Duke University
Abstract:Polarimetry, which is the ability to measure the scattering response of the environment across orthogonal polarizations, is fundamental to enhancing wireless communication and radar system performance. In this paper, we utilize the Zak-OTFS modulation to enable instantaneous polarimetry within a single transmission frame. We transmit a Zak-OTFS carrier waveform and a spread carrier waveform mutually unbiased to it simultaneously over orthogonal polarizations. The mutual unbiasedness of the two waveforms enables the receiver to estimate the full polarimetric response of the scattering environment from a single received frame. Unlike existing methods for instantaneous polarimetry with computational complexity quadratic in the time-bandwidth product, the proposed method enables instantaneous polarimetry at complexity that is only sublinear in the time-bandwidth product. Via numerical simulations, we show ideal polarimetric target detection and parameter estimation results with the proposed method, with improvements in performance and computational complexity over comparable baselines.
Abstract:4G/5G wireless standards use orthogonal frequency division multiplexing (OFDM) which is robust to frequency selectivity. Equalization is possible with a single tap filter, and low-complexity equalization makes OFDM an attractive physical layer. However the performance of OFDM degrades with mobility, since Doppler spreads introduce inter-carrier interference (ICI) between subcarriers and they are no longer orthogonal. Zak-transform based orthogonal time frequency space (Zak-OTFS) modulation has been shown to be robust to doubly selective channels. Zak-OTFS signals are formed in the delay-Doppler (DD) domain, converted to time domain (TD) for transmission and reception, then returned to the DD domain for processing. The received signal is a superposition of many attenuated copies since the doubly selective channel introduces delay and Doppler shifts. The received symbols are more difficult to equalize since they are subject to interference along both delay and Doppler axes. In this paper, we propose a new low-complexity method of equalizing Zak-OTFS in the frequency domain (FD). We derive the FD system model and show that it is unitarily equivalent to the DD system model. We show that the channel matrix in the FD is banded, making it possible to apply conjugate gradient methods to reduce the complexity of equalization. We show that complexity of FD equalization is linear in the dimension of a Zak-OTFS frame. For comparison the complexity of naive MMSE equalization is cubic in the frame dimension. Through numerical simulations we show that FD equalization of Zak-OTFS achieves similar performance as equalization in DD domain.
Abstract: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.
Abstract: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.
Abstract: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.
Abstract:An attractive feature of spread spectrum technologies such as code division multiple access (CDMA) is that it is harder to intercept or jam signals, and this feature was lost when orthogonal frequency domain modulation prevailed over CDMA in wireless standards. Legacy spread carrier waveforms are not matched to delay and Doppler shifts characteristic of 6G wireless environments, and this makes equalization very challenging. Zak-OTFS 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. Hence, 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 PAPR. We describe how to transform Zak-OTFS into a spread spectrum communication system, where the spread carrier waveforms have low PAPR and are matched to the delay and Doppler characteristics of the wireless channel. This transformation is realized by a unitary transform that is a generalization of the discrete affine Fourier transform. The transform maps a pulsone to a time domain waveform which yields a CAZAC sequence after sampling. The family of CAZAC sequences includes the Zadoff-Chu sequences incorporated in LTE and 5G-NR standards. We describe the end-to-end time-domain transceiver signal processing, comprising channel estimation and data demodulation, for the proposed system. We quantify system performance through BER simulations using a six-path Veh-A channel model, showing that the proposed system achieves similar uncoded BER as pulsone-based Zak-OTFS, where the PAPR of each spread carrier waveform is only 3.58 dB.
Abstract: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.
Abstract: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.
Abstract: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.
Abstract: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.