MULTIPLE ACCESS USING ORTHOGONAL TIME FREQUENCY SPACE MODULATION

Abstract

An Orthogonal Time Frequency Space Modulation (OTFS) modulation scheme achieving multiple access by multiplexing multiple signals at the transmitter-side performs allocation of transmission resources to a first signal and a second signal, combining and converting to a transmission format via OTFS modulation and transmitting the signal over a communication channel. At the receiver, multiplexed signals are recovered using orthogonality property of the basis functions used for the multiplexing at the transmitter.

Description

TECHNICAL FIELD

This document relates to the field of telecommunications, in particular, estimation and compensation of impairments in telecommunications data channels.

BACKGROUND

Due to an explosive growth in the number of wireless user devices and the amount of wireless data that these devices can generate or consume, current wireless communication networks are fast running out of bandwidth to accommodate such a high growth in data traffic and provide high quality of service to users.

Various efforts are underway in the telecommunication industry to come up with next generation of wireless technologies that can keep up with the demand on performance of wireless devices and networks.

SUMMARY

Techniques for transmission and reception of signals using OTFS modulation techniques are disclosed. Signal multiplexing may be achieved by assigning non-overlapping time-frequency and/or delay-Doppler resources.

In one example aspect, a signal transmission technique is disclosed. The technique includes performing a logical mapping of transmission resources of the digital communication channel along a first two-dimensional resource plane represented by a first and a second orthogonal axes corresponding to a first transmission dimension and a second transmission dimension respectively, allocating, to a first signal, a first group of transmission resources from the logical mapping for transmission, allocating, to a second signal, a second group of resources from the logical mapping for transmission, transforming, using a first two-dimensional transform, a combination of the first signal having the first group of transmission resources and the second signal having the second group of transmission resources to a corresponding transformed signal in a second two-dimensional resource plane represented by a third and a fourth orthogonal axes corresponding to a third transmission dimension and a fourth transmission dimension respectively, converting the transformed signal to a formatted signal according to a transmission format of the communications channel, and transmitting the formatted signal over the communications channel.

In another example aspect, a signal reception method is disclosed. The method includes receiving a signal transmission comprising at least two component signals multiplexed together, transforming, using an orthogonal transform, the signal transmission into a post-processing format, wherein the post-processing format represents the at least two component signals in a two-dimensional time-frequency plane, recovering, by performing an orthogonal time frequency space transformation, a multiplexed signal in a two-dimensional delay-Doppler plane, from the post-processing format, and demultiplexing the multiplexed signal to recover one of the at least two component signals.

In yet another example aspect, a signal transmission method is disclosed. The signal transmission method includes performing a logical mapping of transmission resources of the digital communication channel along a first two-dimensional resource plane represented by a first and a second orthogonal axes corresponding to a first transmission dimension and a second transmission dimension respectively, allocating, to a first signal, a first group of transmission resources from the logical mapping for transmission, transforming, using a first two-dimensional transform, the first signal having the first group of transmission resources to a corresponding transformed signal in a second two-dimensional resource plane represented by a third and a fourth orthogonal axes corresponding to a third transmission dimension and a fourth transmission dimension respectively, converting the transformed signal to a formatted signal according to a transmission format of the communications channel, and transmitting the formatted signal over the communications channel.

These, and other aspects are described in the present document.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows an example trajectory of Time Varying Impulse Response for Accelerating Reflector.

FIG. 2 shows an example Delay-Doppler Representation for Accelerating Reflector Channel.

FIG. 3 depicts example levels of Abstraction: Signaling over the (i) actual channel with a signaling waveform (ii) the time-frequency Domain (iii) the delay-Doppler Domain.

FIG. 4 illustrates notation used to Denote Signals at Various Stages of Transmitter and Receiver.

FIG. 5 illustrates a conceptual Implementation of the Heisenberg Transform in the Transmitter and the Wigner Transform in the Receiver.

FIG. 6 illustrates cross-correlation between g_tr(t) and g_r(t) for OFDM Systems.

FIG. 7 depicts example of information symbols in the Information (Delay-Doppler) Domain (Right), and Corresponding Basis Functions in the Time-Frequency Domain (Left).

FIG. 8 illustrates an example one Dimensional Multipath Channel Example: (i) Sampled Frequency Response at Δf=1 Hz (ii) Periodic Fourier Transform with Period 1/Δf=1 sec (iii) Sampled Fourier Transform with Period 1/Δf and Resolution 1/MΔf.

FIG. 9 illustrates a one Dimensional Doppler Channel Example: (i) Sampled Frequency Response at T_s=1 sec (ii) Periodic Fourier Transform with Period 1/T_s=1 Hz (iii) Sampled Fourier Transform with Period 1/T_s and Resolution 1/NT_s.

FIG. 10 depicts an example of a time-Varying Channel Response in the Time-Frequency Domain.

FIG. 11 shows an example of a SDFT of Channel response—(τ,v) Delay-Doppler Domain.

FIG. 12 shows an example SFFT of Channel Response—Sampled (τ,v) Delay-Doppler Domain.

FIG. 13 shows an example transformation of the Time-Frequency Plane to the Doppler-Delay Plane.

FIG. 14 shows an example of a Discrete Impulse in the orthogonal time frequency space (OTFS) Domain Used for Channel Estimation.

FIG. 15 shows examples of different Basis Functions, assigned to different users, span the whole Time-Frequency Frame.

FIG. 16 an example of multiplexing three users in the Time-Frequency Domain

FIG. 17 shows an example of multiplexing three users in the Time-Frequency Domain with Interleaving.

FIG. 18 shows an example of OTFS Architecture.

FIG. 19 is a graphical representation of an OTFS delay-Doppler transform.

FIG. 20 is a graphical representation of an OTFS delay-Doppler transform.

FIG. 21 shows a multiplexing scheme.

FIG. 22 shows a multiplexing scheme.

FIG. 23 shows a multiplexing scheme.

FIG. 24 shows a multiplexing scheme.

FIG. 25 shows a multiplexing scheme.

FIG. 26 shows a multiplexing scheme.

FIG. 27 shows a multiplexing scheme.

FIG. 28 is another example of an OTFS architecture.

FIG. 29 is a flowchart representation of a method of signal transmission.

FIG. 30 is a flowchart representation of a method of signal reception.

FIG. 31 is a block diagram of an example communication apparatus.

DETAILED DESCRIPTION

Section headings are used in this document to help improve readability and do not limit scope of the technology discussed in each section only to that section. Furthermore, for ease of explanation, a number of simplifying assumptions have been made. Although these simplifying assumptions are intended to help convey ideas, they are not intended to be limiting.

4G wireless networks have served the public well, providing ubiquitous access to the internet and enabling the explosion of mobile apps, smartphones and sophisticated data intensive applications like mobile video. This continues an honorable tradition in the evolution of cellular technologies, where each new generation brings enormous benefits to the public, enabling astonishing gains in productivity, convenience, and quality of life.

Looking ahead to the demands that the ever increasing and diverse data usage is putting on the network, it is becoming clear to the industry that current 4G networks will not be able to support the foreseen needs in the near term future. The data traffic volume has been and continues to increase exponentially. AT&T reports that its network has seen an increase in data traffic of 100,000% in the period 2007-2015. Looking into the future, new applications like immersive reality, and remote robotic operation (tactile internet) as well as the expansion of mobile video are expected to overwhelm the carrying capacity of current systems. One of the goals of 5G system design is to be able to economically scale the network to 750 Gbps per sq. Km in dense urban settings, something that is not possible with today's technology.

Beyond the sheer volume of data, the quality of data delivery will need to improve in next generation systems. The public has become accustomed to the ubiquity of wireless networks and is demanding a wireline experience when untethered. This translates to a requirement of 50+ Mbps everywhere (at the cell edge), which will require advanced interference mitigation technologies to be achieved.

Another aspect of the quality of user experience is mobility. Current systems' throughput is dramatically reduced with increased mobile speeds due to Doppler effects which evaporate MIMO capacity gains. Future 5G systems aim to not only increase supported speeds up to 500 Km/h for high speed trains and aviation, but also support a host of new automotive applications for vehicle-to-vehicle and vehicle-to-infrastructure communications.

While the support of increased and higher quality data traffic is necessary for the network to continue supporting the user needs, carriers are also exploring new applications that will enable new revenues and innovative use cases. The example of automotive and smart infrastructure applications discussed above is one of several. Others include the deployment of public safety ultra-reliable networks, the use of cellular networks to support the sunset of the PSTN, etc. The biggest revenue opportunity however, is arguably the deployment of large number of internet connected devices, also known as the internet of things (IoT). Current networks however are not designed to support a very large number of connected devices with very low traffic per device.

In summary, current LTE networks cannot achieve the cost/performance targets required to support the above objectives, necessitating a new generation of networks involving advanced PHY technologies. There are numerous technical challenges that will have to be overcome in 5G networks as discussed next.

4G Technical Challenges

In order to enable machine-to-machine communications and the realization of the internet of things, the spectral efficiency for short bursts will have to be improved, as well as the energy consumption of these devices (allowing for 10 years operation on the equivalent of 2 AA batteries). In current LTE systems, the network synchronization requirements place a burden on the devices to be almost continuously on. In addition, the efficiency goes down as the utilization per UE (user equipment, or mobile device) goes down. The PHY requirements for strict synchronization between UE and eNB (Evolved Node B, or LTE base station) will have to be relaxed, enabling a re-designing of the MAC for IoT connections that will simplify transitions from idle state to connected state.

Another important use case for cellular IoT (CIoT) is deep building penetration to sensors and other devices, requiring an additional 20 dB or more of dynamic range. 5G CIoT solutions should be able to coexist with the traditional high-throughput applications by dynamically adjusting parameters based on application context.

The path to higher spectral efficiency points towards a larger number of antennas. A lot of research work has gone into full dimension and massive MIMO architectures with promising results. However, the benefits of larger MIMO systems may be hindered by the increased overhead for training, channel estimation and channel tracking for each antenna. A PHY that is robust to channel variations will be needed as well as innovative ways to reduce the channel estimation overhead.

Robustness to time variations is usually connected to the challenges present in high Doppler use cases such as in vehicle-to-infrastructure and vehicle-to-vehicle automotive applications. With the expected use of spectrum up to 60 GHz for 5G applications, this Doppler impact will be an order of magnitude greater than with current solutions. The ability to handle mobility at these higher frequencies would be extremely valuable.

The OTFS Solution

OTFS is a modulation technique that modulates each information (e.g., QAM) symbol onto one of a set of two dimensional (2D) orthogonal basis functions that span the bandwidth and time duration of the transmission burst or packet. The modulation basis function set is specifically derived to best represent the dynamics of the time varying multipath channel.

OTFS transforms the time-varying multipath channel into a time invariant delay-Doppler two dimensional convolution channel. In this way, it eliminates the difficulties in tracking time-varying fading, for example in high speed vehicle communications.

OTFS increases the coherence time of the channel by orders of magnitude. It simplifies signaling over the channel using well studied AWGN codes over the average channel SNR. More importantly, it enables linear scaling of throughput with the number of antennas in moving vehicle applications due to the inherently accurate and efficient estimation of channel state information (CSI). In addition, since the delay-doppler channel representation is very compact, OTFS enables massive MIMO and beamforming with CSI at the transmitter for four, eight, and more antennas in moving vehicle applications.

In deep building penetration use cases, one QAM symbol may be spread over multiple time and/or frequency points. This is a key technique to increase processing gain and in building penetration capabilities for CIoT deployment and PSTN replacement applications. Spreading in the OTFS domain allows spreading over wider bandwidth and time durations while maintaining a stationary channel that does not need to be tracked over time.

These benefits of OTFS will become apparent once the basic concepts behind OTFS are understood. There is a rich mathematical foundation of OTFS that leads to several variations; for example it can be combined with OFDM or with multicarrier filter banks. In this paper we navigate the challenges of balancing generality with ease of understanding as follows:

This patent document describes the wireless Doppler multipath channel and its effects on multicarrier modulation.

This patent document also describes OTFS as a modulation that matches the characteristics of the time varying channel. We show OTFS can be implemented as two processing steps:

A step that allows transmission over the time frequency plane, via orthogonal waveforms generated by translations in time and/or frequency. In this way, the (time-varying) channel response is sampled over points of the time-frequency plane.

A pre-processing step using carefully crafted orthogonal functions employed over the time-frequency plane, which translate the time-varying channel in the time-frequency plane, to a time-invariant one in the new information domain defined by these orthogonal functions.

This patent document describes the new modulation scheme by exploring the behavior of the channel in the new modulation domain in terms of coherence, time and frequency resolution etc.

This patent document describes aspects of channel estimation in the new information domain and multiplexing multiple users respectively, including complexity and implementation issues.

This patent document provides some performance results and we put the OTFS modulation in the context of cellular systems, discuss its attributes and its benefits for 5G systems.

OTFS Modulation Over the Doppler Multipath Channel

The time variation of the channel introduces significant difficulties in wireless communications related to channel acquisition, tracking, equalization and transmission of channel state information (CSI) to the transmit side for beamforming and MIMO processing. In this paper, we develop a modulation domain based on a set of orthonormal basis functions over which we can transmit the information symbols, and over which the information symbols experience a static, time invariant, two dimensional channel for the duration of the packet or burst transmission. In that modulation domain, the channel coherence time is increased by orders of magnitude and the issues associated with channel fading in the time or frequency domain in SISO or MIMO systems are significantly reduced.

