Orthogonal Time Frequency Space
Orthogonal Time Frequency Space (OTFS) is a two-dimensional modulation technique for wireless communications. The concept was first patented in 2010, with the term introduced in 2017, that operates in the delay-Doppler domain to provide robust performance in high-mobility environments by transforming time-varying channels into an effective time-invariant representation.[1][2] In OTFS, data symbols are placed on a discrete grid in the delay-Doppler plane, which represents the channel's intrinsic multipath structure, and then transformed via the inverse symplectic finite Fourier transform (ISFFT) into the time-frequency domain for transmission using a Heisenberg transform.[3] This process leverages the channel's delay-Doppler response, originally conceptualized in signal processing literature dating back to the 1960s, to spread symbols across time and frequency, ensuring each symbol experiences the full diversity of the channel.[3] At the receiver, the reverse operations—Wigner transform followed by the symplectic finite Fourier transform (SFFT)—recover the symbols, allowing for straightforward equalization as if the channel were static.[4] Compared to orthogonal frequency division multiplexing (OFDM), the prevailing standard in 4G and 5G systems, OTFS offers significant advantages in doubly dispersive channels characterized by high Doppler spreads, such as those encountered in vehicular or aerial communications.[5] OFDM suffers from inter-carrier interference (ICI) and requires frequent channel estimation and pilot insertions in dynamic scenarios, leading to reduced throughput and higher error rates; in contrast, OTFS mitigates ICI through its domain transformation, achieves lower bit error rates (e.g., near-zero at 40 dB SNR versus OFDM's 1.7% under high-Doppler conditions), and reduces the need for cyclic prefixes and synchronization overhead.[4] Additionally, OTFS exhibits a lower peak-to-average power ratio (PAPR), beneficial for power-efficient uplink transmissions, and enables low-complexity detection with minimal training overhead.[6][7] OTFS has emerged as a promising waveform for beyond-5G and 6G networks, particularly in applications demanding ultra-reliable, low-latency communication amid severe mobility, including vehicle-to-everything (V2X), high-speed rail (HSR), unmanned aerial vehicle (UAV) links, low-Earth orbit (LEO) satellites, and integrated sensing-communication (ISAC) systems.[6] Proposed by researchers including Ronny Hadani and Sami Rakib from Cohere Technologies, it builds on foundational work in time-frequency analysis, such as the Zak transform, and is being considered for inclusion in future 3GPP releases while inspiring extensions like delay-Doppler signal processing frameworks.[1][3][8]Introduction
Overview
Orthogonal Time Frequency Space (OTFS) is a two-dimensional modulation technique that operates in the delay-Doppler coordinate system, enabling robust transmission of information symbols over time-varying wireless channels.[9] Unlike traditional modulation schemes such as orthogonal frequency-division multiplexing (OFDM), which process signals in the time-frequency domain, OTFS places data symbols on a grid in the delay-Doppler plane, where channel effects like multipath delays and Doppler shifts are more naturally represented as sparse impulses.[9] This approach transforms the inherently dynamic channel into an effective time-invariant one from the perspective of the transmitted symbols, facilitating simpler equalization and higher reliability.[9] OTFS offers significant advantages in high-mobility scenarios, such as vehicular-to-everything (V2X) communications, where rapid changes in velocity induce severe Doppler spreads that degrade OFDM performance.[9] By distributing each information symbol across the entire time-frequency plane, OTFS achieves full diversity against both delay and Doppler impairments, resulting in superior bit error rate performance compared to OFDM under conditions like speeds exceeding 500 km/h.[10] This resilience stems from the modulation's ability to convert channel fading into a multiplicative effect in the delay-Doppler domain, allowing all symbols to experience an averaged channel response rather than isolated bursts of fading.[9] The core transformation in OTFS involves mapping information symbols from the delay-Doppler grid to the time-frequency domain using the symplectic Fourier transform, a two-dimensional unitary operation that preserves orthogonality and energy.[9] Conceptually, this can be visualized as a lattice of data points in the delay-Doppler plane—representing discrete delays and Doppler shifts—being projected onto an orthogonal grid in the time-frequency plane, where the signal is ultimately transmitted via standard pulse-shaping and upconversion.[9] This mapping ensures that the signal representation in the delay-Doppler domain remains localized, satisfying the Heisenberg uncertainty principle, which limits simultaneous localization in time and frequency but permits it in the complementary delay-Doppler coordinates.[10]History and Development
The core concept of Orthogonal Time Frequency Space (OTFS) modulation originated with a patent filed on May 28, 2010, by inventors Ronny Hadani and Shlomo Rakib, describing an orthonormal time-frequency shifting and spectral shaping method that laid the groundwork for OTFS as an alternative to traditional modulation schemes in time-varying channels.[11] This intellectual property was assigned to Cohere Technologies, Inc., a company founded in 2011 by Rakib and Hadani to commercialize advanced wireless technologies, marking the formal transfer and institutionalization of the OTFS framework within the organization.[8] Subsequent advancements were driven by Cohere's engineering team, including Michail Tsatsanis, who contributed to refining the modulation technique for practical wireless applications; a key early technical document from this period, authored by Anton Monk, Ronny Hadani, Michail Tsatsanis, and Shlomo Rakib, outlined OTFS's transformation of delay-Doppler domain signals into the time-frequency domain.[12] The first major public disclosure occurred in 2017 through a seminal conference paper presented at the IEEE Wireless Communications and Networking Conference, where Hadani and colleagues detailed OTFS modulation's fundamentals and signal processing advantages for high-mobility environments.[1] From 2018 to 2020, OTFS gained traction in 5G research proposals, with studies exploring its integration into emerging standards to address Doppler effects in vehicular and non-terrestrial networks, though it was not ultimately adopted in core 3GPP Release 15 or 16 specifications.[3] By 2021, OTFS emerged as a leading candidate waveform for 6G systems, highlighted in surveys for its robustness in ultra-high-mobility scenarios like integrated sensing and communication.[13] This evolution from theory to implementation involved overcoming practical hurdles, such as pulse shaping to minimize inter-symbol interference while reducing cyclic prefix overhead, with key solutions proposed in 2018 using root-raised cosine filters and other waveforms to enable deployable prototypes.[14] In 2025, the field advanced further with dedicated IEEE workshops, including the ICCC session on OTFS modulation and delay-Doppler waveforms for communications and sensing, fostering discussions on its role in next-generation networks.[15] In October 2025, Cohere Technologies launched the Pulsone, a software-defined platform to deploy OTFS waveforms for enhanced spectrum efficiency in multi-G networks, targeting defense and 6G applications.[16]Mathematical Foundations
Delay-Doppler Domain
The delay-Doppler domain serves as a fundamental coordinate system in wireless communications, particularly for modeling time-varying channels in high-mobility scenarios. In this representation, channel effects are captured as discrete points in a two-dimensional plane, where the axes correspond to delay (τ) and Doppler shift (ν). This sparsity arises in multipath environments, where the channel is typically composed of a limited number of propagation paths, each characterized by distinct delays and Doppler shifts, rather than a dense continuum.[12] Physically, the delay τ quantifies the time offset due to differing path lengths from transmitter to receiver, reflecting the propagation delays of signals via reflections, diffractions, or direct paths. The Doppler shift ν, on the other hand, accounts for frequency offsets induced by relative velocities between the transmitter, receiver, and scattering elements, such as in vehicular or high-speed rail communications. This domain provides a geometrically intuitive view of the channel, treating it as a static mapping of path-specific gains, delays, and velocities over an extended observation window.[12] Mathematically, the channel response in the delay-Doppler domain is expressed as h(\tau, \nu) = \sum_{k} \alpha_k \delta(\tau - \tau_k) \delta(\nu - \nu_k), where \alpha_k denotes the complex gain of the k-th path, \tau_k its delay, and \nu_k its Doppler shift. This formulation exploits the inherent sparsity, as the number of significant paths k is much smaller than the overall resolution in τ and ν, enabling efficient signal processing by focusing computational resources on these discrete locations rather than the full domain.[12] The link to the time-frequency domain is established via the symplectic Fourier transform, which performs a two-dimensional Fourier transform with a specific kernel to couple delay with frequency and Doppler with time. The transform from delay-Doppler to time-frequency is given by F_{\text{DD}\to\text{TF}}(x(\tau,\nu)) = \iint x(\tau,\nu) e^{-j 2\pi (\nu t - \tau f)} \, d\tau \, d\nu, where t and f are time and frequency variables, respectively. This operator reveals how delay-Doppler spreading manifests as time-varying frequency-selective fading in the time-frequency plane.[3] A key advantage of the delay-Doppler representation over traditional time-frequency approaches lies in its stationarity for fast-fading channels. While time-frequency models exhibit rapid variations due to Doppler-induced time selectivity, the delay-Doppler domain remains effectively time-invariant over coherence intervals as long as 10 ms for vehicular speeds up to 100 km/h at carrier frequencies around 3.6 GHz, allowing symbols to experience a consistent channel response and facilitating coherent diversity exploitation.[12]Relation to Time-Frequency Domain
Orthogonal Time Frequency Space (OTFS) modulation bridges the delay-Doppler domain and the time-frequency domain through a transformation that maps information symbols placed on a delay-Doppler grid to the time-frequency plane, enabling robust transmission over doubly dispersive channels.[12] Specifically, the information symbols X[k, l], where k and l index the delay and Doppler coordinates respectively, are transformed via the inverse symplectic Fourier transform (ISFFT) to obtain symbols in the time-frequency domain before final synthesis into the time-domain waveform. This process effectively spreads each symbol across the entire time-frequency grid, providing inherent diversity against channel variations that are more pronounced in high-mobility scenarios.[12] In the continuous-time formulation, the resulting time-domain signal s(t) is expressed as s(t) = \iint X(\tau, \nu) \, e^{j 2\pi \nu (t - \tau)} \, g(t - \tau) \, d\tau \, d\nu, where X(\tau, \nu) represents the symbols in the continuous delay-Doppler plane and g(t) is the pulse-shaping function delayed by \tau and Doppler-shifted by \nu. This integral form captures the modulation as a superposition of delay-Doppler shifted basis functions, with the exponential term implementing the phase adjustments for Doppler effects. The discrete implementation approximates this via the ISFFT, computed efficiently using fast Fourier transforms, which converts the M \times N delay-Doppler grid to an equivalent time-frequency grid of the same size.[12] The Zak transform plays a crucial role in facilitating efficient computation of this transformation, particularly in discrete OTFS implementations, by providing a bridge between the time-domain signal and the delay-Doppler representation. Defined as Z_x(n, T) = \sum_m x(n + mT) e^{-j 2\pi m n / N}, the Zak transform decomposes the signal into quasi-periodic components that align with the lattice structure of the delay-Doppler domain, enabling the ISFFT to be realized through simpler operations akin to those in OFDM modulation.[17] This transform ensures orthogonality and invertibility, allowing seamless mapping without information loss and supporting low-complexity processing at the transceiver.[18] Compared to orthogonal frequency-division multiplexing (OFDM), which allocates symbols directly to time-frequency subcarriers and suffers from inter-carrier interference in high-Doppler environments, OTFS achieves superior performance by distributing symbols across the full delay-Doppler grid.[12] In OFDM, the input-output relation exhibits time- and frequency-selective fading due to the channel's convolutional nature in the time domain, whereas in OTFS, the effective channel in the delay-Doppler domain is nearly diagonal, resembling an array of parallel time-invariant channels with consistent signal-to-noise ratios for all symbols.[12] This diagonalization leverages the sparsity of the delay-Doppler channel representation, enhancing diversity and reliability without requiring adaptive equalization per subcarrier. Fundamentally, OTFS can be viewed as an orthogonal basis expansion within the framework of Heisenberg-Weyl systems, where the modulation employs a set of time-frequency shifted pulses that form an orthonormal basis in phase space.[12] These basis functions, generated from a prototype pulse via the Weyl-Heisenberg group, capture the channel's delay-Doppler scattering geometry, allowing the system to diagonalize the channel response and mitigate the effects of dispersion more effectively than traditional time-frequency bases.[6]OTFS Modulation
Transmitter and Receiver Operations
In OTFS modulation, the transmitter begins by placing data symbols, such as QAM constellations, onto a discrete delay-Doppler (DD) grid of dimensions N \times M, where N represents the number of Doppler bins and M the number of delay bins.[19] This grid placement assigns each symbol to a unique (k, l) position, with k indexing Doppler shifts and l indexing delays, enabling the symbols to interact effectively with the channel's DD representation.[9] Next, an inverse symplectic finite Fourier transform (ISFFT) is applied to map the DD symbols to the time-frequency (TF) domain, spreading the information across orthogonal TF basis functions and leveraging the symplectic Fourier transform's properties for efficient processing.[19] Finally, a Heisenberg transform synthesizes the TF symbols into the time-domain waveform by applying a windowed pulse-shaping filter, typically through a multicarrier synthesis filter bank similar to OFDM, to generate the transmitted signal.[9] At the receiver, the process reverses to recover the symbols. The incoming time-domain signal first undergoes a de-Heisenberg transform, or Wigner transform, which applies an analysis filter bank to project the signal back onto the TF domain and obtain the received TF symbols.[19] A symplectic finite Fourier transform (SFFT) then converts these TF symbols to the DD domain, where the channel appears as a time-invariant, two-dimensional convolution due to the transform's invariance properties.[9] Detection proceeds via simple matched filtering on the DD grid, exploiting the diagonalized channel structure to yield near-ML performance with minimal inter-symbol interference, as each DD symbol experiences an effective channel gain from coherent energy combination across multipaths.[19] The OTFS block diagram typically features the ISFFT at the modulator and SFFT at the demodulator, flanked by Heisenberg and de-Heisenberg blocks for domain conversions, ensuring compatibility with existing multicarrier hardware.[9] The overall computational complexity for an N \times M grid is O(NM \log(NM)), dominated by the fast Fourier transform implementations of the symplectic operations, making it comparable to OFDM while offering superior performance in high-mobility scenarios.[19] For QAM symbols in doubly-dispersive channels, OTFS provides an effective SNR gain by pooling multipath energies into a non-fading DD channel response, resulting in uniform SNR across all symbols and up to several dB improvement over OFDM in high-Doppler environments like vehicular speeds exceeding 250 km/h.[9] To facilitate channel estimation, pilots are inserted as impulses on the DD grid at intervals covering the maximum expected delay and Doppler spreads, occupying minimal overhead (e.g., under 7% of resources for typical urban channels) without detailed algorithmic processing.[9]Channel Modeling
In the delay-Doppler (DD) domain, the channel in orthogonal time frequency space (OTFS) modulation is modeled using the time-invariant impulse response h(\tau, \nu), which captures the effects of multipath propagation through delays \tau and Doppler shifts \nu. This representation arises from the physical geometry of the propagation environment, where the channel is viewed as a superposition of reflected paths from scatterers. For typical wireless channels with a finite number of dominant paths, h(\tau, \nu) = \sum_{k=1}^{P} h_k \delta(\tau - \tau_k) \delta(\nu - \nu_k), with h_k denoting the complex gain of the k-th path, leading to a sparse structure in the DD domain when discretized on a fine grid.[9] This sparsity contrasts with the denser time-frequency (TF) representation and facilitates efficient processing in OTFS systems. The delays \tau_k and Dopplers \nu_k are derived from the scattering geometry: \tau_k corresponds to the propagation distance from transmitter to receiver via the k-th scatterer divided by the speed of light, while \nu_k = (v / \lambda) \cos \theta_k, where v is the relative velocity, \lambda is the carrier wavelength, and \theta_k is the angle of arrival or departure for the path.[9] These parameters evolve slowly over the coherence time due to the relative motion, making the DD domain response quasi-static within an OTFS frame. For practical channels, such as vehicular scenarios, typical values include delay spreads up to 5 μs and Doppler spreads around 300 Hz at carrier frequencies in the GHz range.[9] The effect of the channel on the transmitted DD signal x(\tau, \nu) is described by a twisted convolution, yielding the received signal y(\tau, \nu) = \iint h(\tau', \nu') x(\tau - \tau', \nu - \nu') e^{j 2\pi \nu' (\tau - \tau')} \, d\tau' \, d\nu' + w(\tau, \nu), where w(\tau, \nu) is additive noise.[19] This formulation accounts for the symplectic structure of the DD domain. Under the underspread assumption—where the delay spread is much smaller than the signal duration and the Doppler spread is much smaller than the signal bandwidth—the channel support remains compact, enabling separability and minimal inter-path interference within the OTFS grid.[9] Unlike traditional TF-domain models, where the channel induces time-varying fading and inter-carrier/symbol interference, the OTFS framework diagonalizes the channel operator in the DD domain through the symplectic Fourier transform.[9] This transforms the multiplicative TF channel into a nearly diagonal matrix in DD, where each information symbol experiences an effective gain close to the average channel gain, thereby simplifying detection and equalization while mitigating the impact of mobility-induced variations.[9]Signal Processing
Channel Estimation
In Orthogonal Time Frequency Space (OTFS) systems, channel estimation acquires the delay-Doppler (DD) domain channel state information (CSI), which is inherently sparse due to the limited number of multipath components in typical wireless channels. This sparsity enables efficient estimation techniques that outperform traditional time-frequency approaches, particularly in high-mobility scenarios where Doppler spreads are significant. Pilot-based methods dominate, with embedded pilots placed directly on the DD grid to avoid interference with data symbols while minimizing overhead. A primary approach involves embedding pilots in the DD domain, where pilot symbols are transmitted alongside data and guard regions to isolate channel responses. The received signal at pilot positions can be modeled as \mathbf{y} = \mathbf{P} \mathbf{h} + \mathbf{v}, where \mathbf{y} is the received pilot observations, \mathbf{P} is the pilot matrix derived from the DD grid placement, \mathbf{h} is the sparse channel vector, and \mathbf{v} is additive noise. The least squares (LS) estimator then solves \hat{\mathbf{h}}(\tau, \nu) = \arg\min_{\mathbf{h}} \| \mathbf{y} - \mathbf{P} \mathbf{h} \|^2 under sparsity constraints, often using a threshold to discard noise-dominated entries. This method achieves low normalized mean squared error (NMSE) in high-Doppler environments, with simulations showing NMSE below -20 dB at 20 dB SNR for velocities up to 500 km/h, approaching perfect CSI performance. To exploit DD sparsity further, compressed sensing (CS) techniques recover the channel by treating estimation as a sparse signal recovery problem, requiring pilot density to scale linearly with the number of paths rather than grid size. Algorithms like orthogonal matching pursuit (OMP) iteratively identify active paths and estimate gains, enabling overhead as low as 1-2% for sparse channels with 3-6 paths in a 32×32 grid. In high-Doppler settings (e.g., 4 GHz carrier, 15 kHz subcarrier spacing), CS-based estimators like modified subspace pursuit yield NMSE improvements of 5-10 dB over non-sparse methods, with pilot counts scaling from 6 to 24 for sparsity factors up to 6/1024. Iterative message passing algorithms enhance estimation by jointly refining channel parameters and suppressing interference, particularly with superimposed pilots. These factor-graph-based methods, using sum-product updates, converge in 50-70 iterations to achieve NMSE within 1 dB of MMSE bounds, reducing computational complexity to O(QMN \log(MN)) per iteration where Q is modulation order and M, N are grid dimensions. In multi-user scenarios, pilot contamination arises from overlapping DD responses, but orthogonal placement—assigning distinct grid positions to each user's pilots—eliminates inter-user interference, enabling robust estimation for up to 8-16 users with minimal overhead increase. Recent advances as of 2025 incorporate machine learning and deep learning techniques for OTFS channel estimation, leveraging neural networks to exploit temporal and spatial correlations in high-mobility and integrated sensing-communication (ISAC) scenarios. For instance, Transformer-based models refine initial estimates by predicting channel responses, achieving superior NMSE in reconfigurable intelligent surface (RIS)-assisted systems, while LSTM networks handle time-varying channels with reduced pilot overhead. These DL methods often outperform traditional approaches by 2-5 dB in NMSE under severe Doppler, as surveyed in recent literature.[20][21]Equalization Techniques
In Orthogonal Time Frequency Space (OTFS) systems, equalization compensates for channel distortions in the delay-Doppler (DD) domain, where the channel response is typically sparse and diagonal-dominant, enabling effective mitigation of inter-symbol and inter-carrier interference caused by doubly-selective fading. This approach leverages the DD representation to simplify processing compared to time-frequency domain methods, as the effective channel matrix exhibits a structured sparsity that aligns with the modulation grid. Linear equalization techniques, such as zero-forcing (ZF) and minimum mean square error (MMSE), exploit this structure by inverting the channel response at each DD bin independently, yielding estimates \hat{y}[k,l] = H[k,l]^{-1} y[k,l] for ZF, where y[k,l] is the received signal and H[k,l] is the channel coefficient at delay l and Doppler k. These methods achieve low complexity, with MMSE variants incorporating noise statistics to balance bias and variance, often reducing computational load to O(NM) for an N \times M grid through block-circulant matrix approximations. However, they suffer from noise enhancement in low signal-to-noise ratio regimes and residual interference from off-diagonal terms in fractional Doppler scenarios. Iterative equalization methods enhance performance by incorporating feedback from decoding stages, addressing limitations of linear approaches in high-mobility channels. Turbo equalization integrates soft outputs from a channel decoder to refine DD symbol estimates iteratively, employing log-likelihood ratios for extrinsic information exchange and achieving near-maximum likelihood detection with moderate iterations. Message passing algorithms on factor graphs model the DD input-output relations as a probabilistic graphical model, propagating beliefs between variable and factor nodes to approximate marginal posteriors with low complexity, often converging in fewer iterations than exhaustive search by exploiting the graph's sparsity. These techniques provide robust interference cancellation, particularly for coded OTFS, by iteratively refining channel and symbol estimates. Advanced equalization strategies extend to non-linear channels and further complexity reductions. Markov Chain Monte Carlo (MCMC) methods sample from the posterior distribution in the DD domain to handle non-Gaussian noise or hardware impairments, such as in underwater acoustic links, delivering performance close to optimal detection at the cost of sampling overhead. A RAKE-like decision feedback equalizer applies maximum ratio combining across resolved paths in the DD plane, incorporating soft decisions to cancel interference, which reduces iteration complexity to O(P) per path for P multipaths, making it suitable for real-time implementation in zero-padded OTFS systems. Performance evaluations demonstrate that OTFS equalization yields significant bit error rate (BER) improvements over orthogonal frequency-division multiplexing (OFDM) in doubly-selective channels, with gains of up to 3-5 dB at BER $10^{-3} under high Doppler spreads (e.g., 10% of subcarrier spacing), attributed to full diversity exploitation in the DD domain. Complexity trade-offs favor linear methods for low-latency applications, while iterative approaches incur 2-10x higher operations but enable reliable communication at higher mobilities. In multi-user scenarios, successive interference cancellation via ordered decoding in the DD domain mitigates inter-user interference, supporting non-orthogonal multiple access with BER penalties under 1 dB relative to single-user baselines when combined with turbo principles.Waveform Variants
Pulse Shaping Methods
In Orthogonal Time Frequency Space (OTFS) modulation, the transmit pulse shaping function g_{tx}(t) plays a critical role in the Heisenberg representation by mapping information symbols from the time-frequency (TF) domain to the transmitted waveform, ensuring orthogonality among the modulated pulses to minimize inter-symbol interference (ISI).[22] The ideal pulse shape is rectangular in the TF domain, which simplifies the bi-orthogonality condition with the receive pulse g_{rx}(t) such that \int e^{-j 2\pi m \Delta f (t - nT)} g_{rx}^*(t - nT) g_{tx}(t) \, dt = \delta(m) \delta(n), but this leads to high out-of-band (OOB) emissions in practice due to its abrupt transitions.[22] Practical filters are thus essential to balance spectral containment with modulation integrity, often implemented as windowing functions in the TF domain to approximate the delay-Doppler (DD) representation.[23] Common pulse shaping methods include the root-raised cosine (RRC) filter, which reduces ISI by controlling the roll-off factor \beta (typically 0 to 1) to smooth spectral edges while maintaining Nyquist criteria for zero inter-carrier interference.[24] In OTFS, RRC is applied separably in delay and Doppler dimensions as w_{tx}(\tau, \nu) = \sqrt{BT} \, rrc_{\beta_\tau}(B\tau) \, rrc_{\beta_\nu}(\nu T), where B is bandwidth and T is the symbol period, effectively extending the subframe duration to T(1 + \beta_\nu) and bandwidth to B(1 + \beta_\tau) for better channel handling.[24] Gabor frame expansions provide an alternative for tight bounding in the TF domain, leveraging frame theory to achieve near-orthogonal decompositions that bound the frame operator and enhance robustness against channel variations, though they require careful window design to avoid redundancy.[25] Key challenges in OTFS pulse shaping involve trade-offs between bandwidth efficiency and Doppler robustness, as expanding the pulse support in time or frequency reduces aliasing from high-mobility channels but lowers spectral utilization.[24] OOB emissions pose another issue, particularly with rectangular or sinc-based pulses, which can exceed regulatory spectral masks and interfere in multi-user scenarios; for instance, circular pulse shaping has been proposed to mitigate this by confining energy within the grid.[26] Practical waveforms often compare sinc-based filters, which offer perfect orthogonality with \text{sinc}(B\tau) \text{sinc}(T\nu) but suffer from slow decay and high sidelobes, against Gaussian filters defined as w_1(\tau) = (2\alpha_\tau B^2 \pi)^{1/4} e^{-\alpha_\tau B^2 \tau^2} and w_2(\nu) = (2\alpha_\nu T^2 \pi)^{1/4} e^{-\alpha_\nu T^2 \nu^2}, which provide superior time-frequency localization for Doppler resilience at the cost of slight bandwidth expansion.[24] Hybrid approaches, such as Gaussian-sinc filters, combine sinc's nulls for equalization with Gaussian's low sidelobes for accurate input-output relation estimation, yielding up to 4 dB SNR gains at uncoded BER of $10^{-2} in Zak-OTFS systems.[27] For mm-wave adaptations, shorter pulses (e.g., with reduced \alpha) are employed to match high bandwidths, enhancing delay resolution in short-range high-Doppler environments.[24] In 6G contexts, pulse shaping ensures compliance with effective isotropic radiated power (EIRP) limits by minimizing OOB emissions, with RRC and Gaussian methods demonstrating spectral regrowth reductions that align with stringent masks for integrated sensing and communication.[28]Pulsone
Pulsone, a portmanteau of "pulse" and "tone," denotes a quasi-periodic waveform employed as the carrier in Orthogonal Time Frequency Space (OTFS) modulation, leveraging pulse-position modulation to embed information in the delay-Doppler domain. This design renders it particularly suitable for high-mobility and crystalline channel regimes, where channels exhibit periodic behavior due to structured multipath propagation. Developed by Cohere Technologies as an evolution of OTFS principles, Pulsone draws from foundational patents filed post-2018 and was formally launched in October 2025, with optimizations tailored for machine-type communications in dynamic environments such as vehicular and satellite links.[29][30] Among its key features, Pulsone facilitates machine learning-based detection algorithms, exemplified by the real-time neural receiver architecture demonstrated at NVIDIA's GTC conference in late 2025, which exploits the predictability of periodic channels for low-complexity equalization. Additionally, it achieves a low peak-to-average power ratio (PAPR) of 6.58 dB through integration with spread carrier waveforms, mitigating amplification inefficiencies in power-constrained devices. These attributes enable robust performance in doubly dispersive channels without the need for extensive interference cancellation, contrasting with traditional time-frequency approaches.[29][31] Implementation of Pulsone involves combining OTFS modulation with advanced pulse shaping to confine the signal within specified time and bandwidth constraints, making it viable for Frequency Range 3 (FR3) bands spanning 7–24 GHz. The core pulse train structure is mathematically represented asp(t) = \sum_{n} a_n \delta(t - nT + \phi_n),
where a_n denotes the amplitude of the n-th pulse, T is the nominal pulse spacing, and \phi_n introduces position shifts for modulation, ensuring quasi-periodic localization in both time and delay-Doppler domains. This formulation supports efficient transmitter operations by aligning pulses with channel crystallization conditions, where the pulse period exceeds the maximum delay spread. The advantages of Pulsone include superior synchronization in non-terrestrial networks (NTN), where it maintains stable carrier recovery amid high Doppler shifts from low-Earth orbit satellites, achieving up to twice the spectral efficiency of conventional waveforms in multi-satellite scenarios. As of 2025, initial deployments are underway in multi-G network architectures, particularly for integrated sensing and communication applications, with phased integration into existing 5G infrastructure to enable real-time situational awareness.[32][29]