arXiv subjects

Robert Calderbank

Publications and source records attributed to Robert Calderbank.

At least 37 records · Page 2Linked to original sources

arXiv2025

Improving the Spectral Efficiency of Zak-OTFS via Mutually Unbiased Bases

Orthogonal signaling or Nyquist signaling limits the number of information symbols transmitted in bandwidth $B$ and time $T$ to be $BT$, the time-bandwidth product. Transmitting more than $BT$ symbols leads to loss of orthogonality. The standard approach is to reduce the symbol interval and resolve the resulting inter-symbol interference. This requires changing the sampling frequency and possibly the sampling clock. This paper shows that it is possible to improve spectral efficiency on doubly spread channels without changing the sampling frequency. The idea is to superimpose the information symbols using mutually unbiased bases (MUB) while maintaining the original spacing. We carry this out in the delay-Doppler domain using Zak-transform based orthogonal time frequency space (Zak-OTFS) modulation as it allows construction of MUB. We also construct a precoder that mitigates the effect of the doubly-spread channel. This simplifies receiver processing to detection in Gaussian noise since each basis appears to the other as Gaussian noise. This reduction makes it possible to use trellis coded modulation to further improve the bit-error performance. Numerical results demonstrate that the proposed signaling scheme using MUB achieves good bit-error performance.

eess.SP↗

arXiv2025

Zak-OTFS over CP-OFDM