The present document also discloses examples of a new modulation scheme by exploring the behavior of the channel in the new modulation domain in terms of coherence, time and frequency resolution etc.

The document also discloses techniques for channel estimation in the new information domain and multiplexing multiple users respectively, including associated complexity and implementation issues for implementing the disclosed techniques.

The present document also provides some performance results and examples of benefits offered by the OTFS modulation in the context of cellular systems, including 5G systems.

Example Models for a Wireless Channel

The multipath fading channel is commonly modeled in the baseband as a convolution channel with a time varying impulse response:

$\begin{array}{cc}r\left(t\right)=\int \left(\tau ,t\right)s\left(t-\tau \right)d\tau & \left(1\right)\end{array}$

where s(t) and r(t) represent the complex baseband channel input and output respectively and where (τ,t) is the complex baseband time varying channel response.

This representation, while general, may not explicitly give an insight into the behavior and variations of the time varying impulse response. A more useful and insightful model, which is also commonly used for Doppler multipath doubly fading channels is

$\begin{array}{cc}r\left(t\right)=\int \int h\left(\tau ,v\right)e^{j2\pi v\left(t-\tau \right)}s\left(t-\tau \right)dvd\tau & \left(2\right)\end{array}$

In this representation, the received signal is a superposition of reflected copies of the transmitted signal, where each copy is delayed by the path delay τ, frequency shifted by the Doppler shift v and weighted by the time-invariant delay-Doppler impulse response h(τ,v) for that τ and v. In addition to the intuitive nature of this representation, Eq. (2) maintains the generality of Eq. (1). In other words it can represent complex Doppler trajectories, like accelerating vehicles, reflectors etc. This can be seen by expressing the time varying impulse response as a Fourier expansion with respect to the time variable t

$\begin{array}{cc}\left(\tau ,t\right)=\int h\left(\tau ,v\right)e^{j2\pi \mathrm{vt}}dt& \left(3\right)\end{array}$

Substituting (3) in (1) gives Eq. (2) after some manipulation. More specifically we obtain y(t)=∫∫e{circumflex over ( )}j2πvτ h(τ,v) e{circumflex over ( )}2πv(t−τ) x(t−τ)dvdτ which differs from (2) by an exponential factor. The exponential factor can be added to the definition of the impulse response h(τ,v) making the two representations equivalent. As an example, FIG. 1 shows the time-varying impulse response for an accelerating reflector in the (τ,t) coordinate system, while FIG. 2 shows the same channel represented as a time invariant impulse response in the (τ,v) coordinate system.

An interesting feature revealed by these two figures is how compact the (τ,v) representation is compared to the (τ,t) representation. This has implications for channel estimation, equalization and tracking as will be discussed later.

While h(τ,v) is, in fact, time-invariant, the operation on s(t) is still time varying, as can be seen by the effect of the explicit complex exponential function of time in Eq. (2). In one advantageous aspect, some embodiments of the modulation scheme based on appropriate choice of orthogonal basis functions, disclosed herein, render the effects of this channel truly time-invariant in the domain defined by those basis functions.

The equation below represents a set of orthonormal basis functions ϕ_τ,v(t) indexed by τ,v which are orthogonal to translation and modulation, i.e.,

$\begin{array}{cc}{\varphi }_{\tau ,v}\left(t-{\tau }_0\right)={\varphi }_{\tau +{\tau }_0,v}\left(t\right)& \left(4\right)\end{array}$

$e^{j2\pi v_{0}t}{\varphi }_{\tau ,v}\left(t\right)={\varphi }_{\tau ,v-v_0}\left(t\right)$

and a transmitted signal can be considered as a superposition of these basis functions:

$\begin{array}{cc}s\left(t\right)=\int \int x\left(\tau ,v\right){\varphi }_{\tau ,v}\left(t\right)d\tau dv& \left(5\right)\end{array}$

where the weights x(τ,v) represent the information bearing signal to be transmitted. After the transmitted signal of (5) goes through the time varying channel of Eq. (2) a superposition of delayed and modulated versions of the basis functions is obtained, which due to (4) results in:

$\begin{array}{cc}\begin{array}{c}r\left(t\right)=\int \int h\left(\tau ,v\right)e^{j2\pi v\left(t-\tau \right)}s\left(t-\tau \right)\mathrm{dvd}\tau \\ =\int \int {\varphi }_{\tau ,v}\left(t\right)\left\{h\left(\tau ,v\right)*x\left(\tau ,v\right)\right\}d\tau \mathrm{dv}\end{array}& \left(6\right)\end{array}$

where * denotes two dimensional convolution. Eq. (6) can be thought of as a generalization of the derivation of the convolution relationship for linear time invariant systems, using one dimensional exponentials as basis functions. The term in brackets can be recovered at the receiver by matched filtering against each basis function ϕ_τ,v(t). In this way, a two dimensional channel relationship is established in the (τ,v) domain y(τ,v)=h(τ,v)*x(τ,v), where y(τ,v) is the receiver two dimensional matched filter output. In this domain, the channel is described by a time invariant two-dimensional convolution.

A different interpretation of the wireless channel will also be useful in what follows. Consider s(t) and r(t) as elements of the Hilbert space of square integrable function . Then Eq. (2) can be interpreted as a linear operator on acting on the input s(t), parametrized by the impulse response h(τ,v), and producing the output r(t)

$\begin{array}{cc}r={\Pi }_h\left(s\right):s\left(t\right)\in \mathscr{H}\stackrel{{\prod }_h(·)}{⟶}r\left(t\right)\in \mathscr{H}& \left(7\right)\end{array}$

Although the operator is linear, it is not time-invariant. In the no-Doppler case, e.g., if h(v,τ)=h(0,τ)δ(v), then Eq. (2) reduces to a time invariant convolution. Also notice that while for time invariant systems the impulse response is parameterized by one dimension, in the time varying case we have a two dimensional impulse response. While in the time invariant case the convolution operator produces a superposition of delays of the input s(t), (hence the parameterization is along the one dimensional delay axis) in the time varying case there is a superposition of delay-and-modulate operations as seen in Eq. (2) (hence the parameterization is along the two dimensional delay and Doppler axes). This is a major difference which makes the time varying representation non-commutative (in contrast to the convolution operation which is commutative), and complicates the treatment of time varying systems.

The important point of Eq. (7) is that the operator Π_h(·) can be compactly parametrized in a two dimensional space h(τ,v), providing an efficient, time invariant description of the channel. Typical channel delay spreads and Doppler spreads are a very small fraction of the symbol duration and subcarrier spacing of multicarrier systems.

In the mathematics literature, the representation of time varying systems of (2) and (7) is sometimes called the Heisenberg representation. It can be shown that every linear operator (7) can be parameterized by some impulse response as in (2).

OTFS Modulation over the Doppler Multipath Channel

The time variation of the channel introduces significant difficulties in wireless communications related to channel acquisition, tracking, equalization and transmission of channel state information (CSI) to the transmit side for beamforming and MIMO processing. This document discloses a modulation domain based on a set of orthonormal basis functions over which systems can transmit the information symbols, and over which the information symbols experience a static, time invariant, two dimensional channel for the duration of the packet or burst transmission. In this modulation domain, the channel coherence time is increased by orders of magnitude and the issues associated with channel fading in the time or frequency domain in SISO or MIMO systems are significantly reduced.

Orthogonal Time Frequency Space (OTFS) modulation could be implemented as a cascade of two transformations. The first transformation maps the two dimensional plane where the information symbols reside (and which we call the delay-Doppler plane) to the time frequency plane. The second one transforms the time frequency domain to the waveform time domain where actual transmitted signal is constructed. This transform can be thought of as a generalization of multicarrier modulation schemes.

FIG. 3 provides a pictorial view of the two transformations that could be considered to constitute the OTFS modulation. It shows at a high level the signal processing steps that are required at the transmitter and receiver. It also includes the parameters that define each step, which will become apparent as we further expose each step. Further, FIG. 4 shows a block diagram of the different processing stages at the transmitter and receiver and establishes the notation that will be used for the various signals.

The Heisenberg Transform

One important aspect of transmission to construct an appropriate transmit waveform which carries information provided by symbols on a grid in the time-frequency plane. In some embodiments, it is advantageous to have a modulation scheme that transforms the channel operation to an equivalent operation on the time-frequency domain with two properties:

• • The channel is orthogonalized on the time-frequency grid.
  • The channel time variation is simplified on the time-frequency grid and can be addressed with an additional (or a single additional) transform.

Fortunately, these goals can be accomplished with a scheme that is very close to well-known multicarrier modulation techniques, as explained next. This is applicable to the general framework for multicarrier modulation and specifically examples of OFDM and multicarrier filter bank implementations.

Consider the following components of a time frequency modulation:

• • [1] A lattice or grid on the time frequency plane, that is a sampling of the time axis with sampling period T and the frequency axis with sampling period Δf.

$\begin{array}{cc}\Lambda =\left\{\left(nT,m\Delta f\right),n,m\in \mathbb{Z}\right\}& \left(8\right)\end{array}$

• • [2] A packet burst with total duration NT secs and total bandwidth MΔf Hz
  • [3] A set of modulation symbols X[n,m], n=0, . . . , N−1, m=0, . . . , M−1 we wish to transmit over this burst
  • [4] A transmit pulse g_tr(t) with the property of being orthogonal to translations by T and modulations by Δf. This orthogonality property is useful if the receiver uses the same pulse as the transmitter. In some implementations, bi-orthogonality property may be used instead.

$\begin{array}{cc}<{ℊ}_{\mathrm{tr}}\left(t\right),{ℊ}_{\mathrm{tr}}\left(t-nT\right)e^{j2\pi m\Delta f\left(t-\mathrm{nT}\right)}>=\int {ℊ}_{\mathrm{tr}}^{*}\left(t\right){ℊ}_r\left(t-nT\right)e^{j2\pi m\Delta f\left(t-\mathrm{nT}\right)}\mathrm{dt}\text{⁠}=\delta \left(m\right)\delta \left(n\right)& \left(9\right)\end{array}$

Given the above components, the time-frequency modulator is a Heisenberg operator on the lattice Λ, that is, it maps the two dimensional symbols X[n·m] to a transmitted waveform, via a superposition of delay-and-modulate operations on the pulse waveform g_tr(t)

$\begin{array}{cc}s\left(t\right)=\sum _{m=-M/2}^{M/2-1}\sum _{n=0}^{N-1}X\left[n,m\right]{ℊ}_{\mathrm{tr}}\left(t-\mathrm{nT}\right)e^{j2\pi m\Delta f\left(t-\mathrm{nT}\right)}& \left(10\right)\end{array}$

More formally

$\begin{array}{cc}x={\Pi }_X\left(g_{\mathrm{tr}}\right):g_{\mathrm{tr}}\left(t\right)\in \mathscr{H}\stackrel{{\Pi }_x(·)}{⟶}y\left(t\right)\in \mathscr{H}& \left(11\right)\end{array}$

where Π_X(·) denotes the “discrete” Heisenberg operator, parameterized by discrete values X[n,m].

Notice the similarity of (11) with the channel equation (7). This is not by coincidence, but rather because of application of a modulation effect that mimics the channel effect, so that the end effect of the cascade of modulation and channel is more tractable at the receiver. For example, linear modulation (aimed at time invariant channels) is in its simplest form a convolution of the transmit pulse g(t) with a delta train of QAM information symbols sampled at the Baud rate T.

$\begin{array}{cc}s\left(t\right)=\sum _{n=0}^{N-1}X\left[n\right]g\left(t-nT\right)& \left(12\right)\end{array}$

In the case of a time varying channel, systems convolve-and-modulate the transmit pulse (c.f. the channel Eq. (2)) with a two dimensional delta train which samples the time frequency domain at a certain Baud rate and subcarrier spacing.

The sampling rate in the time-frequency domain is related to the bandwidth and time duration of the pulse g_tr(t) namely its time-frequency localization. In order for the orthogonality condition of (9) to hold for a frequency spacing Δf, the time spacing must be T≥1/Δf. The critical sampling case of T=1/Δf is generally not practical and refers to limiting cases, for example to OFDM systems with cyclic prefix length equal to zero or to filter banks with g_tr (t) equal to the ideal Nyquist pulse.

Some examples are now in order:

Example 1: OFDM Modulation: Consider an OFDM system with M subcarriers, symbol length T_OFDM, cyclic prefix length T_CP and subcarrier spacing 1/T_OFDM. Substitute in Equation (10) symbol duration T=T_OFDM+T_CP, number of symbols N=1, subcarrier spacing Δf=1/T_OFDM and g_tr(t) a square window that limits the duration of the subcarriers to the symbol length T

