Low-Complexity Equalization of Zak-OTFS in the Frequency Domain

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.

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.

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.

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.

A Novel Precoder for Peak-to-Average Power Ratio Reduction in OTFS Systems

We consider the issue of high peak-to-average-power ratio (PAPR) of Orthogonal time frequency space (OTFS) modulated signals. This paper proposes a low-complexity novel iterative PAPR reduction method which achieves a PAPR reduction of roughly 5 dB when compared to a OTFS modulated signal without any PAPR compensation. Simulations reveal that the PAPR achieved by the proposed method is significantly better than that achieved by other state-of-art methods. Simulations also reveal that the error rate performance of OTFS based systems with the proposed PAPR reduction is similar to that achieved with the other state-of-art methods.

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.

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.

Zak-OTFS and Turbo Signal Processing for Joint Sensing and 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 pilot pulsone, and the I/O relation can be reconstructed for a sampled system that operates under finite duration and bandwidth constraints. In previous work we had measured BER performance of a baseline system where we used separate Zak-OTFS subframes for sensing and data transmission. In this Letter we demonstrate how to use turbo signal processing to match BER performance of this baseline system when we integrate sensing and communication within the same Zak-OTFS subframe. The turbo decoder alternates between channel sensing using a noise-like waveform (spread pulsone) and recovery of data transmitted using point pulsones.

Zak-OTFS: Pulse Shaping and the Tradeoff between Time/Bandwidth Expansion and Predictability

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. When the crystallization condition is satisfied, we describe how to integrate sensing and communication within a single Zak-OTFS subframe by transmitting a pilot in the center of the subframe and surrounding the pilot with a pilot region and guard band to mitigate interference between data symbols and pilot. At the receiver we first read off the effective channel taps within the pilot region, and then use the estimated channel taps to recover the data from the symbols received outside the pilot region. We introduce a framework for filter design in the delay-Doppler (DD) domain where the symplectic Fourier transform connects aliasing in the DD domain (predictability of the I/O relation) with time/bandwidth expansion. The choice of pulse shaping filter determines the fraction of pilot energy that lies outside the pilot region and the degradation in BER performance that results from the interference to data symbols. We demonstrate that Gaussian filters in the DD domain provide significant improvements in BER performance over the sinc and root raised cosine filters considered in previous work. We also demonstrate that, by limiting DD domain aliasing, Gaussian filters extend the region where the crystallization condition is satisfied. The Gaussian filters considered in this paper are a particular case of factorizable pulse shaping filters in the DD domain, and this family of filters may be of independent interest.

Zak-OTFS for Integration of Sensing and 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 ${\Lambda}_{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 ${\Lambda^*}$. We show that if the channel satisfies the crystallization conditions with respect to ${\Lambda^*}$ 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 ${\Lambda}_{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.