Zak-Orthogonal Time Frequency Space (Zak-OTFS) modulation has been shown to achieve significantly better performance compared to the standardized Cyclic-Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM), in high delay/Doppler spread scenarios envisaged in next generation communication systems. Zak-OTFS carriers are quasi-periodic pulses in the delay-Doppler (DD) domain, characterized by two parameters, (i) the pulse period along the delay axis (``delay period") (Doppler period is related to the delay period), and (ii) the pulse shaping filter. An important practical challenge is enabling support for Zak-OTFS modulation in existing CP-OFDM based modems. In this paper we show that Zak-OTFS modulation with pulse shaping constrained to sinc filtering (filter bandwidth equal to the communication bandwidth $B$) followed by time-windowing with a rectangular window of duration $(T + T_{cp})$ ($T$ is the symbol duration and $T_{cp}$ is the CP duration), can be implemented as a low-complexity precoder over standard CP-OFDM. We also show that the Zak-OTFS de-modulator with matched filtering constrained to sinc filtering (filter bandwidth $B$) followed by rectangular time windowing over duration $T$ can be implemented as a low-complexity post-processing of the CP-OFDM de-modulator output. This proposed ``Zak-OTFS over CP-OFDM" architecture enables us to harness the benefits of Zak-OTFS in existing network infrastructure. We also show that the proposed Zak-OTFS over CP-OFDM is a family of modulations, with CP-OFDM being a special case when the delay period takes its minimum possible value equal to the inverse bandwidth, i.e., Zak-OTFS over CP-OFDM with minimum delay period.

eess.SP↗

arXiv2025

Zak-OTFS Based Coded Random Access for Uplink mMTC

This paper proposes a grant-free coded random access (CRA) scheme for uplink massive machine-type communications (mMTC), based on Zak-orthogonal time frequency space (Zak-OTFS) modulation in the delay-Doppler domain. The scheme is tailored for doubly selective wireless channels, where conventional orthogonal frequency-division multiplexing (OFDM)-based CRA suffers from unreliable inter-slot channel prediction due to time-frequency variability. By exploiting the predictable nature of Zak-OTFS, the proposed approach enables accurate channel estimation across slots, facilitating reliable successive interference cancellation across user packet replicas. A fair comparison with an OFDM-based CRA baseline shows that the proposed scheme achieves significantly lower packet loss rates under high mobility and user density. Extensive simulations over the standardized Veh-A channel confirm the robustness and scalability of Zak-OTFS-based CRA, supporting its applicability to future mMTC deployments.

eess.SP↗

arXiv2025

Zak-OTFS based Multiuser Uplink in Doubly-Spread Channels

Wireless users with different characteristics will be expected to share spectrum in next generation communication networks. One of the great strengths of wireless networks based on Orthogonal Frequency Division Multiplexing (OFDM) is the ease with which different non-overlapping time-frequency (TF) resources can be allocated to different users by simply shifting each user's signal in time and frequency. However, a significant weaknesses of OFDM is the inflexibility of sub-carrier spacing. Since OFDM does not allow users to have different sub-carrier spacing, a single user subject to inter-carrier interference causes carrier spacing to increase for all users. Zak-OTFS is an alternative delay-Doppler (DD) domain modulation scheme, where, in contrast to OFDM, the Input-Output (I/O) relation is predictable. We match the strength of OFDM by designing a novel DD domain method of shaping the transmitted Zak-OTFS pulse on the uplink that enables flexible non-overlapping TF resource allocation. The base station (BS) receives a superposition of uplink signals and applies individual matched filters to obtain the data specific to individual users. We develop theoretical measures of interference between users, and present numerical simulations for a vehicular channel model representative of next generation propagation environments. We demonstrate single-user performance in a multiuser Zak-OTFS uplink system without needing to provision guard bands between TF resources allocated to different users. These performance results demonstrate that the benefits of a predictable Zak-OTFS waveform can be realized within an architecture for uplink communication.

eess.SP↗

arXiv2025

Precoded Zak-OTFS for Per-Carrier Equalization

In Zak-OTFS (orthogonal time frequency space) modulation the carrier waveform is a pulse in the delay-Doppler (DD) domain, formally a quasi-periodic localized function with specific periods along delay and Doppler. When the channel delay spread is less than the delay period, and the channel Doppler spread is less than the Doppler period, the response to a single Zak-OTFS carrier provides an image of the scattering environment and can be used to predict the effective channel at all other carriers. The image of the scattering environment changes slowly, making it possible to employ precoding at the transmitter. Precoding techniques were developed more than thirty years ago for wireline modem channels (V.34 standard) defined by linear convolution where a pulse in the time domain (TD) is used to probe the one-dimensional partial response channel. The action of a doubly spread channel on Zak-OTFS modulation determines a two-dimensional partial response channel defined by twisted convolution, and we develop a novel precoding technique for this channel. The proposed precoder leads to separate equalization of each DD carrier which has significantly lower complexity than joint equalization of all carriers. Further, the effective precoded channel results in non-interfering DD carriers which significantly reduces the overhead of guard carriers separating data and pilot carriers, which improves the spectral efficiency significantly.

eess.SP↗

arXiv2025

Differential Communication in Channels with Mobility and Delay Spread using Zak-OTFS

Zak-transform based orthogonal time frequency space (Zak-OTFS) is a delay-Doppler (DD) domain modulation scheme in which the signal processing is carried out in the DD domain. The channel when viewed in the DD domain is predictable. However, even with Zak-OTFS, pilots need to be sent periodically, albeit at a lower rate. In this paper, we propose a differential communication scheme for Zak-OTFS systems that alleviates the need for periodic pilot transmission. Towards this, we analytically show that the detected data can be used as a pilot and that the channel estimate obtained from the detected data can enable further detection enabling the "differential" aspect of the communication. Specifically, we leverage the prediction capability of the DD channel in Zak-OTFS to use the channel estimate (obtained from detected data symbols treated as pilots) in the previous instant to detect data in the next instant and propagate this forward. The advantages are two fold. First, it allows the data symbols to enjoy higher energy since the energy that would otherwise be required for pilot symbols can also be allocated to data symbols. Second, it allows for full spectral efficiency compared to point or embedded pilots. Comparison with the full spectral efficiency achieving spread pilot scheme shows that the proposed method achieves better bit-error rate at lower complexity.

eess.SP↗

arXiv2025

Zak-OTFS with Spread Carrier Waveforms

Zak-OTFS (orthogonal time frequency space) modulation is a communication framework that parameterizes the wireless channel in the delay-Doppler (DD) domain, where the parameters map directly to physical attributes of the scatterers that comprise the scattering environment. As a consequence, the channel can be efficiently acquired and equalized. The Zak-OTFS carrier is a pulse in the DD domain, and the Zak transform converts it to a pulse train modulated by a tone (pulsone) in the time domain. The pulsone waveform is localized rather than spread, and it suffers from high peak-to-average power ratio (PAPR). We describe how to transform the orthonormal basis of Zak-OTFS pulsones into an orthonormal basis of spread carrier waveforms with low PAPR (only $6.58$ dB) that support communication in the presence of mobility and delay spread. This transformation is realized by a unitary transform based on the discrete affine Fourier transform. Unlike other spread modulations that achieve low PAPR by spreading information across a wider bandwidth (thus reducing the spectral efficiency), the proposed spread carrier-based Zak-OTFS achieves full spectral efficiency like pulsone-based Zak-OTFS, with $5.6$ dB lower PAPR per basis element. We demonstrate uncoded bit error rate (BER) similar to pulsone-based Zak-OTFS, and improved BER performance over competing methods based on OFDM and OTFS in high mobility & delay spread environments.

eess.SP↗

arXiv2025

Low-Complexity Frequency Domain Equalization of Zak-OTFS in Doubly-Spread Channels

We communicate over wireless channels by first estimating and then equalizing the effective channel. In Zak-OTFS (orthogonal time frequency space) modulation the carrier waveform is a pulse in the delay-Doppler (DD) domain, formally a quasi-periodic localized function with specific periods along delay and Doppler. When the channel delay spread is less than the delay period, and the channel Doppler spread is less than the Doppler period, the response to a single Zak-OTFS carrier provides an image of the scattering environment and can be used to predict the effective channel at all other carriers. This makes DD domain channel estimation straightforward, and there is no loss in spectral efficiency since it is possible to design data and pilot signals that are mutually unbiased. However, equalization in the DD domain has high complexity ${\mathcal O}(M^3N^3)$ where $M$, $N$ are respectively the number of delay and Doppler bins in an OTFS frame, and $MN$ is the number of information symbols. We demonstrate that equalization in the frequency domain (FD) reduces complexity to only ${\mathcal O}(M^2 N^2)$ by taking advantage of the banded structure of the effective FD channel. We also derive a low-complexity method to reconstruct the effective FD channel from the estimated DD domain effective channel.

eess.SP↗

arXiv2025

Zak-OTFS to Integrate Sensing the I/O Relation and Data Communication

The Zak-OTFS input/output (I/O) relation is predictable and non-fading when the delay and Doppler periods are greater than the effective channel delay and Doppler spreads, a condition which we refer to as the crystallization condition. The filter taps can simply be read off from the response to a single Zak-OTFS point (impulse) pulsone waveform, and the I/O relation can be reconstructed for a sampled system that operates under finite duration and bandwidth constraints. Predictability opens up the possibility of a model-free mode of operation. The time-domain realization of a Zak-OTFS point pulsone is a pulse train modulated by a tone, hence the name, pulsone. The Peak-to-Average Power Ratio (PAPR) of a pulsone is about $15$ dB, and we describe a general method for constructing a spread pulsone for which the time-domain realization has a PAPR of about 6dB. We construct the spread pulsone by applying a type of discrete spreading filter to a Zak-OTFS point pulsone. The self-ambiguity function of the point pulsone is supported on the period lattice $Λ_{p}$, and by applying a discrete chirp filter, we obtain a spread pulsone with a self-ambiguity function that is supported on a rotated lattice ${Λ^*}$. We show that if the channel satisfies the crystallization conditions with respect to ${Λ^*}$ then the effective DD domain filter taps can simply be read off from the cross-ambiguity between the channel response to the spread pulsone and the transmitted spread pulsone. If, in addition, the channel satisfies the crystallization conditions with respect to the period lattice $Λ_{p}$, then in an OTFS frame consisting of a spread pilot pulsone and point data pulsones, after cancelling the received signal corresponding to the spread pulsone, we can recover the channel response to any data pulsone.

eess.SP↗

arXiv2025

Waveform for Next Generation Communication Systems: Comparing Zak-OTFS with OFDM

Across the world, there is growing interest in new waveforms, Zak-OTFS in particular, and over-the-air implementations are starting to appear. The choice between OFDM and Zak-OTFS is not so much a choice between waveforms as it is an architectural choice between preventing inter-carrier interference (ICI) and embracing ICI. In OFDM, once the Input-Output (I/O) relation is known, equalization is relatively simple, at least when there is no ICI. However, in the presence of ICI the I/O relation is non-predictable and its acquisition is non-trivial. In contrast, equalization is more involved in Zak-OTFS due to inter-symbol-interference (ISI), however the I/O relation is predictable and its acquisition is simple. {Zak-OTFS exhibits superior performance in doubly-spread 6G use cases with high delay/Doppler channel spreads (i.e., high mobility and/or large cells), but architectural choice is governed by the typical use case, today and in the future. What is typical depends to some degree on geography, since large delay spread is a characteristic of large cells which are the rule rather than the exception in many important wireless markets.} This paper provides a comprehensive performance comparison of cyclic prefix OFDM (CP-OFDM) and Zak-OTFS across the full range of 6G propagation environments. The performance results provide insights into the fundamental architectural choice.

eess.SP↗

arXiv2025

Over-the-Air Transmission of Zak-OTFS with Spread Pilots on Sub-THz Communications Testbed

Looking towards 6G wireless systems, frequency bands like the sub-terahertz (sub-THz) band (100 GHz - 300 GHz) are gaining traction for their promises of large available swaths of bandwidth to support the ever-growing data demands. However, challenges with harsh channel conditions and hardware nonlinearities in the sub-THz band require robust communication techniques with favorable properties, such as good spectral efficiency and low peak-to-average power ratio (PAPR). Recently, OTFS and its variants have garnered significant attention for their performance in severe conditions (like high delay and Doppler), making it a promising candidate for future communications. In this work, we implement Zak-OTFS for the over-the-air experiments with traditional point pilots and the new spread pilots. Notably, we design our spread-pilot waveforms with communications and sensing coexisting in the same radio resources. We define the system model and the signal design for integration onto our state-of-the-art sub-THz wireless testbed. We show successful data transmission over-the-air at 140 GHz and 240 GHz in a variety of signal-to-noise ratio (SNR) conditions. In addition, we demonstrate integrated sensing and communications (ISAC) capabilities and show PAPR improvement of over 5 dB with spread pilots compared to point pilots.

eess.SP↗

arXiv2025

Spatially-Coupled QLDPC Codes

Spatially-coupled (SC) codes is a class of convolutional LDPC codes that has been well investigated in classical coding theory thanks to their high performance and compatibility with low-latency decoders. We describe toric codes as quantum counterparts of classical two-dimensional spatially-coupled (2D-SC) codes, and introduce spatially-coupled quantum LDPC (SC-QLDPC) codes as a generalization. We use the convolutional structure to represent the parity check matrix of a 2D-SC code as a polynomial in two indeterminates, and derive an algebraic condition that is both necessary and sufficient for a 2D-SC code to be a stabilizer code. This algebraic framework facilitates the construction of new code families. While not the focus of this paper, we note that small memory facilitates physical connectivity of qubits, and it enables local encoding and low-latency windowed decoding. In this paper, we use the algebraic framework to optimize short cycles in the Tanner graph of 2D-SC hypergraph product (HGP) codes that arise from short cycles in either component code. While prior work focuses on QLDPC codes with rate less than 1/10, we construct 2D-SC HGP codes with small memories, higher rates (about 1/3), and superior thresholds.

quant-ph↗

arXiv2025

Zak-OTFS for Mutually Unbiased Sensing and Communication

Waveforms with ideal ambiguity functions are fundamental to integrated sensing and communication, to active sensing (radar), and to uplink multiple access. We describe a general method of constructing waveforms using the discrete Zak transform (DZT) to convert sequences of length $MN$ in the time domain to waveforms in the delay-Doppler (DD) domain, each of which is defined by an $M\times N$ quasi-periodic array. The DZT preserves inner products, and we show that phase coded waveforms used in radar (CAZAC sequences) determine noise-like waveforms in the DD domain, each with low Peak to Average Power Ratio. In a Zak-OTFS communication system, we show that these waveforms are mutually unbiased with respect to every carrier and use them to integrate sensing and communication as spread pilots. We view each waveform as a linear combination of Zak-OTFS carriers and show that the self-ambiguity function is supported on a discrete line in the integers modulo $MN$. The sidelobes are significantly lower than the original CAZAC sequence, and the advantage of discrete support is better localization/resolution in delay and Doppler compared with standard methods based on chirps or tones. We show that the absolute value of the cross-ambiguity function for pairs of waveforms in the same family is small and constant. This property makes the waveforms ideal preambles in the 2-step RACH protocol introduced in Release 15, 3GPP to enable grant-free multiple access. The characteristics of the cross-ambiguity function make it possible to simultaneously detect multiple preambles in the presence of mobility and delay spread.

eess.SP↗

arXiv2025

Zak-OTFS for Identification of Linear Time-Varying Systems

Linear time-varying (LTV) systems model radar scenes where each reflector/target applies a delay, Doppler shift and complex amplitude scaling to a transmitted waveform. The receiver processes the received signal using the transmitted signal as a reference. The self-ambiguity function of the transmitted signal captures the cross-correlation of delay and Doppler shifts of the transmitted waveform. It acts as a blur that limits resolution, at the receiver, of the delay and Doppler shifts of targets in close proximity. This paper considers resolution of multiple targets and compares performance of traditional chirp waveforms with the Zak-OTFS waveform. The self-ambiguity function of a chirp is a line in the delay-Doppler domain, whereas the self-ambiguity function of the Zak-OTFS waveform is a lattice. The advantage of lattices over lines is better localization, and we show lattices provide superior noise-free estimation of the range and velocity of multiple targets. When the delay spread of the radar scene is less than the delay period of the Zak-OTFS modulation, and the Doppler spread is less than the Doppler period, we describe how to localize targets by calculating cross-ambiguities in the delay-Doppler domain. We show that the signal processing complexity of our approach is superior to the traditional approach of computing cross-ambiguities in the continuous time / frequency domain.

eess.SP↗

arXiv2025

Low-Complexity Detection of Multiple Preambles in the Presence of Mobility and Delay Spread

Current wireless infrastructure is optimized to support downlink applications. This paper anticipates the emergence of applications where engineering focus shifts from downlink to uplink. The current paradigm of scheduling users on reserved uplink resources is not able to deal efficiently with unpredictable traffic patterns. As a result, 3GPP introduced the 2-step RACH as a mechanism to enable grant-free (random) initial access. The first of the two steps is preamble detection in a RACH slot, and in this paper we describe a low-complexity algorithm for simultaneous detection of multiple preambles in the presence of mobility and delay spread. We provide a pathway to standards adoption by choosing ZC sequences as preambles, as ZC sequences already appear in 5G standards. We construct preambles by using the discrete Zak transform to pass from a ZC sequence of length MN in the TD to a quasi-periodic MxN array in the DD domain. There are MN quasi-periodic Dirac pulses, each corresponding to a Zak-OTFS carrier waveform, and the ZC preamble is simply the corresponding sum of Zak-OTFS carrier waveforms. We detect multiple preambles in the presence of mobility and delay spread by sampling the received signal on the MxN period grid in the DD domain. We approach detection as a compressed sensing problem. We represent a preamble as a column of length MN in the DD domain and apply discrete shifts in delay and Doppler to produce a block with O(MN) columns in the compressed sensing matrix. The superposition of multiple preambles determines a block sparse sum of columns in the sensing matrix. The correlation properties of ZC sequences result in a highly structured compressed sensing matrix, making it possible to identify constituent preambles using OST, which has complexity O(M^3N^3). In this paper, we describe an algorithm with complexity that is O(M^2N^2) in the size of an individual column.

eess.SP↗

arXiv2024

Zak-OTFS with Interleaved Pilots to Extend the Region of Predictable Operation

When the delay period of the Zak-OTFS carrier is greater than the delay spread of the channel, and the Doppler period of the carrier is greater than the Doppler spread of the channel, the effective channel filter taps can simply be read off from the response to a single pilot carrier waveform. The input-output (I/O) relation can then be reconstructed for a sampled system that operates under finite duration and bandwidth constraints. We introduce a framework for pilot design in the delay-Doppler (DD) domain which makes it possible to support users with very different delay-Doppler characteristics when it is not possible to choose a single delay and Doppler period to support all users. The method is to interleave single pilots in the DD domain, and to choose the pilot spacing so that the I/O relation can be reconstructed by solving a small linear system of equations.

eess.SP↗

arXiv2024

Delay-Doppler Signal Processing with Zadoff-Chu Sequences

Much of the engineering behind current wireless systems has focused on designing an efficient and high-throughput downlink to support human-centric communication such as video streaming and internet browsing. This paper looks ahead to design of the uplink, anticipating the emergence of machine-type communication (MTC) and the confluence of sensing, communication, and distributed learning. We demonstrate that grant-free multiple access is possible even in the presence of highly time-varying channels. Our approach provides a pathway to standards adoption, since it is built on enhancing the 2-step random access procedure which is already part of the 5GNR standard. This 2-step procedure uses Zadoff-Chu (ZC) sequences as preambles that point to radio resources which are then used to upload data. We also use ZC sequences as preambles / pilots, but we process signals in the Delay-Doppler (DD) domain rather than the time-domain. We demonstrate that it is possible to detect multiple preambles in the presence of mobility and delay spread using a receiver with no knowledge of the channel other than the worst case delay and Doppler spreads. Our approach depends on the mathematical properties of ZC sequences in the DD domain. We derive a closed form expression for ZC pilots in the DD domain, we characterize the possible self-ambiguity functions, and we determine the magnitude of the possible cross-ambiguity functions. These mathematical properties enable detection of multiple pilots through solution of a compressed sensing problem. The columns of the compressed sensing matrix are the translates of individual ZC pilots in delay and Doppler. We show that columns in the design matrix satisfy a coherence property that makes it possible to detect multiple preambles in a single Zak-OTFS subframe using One-Step Thresholding (OST), which is an algorithm with low complexity.

eess.SP↗

arXiv2024

Zak-OTFS and Turbo Signal Processing for Joint Sensing and Communication

eess.SP↗