$\begin{array}{cc}{g}_{\mathrm{tr}}\left(t\right)=\{\begin{array}{cc}1/\sqrt{T-T_{CP}},& -T_{CP}<t<T-T_{CP}\\ 0,& \mathrm{else}\end{array}& \left(13\right)\end{array}$

Results in the OFDM formula below. Strictly speaking, the pulse of Eq. (10) is not orthonormal but is orthogonal to the receive filter (where the CP samples are discarded) as will be shown in this document.

$\begin{array}{cc}x\left(t\right)=\sum _{m=-M/2}^{M/2-1}X\left[n,m\right]g_{\mathrm{tr}}\left(t\right)e^{j2\pi m\Delta ft}& \left(14\right)\end{array}$

Example 2: Single Carrier Modulation: Equation (10) reduces to single carrier modulation with M=1 subcarrier, T equal to the Baud period and g_tr (t) equal to a square root raised cosine Nyquist pulse.

Example 3: Multicarrier Filter Banks (MCFB): Equation (10) describes a MCFB if g_tr(t) is a square root raised cosine Nyquist pulse with excess bandwidth α, T is equal to the Baud period and Δf=(1+α)/T.

Expressing the modulation operation as a Heisenberg transform as in Eq. (11) may be counterintuitive. Modulation is usually considered to be a transformation of the modulation symbols X[m,n] to a transmit waveform s(t). The Heisenberg transform instead, uses X[m,n] as weights/parameters of an operator that produces s(t) when applied to the prototype transmit filter response g_tr (t)—c.f. Eq. (11). While possibly counterintuitive, this formulation is useful in pursuing an abstraction of the modulation-channel-demodulation cascade effects in a two dimensional domain where the channel can be described as time invariant.

On the receiver side, processing is performed to go back from the waveform domain to the time-frequency domain. Since the received signal has undergone the cascade of two Heisenberg transforms (one by the modulation effect and one by the channel effect), it is natural to inquire what the end-to-end effect of this cascade is. The answer to this question is given by the following result:

Proposition 1: Let two Heisenberg transforms as defined by Eqs. (7), (2) be parametrized by impulse responses h₁(τ,v), h₂(τ,v) and be applied in cascade to a waveform g(t)∈. Then

$\begin{array}{cc}{\Pi }_{h_2}\left({\Pi }_{h_1}\left(g\left(t\right)\right)\right)={\Pi }_h\left(g\left(t\right)\right)& \left(15\right)\end{array}$

where h(τ,v)=h₂(τ,v)⊙h₁(τ,v) is the “twisted” convolution of h₁(τ,v), h₂(τ,v) defined by the following convolve-and-modulate operation

$\begin{array}{cc}h\left(\tau ,\nu \right)=\int \int h_2\left({\tau }^{\prime },{\nu }^{\prime }\right)h_1\left(\tau -{\tau }^{\prime },\nu -{\nu }^{\prime }\right)e^{j2{\mathrm{\pi \nu }}^{\prime }\left(\tau -{\tau }^{\prime }\right)t}d{\tau }^{\prime }d{\nu }^{\prime }& \left(16\right)\end{array}$

Proof: Provided elsewhere in the document.

Applying the above result to the cascade of the modulation and channel Heisenberg transforms of (11) and (7), it can be shown that the received signal is given by the Heisenberg transform

$\begin{array}{cc}r\left(t\right)={\Pi }_f\left(g_{\mathrm{tr}}\left(t\right)\right)+v\left(t\right)=\int \int f\left(\tau ,v\right)e^{j2\mathrm{\pi \nu }\left(t-\tau \right)}{g}_{\mathrm{tr}}\left(t-\tau \right)d\nu d\tau +v\left(t\right)& \left(17\right)\end{array}$

where v(t) is additive noise and f(τ,v), the impulse response of the combined transform, is given by the twisted convolution of X[n,m] and h(τ,v)

$\begin{array}{cc}f\left(\tau ,\nu \right)=h\left(\tau ,\nu \right)\odot X\left[n,m\right]=\sum _{m=-M/2}^{M/2-1}\sum _{n=0}^{N-1}X\left[n,m\right]h\left(\tau -\mathrm{nT},\nu -m\Delta f\right)e^{j2\pi \left(\nu -m\Delta f\right)\mathrm{nT}}& \left(18\right)\end{array}$

This result can be considered an extension of the single carrier modulation case, where the received signal through a time invariant channel is given by the convolution of the QAM symbols with a composite pulse, that pulse being the convolution of the transmitter pulse and the channel impulse response.

Receiver Processing and the Wigner Transform

Typical communication system design dictates that the receiver performs a matched filtering operation, taking the inner product of the received waveform with the transmitter pulse, appropriately delayed or otherwise distorted by the channel. Typical OTFS systems include a collection of delayed and modulated transmit pulses, and a receiver may perform a matched filter on each one of them. FIG. 5 provides a conceptual view of this processing. On the transmitter, a set of M subcarriers is modulated for each symbol transmitted, while on the receiver matched filtering is performed on each of those subcarrier pulses. Define a receiver pulse g_r(t) and take the inner product with a collection of delayed and modulated versions of it. The receiver pulse g_r(t) is in many cases identical to the transmitter pulse, but we keep the separate notation to cover some cases where it is not (most notably in OFDM where the CP samples have to be discarded).

While this approach will yield the sufficient statistics for data detection in the case of an ideal channel, a concern can be raised here for the case of non-ideal channel effects. In this case, the sufficient statistics for symbol detection are obtained by matched filtering with the channel-distorted, information-carrying pulses (assuming that the additive noise is white and Gaussian). In many well designed multicarrier systems however (e.g., OFDM and MCFB), the channel distorted version of each subcarrier signal is only a scalar version of the transmitted signal, allowing for a matched filter design that is independent of the channel and uses the original transmitted subcarrier pulse. The present document makes these statements more precise and examines the conditions for this to be true.

FIG. 5 is only a conceptual illustration and does not point to the actual implementation of the receiver. Typically this matched filtering is implemented in the digital domain using an FFT or a polyphase transform for OFDM and MCFB (multi-channel filter bank) respectively. In this paper we are rather more interested in the theoretical understanding of this modulation. To this end, consider a generalization of this matched filtering by taking the inner product <g_r(t−τ)e^j2π(t−τ), r(t)> of the received waveform with the delayed and modulated versions of the receiver pulse for arbitrary time and frequency offset (τ,v). While this may not be a specific implementation, it allows to view the operations of FIG. 5 as a two dimensional sampling of this more general inner product.

Define the inner product:

$\begin{array}{cc}{A}_{g_r,r}\left(\tau ,\nu \right)=<g_r\left(t-\tau \right)e^{j2\mathrm{\pi \nu }\left(t-\tau \right)},r\left(t\right)>=\int g_r^{*}\left(t-\tau \right)e^{-j2\mathrm{\pi \nu }\left(t-\tau \right)}r\left(t\right)dt& \left(19\right)\end{array}$

The function A_gr,r(τ,v) is known as the cross-ambiguity function in the radar and math communities and yields the matched filter output if sampled at r=nT, v=mΔf (on the lattice Λ), i.e.,

$\begin{array}{cc}{Y\left[n,m\right]=A_{g_r,r}\left(\tau ,\nu \right)❘}_{\tau =\mathrm{nT},\nu =m\Delta f}& \left(20\right)\end{array}$

In the math community, the ambiguity function is related to the inverse of the Heisenberg transform, namely the Wigner transform. FIG. 5 provides an intuitive feel for that, as the receiver appears to invert the operations of the transmitter. More formally, if a systems takes the cross-ambiguity or the transmit and receive pulses A_(g_r,g_tr) (τ,v), and uses it as the impulse response of the Heisenberg operator, then it can obtain the orthogonal cross-projection operator

${\Pi }_{A_{g_r,g_{\mathrm{tr}}}}\left(y\left(t\right)\right)=g_{\mathrm{tr}}\left(t\right)\langle g_r\left(t\right),y\left(t\right)\rangle$

In words, the coefficients that come out of the matched filter, if used in a Heisenberg representation, will provide the best approximation to the original y(t) in the sense of minimum square error.

The key question here is what the relationship is between the matched filter output Y[n,m] (or more generally Y(τ,v)) and the transmitter input X[n,m]. We have already established in (17) that the input to the matched filter r(t) can be expressed as a Heisenberg representation with impulse response f(τ,v) (plus noise). The output of the matched filter then has two contributions

$\begin{array}{cc}Y\left(\tau ,\nu \right)=A_{g_r,r}\left(\tau ,\nu \right)=A_{g_r,\left[{\Pi }_f\left(g_{\mathrm{tr}}\right)+v\right]}\left(\tau ,\nu \right)=A_{g_r,{\Pi }_f\left(g_{\mathrm{tr}}\right)}\left(\tau ,\nu \right)+A_{g_r,v}\left(\tau ,\nu \right)& \left(21\right)\end{array}$

The last term is the contribution of noise, which we can be denotes as V(τ,v)=A_gr,v(τ,v). The first term on the right hand side is the matched filter output to the (noiseless) input comprising of a superposition of delayed and modulated versions of the transmit pulse. One can next establish that this term can be expressed as the twisted convolution of the two dimensional impulse response f(τ,v) with the cross-ambiguity function (or two dimensional cross correlation) of the transmit and receive pulses.

The following theorem summarizes the result.

Theorem 1: (Fundamental time-frequency domain channel equation). If the received signal can be expressed as

$\begin{array}{cc}{\Pi }_f\left(g_{\mathrm{tr}}\left(t\right)\right)=\int \int f\left(\tau ,\nu \right)e^{j2\mathrm{\pi \nu }\left(t-\tau \right)}{g}_{\mathrm{tr}}\left(t-\tau \right)d\nu d\tau & \left(22\right)\end{array}$

Then the cross-ambiguity of that signal with the receive pulse g_tr(t) can be expressed as

$\begin{array}{cc}{A}_{g_r,{\Pi }_f\left(g_{\mathrm{tr}}\right)}\left(\tau ,\nu \right)=f\left(\tau ,\nu \right)\odot A_{g_r,g_{\mathrm{tr}}}\left(\tau ,\nu \right)& \left(23\right)\end{array}$

Proof: is provided elsewhere in the present document.

Recall from (18) that f(τ,v)=h(τ,v)⊙X[n,m], that is, the composite impulse response is itself a twisted convolution of the channel response and the modulation symbols.

Substituting f(τ,v) from (18) into (21) one can obtain the end-to-end channel description in the time frequency domain:

$\begin{array}{cc}\begin{array}{c}Y\left(\tau ,\nu \right)=A_{g_r,{\Pi }_r\left(g_{\mathrm{tr}}\right)}\left(\tau ,\nu \right)+V\left(\tau ,\nu \right)\\ =h\left(\tau ,\nu \right)\odot X\left[n,m\right]\odot A_{g_r,g_{\mathrm{tr}}}\left(\tau ,\nu \right)+V\left(\tau ,\nu \right)\end{array}& \left(24\right)\end{array}$

where V(τ,v) is the additive noise term. Eq. (24) provides an abstraction of the time varying channel on the time-frequency plane. It states that the matched filter output at any time and frequency point (τ,v) is given by the delay-Doppler impulse response of the channel twist-convolved with the impulse response of the modulation operator twist-convolved with the cross-ambiguity (or two dimensional cross correlation) function of the transmit and receive pulses.

Evaluating Eq. (24) on the lattice Λ one can obtain the matched filter output modulation symbol estimates

$\begin{array}{cc}{\hat{X}\left[m,n\right]=Y\left[n,m\right]=Y\left(\tau ,v\right)❘}_{\tau =\mathrm{nT},v=m\Delta f}& \left(25\right)\end{array}$

In order to get more intuition on Equations (24), (25) first consider the case of an ideal channel, i.e., h(τ,v)=δ(τ)d(v). In this case by direct substitution one can get the convolution relationship:

$\begin{array}{cc}Y\left[n,m\right]=\sum _{m^{\prime }=-M/2}^{M/2-1}\sum _{n^{\prime }=0}^{N-1}X\left[n^{\prime },m^{\prime }\right]A_{g_r,g_{\mathrm{tr}}}\left(\left(n-n^{\prime }\right)T,\left(m-m^{\prime }\right)\Delta f\right)+V\left[m,n\right]& \left(26\right)\end{array}$

In order to simplify Eq. (26) one can use the orthogonality properties of the ambiguity function. Since implementations may in general use different transmit and receive pulses one can modify the orthogonality condition on the design of the transmit pulse we stated in (9) to a bi-orthogonality condition:

$\begin{array}{cc}\langle g_{\mathrm{tr}}\left(t\right),g_r\left(t-\mathrm{nT}\right)e^{j2\pi m\Delta f\left(t-\mathrm{nT}\right)}\rangle =\int g_{\mathrm{tr}}^{*}\left(t\right)g_r\left(t-\mathrm{nT}\right)e^{j2\pi m\Delta f\left(t-\mathrm{nT}\right)}\mathrm{dt}=\delta \left(m\right)\delta \left(n\right)& \left(27\right)\end{array}$

Under this condition, only one term survives in (26) and resulting in:

$\begin{array}{cc}Y\left[n,m\right]=X\left[n,m\right]+V\left[n,m\right]& \left(28\right)\end{array}$

where V[n,m] is the additive white noise. Eq. (28) shows that the matched filter output does recover the transmitted symbols (plus noise) under ideal channel conditions. Of more interest of course is the case of non-ideal time varying channel effects. This document shows that, even in this case, the channel orthogonalization is maintained (no intersymbol or intercarrier interference), while the channel complex gain distortion has a closed form expression.

The following theorem summarizes the result as a generalization of (28).

Theorem 2: (End-to-end time-frequency domain channel equation):

If h(τ,v) has finite support bounded by (τ_max,v_max) and if A_gr,gtr(τ,v)=0 for τ∈(nT−τ_max,nT+τ_max), v∈(mΔf−v_max,mΔf+v_max), that is, the ambiguity function bi-orthogonality property of (27) is true in a neighborhood of each grid point (mΔf, nT) of the lattice Λ at least as large as the support of the channel response h(τ,v), then the following equation holds

$\begin{array}{cc}Y\left[n,m\right]=H\left[n,m\right]X\left[n,m\right]& \left(29\right)\end{array}$ $H\left[n,m\right]=\int \int h\left(\tau ,v\right)e^{j2\pi \mathrm{vnT}}{e}^{-j2\pi \left(v+m\Delta f\right)\tau }\mathrm{dvd}\tau$

If the ambiguity function is only approximately bi-orthogonal in the neighborhood of Λ (by continuity), then (29) is only approximately true

Proof: provided elsewhere in the present document.

Eq. (29) is a fundamental equation that describes the channel behavior in the time-frequency domain. It is the basis for understanding the nature of the channel and its variations along the time and frequency dimensions.

Some observations are now in order on Eq. (29). As mentioned before, there is no interference across X[n,m] in either time n or frequency m.

The end-to-end channel distortion in the modulation domain is a (complex) scalar that should be equalized.

If there is no Doppler, i.e. h(τ,v)=h(τ,0)δ(v), then Eq. (29) becomes

$\begin{array}{cc}\begin{array}{c}Y\left[n,m\right]=X\left[n,m\right]\int h\left(\tau ,0\right)e^{-j2\pi m\Delta f\tau }d\tau \\ =X\left[n,m\right]H\left(0,m\Delta f\right)\end{array}& \left(30\right)\end{array}$

which is the well-known multicarrier result, that each subcarrier symbol is multiplied by the frequency response of the time invariant channel evaluated at the frequency of that subcarrier.

If there is no multipath, i.e. h(τ,v)=h(0,v)δ(τ), then Eq. (29) becomes

$\begin{array}{cc}Y\left[n,m\right]=X\left[n,m\right]\int h\left(v,0\right)e^{j2\pi \mathrm{vnT}}d\tau & \left(31\right)\end{array}$

Notice that the fading each subcarrier experiences as a function of time nT has a complicated expression as a weighted superposition of exponentials. This is a major complication in the design of wireless systems with mobility like LTE; it necessitates the transmission of pilots and the continuous tracking of the channel, which becomes more difficult the higher the vehicle speed or Doppler bandwidth is.

Some examples of this general framework include the following.

Example 3: (OFDM modulation). In this case the fundamental transmit pulse is given by (13) and the fundamental receive pulse is

$\begin{array}{cc}{g}_r\left(t\right)=\{\begin{array}{cc}0& -T_{\mathrm{CP}}<t<0\\ \frac{1}{\sqrt{T-T_{\mathrm{CP}}}}& 0<t<T-T_{\mathrm{CP}}\\ 0& \mathrm{else}\end{array}& \left(32\right)\end{array}$

i.e., the receiver zeroes out the CP samples and applies a square window to the symbols comprising the OFDM symbol. It is worth noting that in this case, the bi-orthogonality property holds exactly along the time dimension. FIG. 6 shows the cross correlation between the transmit and receive pulses of (13) and (32). The cross correlation is exactly equal to one and zero in the vicinity of zero and ±T respectively, while holding those values for the duration of T_CP. Hence, as long as the support of the channel on the time dimension is less than T_CP the bi-orthogonality condition is satisfied along the time dimension. Across the frequency dimension the condition is only approximate, as the ambiguity takes the form of a sinc function as a function of frequency and the nulls are not identically zero for the whole support of the Doppler spread.

Example 4: (MCFB modulation). In the case of multicarrier filter banks g_tr(t)=g_r(t)=g(t). There are several designs for the fundamental pulse g(t). A square root raised cosine pulse provides good localization along the frequency dimension at the expense of less localization along the time dimension. If T is much larger than the support of the channel in the time dimension, then each subchannel sees a flat channel and the bi-orthogonality property holds approximately.

In summary, it will be appreciated that the one of the two transforms that define OTFS have been described. How the transmitter and receiver apply appropriate operators on the fundamental transmit and receive pulses and orthogonalize the channel according to Eq. (29) has also been disclosed. One can see by examples how the choice of the fundamental pulse affect the time and frequency localization of the transmitted modulation symbols and the quality of the channel orthogonalization that is achieved. However, Eq. (29) shows that the channel in this domain, while free of intersymbol interference, suffers from fading across both the time and the frequency dimensions via a complicated superposition of linear phase factors.

The next section starts from Eq. (29) and describes the second transform that defines OTFS. This section shows how that transform defines an information domain where the channel does not fade in either dimension.

The 2D OTFS Transform

The time-frequency response H[n,m] in (29) is related to the channel delay-Doppler response h(τ,v) by an expression that resembles a Fourier transform. However, there are two important differences: (i) the transform is two dimensional (along delay and Doppler) and (ii) the exponentials defining the transforms for the two dimensions have opposing signs. Despite these difficulties, Eq. (29) points in the direction of using complex exponentials as basis functions on which to modulate the information symbols; and only transmit on the time-frequency domain the superposition of those modulated complex exponential bases. This is the approach generally used herein.

This is similar to the SC-FDMA modulation scheme, where in the frequency domain we transmit a superposition of modulated exponentials (the output of the DFT preprocessing block). The reason to pursue this direction is to exploit Fourier transform properties and translate a multiplicative channel in one Fourier domain to a convolution channel in the other Fourier domain.

Given the difficulties of Eq. (29) mentioned above, a suitable version of Fourier transform and associated sampling theory results is useful. The following definitions can be used:

Definition 1: Symplectic Discrete Fourier Transform: Given a square summable two dimensional sequence X[m,n]∈(Λ) we define

$\begin{array}{cc}\begin{array}{c}x\left(\tau ,v\right)=\sum _{m,n}X\left[n,m\right]e^{-j2\pi \left(\mathrm{vnT}-\tau m\Delta f\right)}\\ \stackrel{△}{=}\mathrm{SDFT}\left(X\left[n,m\right]\right)\end{array}& \left(33\right)\end{array}$

The above 2D Fourier transform (sometimes known as the Symplectic Discrete Fourier Transform in the math community) differs from the more well known Cartesian Fourier transform in that the exponential functions across each of the two dimensions have opposing signs. This is necessary in this case, as it matches the behavior of the channel equation.

Further notice that the resulting x(τ,v) is periodic with periods (1/Δf,1/T). This transform defines a new two dimensional plane, which we will call the delay-Doppler plane, and which can represent a max delay of 1/Δf and a max Doppler of 1/T. A one dimensional periodic function is also called a function on a circle, while a 2D periodic function is called a function on a torus (or donut). In this case x(τ,v) is defined on a torus Z with circumferences (dimensions) (1/Δf,1/T).

The periodicity of x(τ,v) (or sampling rate of the time-frequency plane) also defines a lattice on the delay-Doppler plane, which can be called the reciprocal lattice

$\begin{array}{cc}{\Lambda }^{\perp }=\left\{\left(m\frac{1}{\mathrm{\Delta f}},n\frac{1}{T}\right),n,m\in \mathbb{Z}\right\}& \left(34\right)\end{array}$

The points on the reciprocal lattice have the property of making the exponent in (33), an integer multiple of 2π.

The inverse transform is given by:

$\begin{array}{cc}X\left[n,m\right]=\frac{1}{c}\underset{0}{\overset{\frac{1}{△f}}{\int }}\underset{0}{\overset{\frac{1}{T}}{\int }}x\left(\tau ,v\right)e^{j2\pi \left(\mathrm{vnT}-\tau m\Delta f\right)}\mathrm{dvd}\tau ={\mathrm{SDFT}}^{-1}\left(x\left(\tau ,v\right)\right)& \left(35\right)\end{array}$ $\mathrm{where}c=T\Delta f.$

Next, define a sampled version of x(τ,v). In particular, a version that can take M samples on the delay dimension (spaced at 1/MΔf) and N samples on the Doppler dimension (spaced at 1/NT). More formally we define a denser version of the reciprocal lattice

$\begin{array}{cc}{\Lambda }_0^{\perp }=\left\{\left(m\frac{1}{M\Delta f},n\frac{1}{\mathrm{NT}}\right),n,m\in \mathbb{Z}\right\}& \left(36\right)\end{array}$

So that Λ^⊥⊆Λ₀^⊥. Define discrete periodic functions on this dense lattice with period (1/Δf, 1/T), or equivalently define functions on a discrete torus with these dimensions

$\begin{array}{cc}{Z}_0^{\perp }=\left\{\left(m\frac{1}{M\Delta f},n\frac{1}{\mathrm{NT}}\right),m=0,...,M-1,n=0,...N-1,\right\}& \left(37\right)\end{array}$

These functions are related via Fourier transform relationships to discrete periodic functions on the lattice Λ, or equivalently, functions on the discrete torus

$\begin{array}{cc}{Z}_0=\left\{\left(\mathrm{nT},m\Delta f\right),m=0,...,M-1,n=0,...N-1,\right\}& \left(38\right)\end{array}$

It is useful to develop an expression for sampling Eq. (33) on the lattice of (37). First, start with the following definition.

Definition 2: Symplectic Finite Fourier Transform: If X_p[k,l] is periodic with period (N,M), then we define

$\begin{array}{cc}\begin{array}{c}{x}_p\left[m,n\right]=\sum _{k=0}^{N-1}\sum _{l=-\frac{M}{2}}^{\frac{M}{2}-1}{X}_p\left[k,l\right]e^{-j2\pi \left(\frac{\mathrm{nk}}{N}-\frac{\mathrm{ml}}{M}\right)}\\ \stackrel{△}{=}\mathrm{SFFT}\left(X\left[k,l\right]\right)\end{array}& \left(39\right)\end{array}$

Notice that x_p[m,n] is also periodic with period [M,N] or equivalently, it is defined on the discrete torus Z₀^⊥. Formally, the SFFT(X[n,m]) is a linear transformation from (Z₀)→(Z₀^⊥).

Now consider generating x_p[m,n] as a sampled version of (33), i.e.,

${x_p\left[m,n\right]=x\left[m,n\right]=x\left(\tau ,v\right)❘}_{\tau =\frac{m}{M\Delta f},v=\frac{n}{\mathrm{NT}}}.$

Then it can be shown that (39) still holds where X_p,[m,n] is a periodization of X[n,m] with period (N,M)

$\begin{array}{cc}{X}_p\left[n,m\right]=\sum _{l,k=-\infty }^{\infty }X\left[n-\mathrm{kN},m-\mathrm{lM}\right]& \left(40\right)\end{array}$

This is similar to the well-known result that sampling in one Fourier domain creates aliasing in the other domain.

The inverse discrete (symplectic) Fourier transform is given by

$\begin{array}{cc}\begin{array}{c}{X}_p\left[n,m\right]=\frac{1}{\mathrm{MN}}\sum _{l,k}x\left[l,k\right]e^{j2\pi \left(\frac{\mathrm{nk}}{N}-\frac{\mathrm{ml}}{M}\right)}\\ \stackrel{\Delta }{=}{\mathrm{SFFT}}^{-1}\left(x\left[l,k\right]\right)\end{array}& \left(41\right)\end{array}$

where l=0, . . . , M−1, k=0, . . . , N−1. If the support of X[n,m] is time-frequency limited to Z₀ (no aliasing in (40)), then X_p[n,m]=X[n,m] for n,m∈Z₀, and the inverse transform (41) recovers the original signal.

In the math community, the SDFT is called “discrete” because it represents a signal using a discrete set of exponentials, while the SFFT is called “finite” because it represents a signal using a finite set of exponentials.

Arguably the most important property of the symplectic Fourier transform is that it transforms a multiplicative channel effect in one domain to a circular convolution effect in the transformed domain. This is summarized in the following proposition:

Proposition 2: Let X₁[n,m]∈(Z₀), X₂[n,m]∈(Z₀) be periodic 2D sequences. Then

$\begin{array}{cc}\mathrm{SFFT}\left(X_1\left[n,m\right]*X_2\left[n,m\right]\right)=\mathrm{SFFT}\left(X_1\left[n,m\right]\right)·\mathrm{SFFT}\left(X_2\left[n,m\right]\right)& \left(42\right)\end{array}$

where * denotes two dimensional circular convolution.

Proof: is provided elsewhere in this document.

Discrete OTFS modulation: Consider a set of NM QAM information symbols arranged on a 2D grid x[l,k], k=0, . . . , N−1, l=0, . . . , M−1 that a transmitter wants to transmit. Without loss of generality, consider x[l,k] to be two dimensional periodic with period [N,M]. Further, assume a multicarrier modulation system defined by

• • [A] A lattice on the time frequency plane, that is a sampling of the time axis with sampling period T and the frequency axis with sampling period Δf (c.f. Eq. (8)).
  • [B] A packet burst with total duration NT secs and total bandwidth MΔf Hz.
  • [C] Transmit and receive pulses g_tr(t), g_tr(t)∈L₂() satisfying the bi-orthogonality property of (27)
  • [D] A transmit windowing square summable function W_tr[n,m]∈(Λ) multiplying the modulation symbols in the time-frequency domain
  • [E] A set of modulation symbols X[n,m], n=0, . . . , N−1, m=0, . . . , M−1 related to the information symbols x[k,l] by a set of basis functions b_k,l[n,m]

$\begin{array}{cc}X\left[n,m\right]=\frac{1}{\mathrm{MN}}{W}_{\mathrm{tr}}\left[n,m\right]\sum _{k=0}^{N-1}\sum _{l=0}^{M-1}x\left[l,k\right]b_{k,l}\left[n,m\right]b_{k,l}\left[n,m\right]=e^{j2\pi \left(\frac{\mathrm{ml}}{M}-\frac{\mathrm{nk}}{N}\right)}& \left(43\right)\end{array}$

where the basis functions b_k,l[n,m] are related to the inverse symplectic Fourier transform (c.f., Eq. (41))

Given the above components, define the discrete OTFS modulation via the following two steps

$\begin{array}{cc}X\left[n,m\right]=W_{\mathrm{tr}}\left[n,m\right]{\mathrm{SFFT}}^{-1}\left(x\left[k,l\right]\right)s\left(t\right)={\prod }_X\left(g_{\mathrm{tr}}\left(t\right)\right)& \left(44\right)\end{array}$

The first equation in (44) describes the OTFS transform, which combines an inverse symplectic transform with a widowing operation. The second equation describes the transmission of the modulation symbols X[n,m] via a Heisenberg transform of g_tr(t) parameterized by X[n,m]. More explicit formulas for the modulation steps are given by Equations (41) and (10).

While the expression of the OTFS modulation via the symplectic Fourier transform reveals important properties, it is easier to understand the modulation via Eq. (43), that is, transmitting each information symbol x[k,l] by modulating a 2D basis function b_k, [n,m] on the time-frequency plane.

FIG. 7 visualizes this interpretation by isolating each symbol in the information domain and showing its contribution to the time-frequency modulation domain. Of course the transmitted signal is the superposition of all the symbols on the right (in the information domain) or all the basis functions on the left (in the modulation domain).

FIG. 7 uses the trivial window W_tr[n,m]=1 for all n=0, . . . , N−1,

$m=-\frac{M}{2},\dots \frac{M}{2}-1$

and zero else. This may seem superfluous but there is a technical reason for this window: recall that SFFT⁻¹(x[k,l]) is a periodic sequence that extends to infinite time and bandwidth. By applying the window transmitters can limit the modulation symbols to the available finite time and bandwidth. The window in general could extend beyond the period of the information symbols [M,N] and could have a shape different from a rectangular pulse. This would be akin to adding cyclic prefix/suffix in the dimensions of both time and frequency with or without shaping. The choice of window has implications on the shape and resolution of the channel response in the information domain as we will discuss later. It also has implications on the receiver processing as the potential cyclic prefix/suffix has to either be removed or otherwise handled.

Discrete OTFS demodulation: Assume that the transmitted signal s(t) undergoes channel distortion according to (7), (2) yielding r(t) at the receiver. Further, let the receiver employ a receive windowing square summable function W_r[n,m]. Then, the demodulation operation consists of the following steps:

• • (i) Matched filtering with the receive pulse, or more formally, evaluating the ambiguity function on Λ (Wigner transform) to obtain estimates of the time-frequency modulation symbols

$\begin{array}{cc}Y\left[n,m\right]=A_{g_r,y}\left(\tau ,v\right){❘}_{\tau =\mathrm{nT},v=m\Delta f}& \left(45\right)\end{array}$

• • (ii) windowing and periodization of Y[n,m]

$\begin{array}{cc}{Y}_w\left[n,m\right]=W_r\left[n,m\right]Y\left[n,m\right]Y_p\left[n,m\right]=\sum _{k,l=-\infty }^{\infty }{Y}_w\left[n-\mathrm{kN},m-\mathrm{lM}\right]& \left(46\right)\end{array}$

• • (iii) and applying the symplectic Fourier transform on the periodic sequence Y_p[n,m]

$\begin{array}{cc}\hat{x}\left[l,k\right]=y\left[l,k\right]=\mathrm{SFFT}\left(Y_p\left[n,m\right]\right)& \left(47\right)\end{array}$

The first step of the demodulation operation can be interpreted as a matched filtering operation on the time-frequency domain as discussed earlier. The second step is there to ensure that the input to the SFFT is a periodic sequence. If a trivial window is used, this step can be skipped. The third step can also be interpreted as a projection of the time-frequency modulation symbols on the orthogonal basis functions

$\begin{array}{cc}\hat{x}\left[l,k\right]=\sum _{m=0}^{M-1}\sum _{n=0}^{N-1}\hat{X}\left(n,m\right)b_{k,l}^{*}\left(n,m\right)b_{k,l}^{*}\left(n,m\right)=e^{-j2\pi \left(\frac{\mathrm{lm}}{L}-\frac{\mathrm{kn}}{K}\right)}& \left(48\right)\end{array}$

The discrete OTFS modulation defined above points to efficient implementation via discrete-and-periodic FFT type processing. However, it may not provide insight into the time and bandwidth resolution of these operations in the context of two dimensional Fourier sampling theory. This document introduces the continuous OTFS modulation and relate the more practical discrete OTFS as a sampled version of the continuous modulation.

Continuous OTFS modulation: Consider a two dimensional periodic function x(τ,v) with period [1/Δf,1/T] that a transmitter wants to transmit; the choice of the period may seem arbitrary at this point, but it will become clear after the discussion next. Further, assume a multicarrier modulation system defined by

• • (A) A lattice on the time frequency plane, that is a sampling of the time axis with sampling period T and the frequency axis with sampling period Δf (c.f. Eq. (8)).
  • (B) Transmit and receive pulses g_tr(t), g_tr(t)∈L₂() satisfying the bi-orthogonality property of (27)
  • (C) A transmit windowing function W_tr[n,m]∈(Λ) multiplying the modulation symbols in the time-frequency domain

Given the above components, define the continuous OTFS modulation via the following two steps

$\begin{array}{cc}X\left[n,m\right]=W_{\mathrm{tr}}\left[n,m\right]{\mathrm{SDFT}}^{-1}\left(x,\left(\tau ,v\right)\right)s\left(t\right)={\prod }_X\left(g_{\mathrm{tr}}\left(t\right)\right)& \left(49\right)\end{array}$

The first equation describes the inverse discrete time-frequency symplectic Fourier transform [c.f. Eq. (35)] and the windowing function, while the second equation describes the transmission of the modulation symbols via a Heisenberg transform [c.f. Eq. (10)].

Continuous OTFS demodulation: Assume that the transmitted signal s(t) undergoes channel distortion according to (7), (2) yielding r(t) at the receiver. Further, let the receiver employ a receive windowing function W_r[n,m]∈(Λ). Then, the demodulation operation consists of two steps:

• • (i) Evaluating the ambiguity function on Λ (Wigner transform) to obtain estimates of the time-frequency modulation symbols

$\begin{array}{cc}Y\left[n,m\right]=A_{g_r,y}\left(\tau ,v\right){❘}_{\tau =\mathrm{nT},v=m\Delta f}& \left(50\right)\end{array}$

• • (ii) Windowing and applying the symplectic Fourier transform on the modulation symbols

$\begin{array}{cc}\hat{x}\left(\tau ,v\right)=\mathrm{SDFT}\left(W_r\left[n,m\right]Y\left[n,m\right]\right)& \left(51\right)\end{array}$

In (50), (51) there is no periodization of Y[n,m], since the SDFT is defined on aperiodic square summable sequences. The periodization step needed in discrete OTFS can be understood as follows. Suppose we wish to recover the transmitted information symbols by performing a continuous OTFS demodulation and then sampling on the delay-Doppler grid

$\hat{x}\left(l,k\right)=\hat{x}\left(\tau ,v\right){❘}_{\tau =\frac{m}{M\Delta f},v=\frac{n}{\mathrm{NT}}}$

Since performing a continuous symplectic Fourier transform is not practical, consider whether the same result can be obtained using SFFT. The answer is that SFFT processing will produce exactly the samples as if the input sequence is first periodized (aliased)—see also (39) (40).

The description so covers all the steps of the OTFS modulation as depicted in FIG. 3. The document has also discussed how the Wigner transform at the receiver inverts the Heisenberg transform at the transmitter [c.f. Eqs. (26), (28)], and similarly for the forward and inverse symplectic Fourier transforms. The practical question is what form the end-to-end signal relationship takes when a non-ideal channel is between the transmitter and receiver.

Channel Equation in the OTFS Domain

The main result in this section shows how the time varying channel in (2), (7), is transformed to a time invariant convolution channel in the delay Doppler domain.

Proposition 3: Consider a set of NM QAM information symbols arranged in a 2D periodic sequence x[l,k] with period [M,N]. The sequence x[k,l] undergoes the following transformations:

• • (a) It is modulated using the discrete OTFS modulation of Eq. (44).
  • (b) It is distorted by the delay-Doppler channel of Eqs. (2), (7).
  • (c) It is demodulated by the discrete OTFS demodulation of Eqs. (45), (47).

The estimated sequence {circumflex over (x)}[l,k] obtained after demodulation is given by the two dimensional periodic convolution

$\begin{array}{cc}\hat{x}\left[l,k\right]\simeq \frac{1}{\mathrm{MN}}\sum _{m=0}^{M-1}\sum _{n=0}^{N-1}x\left[m,n\right]h_w\left(\frac{l-m}{M\Delta f},\frac{k-n}{\mathrm{NT}}\right)& \left(52\right)\end{array}$

of the input QAM sequence x[m,n] and a sampled version of the windowed impulse response h_w(·),

$\begin{array}{cc}{h}_w\left(\frac{l-m}{M\Delta f},\frac{k-n}{\mathrm{NT}}\right)=h_w\left({\tau }^{\prime },v^{\prime }\right){❘}_{{\tau }^{\prime }=\frac{l-m}{M\Delta f},v^{\prime }=\frac{k-n}{\mathrm{NT}}}& \left(53\right)\end{array}$

where h_w(τ′,v′) denotes the circular convolution of the channel response with a windowing function. To be precise, in the window w(τ,v) is circularly convolved with a slightly modified version of the channel impulse response e{circumflex over ( )}(−j2πvτ)h(τ,v) (by a complex exponential) as can be seen in the equation.

$\begin{array}{cc}{h}_w\left({\tau }^{\prime },v^{\prime }\right)=\int \int e^{-j2\pi v\tau }h\left(\tau ,v\right)w\left({\tau }^{\prime }-\tau ,v^{\prime }-v\right)d\tau \mathrm{dv}& \left(54\right)\end{array}$

where the windowing function w(τ,v) is the symplectic Fourier transform of the time-frequency window W[n,m]

$\begin{array}{cc}w\left(\tau ,v\right)=\sum _{m=0}^{M-1}\sum _{n=0}^{N-1}W\left[n,m\right]e^{-j2\pi \left(\mathrm{vnT}-\tau m\Delta f\right)}& \left(55\right)\end{array}$

and where W[n,m] is the product of the transmit and receive window.

$\begin{array}{cc}W\left[n,m\right]=W_{\mathrm{tr}}\left[n,m\right]W_r\left[n,m\right]& \left(56\right)\end{array}$

Proof: provided elsewhere in the document.

In many cases, the windows in the transmitter and receiver are matched, i.e., W_tr[n,m]=W₀[n,m] and W_r[n,m]=W₀*[n,m], hence W [n,m]=|W₀[n,m]|².

The window effect is to produce a blurred version of the original channel with a resolution that depends on the span of the frequency and time samples available as will be discussed in the next section. If we consider the rectangular (or trivial) window, i.e., W[n,m]=1, n=0, . . . , N−1, m=−M/2, . . . , M/2−1 and zero else, then its SDFT w(τ,v) in (55) is the two dimensional Dirichlet kernel with bandwidth inversely proportional to N and M.

There are several other uses of the window function. The system can be designed with a window function aimed at randomizing the phases of the transmitted symbols, akin to how QAM symbol phases are randomized in WiFi and Multimedia-Over-Coax communication systems. This randomization may be more important for pilot symbols than data carrying symbols. For example, if neighboring cells use different window functions, the problem of pilot contamination is avoided.

A different use of the window is the ability to implement random access systems over OTFS using spread spectrum/CDMA type techniques as will be discussed later.

Channel Time/Frequency Coherence and OTFS Resolution

This section discloses, among other things, certain OTFS design issues, including the choice of data frame length, bandwidth, symbol length and number of subcarriers. We study the tradeoffs among these parameters and gain more insight on the capabilities of OTFS technology.

Since OTFS is based on Fourier representation theory similar spectral analysis concepts apply like frequency resolution vs Fourier transform length, sidelobes vs windowing shape etc. One difference that can be a source of confusion comes from the naming of the two Fourier transform domains in the current framework.

OTFS transforms the time-frequency domain to the delay-Doppler domain creating the Fourier pairs: (i) time⇔Doppler and (ii) frequency⇔delay. The “spectral” resolution of interest here therefore is either on the Doppler or on the delay dimensions.

These issues can be easier clarified with an example. Consider a time-invariant multipath channel (zero Doppler) with frequency response H(f,0) for all t. In the first plot of FIG. 8 we show the real part of H(f,0) as well as a sampled version of it on a grid of M=8 subcarriers. The second plot of FIG. 8 shows the SDFT of the sampled H(mΔf,0), i.e., h(τ,0) along the delay dimension. Taking this frequency response to the “delay” domain reveals the structure of this multipath channel, that is, the existence of two reflectors with equal power in this example. Further, the delay dimension of the SDFT is periodic with period 1/Δf as expected due to the nature of the discrete Fourier transform. Finally, in the third plot of FIG. 8 we shows the SFFT of the frequency response, which as expected is a sampled version of the SDFT of the second plot. The SFFT has M=8 points in each period 1/Δf leading to a resolution in the delay domain of 1/MΔf=1/BW.

In the current example, the reflectors are separated by more than 1/MΔf and are resolvable. If they were not, then the system would experience a flat channel within the bandwidth of observation, and in the delay domain the two reflectors would have been blurred into one.

FIG. 9 shows similar results for a flat Doppler channel with time varying frequency response H(0, t) for all f. The first plot shows the response as a function of time, while the second plot shown the SDFT along the Doppler dimension. Finally, the third plot shows the SFFT, that is the sampled version of the transform. Notice that the SDFT is periodic with period 1/T while the SFFT is periodic with period 1/T and has resolution of 1/NT.

The conclusion one can draw from FIG. 9 is that as long as there is sufficient variability of the channel within the observation time NT, that is, as long as reflectors have Doppler frequency difference larger than 1/NT, the OTFS system will resolve these reflectors and will produce an equivalent channel in the delay-Doppler domain that is not fading. In other words, OTFS can take a channel that inherently has a coherence time of only T and produce an equivalent channel in the delay Doppler domain that has coherence time NT. This is an important property of OTFS as it can increase the coherence time of the channel by orders of magnitude and enable MIMO processing and beamforming under Doppler channel conditions.

The two one-dimensional channel examples previously discussed are special cases of the more general two-dimensional channel of FIG. 10. The time-frequency response and its sampled version are shown in FIG. 10, where the sampling period is (T, Δf).

FIG. 11 shows the SDFT of this sampled response which is periodic with period (1/T, 1/Δf), across the Doppler and delay dimensions respectively.

The Nyquist sampling requirements for this channel response may be quantified as follows. 1/T is generally on the order of Δf (for an OFDM system with zero length CP it is exactly 1/T=Δf) so the period of the channel response in FIG. 11 is approximately (f,T), and aliasing can be avoided as long as the support of the channel response is less than ±Δf/2 in the Doppler dimension and ±T/2 in the delay dimension.

FIG. 12 shows the SFFT, that is, the sampled version of FIG. 11. The resolution of FIG. 11 is 1/NT, 1/MΔf across the Doppler and delay dimensions respectively.

FIG. 13 summarizes the sampling aspects of the OTFS modulation. The OTFS modulation consists of two steps shown in this figure:

A Heisenberg transform translates a time-varying convolution channel in the waveform domain to an orthogonal but still time varying channel in the time frequency domain. For a total bandwidth BW and M subcarriers the frequency resolution is Δf=BW/M. For a total frame duration T_f and N symbols the time resolution is T=T_f/N.

A SFFT transform translates the time-varying channel in the time-frequency domain to a time invariant one in the delay-Doppler domain. The Doppler resolution is 1/T_f and the delay resolution is 1/BW.

The choice of window can provide a tradeoff between main lobe width (resolution) and side lobe suppression, as in classical spectral analysis.

Channel Estimation in the OTFS Domain

There is a variety of different ways a channel estimation scheme could be designed for an OTFS system, and a variety of different implementation options and details. This section presents, among other things, a high level summary and highlight some of the concepts.

A straightforward way to perform channel estimation entails transmitting a sounding OTFS frame containing a discrete delta function in the OTFS domain or equivalently a set of unmodulated carriers in the time frequency domain. From a practical standpoint, the carriers may be modulated with known, say BPSK, symbols which are removed at the receiver as is common in many OFDM systems. This approach could be considered an extension of the channel estimation symbols used in WiFi and Multimedia-Over-Coax modems.

FIG. 14 shows an example of an OTFS symbol containing such an impulse. This approach may however be wasteful as the extend of the channel response is only a fraction of the full extend of the OTFS frame (1/T, 1/Δf). For example, in LTE systems 1/T≈15 KHz while the maximum Doppler shift f_d,max is typically one to two orders of magnitude smaller. Similarly 1/Δf≈67 usec, while maximum delay spread τ_max is again one to two orders of magnitude less. Implementations thus can have a much smaller region of the OTFS frame devoted to channel estimation while the rest of the frame carries useful data. More specifically, for a channel with support (±f_d,max, ±τ_max) an OTFS subframe of length (2f_d,max/T, 2τ_max/Δf) may have to be used.

In the case of multiuser transmission, each UE can have its own channel estimation subframe positioned in different parts of the OTFS frame. This is akin to multiplexing of multiple users when transmitting Uplink Sounding Reference Signals in LTE. The difference is that OTFS benefits from the virtuous effects of its two dimensional nature. For example, if τ_max is 5% of the extend of the delay dimension and f_d,max is 5% of the Doppler dimension, the channel estimation subframe need only be 5%×5%=0.25% of the OTFS frame.

Notice that although the channel estimation symbols are limited to a small part of the OTFS frame, they actually sound the whole time-frequency domain via the corresponding basis functions associated with these symbols.

A different approach to channel estimation is to devote pilot symbols on a subgrid in the time-frequency domain. This is akin to CRS pilots in downlink LTE subframes. One question in this approach is the determination of the density of pilots that is sufficient for channel estimation without introducing aliasing. Assume that the pilots occupy the subgrid (n₀T, m₀Δf) for some integers no, m. Recall that for this grid the SDFT will be periodic with period (1/n₀T, 1/m₀Δf). Then, applying the aliasing results discussed earlier to this grid, we obtain an alias free Nyquist channel support region of (±f_d,max, ±τ_max)=(±½n₀T, ±½m₀Δf). The density of the pilots can then be determined from this relation given the maximum support of the channel. The pilot subgrid should extend to the whole time-frequency frame, so that the resolution of the channel is not compromised.

OTFS-Access: Multiplexing More than One User

There are many different ways to multiplex several uplink or downlink transmissions in one OTFS frame. Some of the multiplexing methods include:

• • (A) Multiplexing in the OTFS delay-Doppler domain
  • (B) Multiplexing in the time-frequency domain
  • (C) Multiplexing in the code spreading domain
  • (D) Multiplexing in the spatial domain

Multiplexing in the delay-Doppler domain: This may be the most natural multiplexing scheme for downlink transmissions. Different sets of OTFS basis functions, or sets of information symbols or resource blocks are given to different users. Given the orthogonality of the basis functions, the users can be separated at the UE receiver. The UE need only demodulate the portion of the OTFS frame that is assigned to it.

This approach could be made similar to the allocation of PRBs to different UEs in LTE. One difference is that, in OTFS, even a small subframe or resource block in the OTFS domain will be transmitted over the whole time-frequency frame via the basis functions and will experience the average channel response.

FIG. 15 illustrates this point by showing two different basis functions belonging to different users. Because of this, there is no compromise on channel resolution for each user, regardless of the resource block or subframe size.

In the uplink direction, transmissions from different users experience different channel responses. Hence, the different subframes in the OTFS domain will experience a different convolution channel. This can potentially introduce inter-user interference at the edges where two user subframes are adjacent, and would require guard gaps to eliminate it. In order to avoid this overhead, a different multiplexing scheme can be used in the uplink as explained next.

Multiplexing in the time-frequency domain: In this approach, resource blocks or subframes are allocated to different users in the time-frequency domain.

FIG. 16 illustrates this for a three user case. In this figure, User 1 (blue) occupies the whole frame length but only half the available subcarriers. Users 2 and 3 (red and black respectively) occupy the other half subcarriers, and divide the total length of the frame between them.

In this case, each user employs a slightly different version of the OTFS modulation described above. One difference is that each user i performs an SFFT on a subframe (N_i, M_i), N_i≤N, M_i≤M. This reduces the resolution of the channel, or in other words reduces the extent of the time-frequency plane in which each user will experience its channel variation. On the other side, this also gives the scheduler the opportunity to schedule users in parts of the time-frequency plane where their channel is best.

To be able to extract the maximum diversity of the channel and allocate users across the whole time-frequency frame, implementations can multiplex users via interleaving. In this case, one user occupies a subsampled grid of the time-frequency frame, while another user occupies another subsampled grid adjacent to it.

FIG. 17 shows three users as before but interleaved on the subcarrier dimension. Of course, interleaving is possible in the time dimension as well, and/or in both dimensions. The degree of interleaving, or subsampling the grid per user is only limited by the spread of the channel that we need to handle.

Multiplexing in the time-frequency spreading code domain: In embodiments that provide a random access PHY and MAC layer where users can access the network without having to undergo elaborate RACH (random access channel) and other synchronization procedures, e.g., to support Internet of Things (IoT) deployments, OTFS can support such a system by employing a spread-spectrum approach. Each user is assigned a different two-dimensional window function that is designed as a randomizer. The windows of different users are designed to be nearly orthogonal to each other and nearly orthogonal to time and frequency shifts. Each user then only transmits on one or a few basis functions and uses the window as a means to randomize interference and provide processing gain. This can result in a much simplified system that may be attractive for low cost, short burst type of IoT applications.

Multiplexing in the spatial domain: Similar to some other OFDM multicarrier systems, a multi-antenna OTFS system can support multiple users transmitting on the same basis functions across the whole time-frequency frame. The users are separated by appropriate transmitter and receiver beamforming operations.

Additional examples of multi-user multiplexing are described with respect to FIG. 21 to FIG. 27.

In some embodiments, the multiplexed signals include reference signals and information signals targeted at UEs. The information signals may include user data and/or other higher layer system information. Reference signals may include UE-specific reference signals, reference signals intended by a logical group of UEs or reference signals to be used by all UEs being served by the transmitter.

As previously described, in some embodiments, both the reference signals and the information signals, or signals carrying user data, are multiplexed in the delay-Doppler domain and then transformed to the time-frequency domain prior to transmission. In other words, in some embodiments, both reference signals for the system and information signals are carried in the transformed domain. As previously described with respect to FIG. 14, reference signals may be introduced using minimal resources in the delay-Doppler domain, yet after OTFS transformation, may occupy the entire time-frequency range. Thus, high quality channel optimization is possible while using minimal transmission resources.

In various embodiments, reference signals may be added to the transmitted signals in the delay-Doppler domain and/or the time-frequency domain, providing a system with a greater control of the level of optimization and transmission resource usage. In conventional wireless systems, reference signals are often separated from user data signals by leaving unused resources for practical implementations. Using OTFS based transmission/reception techniques, due to the orthogonality of basis functions and the application of a transform prior to transmitting reference function, such communication resources may not have to be left unused—a receiver will be able to recover reference signals that are relatively densely packed, e.g., without any unused of black space resources.

Implementation Issues

OTFS is a novel modulation technique with numerous benefits and a strong mathematical foundation. From an implementation standpoint, one added benefit is the compatibility with OFDM and the need for only incremental change in the transmitter and receiver architecture.

A typical OTFS implementation includes two steps. The Heisenberg transform (which takes the time-frequency domain to the waveform domain) is typically already implemented in today's systems in the form of OFDM/OFDMA. This implementation corresponds to a prototype filter g(t) which is a square pulse. Other filtered OFDM and filter bank variations have been proposed for 5G, which can also be accommodated in this general framework with different choices of g(t).

The second step of OTFS is the two dimensional Fourier transform (SFFT). This can be thought of as a pre- and post-processing step at the transmitter and receiver respectively as illustrated in FIG. 18. In that sense it is similar, from an implementation standpoint, to the SC-FDMA pre-processing step. As depicted in FIG. 18, processing from left to right, at the transmitter, QAM (or QPSK) symbols are input to an OTFS preprocessing block which may then process the symbols as described in this patent document. The output of the pre-processing block may represent time-frequency samples, and then be input to a conventional OFDM or filter bank based multicarrier transmission system. The resulting signal is transmitted over a communication channel.

At the receiver-side, a conventional OFDM or filter bank demodulator may be used to recover time-frequency domain samples. The time-frequency domain samples may be input to the OTFS demodulation stage, shown as the OTFS post-processing and equalization stage in FIG. 18. In this stage, information bits and/or reference signals may be recovered using the various techniques described in the present document.

From a complexity comparison standpoint, for a frame of N OFDM symbols of M subcarriers, SC-FDMA adds N DFTs of M point each (assuming worse case M subcarriers given to a single user). The additional complexity of SC-FDMA is then NM log₂(M) over the baseline OFDM architecture. For OTFS, the 2D SFFT has complexity NM log₂(NM)=NM log₂(M)+NM log₂(N), so the term NM log₂(N) is the OTFS additional complexity compared to SC-FDMA. For an LTE subframe with M=1200 subcarriers and N=14 symbols, the additional complexity is 37% more compared to the additional complexity of SC-FDMA.

In one advantageous aspect, from an architectural and implementation standpoint, OTFS augments the PHY capabilities of an existing LTE modem architecture and does not introduce co-existence and compatibility issues.

Examples of Benefits of OTFS Modulation

The OTFS modulation has numerous benefits that tie into the challenges that 5G systems are trying to overcome. Arguably, the biggest benefit and the main reason to study this modulation is its ability to communicate over a channel that randomly fades within the time-frequency frame and still provide a stationary, deterministic and non-fading channel interaction between the transmitter and the receiver. In the OTFS domain, all information symbols experience the same channel and same SNR.

Further, OTFS best utilizes the fades and power fluctuations in the received signal to maximize capacity. To illustrate this point assume that the channel consists of two reflectors which introduce peaks and valleys in the channel response either across time or across frequency or both. An OFDM system can theoretically address this problem by allocating power resources according to the waterfilling principle. However, due to practical difficulties such approaches are not pursued in wireless OFDM systems, leading to wasteful parts of the time-frequency frame having excess received energy, followed by other parts with too low received energy. An OTFS system would resolve the two reflectors and the receiver equalizer would employ coherent combining of the energy of the two reflectors, providing a non-fading channel with the same SNR for each symbol. It therefore provides a channel interaction that is designed to maximize capacity under the transmit assumption of equal power allocation across symbols (which is common in existing wireless systems), using only standard AWGN codes.

In addition, OTFS provides a domain in which the channel can be characterized in a very compact form. This has significant implications for addressing the channel estimation bottlenecks that plague current multi-antenna systems and can be a key enabling technology for addressing similar problems in future massive MIMO systems.

One benefit of OTFS is its ability to easily handle extreme Doppler channels. We have verified in the field 2×2 and 4×4, two and four stream MIMO transmission respectively in 90 Km/h moving vehicle setups. This is not only useful in vehicle-to-vehicle, high speed train and other 5G applications that are Doppler intensive, but can also be an enabling technology for mm wave systems where Doppler effects will be significantly amplified.

Further, OTFS provides a natural way to apply spreading codes and deliver processing gain, and spread-spectrum based CDMA random access to multicarrier systems. It eliminates the time and frequency fades common to multicarrier systems and simplifies the receiver maximal ratio combining subsystem. The processing gain can address the challenge of deep building penetration needed for IoT and PSTN replacement applications, while the CDMA multiple access scheme can address the battery life challenges and short burst efficiency needed for IoT deployments.

Last but not least, the compact channel estimation process that OTFS provides can be essential to the successful deployment of advanced technologies like Cooperative Multipoint (Co-MP) and distributed interference mitigation or network MIMO.

It will be appreciated that the present document discloses OTFS, a novel modulation scheme for wireless communications, with significant advantages in performance, especially under significant Doppler effects in mobility scenarios or mmWave communications. It will be appreciated that the present document discloses various attributes, compatibility and design aspects and demonstrated the superiority of OTFS in a variety of use cases.

FIG. 19 is a graphical representation of an OTFS delay-Doppler transform. Graph 1902 depicts a two-dimensional plane with two orthogonal axes—a delay axis and a Doppler axis, along which transmission resources are available as a grid of resources. When transformed through a 2D OTFS transform, as depicted by the stage 1904, the resulting signal may be represented in a second two-dimensional transmission resource plane using another two orthogonal axes, a time axis and a frequency axis. In the second two-dimensional resource plane, the signal may be identifiable similar to conventional LTE or other systems which allocate transmission resources along time (slots) and frequency (subcarrier). In addition, a coding or shaping window 1908 may also be used to multiplex (at a transmitter) and de-multiplex (at a receiver) signals.

FIG. 19 is a graphical representation of an OTFS delay-Doppler transform that shows a single grid point transmission resource (T₀, v₀) spreading across the entire time-frequency plane after the 2D OTFS transform stage.

In FIGS. 21 to 27, several examples of multi-user multiplexing of signals are described.

FIG. 21 shows an example of a multi-user delay-Doppler transform multiplexing. UE1 and UE2 each use a sparser lattice than the original lattice. Each UE uses every other point τ in the delay domain. The window for UE2 is shifted in frequency. It can be seen that both UEs have only half the resolution in the delay dimension. However, both UEs have full resolution in the Doppler dimension and cover the entire span of delay and Doppler domains.

FIG. 22 shows an example of a multi-user delay-Doppler transform multiplexing. This example shows multiplexing of three UEs: UE1, UE2 and UE3. Each UE uses a sparser lattice that the original lattice. UE1 uses every other point τ in the delay domain. UE2 and UE3 use every other point both in the delay domain and the Doppler domain (v). UE2's window is shifted in the frequency domain and UE3's window is shifted both in the time and frequency domains. As can be see, UE1 occupies half the dimension in the delay domain and full resolution in the Doppler domain. UE2 and UE3 have half the resolution in both delay and Doppler domains and all three UEs cover the entire span of delay and Doppler domains.

FIG. 23 shows an example of a multi-user delay-Doppler transform multiplexing. In this example, assignments to three UEs are shown. Each UE uses a sparser lattice than the original lattice. UE1 uses every other point in the delay domain. UE2 and UE3 both use every other point in both delay and Doppler domains. UE1 uses a split window. UE2 and UE3 windows ae shifted in frequency and UE3 window is also shifted in time. None of the lines above M/2 are copies of lines 0 to (M/4−1). In comparison with the assignments discussed in FIG. 21, each user will experience a different channel because the UEs are all using different frequencies.

FIG. 24 shows an example of a multi-user delay-Doppler transform multiplexing. In this example, UE1 uses the left half of the original lattice and transmits zero power in the right half of the lattice. Conversely, UE2 uses the right half for transmission and sends zero power in the left half (occupied by UE1's transmissions). The window of UE1 and UE2 is contiguous on the full lattice. In this example, both UEs have full resolution in both delay and Doppler dimension, both UEs cover the full Doppler span and each covers only half of the delay span. In the UL direction, a receiver may experience different channel conditions due to different UEs.

FIG. 25 shows an example of a multi-user delay-Doppler transform multiplexing. In this example, UE1 uses the left half and sends zero power in the right half of the original lattice. UE2 uses the right bottom quarter and sends zero power in the remaining three-quarters of the original lattice. UE3 uses the right top quarter and sends zero power in the remaining three-quarters of the original lattice. The window of all three UEs is the same and is contiguous. Furthermore, all three UEs have full resolution in both delay and Doppler domains. UE1 covers the full Doppler span and half the delay span UE2 and UE3 cover half the delay span and half the Doppler span. In the uplink, a receiver will experience different UL channels from different UEs.

FIG. 26 and FIG. 27 shows an example of a multi-user delay-Doppler transform multiplexing in which UE1 and UE2 occupy overlapping resources in the Delay Doppler domain, but non-overlapping resources in the time-frequency domain. Furthermore, each UE is assigned a separate frequency range but occupies the entire time domain of the transmitted symbol. In the delay-Doppler domain, the UEs occupy the same T resources, but different v resources.

FIG. 28 shows a variation of the compatibility of OTFS scheme with conventional transmission schemes such as previously described with respect to FIG. 18. Processing from left to right, at the transmitter, QAM (or QPSK) symbols are input to an OTFS preprocessing block which may then process the symbols as described in this patent document. The output of the pre-processing block may represent time-frequency samples, and then be input to a conventional OFDM or a universal filtered multicarrier (UFMC) transmission system. The resulting signal is transmitted over a communication channel.

At the receiver-side, a conventional OFDM or UFMC demodulator may be used to recover time-frequency domain samples. The time-frequency domain samples may be input to the OTFS demodulation stage, shown as the OTFS post-processing and equalization stage in FIG. 28. In this stage, information bits and/or reference signals may be recovered using the various techniques described in the present document.

FIG. 29 shows a flowchart for an example signal transmission method 2900. The method 2900 may be implemented at the transmitter-side. For example, in some embodiments, the method 2900 may be implemented at a base station in a cellular network such as a 5G network.

The method 2900 includes, at 2902, performing a logical mapping of transmission resources of the digital communication channel along a first two-dimensional resource plane represented by a first and a second orthogonal axes corresponding to a first transmission dimension and a second transmission dimension respectively. For example, the first two-dimensional resource plan may be a delay-Doppler plane and the first and the second orthogonal axes may correspond to the delay dimension and the Doppler dimension.

The method 2900 includes, at 2904, allocating, to a first signal, a first group of transmission resources from the logical mapping for transmission.

The method 2900 includes, at 2906, transforming, using a first two-dimensional transform, a combination of the first signal having the first group of transmission resources and the second signal having the second group of transmission resources to a corresponding transformed signal in a second two-dimensional resource plane represented by a third and a fourth orthogonal axes corresponding to a third transmission dimension and a fourth transmission dimension respectively. For example, the second two-dimensional resource plan may include a time-frequency plane and the third orthogonal axis may correspond to the time dimension and the fourth axis may correspond to the frequency dimension. In such as case, transmission resources may correspond to time slots and subcarriers.

The method 2900 includes, at 2908, converting the transformed signal to a formatted signal according to a transmission format of the communications channel.

The method 2900 includes, at 2910, transmitting the formatted signal over the communications channel. The formatted signal may be formatted according to a well-known format such as the LTE format or may comprise a 5G or another transmission protocol.

The method 2900 may operate such that transmission resources used by the first signal and the second signal are non-overlapping in at least one of the first two-dimensional resource plane and the second two-dimensional resource plane. FIG. 16, FIG. 17, FIGS. 21-27 and associated description in this patent document describe some example embodiments of assignment of transmission resources to multiple signals.

As described with reference to FIG. 3, FIG. 4 and elsewhere, in some embodiments, the first two-dimensional resource plane comprises a delay-Doppler plane and the second two-dimensional resource plane comprises a time-frequency plane. This patent document also describes various multiplexing techniques in which the first signal and the second signal may each correspond to information signals intended for different receiving UEs, or may be pilot signals or reference signals, or a combination thereof.

In some embodiments, the transformed signal output from the first transform operation may be formatted by applying a multicarrier modulation scheme to the transformed signal. This patent document describes several embodiments, including using OFDM modulation, FBMC modulation, UFMC modulation, and so on. Furthermore, in some embodiments, the resulting signal may be produced to be compatible with a well-known or a legacy standard such as the LTE transmission format. In this way, in one advantageous aspect, the method 2900 may produce a signal that appears to be pre-processed and compatible with legacy systems for transmission.

In some embodiments, the resources allocated to the first and the second signal in the first two-dimensional resource plane may each use a set of basis function that are orthogonal to each other. Each set may include one or more basis functions. FIG. 7 and FIG. 15 shows examples of orthogonal basis functions in the delay-Doppler domain that may be used in the sets.

In various embodiments, to facilitate separation of the multiplexed versions of the first signal and the second signal, the non-overlapping resource utilization by the first signal and the second signal may be a property that is enforced both in the first two dimensional resource plane and the second two-dimensional resource plane. Alternatively, the non-overlapping nature of resource allocation may be only in the time-frequency plane or in the delay-Doppler plane. It will be appreciated by one of skill in the art that, as long as the resources used are non-overlapping, and preferably orthogonal, receivers can use this knowledge to recover the first signal and the second signal individually.

In some embodiments, a first resource window and a second resource window may be assigned to the first and second signals. Some examples are described in the figures in the present document. These windows may be assigned such that the windows may have the same shape (e.g., rectangular) and may be obtained from each other along time and/or frequency axis shifts.

In some embodiments, different antenna resources may be assigned to the first and the second signals, thereby achieving spatial diversity of transmission resources.

It will be understood by one of skill in the art that additional signals could be multiplexed along with the first signal and the second signal to provide multiple access to greater than two logical signals by multiplexing in a manner in which non-overlapping resources are allocated at least in the delay-Doppler domain or in the time-frequency domain or both. In some embodiments, the resource utilization in one of the two-dimensional resource plane may be partially or completely overlapping. FIG. 21 shows an example in which two UEs are allocated overlapping resources in the delay-Doppler domain but are non-overlapping in the time-frequency domain.

In some embodiments, signal separation at the receiver-side is facilitated by converting the transform signal to the formatted signal by code division multiplexing the transformed signal using a two-dimensional code to generate a code-division multiplexed signal, and performing a multicarrier modulation operation on the code-division multiplexed signal. In some embodiments, randomization of phases may be performed prior to the multicarrier modulation to achieve interference minimization and avoidance from neighboring cells. For example, the randomization may be a function of identify of the cell.

FIG. 30 is a flowchart depiction of a method 3000 of single reception. The method 3000 may be implemented by a receiver apparatus such as a base station or UE.

The method 3000 includes receiving (3002) a signal transmission comprising at least two component signals multiplexed together.

The method 3000 includes transforming (3004), using an orthogonal transform, the signal transmission into a post-processing format, wherein the post-processing format represents the at least two component signals in a two-dimensional time-frequency plane.

The method 3000 includes recovering (3006), by performing an orthogonal time frequency space transformation, a multiplexed signal in a two-dimensional delay-Doppler plane, from the post-processing format.

The method 3000 includes demultiplexing (3008) the multiplexed signal to recover one of the at least two component signals.

In various embodiments, the method 3000 may operate such that a receiver may be able to successfully receive and recover the first signal and the second signal transmitted according to the method 2900.

In some embodiments, a signal transmission method may include performing a logical mapping of transmission resources of the digital communication channel along a first two-dimensional resource plane represented by a first and a second orthogonal axes corresponding to a first transmission dimension and a second transmission dimension respectively, allocating, to a first signal, a first group of transmission resources from the logical mapping for transmission, transforming, using a first two-dimensional transform, the first signal having the first group of transmission resources to a corresponding transformed signal in a second two-dimensional resource plane represented by a third and a fourth orthogonal axes corresponding to a third transmission dimension and a fourth transmission dimension respectively, converting the transformed signal to a formatted signal according to a transmission format of the communications channel, and transmitting the formatted signal over the communications channel.

In some embodiments, a receiver apparatus may receive the single signal transmitted according to the above-described method and successfully receive the signal by processing through two transforms—a first transform that enables processing in the time-frequency resource plane, followed by a second transform that enables processing and symbol recovery in the delay-Doppler plane.

Proof of Proposition 1: Let

$\begin{array}{cc}{g}_1\left(t\right)=\int \int h_1\left(\tau ,v\right)e^{j2\pi v\left(t-\tau \right)}g\left(t-\tau \right)\mathrm{dvd}\tau & \left(57\right)\\ g_2\left(t\right)=\int \int h_2\left(\tau ,v\right)e^{j2\pi v\left(t-\tau \right)}{g}_1\left(t-\tau \right)\mathrm{dvd}\tau & \left(58\right)\end{array}$

Substituting (58) into (57) we obtain after some manipulation

$\begin{array}{cc}{g}_2\left(t\right)=\int \int f\left(\tau ,v\right)e^{j2\pi v\left(t-\tau \right)}g\left(t-\tau \right)\mathrm{dvd}\tau & \left(59\right)\end{array}$

with f(τ,v) given by (16).

Proof of Theorem 1: The theorem can be proven by straightforward but tedious substitution of the left hand side of (23); by definition

$\begin{array}{cc}\begin{array}{c}{A}_{g_r,{\prod }_f\left(g_{\mathrm{tr}}\right)}\left(\tau ,v\right)=<g_r\left(t-\tau \right)e^{j2\pi \mathrm{vt}},{\prod }_f\left(g_{\mathrm{tr}}\right)>\\ =\int g_r^{*}\left(t-\tau \right)e^{-j2\pi \mathrm{vt}}{\prod }_f\left(g_{\mathrm{tr}}\left(t\right)\right)\mathrm{dt}\\ =\int g_r^{*}\left(t-\tau \right)e^{-j2\pi \mathrm{vt}}\int \int f\left({\tau }^{\prime },v^{\prime }\right)e^{j2\pi v^{\prime }\left(t-{\tau }^{\prime }\right)}{g}_{\mathrm{tr}}\left(t-{\tau }^{\prime }\right){\mathrm{dv}}^{\prime }d{\tau }^{\prime }\mathrm{dt}\end{array}& \left(60\right)\end{array}$

By changing the order of integration and the variable of integration (t−τ′)→t we obtain

$\begin{array}{cc}\begin{array}{c}{A}_{g_r,{\prod }_f\left(g_{\mathrm{tr}}\right)}\left(\tau ,v\right)=\int \int f\left({\tau }^{\prime },v^{\prime }\right)e^{j2\pi v^{\prime }\left(t-{\tau }^{\prime }\right)}\int g_r^{*}\left(t-\tau \right)g_{\mathrm{tr}}\left(t-{\tau }^{\prime }\right)e^{-j2\pi \mathrm{vt}}\mathrm{dt}{\mathrm{dv}}^{\prime }d{\tau }^{\prime }\\ =\int \int f\left({\tau }^{\prime },v^{\prime }\right)e^{j2\pi v^{\prime }\left(\tau -{\tau }^{\prime }\right)}{A}_{g_r,g_{\mathrm{tr}}}\left(\tau -{\tau }^{\prime },v-v^{\prime }\right)e^{j2\pi v^{\prime }\left(\tau -{\tau }^{\prime }\right)}{\mathrm{dv}}^{\prime }d{\tau }^{\prime }\end{array}& \left(61\right)\end{array}$

where

$\begin{array}{cc}{A}_{g_r,g_{\mathrm{tr}}}\left(\tau -{\tau }^{\prime },v-v^{\prime }\right)=\int g_r^{*}\left(t-\left(\tau -{\tau }^{\prime }\right)\right)g_{\mathrm{tr}}\left(t\right)e^{-j2\pi \left(v-v^{\prime }\right)t-\left(\tau -{\tau }^{\prime }\right)}\mathrm{dt}& \left(62\right)\end{array}$

Notice that the right second line of (61) is exactly the right hand side of (23), which is what we wanted to prove. □

Proof of Theorem 2: Substituting into (23) and evaluating on the lattice Λ we obtain: (63)

$\begin{array}{cc}\underset{\_}{M}{\underset{\_}{}}_1\times \int \int h\left(\tau -\mathrm{nT},v-m\Delta f\right)A_{g_r,g_{\mathrm{tr}}}\left(\mathrm{nT}-\tau ,m\Delta f-v\right)e^{j1\pi v\left(\mathrm{nT}-\tau \right)t}+V\left[m,n\right]& \left(63\right)\end{array}$

Using the bi-orthogonality condition in (63) only one term survives in the right hand side and we obtain the desired result of (29).

Proof of Proposition 2: Based on the definition of SFFT, it is not hard to verify that a delay translates into a linear phase

$\begin{array}{cc}\mathrm{SFFT}\left(X_2\left[n-k,m-l\right]\right)=\mathrm{SFFT}\left(X_2\left[n,m\right]\right)e^{-j2\pi \left(\frac{\mathrm{nk}}{N}-\frac{\mathrm{ml}}{M}\right)}& \left(64\right)\end{array}$

Based on this result we can evaluate the SFFT of a circular convolution

$\begin{array}{cc}\begin{array}{c}\mathrm{SFFT}\left(\sum _{k=0}^{N-1}\sum _{l=-\frac{M}{2}}^{\frac{M}{2}-1}{X}_1\left[k,l\right]X_2\left[\left(n-k\right)\mathrm{mod}N,\left(-l\right)\mathrm{mod}M\right]\right)=\sum _{k=0}^{N-1}\sum _{l=-\frac{M}{2}}^{\frac{M}{2}-1}{X}_1\left[k,l\right]\mathrm{SFFT}\left(X_2\left[n,m\right]\right)e^{-j2\pi \left(\frac{\mathrm{nk}}{N}-\frac{\mathrm{ml}}{M}\right)}\\ =\mathrm{SFFT}\left(X_1\left[n,m\right]\right)\mathrm{SFFT}\left(X_2\left[n,m\right]\right)\end{array}& \left(65\right)\end{array}$

yielding the desired result.

Proof of Proposition 3: We have already proven that on the time-frequency domain we have a multiplicative frequency selective channel given by (29). This result, combined with the interchange of convolution and multiplication property of the symplectic Fourier transform [c.f. Proposition 1 and Eq. (42)] leads to the desired result.

In particular, if we substitute Y(n,m) in the demodulation equation (48) from the time-frequency channel equation (29) and X[n,m] in (29) from the modulation equation (43) we get a (complicated) end-to-end expression

$\begin{array}{cc}\hat{x}\left[k,l\right]=\frac{1}{\mathrm{MN}}\sum _{k^{\prime }=0}^{N-1}\sum _{l^{\prime }=0}^{M-1}x\left[k^{\prime },l^{\prime }\right]\int \int h\left(\tau ,v\right)e^{-j2\pi v\tau }\times \times \left[\sum _{m=0}^{L-1}\sum _{n=0}^{K-1}W\left(n,m\right)e^{-j2\pi \mathrm{nT}\left(\frac{k-k^{\prime }}{\mathrm{NT}}-v\right)}{e}^{j2\pi m\Delta f\left(\frac{l-l^{\prime }}{M\Delta f}-\tau \right)}\right]\mathrm{dvd}\tau & \left(66\right)\end{array}$

Recognizing the factor in brackets as the discrete symplectic Fourier transform of W(n,m) we have

$\begin{array}{cc}\hat{x}\left[k,l\right]=\frac{1}{\mathrm{MN}}\sum _{k^{\prime }=0}^{N-1}\sum _{l^{\prime }=0}^{M-1}x\left[k^{\prime },l^{\prime }\right]\int \int h\left(\tau ,v\right)e^{-j2\pi v\tau }w\left(\frac{l-l^{\prime }}{M\Delta f}-\tau ,\frac{k-k^{\prime }}{\mathrm{NT}}-v\right)\mathrm{dvd}\tau & \left(67\right)\end{array}$

Further recognizing the double integral as a convolution of the channel impulse response (multiplied by an exponential) with the transformed window we obtain

$\begin{array}{cc}\hat{x}\left[k,l\right]=\frac{1}{\mathrm{MN}}\sum _{k^{\prime }=0}^{N-1}\sum _{l^{\prime }=0}^{M-1}x\left[k^{\prime },l^{\prime }\right]h_w\left(\frac{l-l^{\prime }}{M\Delta f}-\tau ,\frac{k-k^{\prime }}{\mathrm{NT}}-v\right)& \left(68\right)\end{array}$

which is the desired result.

It will be appreciated that various techniques are disclosed for transmitting and receiving data using OTFS modulation techniques.

FIG. 31 shows an example of a wireless transceiver apparatus 3100. The apparatus 3100 may be used to implement method 2900 or 3000. The apparatus 3100 includes a processor 3102, a memory 3104 that stores processor-executable instructions and data during computations performed by the processor. The apparatus 3100 includes reception and/or transmission circuitry 3106, e.g., including radio frequency operations for receiving or transmitting signals.

The disclosed and other embodiments and the functional operations described in this document can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this document and their structural equivalents, or in combinations of one or more of them. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.

A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described in this document can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).

Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Computer readable media suitable for storing computer program instructions and data include all forms of non volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

While this document contains many specifics, these should not be construed as limitations on the scope of an invention that is claimed or of what may be claimed, but rather as descriptions of features specific to particular embodiments. Certain features that are described in this document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable sub-combination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a sub-combination or a variation of a sub-combination. Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results.

Only a few examples and implementations are disclosed. Variations, modifications, and enhancements to the described examples and implementations and other implementations can be made based on what is disclosed.

Claims

1. A signal transmission method, implemented at a transmitter-side, comprising: performing a logical mapping of transmission resources of a digital communication channel along a first two-dimensional resource plane represented by a first and a second orthogonal axes corresponding to a first transmission dimension and a second transmission dimension respectively;allocating, to a first signal, a first group of transmission resources from the logical mapping for transmission;transforming, using a first two-dimensional transform, the first signal having the first group of transmission resources to a corresponding transformed signal in a second two-dimensional resource plane represented by a third and a fourth orthogonal axes corresponding to a third transmission dimension and a fourth transmission dimension respectively;converting the transformed signal to a formatted signal according to a transmission format of the communications channel; andtransmitting the formatted signal over the communications channel.

2. The method of claim 1, wherein the first two-dimensional resource plane comprises a delay-Doppler plane and wherein the second two-dimensional resource plane comprises a time-frequency plane.

3. The method of claim 1, wherein the converting the transformed signal to the formatted signal includes applying a multicarrier modulation scheme to the transformed signal.

4. The method of claim 3, wherein the multicarrier modulation scheme is an orthogonal frequency division multiplexing (OFDM) scheme.

5. The method of claim 4, wherein the transmission format comprises a Long Term Evolution (LTE) transmission format and wherein the OFDM scheme produces a signal compatible with the LTE transmission format.

6. The method of claim 1, further including: allocating, to at least one additional second signal, a second group of resources from the logical mapping for transmission, wherein transmission resources used by the first signal and the second signal are non-overlapping in at least one of the first two-dimensional resource plane and the second two-dimensional resource plane.

7. The method of claim 6, wherein the first signal comprises a first information signal for a first user equipment and wherein the second signal comprises a second information signal for a second user equipment.

8. The method of claim 1, wherein the first signal comprises an information signal for a user equipment and the second signal comprises a reference signal.

9. The method of claim 1, wherein the first signal comprises a pilot signal.

10. The method of claim 2, wherein the two-dimensional delay-Doppler plane comprises a lattice with lattice points defined as (m/Δf, n/T), wherein 1/Δf is a maximum delay representable on the two-dimensional delay-Doppler plane, 1/T is a maximum Doppler representable on the two-dimensional delay-Doppler plane, and m and n are integers.

11. A transmission apparatus comprising at least one processor and a memory, wherein the memory stores instructions that, upon execution by the at least one processor, cause the transmission apparatus to implement a method comprising: performing a logical mapping of transmission resources of a digital communication channel along a first two-dimensional resource plane represented by a first and a second orthogonal axes corresponding to a first transmission dimension and a second transmission dimension respectively;allocating, to a first signal, a first group of transmission resources from the logical mapping for transmission;transforming, using a first two-dimensional transform, the first signal having the first group of transmission resources to a corresponding transformed signal in a second two-dimensional resource plane represented by a third and a fourth orthogonal axes corresponding to a third transmission dimension and a fourth transmission dimension respectively;converting the transformed signal to a formatted signal according to a transmission format of the communications channel; andtransmitting the formatted signal over the communications channel.

12. The transmission apparatus of claim 11, wherein the first two-dimensional resource plane comprises a delay-Doppler plane and wherein the second two-dimensional resource plane comprises a time-frequency plane.

13. The transmission apparatus of claim 11, wherein the converting the transformed signal to the formatted signal includes applying a multicarrier modulation scheme to the transformed signal.

14. The transmission apparatus of claim 13, wherein the multicarrier modulation scheme is an orthogonal frequency division multiplexing (OFDM) scheme.

15. The transmission apparatus of claim 14, wherein the transmission format comprises a Long Term Evolution (LTE) transmission format and wherein the OFDM scheme produces a signal compatible with the LTE transmission format.

16. The transmission apparatus of claim 11, wherein the method further includes: allocating, to at least one additional second signal, a second group of resources from the logical mapping for transmission, wherein transmission resources used by the first signal and the second signal are non-overlapping in at least one of the first two-dimensional resource plane and the second two-dimensional resource plane.

17. The transmission apparatus of claim 16, wherein the first signal comprises a first information signal for a first user equipment and wherein the second signal comprises a second information signal for a second user equipment.

18. The transmission apparatus of claim 11, wherein the first signal comprises an information signal for a user equipment and the second signal comprises a reference signal.

19. The transmission apparatus of claim 11, wherein the first signal comprises a pilot signal.

20. The transmission apparatus of claim 12, wherein the two-dimensional delay-Doppler plane comprises a lattice with lattice points defined as (m/Δf, n/T), wherein 1/Δf is a maximum delay representable on the two-dimensional delay-Doppler plane, 1/T is a maximum Doppler representable on the two-dimensional delay-Doppler plane, and m and n are integers.