Receiver-side processing of orthogonal time frequency space modulated signals

Abstract
Wireless communication techniques for transmitting and receiving reference signals is described. The reference signals may include pilot signals that are transmitted using transmission resources that are separate from data transmission resources. Pilot signals are continuously transmitted from a base station to user equipment being served. Pilot signals are generated from delay-Doppler domain signals that are processed to obtain time-frequency signals that occupy a two-dimensional lattice in the time frequency domain that is non-overlapping with a lattice corresponding to data signal transmissions.
Description
TECHNICAL FIELD

The present document relates to wireless communication, and more particularly, to receiver-side processing of orthogonal time frequency space modulated signals.


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

This document discloses receiver-side techniques for receiving orthogonal time frequency and space (OTFS) modulated signals, and extracting information bits therefrom.


In one example aspect, a wireless communication method, implemented by a wireless communications receiver is disclosed. The method includes processing a wireless signal comprising information bits modulated using an orthogonal time frequency and space (OTFS) modulation scheme to generate time-frequency domain digital samples, performing linear equalization of the time-frequency domain digital samples resulting in an equalized signal, inputting the equalized signal to a feedback filter operated in a delay-time domain to produce a decision feedback equalizer (DFE) output signal, extracting symbol estimates from the DFE output signal, and recovering the information bits from the symbol estimates.


In another example aspect, an apparatus for wireless communication is disclosed. The apparatus includes a module for processing a wireless signal received at one or more antennas of the apparatus. A module may perform linear equalization in the time-frequency domain. A module may perform DFE operation in the delay-time domain. A module may perform symbol estimation in the delay-Doppler domain.


These, and other, features are described in this document.





DESCRIPTION OF THE DRAWINGS

Drawings described herein are used to provide a further understanding and constitute a part of this application. Example embodiments and illustrations thereof are used to explain the technology rather than limiting its scope.



FIG. 1 shows an example communication network.



FIG. 2 is a block diagram showing an example of an OTFS transmitter.



FIG. 3 is a block diagram showing an example of an OTFS receiver.



FIG. 4 is a block diagram showing an example of a single input multiple output (SIMO) DFE receiver.



FIG. 5 is a graph showing an example of multiplexing a pilot region and a data region in the delay-Doppler domain.



FIG. 6 is a block diagram showing an example of a MIMO DFE with ordered/unordered inter-stream interference cancellation (SIC).



FIG. 7 is a block diagram showing an example of a MIMO maximum likelihood (ML) DFE receiver which uses a hard slicer.



FIG. 8 is a block diagram showing an example of a MIMO ML-DFE receiver that uses soft-QAM modulation.



FIG. 9 shows a flowchart of an example wireless communication transmission method.



FIG. 10 shows a block diagram of an example of a wireless transmission apparatus.



FIG. 11 shows an example of a wireless transceiver apparatus.



FIG. 12 shows an example of a transmission frame.





DETAILED DESCRIPTION

To make the purposes, technical solutions and advantages of this disclosure more apparent, various embodiments are described in detail below with reference to the drawings. Unless otherwise noted, embodiments and features in embodiments of the present document may be combined with each other.


The present-day wireless technologies are expected to fall short in meeting the rising demand in wireless communications. Many industry organizations have started the efforts to standardize next generation of wireless signal interoperability standards. The 5th Generation (5G) effort by the 3rd Generation Partnership Project (3GPP) is one such example and is used throughout the document for the sake of explanation. The disclosed technique could be, however, used in other wireless networks and systems.


Section headings are used in the present document to improve readability of the description and do not in any way limit the discussion to the respective sections only.



FIG. 1 shows an example communication network 100 in which the disclosed technologies can be implemented. The network 100 may include a base station transmitter that transmits wireless signals s(t) (downlink signals) to one or more receivers 102, the received signal being denoted as r(t), which may be located in a variety of locations, including inside or outside a building and in a moving vehicle. The receivers may transmit uplink transmissions to the base station, typically located near the wireless transmitter. The technology described herein may be implemented at a receiver 102.


Because OTFS modulated signals are not modulated along a time-frequency grid but along a delay-Doppler grid, traditional signal reception techniques such as those used for receiving orthogonal frequency division multiplexing (OFDM) signals, for example, as used in Long Term Evolution (LTE) systems, cannot provide adequate performance to receive and process OTFS signals to extract or recover information bits modulated on the OTFS signals.


The presently disclosed techniques can overcome these problems, and others.


1. Introduction

Signal transmission over a wireless fading channel undergoes time and frequency selective fading which must be compensated for reliable end-to-end communication. Contemporary multi-carrier modulation techniques such as Orthogonal Frequency Division Multiplexing (OFDM) and Single Carrier Frequency Division Multiplexing (SC-FDM) exploit the degrees of freedom offered by the channel's frequency selectivity, which is characterized by the delay spread. However, the time-selective nature of the channel, as characterized by the Doppler spread, is not natively handled by these modulation techniques. Orthogonal Time Frequency and Space is a generalized two-dimensional multi-carrier modulation that fully exploits the degrees of freedom offered by the delay and Doppler dimensions of a wireless channel.


1.1 Notation


The following mathematical notation is adopted in this patent document.


Boldface font are used to describe vectors and matrices. In most cases lower-case and upper-case letters denote vectors and matrices respectively. In some cases, such as for differentiating time and frequency vectors, upper-case letters may also be used for vectors in the frequency domain.


The superscripts (.)T, (.)*, (.)H denote, respectively, transpose, conjugate and conjugate transpose operators while ⊗ denotes the Kronecker product.


The element in row i and column j of matrix A is denoted as Aij or A(i,j).


The matrix FN denotes a normalized N×N DFT matrix where FN(i,j)=(1/√{square root over (N)})e−j2πij/N.


IL denotes an L×L identity matrix, while OL×L denotes an L×L zero matrix.



custom character
M denotes the M-dimensional vector space over the field of complex numbers, and x∈custom characterM represents an M-dimensional column vector.


Nt,Nr are, respectively, the number of transmit and receive antennas.


Nl is the number of spatial layers or streams.


N,M are the dimensions of the lattice corresponding to the Delay and Doppler axes respectively.


X(k,l) represents a signal at the (k,l) point on the time-frequency grid, where k is the frequency index and l is the time index.


2. Signal Model

A multi-antenna communication system may include devices transmitting over a wireless fading channel with Nt transmit antennas and Nr receive antennas. FIG. 2 depicts an example of an OTFS transmitter. The information bits to be communicated from the transmitter may be encoded by a Forward Error Correction (FEC) block, rate matched to the number of bits the channel allocation can support, scrambled and modulated onto a discrete constellation denoted as Ω. The information bits may include user data that is locally generated or received from other equipment via a data input connection (not shown in the figure). For clarity, a Quadrature Amplitude Modulation (QAM) constellation example is discussed, but it is also possible to use some other digital constellation such as Phase Shift Keying.


The QAM symbols are mapped onto one or more spatial layers (or streams) according to the determined channel rank. For example, in downlink cellular transmission from a base station to a User Equipment (UE), the channel rank may be computed by the UE and fed back as channel state information (CSI) to the base station. Alternatively, in a Time Division Duplex (TDD) system, the base station derives the channel rank by exploiting uplink-downlink channel reciprocity.


For OTFS transmission, the information symbols for layer p can be viewed as functions defined on a two-dimensional Delay-Doppler plane, x(τ,v,p), p=0, . . . , Nl−1. The two-dimensional Delay-Doppler channel model equation is characterized by a 2D cyclic convolution










γ


(

τ
,
v

)


=


h


(

τ
,
v

)




*

2





D




x


(

τ
,
v

)







(
1
)







where the MIMO channel h(τ,v) is of dimension Nr×Nl and has finite support along the Delay and Doppler axes, and y(τ,v)∈custom characterNr is the received noiseless signal. The transmitted vector x(τ,v)∈custom characterNl is assumed to be zero mean and unity variance. Practically, the QAM symbols are mapped onto a lattice by sampling at N points on the r axis and M points on the v axis, i.e. x(n,m,p), where n=0, . . . , N−1 and m=0, . . . , M−1. For simplicity we will omit the layer indexing except where necessary.


For each spatial layer, the information symbol matrix is transformed to the time-frequency domain by a two-dimensional transform. One such transform is the inverse Discrete Symplectic Fourier transform (IDSFT). The convention adopted in the present document about Symplectic Fourier transforms follows the 1-dimensional analogue. (1) (Continuous-time) Fourier transform (FT)<->Symplectic Fourier transform (SFT). (2) Discrete-time Fourier transform (DTFT)<->Discrete time-frequency Symplectic Fourier transform (DTFSFT). (3) Discrete Fourier transform (DFT)<->Discrete Symplectic Fourier transform (DSFT). The IDSFT converts the effect of the channel on the transmitted signal from a two-dimensional cyclic convolution in the Delay-Doppler domain to a multiplicative operation in the time-frequency domain. The IDSFT operation is given by the expression:














X


(

k
,
l

)


=



IDSFT


{

x


(

n
,
m

)


}








=






n
=
0


N
-
1











m
=
0


M
-
1









x


(

n
,
m

)





b

n
,
m

*



(

k
,
l

)


















b

n
,
m




(

k
,
l

)


=


1
/

MN




e

j





2


π


(


kn
N

-

lm
M


)






,





k
=
0

,





,

N
-
1

,

l
=
0

,





,

M
-
1.






(
2
)







It can be seen from the above that the IDSFT operation produces a 2D signal that is periodic in N and M.


Next, a windowing function, C(k,l), may be applied over the time-frequency grid. This windowing function serves multiple purposes. A first purpose is to randomize the time-frequency symbols. A second purpose is to apply a pseudo-random signature that distinguishes OTFS transmissions in a multiple access system. For example, C(k,l) may represent a signature sequence with low cross-correlation property to facilitate detection in a multi-point-to-point system such as the downlink of a wireless cellular network.


The spatial layers for each time-frequency grid point may be re-arranged into a vector at the input of the spatial precoder. The input to the spatial precoder for the (k,l) grid point is Xkl=[Xk,l(0), . . . , Xk,l(Nl−1)]T. The spatial precoder W(k,l)∈custom characterNt×Nl transforms the Nl layers to Nt streams matching the number of transmit antennas. Subsequently, multi-carrier post-processing is applied, yielding the transmit waveform in the time domain. FIG. 2 shows an exemplary scheme, wherein a 1D IFFT is sequentially applied across the M OTFS time symbols. A cyclic prefix is added before the baseband signal is sent to a digital-to-analog converter and up-converted for transmission at the carrier frequency. In a different method a filter-bank may be applied rather than the IFFT+cyclic prefix method shown in FIG. 2.



FIG. 3 depicts an example of an OTFS receiver. From left to the right of the figure, he incoming RF signal is processed through an RF front end, which may include, but is not limited to, down-conversion to baseband frequency and other required processing such as low pass filtering, automatic frequency correction, IQ imbalance correction, and so on. The automatic gain control (AGC) loop and analog-to-digital conversion (ADC) blocks further process the baseband signal for input to the inner receiver sub-system. The time-and frequency synchronization system corrects for differences in timing between the transmitter and receiver sub-systems before multi-carrier processing. Herein, the multi-carrier processing may consist of cyclic prefix removal and FFT processing to convert the receive waveform to the time-frequency domain. In a different method, a filter-bank may be applied for multi-carrier processing.


The received signal at the (k,l) time-frequency grid point is













Y
kl

=






H
~

kl



W


(

k
,
l

)




X
kl


+

Z
kl








=





H
kl



X
kl


+

Z
kl









(
3
)







Where {tilde over (H)}klcustom characterNr×Nt is the MIMO channel with each entry modeled as a complex Gaussian random variable [{tilde over (H)}kl]ij˜custom character(0,1), and Hklcustom characterNr×Nl is the equivalent channel after spatial precoding. The thermal noise plus other-cell interference at the receiver input, Zklcustom characterNr is modeled as a complex Gaussian vector Zkl˜custom character(0,RZZ). The received signal vector for Nr antennas is given by

Ykl=[Ykl(0) . . . ,Ykl(Nr−1)]T


3. Linear Equalization

For OFDM systems, the QAM symbols are directly mapped onto the time-frequency grid. Therefore, per-tone frequency domain MMSE equalization is optimal in the mean square error (MSE) sense. In contrast, information symbols in an OTFS system are in the Delay-Doppler domain. Therefore, per-tone frequency MMSE equalization may be sub-optimal. To motivate application of an advanced receiver for OTFS demodulation we will start with the formulation of a linear MMSE equalizer.


For frequency domain linear equalization, the equalized signal at the (k,l) time-frequency index is given by

{circumflex over (X)}klMMSE=GklYkl


Applying the Orthogonality theorem the LMMSE filter is Gkl=RXY(k,l)RYY−1(k,l), where

RYY(k,l)=HklRXX(k,l)HklH+RZZ(k,l)
RXY(k,l)=RXX(k,l)HklH


The signal covariance matrix RXX(k,l)=RXX for every k, l, whereas the receiver noise variance matrix RZZ(k,l) may be different for each time-frequency index. For convenience the time-frequency indices could be dropped except where necessary. Using the matrix inversion lemma, the LMMSE (also known as Wiener) filter can be re-written as

G=RXX(I+HHRZZ−1HRXX)−1HHRZZ−1  (4)


After equalization, a Discrete Symplectic Fourier Transform (DSFT) is performed to convert the equalized symbols from time-frequency to the Delay-Doppler domain.


The QAM symbols could be considered to reside in the Delay-Doppler domain. Thus, time-frequency domain equalization can be shown to be sub-optimal. To see this, consider the residual error after LMMSE filtering, Ekl={circumflex over (X)}klMMSE−Xkl, where Eklcustom characterNl. The corresponding MSE matrix REE(k,l)∈custom characterNl×Nl is given by














R
EE



(

k
,
l

)


=



E


{


E
kl



E
kl
H


}








=





R
XX



(

I
+


H
kl
H




R
zz

-
1




(

k
,
l

)




H
kl



R
XX



)



-
1









(
5
)







Since the equalization is performed independently at each time-frequency index, the covariance matrix is independent across the time-frequency grid. For time index l the error covariance matrix is a block diagonal matrix where each entry on the diagonal is an Nl×Nl matrix, i.e.











R
EE



(
l
)


=

[





R
EE



(

0
,
l

)








0


N
l

×

N
l



















0


N
l

×

N
l










R
EE



(


N
-
1

,
l

)





]





(
6
)







After linear equalization the channel model expression becomes

{circumflex over (X)}lMMSE=Xl+El  (7)


As the DSFT operation can be decomposed into two one-dimensional DFT transforms, we start by considering a length N IDFT along the frequency axis to the delay domain for OTFS time symbol l. This yields,














x
^

l
MMSE

=




F
N
H




X
^

l
MMSE









=




x
l

+

e
l



,

l
=
0

,





,

M
-
1

,







(
8
)







Where the equalities that xl=FNXl and el=FNEl are used. The Delay-domain post-equalization error covariance matrix is














R
ee



(
l
)


=



E


{


e
l



e
l
H


}








=




F
N
H


E


{


E
l



E
l
H


}



F
N








=




F
N
H




R
EE



(
l
)




F
N









(
9
)







The DFT transformation in (9) makes Ree(l) a circulant matrix because REE(l) is a diagonal matrix. This also implies that the error covariance matrix is no longer white after transformation to the Delay-domain, i.e. the residual error is correlated. This correlated noise is caused by ISI which can be seen by re-writing (8) as













x
l

=





x
^

l
MMSE

-

e
l








=





F
N
H



G
l



Y
l


-

e
l








=





A
l



y
l


-

e
l









(
10
)







where Al=FNHGlFN is a circulant matrix. A circulant matrix is characterized by its generator vector, wherein each column of the matrix is a cyclic shift of the generator vector. Let Al=[a0,l, . . . , aN-1,l]T and, without loss of generality, let a0,l be the generator vector. Then it is straightforward to show that the signal model above describes a cyclic convolution:

xl(n)=Σm=0N-1a0,l(m)yl(n−m)mod N  (10A)


Therefore, ISI is introduced when trying to recover x1 from its estimate. This same reasoning can be extended from the Delay-time domain to the Delay-Doppler domain by computing the second part of the DSFT, namely, a DFT transformation from the time to Doppler domain. This, in effect is a 2D cyclic convolution that reveals a residual 2D inter-symbol interference across both Delay and Doppler dimensions. In the next section we show how a Decision Feedback Equalizer can be used to suppress this residual ISI.


4. Decision Feedback Equalization

As the OTFS information symbols reside in the Delay-Doppler domain, where the channel effect on the transmitted signal is a 2D cyclic convolution, a 2D equalizer is desirable at the receiver. One method of implementing a 2D equalizer is as follows. In a first step, a linear equalizer is applied in the time-frequency domain—as described in the previous section. As a second step, a feedback filter is applied in the Delay-Doppler domain to mitigate the residual interference across both delay and Doppler axes. However, since the OTFS block transmission is cyclic, the residual ISI on a particular QAM symbol is caused by other QAM symbols across the Delay-Doppler plane in the current N×M transmission block. It may be difficult from an implementation perspective to mitigate ISI in a full 2D scheme. The complexity of a 2D feedback filter for a DFE can be reduced by employing a hybrid DFE. Specifically, (1) The feedforward filter is implemented in the time-frequency domain, (2) the feedback filter is implemented in the Delay-time domain, and (3) the estimated symbols are obtained in the Delay-Doppler domain.


The rationale for this approach is that after the feedforward filtering, the residual ISI in the Delay domain dominates the interference in the Doppler domain. A set of M parallel feedback filters are implemented corresponding to the M time indices in the OTFS block. This document discloses a DFE receiver for a single input multiple output (SIMO) antenna system (which includes the case of a single receive antenna) system and then extends to the more general multiple input multiple output (MIMO) case, where multiple data streams are transmitted.


4.1 SIMO-DFE


The input to the feedback filter is given by (8) where for the SIMO case xlcustom characterN. A set of M parallel noise-predictive DFE feedback filters are employed in the Delay-time domain. For time index l, the estimation of xl(n), n=0, . . . , N−1, is based on exploiting the correlation in the residual error. Given the (LMMSE) feedforward output signal

xlMMSE(n)=xl(n)+el(n)  (10C)


Some embodiments may be implemented to seek a predicted error signal êl(n) such that the variance of the error term, xlMMSE(n)−êl(n) is reduced before estimation. The closer êl(n) is to el(n), the more accurate would be the final detection of xl(n). For simplicity, it may be assumed that the residual error from μ past detected symbols is known. Then the predicted error at the nth symbol is given by:












e
^

l



(
n
)


=




m
=
1

μ








b
m




e
l



(

n
-
m

)








(
11
)







Where {bm} are the error prediction filter coefficients. For simplicity, the analysis below drops the time index l. The expression above for symbol n can be put in a block processing form by re-writing the error vector at symbol n as ên=[ên-μ, ên-μ+1, . . . , ên]T. Thus, it can be seen that:

ên=Ben,  (12)


where B∈custom character(∥+1)×(μ+1) is a strictly lower triangular matrix (i.e. zero entries on the diagonal) with the last row given by bμ=[bμ,1, . . . , bμ,μ, 0] and en=[en-μ, . . . , en-1, en]T.


This predictive error formulation depends on the filter length μ+1. As such, in some implementations, the pre-feedback error covariance matrix Ree may be truncated based on this feedback filter length. Taking into account the cyclic (or periodic) nature of (10) the truncated error covariance matrix for symbol n is given by the sub-matrix:














R
~

ee

=



trunc


{

R
ee

}








=




R
ee



[



(


n
-
μ

,





,
n

)


mod





N


,


(


n
-
μ

,





,
n

)


mod





N



]









(
13
)







The final DFE output is then given by

{circumflex over (x)}DFE(n)={circumflex over (x)}MMSE(n)−bμen,n=0, . . . ,N−1  (14)


Typically, past residual errors are unknown because the receiver only has access to the output of the feedforward equalizer output {circumflex over (x)}MMSE(n), n=0, . . . , N−1. Assuming that past hard decisions {circumflex over (x)}h(n−μ), . . . , {circumflex over (x)}h(n−1)} are correct, some implementations can form an estimate of ê(n−i) as:

ê(n−i)={circumflex over (x)}MMSE(n−i)−{circumflex over (x)}h(n−i),i=1, . . . ,μ  (15)


This document also discloses how reliable past decisions can be obtained. The residual error at the output of the feedback filter is then given by:













ɛ
n

=




e
n

-


e
^

n









=




(


I
μ

-
B

)



e
n



,

n
=
0

,





,

N
-
1








(
16
)







The resulting error covariance matrix is:













R
ɛɛ

=



E


{


ɛ
n



ɛ
n
H


}








=




(


I
μ

-
B

)






R
~

ee



(


I
μ

-
B

)


H









(
17
)







The Cholesky decomposition of {tilde over (R)}ee is:

{tilde over (R)}ee=LDU


where L is a lower triangular matrix with unity diagonal entries, D is a diagonal matrix with positive entries and U=LH is an upper triangular matrix. Substituting this decomposition into (17), it is straightforward to show that the post DFE error covariance is minimized if

L−1=Iμ−B  (18)


Where B is a strictly lower triangular matrix






B
=

[



0


0


0


0


0


0





b
10



0


0


0


0


0













0


0


0
















0


0





b


μ
-
1

,
0













0


0





b

μ
,
0





b

μ
,
1











b

μ
,

μ
-
1





0



]






FIG. 4 is a block diagram of an example embodiment of a DFE receiver for a SIMO system. For each time slice l∈{0, . . . , M−1} the feedback section works on each sample n ∈{0, . . . , N−1}. It can be seen in FIG. 4 that the feedback filter 402 works in parallel across each time slice l=0, . . . , M−1. The Delay-time DFE output is transformed to the Delay-Doppler domain and sent to the soft QAM demodulator (soft slicer), which produces log likelihood ratios (LLRs) as soft input to the FEC decoder.


To start the feedback at n=0, the past symbols {n−μ, . . . , n−1} are actually modulo N, i.e. they are the last portion of the length N data block, for which hard decisions are not yet available. In some embodiments, a hard decision is made on the output of the feedforward filter. Alternatively or additionally, in some embodiments, a known sequence is appended at the end of each transmitted block, which also helps mitigate error propagation. For example, data and pilot regions may be multiplexed in the Delay-Doppler domain as shown in the example graph in FIG. 5. Here, the pilot region consists of a single impulse at (0, 0) and a zero-power region at the edges of the data region to facilitate estimation of the Delay-Doppler channel response at the receiver. This pilot region constitutes a known sequence that can be used to start the feedback filter.


In some embodiments, the transmitted signals may include a frame structure in which the lowest constellations are sent at the top (beginning) of a frame, in the delay domain. FIG. 12 show an example of multiplexing information bits for different users in a transmission on a stream-basis such that a pilot signal transmission portion may be at the beginning of the transmission frame, followed by the lowest modulation (4QAM, in this case), followed by increasing modulation for different users based on the channel condition to the corresponding user equipment. The data being sent to different users may thus be arranged along the delay dimension.


As shown the example of FIG. 12, the transmitted wireless signal may include one or more streams (spatial layers). Each stream may include a first portion that includes a decision feedback equalization signal, followed by a second portion in which data being transmitted (e.g., modulation information bits) to multiple user equipment is arranged in increasing level of modulation constellation density along the delay dimension.


In some implementations, the DFE algorithm may be described as follows: (1) Compute the time-frequency LMMSE (feedforward) equalizer output. (2) For the 1th OTFS symbol, transform the LMMSE equalizer output to Delay-time domain to obtain (8). (3) Compute the delay-domain error covariance matrix Ree(l)=FNHREE(l)FN. In some implementation, rather than performing the full matrix multiplications, a faster method may be used. (4) Computing the truncated error covariance matrix in (13). (5) Obtaining the filter bμ as the last row of B=Iμ−L−1. (6) DFE output for sample n is









x
^

DFE



(
n
)


=




x
^

MMSE



(
n
)


-




i
=
1

μ








b

μ
,
1




(





x
^

MMSE



(

n
-
i

)



mod





N


-




x
^

h



(

n
-
i

)



mod





N



)








(6) Collecting all time slices and transform to the Delay-Doppler domain.


4.2 MIMO-DFE


In some embodiments, a MIMO DFE technique could be largely based on the SIMO case but with some differences. First, the expressions in the SIMO case still hold but with the difference that each element of a vector or matrix is now of dimension Nl. For instance each element of the (μ+1)×(μ+1) covariance matrix of (13) is an Nl×Nl matrix. Second, while the cancellation of past symbols eliminates, or at least mitigates, the ISI, there is still correlation between the MIMO streams. It can be shown that, by design, the noise-predictive MIMO DFE structure also performs successive inter-stream interference cancellation (SIC). In the present case, the cancellation between streams may be ordered or un-ordered. This document describes both these cases separately and shows an extension of the DFE receiver to incorporate a near maximum likelihood mechanism.


4.3 MIMO DFE with SIC



FIG. 6 depicts an example embodiment of a MIMO DFE receiver. The LMMSE feedforward output {circumflex over (x)}MMSE(n) is a vector of dimension Nl>1. Similarly to the SIMO (Nl=1) case, the MIMO DFE works in parallel across the time axis. For convenience, the time index l=0, . . . , M−1 are omitted. To detect the data vector at the nth delay index xn for any time index, arrange the observation vector from the feedforward filter output of (8) first according to spatial layers and then according to the delay domain as:











x
^

MMSE

=

[





x
^



n
-
μ

,
0

MMSE












x
^



n
-
μ

,


N
l

-
1


MMSE

















x
^


n
,
0

MMSE












x
^


n
,


N
l

-
1


MMSE




]





(
19
)







The frequency-domain error covariance matrix of (6) is a block diagonal matrix, where each diagonal element REE(n,n)∈custom characterNl×Nl. Define the block N×N DFT matrix as

{tilde over (F)}N=FN⊗INl  (20)


Then, it is straightforward to show that the corresponding delay-domain error covariance is given by:

Ree={tilde over (F)}NHREE{tilde over (F)}N  (21)


Similar to the SIMO case, the columns of Ree an be obtained by an Nl×Nl block circular shift of the generator vector Ree[0]∈custom characterN·Nl×Nl.


Again, implementations can obtain the truncated covariance matrix of (13), and after Cholesky decomposition, the lower triangular matrix is of the form:






L
=

[




L

0
,
0




0


0


0


0





L
10




L
11



0


0


0













0


0
















0





L


μ
-
1

,
0













0





L

μ
,
0





L

μ
,
1











L

μ
,
μ





]





Each diagonal entry of L is an Nl×Nl lower triangular matrix. The feedback filter is taken as the last block row of the B matrix obtained as in (18) but now for the MIMO case. Hence, the matrix feedback filter bμcustom characterNl×Nl(μ+1) is given by:

bμ=[bμ,0,bμ,1, . . . ,bμ,μ]  (22)


The last block element bμ,μ is strictly lower triangular. To see the effect of the inter-stream cancellation, consider the 2×2 case. The last block element of the feedback filter is given by










b

μ
,
μ


=

[



0


0




α


0



]





(
23
)







From (19) the current symbol vector to be detected is xn=[xn,0 xn,1]T. From the product bμ,μ·en which is performed in (14) it can be seen that for the feedback filter does not act on the error in the first layer, while for the second layer, there is a filter coefficient acting on the first layer.


The interpretation may be as follows: for the first layer a prediction error is computed only from hard decisions of past symbol vectors. For the second layer, the detection of the first layer is used to predict error for detecting the second layer. More generally, detection of a spatial layer for a current symbol vector utilizes hard decisions from past detected symbol vectors as well as hard decisions for preceding layers in the current symbol. This is equivalently an SIC mechanism without any ordering applied to the stream cancellation. A different method is to apply ordering across the spatial layers in the MIMO system in scenarios where the SINR statistics are not identical across spatial layers.


4.4 MIMO DFE with Maximum Likelihood Detection


A different method to the DFE is to only cancel the ISI from past symbol vectors. That is, to detect xn, implementations can use an observation vector of vn,past=[vn-μT, vn-μ-1T, . . . , vn-1T]T to form the prediction error vector for (14). If the cancellation of ISI is perfect, the post DFE signal expression for the nth symbol vector

{circumflex over (x)}nDFE=xn+en  (24)


is now similar to what is expected in say OFDM, where the interference is only between the spatial layers (or streams). Therefore, implementations can apply a maximum likelihood receiver to detect the QAM symbols on each layer.



FIG. 7 depicts an example embodiment of a DFE-ML receiver, where a hard slicer is applied for the input to the DFE feedback path. Given a QAM constellation Ω, the ML decision is










x
n
ML

=



arg





max



u


Ω

N
l












(

u
-


x
^

n
DFE


)

H




R
ee

-
1




(

u
-


x
^

n
DFE


)







(
25
)







The error covariance matrix, Ree corresponds to the additive error in (24) that is obtained after cancelling interference from past symbols. Furthermore, Ree is not white. To improve detection performance, some embodiments may first whiten the ML receiver input as follows. First, decompose the error covariance matrix as Ree=Ree1/2ReeT/2. Then, let the input to the ML receiver be














R
ee


-
1

/
2





x
^

n
DFE


=




R
ee


-
1

/
2




(


x
n

+

e
n


)








=





R
ee


-
1

/
2




x
n


+


e
~

n









(
26
)







This expression now follows the basic MIMO equation for ML, i.e. y=Hx+n, where, in our case, the channel H=Ree−1/2xn and the noise covariance matrix E{{tilde over (e)}n{tilde over (e)}nH}=INl.


In addition, the ML provides a log likelihood ratio (LLR) for each transmitted bit. Rather than resort to hard QAM decisions for the DFE, a different method is to generate soft QAM symbols based on the LLR values from the ML receiver.



FIG. 8 illustrates an example embodiment of a DFE-ML receiver with soft input to the feedback path. While all other functional blocks are similar to FIG. 7, in place of a hard slicer, a soft QAM modulator may be used to provide input to the IDFT operation in the feedback path.



FIG. 9 is a flowchart for an example method 200 of wireless communication. The method 200 may be implemented by a wireless receiver, e.g., receiver 102 depicted in FIG. 1.


The method 200 includes, at 202, processing a wireless signal comprising information bits modulated using an OTFS modulation scheme to generate time-frequency domain digital samples. In some embodiments, the time-frequency domain samples may be generated by applying a two-dimensional transform to the wireless signal. The two-dimensional transform may be, for example, a discrete Symplectic Fourier transform. In some embodiments, the two-dimensional transform may be applied by windowing over a grid in the time-frequency domain.


In some embodiments, the processing 202 may be performed using an RF front end which may downcovert the received signal from RF to baseband signal. Automatic Gain Control may be used to generate an AGC-corrected baseband signal. This signal may be digitized by an analog to digital converter to generate digital samples.


The method 200 includes, at 204, performing linear equalization of the time-frequency domain digital samples resulting in an equalized signal. Various embodiments of linear equalization are described in this document. In some embodiments, the linear equalization may be performed using a mean square error criterion and minimizing the error. Some examples are given with reference to Eq. (4) to Eq. (9). In some embodiments, a Wiener filtering formulation may be used for the optimization.


The method 200 further includes, at 206, inputting the equalized signal to a feedback filter operated in a delay-time domain to produce a decision feedback equalizer (DFE) output signal. Various possibilities of DFE include single-input, multiple output (SIMO) DFE (Section 4.1), multiple-input multiple-output (MIMO) DFE (Section 4.2), MIMO-DFE with successive interference cancellation (Section 4.3), and MIMO DFE with maximum likelihood estimation (Section 4.4), as described herein.


The method 200 further includes, at 208, extracting symbol estimates from the DFE output signal. As described with reference to FIGS. 2-4 and 6-8, in some embodiments, the extraction operation may be performed in the delay-Doppler domain.


The method 200 further includes, at 210, recovering the information bits from the symbol estimates. The symbols may be, for example, quadrature amplitude modulation symbols such as 4, 8, 16 or higher QAM modulation symbols.


In some embodiments, a wireless signal transmission method may include generating data frames, e.g., as depicted in FIG. 12, and transmitting the generated data frames to multiple UEs over a wireless communication channel. For example, the transmission method may be implemented at a base station in a wireless network.



FIG. 10 is a block diagram showing an example communication apparatus 300 that may implement the method 200. The apparatus 300 includes a module 302 for processing a wireless signal received at one or more antennas of the apparatus 300. A module 304 may perform linear equalization in the time-frequency domain. The module 306 may perform DFE operation in the delay-time domain. The module 308 may perform symbol estimation in the delay-Doppler domain. The module 310 may recover information bits from modulated symbols.



FIG. 11 shows an example of a wireless transceiver apparatus 600. The apparatus 600 may be used to implement method 200. The apparatus 600 includes a processor 602, a memory 604 that stores processor-executable instructions and data during computations performed by the processor. The apparatus 600 includes reception and/or transmission circuitry 606, e.g., including radio frequency operations for receiving or transmitting signals.


It will be appreciated that techniques for wireless data reception are disclosed using two-dimensional reference signals based on delay-Doppler domain representation of signals.


The disclosed and other embodiments, modules 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 standalone 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 patent 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 wireless communication method, implemented by a wireless communication receiver, comprising: processing a wireless signal comprising information bits modulated using an orthogonal time frequency and space (OTFS) modulation scheme to generate time-frequency domain digital samples;performing linear equalization of the time-frequency domain digital samples resulting in an equalized signal; andinputting the equalized signal to a feedback filter operated in a delay-time domain to produce a decision feedback equalizer (DFE) output signal;extracting symbol estimates from the DFE output signal; andrecovering the information bits from the symbol estimates;wherein the processing the wireless signal includes applying a two-dimensional transform to generate the time-frequency domain digital samples;wherein the applying the two-dimensional transform comprises a discrete Symplectic Fourier transform or applying a two-dimensional windowing function over a grid in the time-frequency domain.
  • 2. The method of claim 1, wherein the extracting symbol estimates is performed in a delay-Doppler domain.
  • 3. The method of claim 1, wherein the processing the wireless signal includes applying a two-dimensional transform to generate the time-frequency domain digital samples.
  • 4. The method of claim 1, wherein the performing the linear equalization includes performing Wiener filtering of the time-frequency domain digital samples.
  • 5. The method of claim 1, wherein the producing the DFE output signal includes performing a single input multi-output (SIMO) decision feedback equalization (DFE) to produce the DFE output signal.
  • 6. The method of claim 1, wherein the wireless signal comprises one or more streams and wherein each stream comprises a first portion that includes a pilot signal, and a second portion in which data being transmitted to multiple user equipment is arranged in increasing level of modulation constellation density along a delay dimension.
  • 7. The method of claim 1, wherein the DFE is performed by operating a set of M parallel noise-predictive DFE feedback filters in the delay-time domain, where M is an integer.
  • 8. The method of claim 7, further including: computing an output of the equalizer by:transforming, for a given OTFS symbol, the output of the equalizer to a delay-time domain representation;computing an estimate of a delay-domain error covariance matrix;computing a truncated error covariance matrix;obtaining filter coefficients of a feedforward filter; andcalculating the output of the equalizer using the filter coefficients.
  • 9. A wireless communication receiver apparatus, comprising: a radio frequency (RF) front end;a memory storing instructions;a processor that reads the instructions from memory to receive a wireless signal from the RF front end and recover information bits from the wireless signal, the instructions comprising:instructions for processing a wireless signal comprising information bits modulated using an orthogonal time frequency and space (OTFS) modulation scheme to generate time-frequency domain digital samples;instructions for performing linear equalization of the time-frequency domain digital samples resulting in an equalized signal; andinstructions for inputting the equalized signal to a feedback filter operated in a delay-time domain to produce a decision feedback equalizer (DFE) output signal;instructions for extracting symbol estimates from the DFE output signal; andinstructions for recovering the information bits from the symbol estimates;wherein the instructions for processing the wireless signal include instructions for applying a two-dimensional transform to generate the time-frequency domain digital samples;wherein the applying the two-dimensional transform comprises applying a discrete Symplectic Fourier transform or applying a two-dimensional windowing function over a grid in the time-frequency domain.
  • 10. The apparatus of claim 9, wherein the instructions for processing the wireless signal include instructions for applying a two-dimensional transform to generate the time-frequency domain digital samples.
  • 11. The apparatus of claim 9, wherein the instructions for extracting symbol estimates include instructions for extracting symbol estimates in a delay-Doppler domain.
  • 12. The apparatus of claim 9, wherein the instructions for performing the linear equalization include instructions for performing Wiener filtering of the time-frequency domain digital samples.
  • 13. The apparatus of claim 9, wherein the instructions for producing the DFE output signal include instructions for performing a single input multi-output (SIMO) decision feedback equalization (DFE) to produce the DFE output signal.
  • 14. The apparatus of claim 13, wherein the SIMO-DFE is performed by operating a set of M parallel noise-predictive DFE feedback filters in the delay-time domain, where M is an integer.
  • 15. The apparatus of claim 14, wherein the instructions further include: instructions for computing an output of the equalizer by:instructions for transforming, for a given OTFS symbol, the output of the equalizer to a delay-time domain representation;instructions for computing an estimate of a delay-domain error covariance matrix;instructions for computing a truncated error covariance matrix;instructions for obtaining filter coefficients of a feedforward filter; andinstructions for calculating the output of the equalizer using the filter coefficients.
  • 16. The apparatus of claim 9, wherein the instructions for producing the DFE output signal include instructions for performing a multi-input multi-output (MIMO) decision feedback equalization (DFE) to produce the DFE output signal.
  • 17. A wireless communication receiver apparatus, comprising: a radio frequency (RF) front end;a processor configured to cause the wireless communication apparatus to receive a wireless signal from the RF front end and recover information bits from the wireless signal by:processing the wireless signal comprising information bits modulated using an orthogonal time frequency and space (OTFS) modulation scheme to generate time-frequency domain digital samples;performing linear equalization of the time-frequency domain digital samples resulting in an equalized signal;inputting the equalized signal to a feedback filter operated in a delay-time domain to produce a decision feedback equalizer (DFE) output signal;extracting symbol estimates from the DFE output signal; andrecovering the information bits from the symbol estimates;wherein the processing the wireless signal include instructions for applying a two-dimensional transform to generate the time-frequency domain digital samples;wherein the applying the two-dimensional transform comprises applying a discrete Symplectic Fourier transform or applying a two-dimensional windowing function over a grid in the time-frequency domain.
  • 18. The wireless communication receiver apparatus of claim 17, wherein the extracting symbol estimates is performed in a delay-Doppler domain.
  • 19. The wireless communication receiver apparatus of claim 17, wherein the processing the wireless signal includes applying a two-dimensional transform to generate the time-frequency domain digital samples.
  • 20. The wireless communication receiver apparatus of claim 17, wherein the performing the linear equalization includes performing Wiener filtering of the time-frequency domain digital samples.
  • 21. The wireless communication receiver apparatus of claim 17, wherein the producing the DFE output signal includes performing a single input multi-output (SIMO) decision feedback equalization (DFE) to produce the DFE output signal.
  • 22. The wireless communication receiver apparatus of claim 17, wherein the DFE is performed by operating a set of M parallel noise-predictive DFE feedback filters in the delay-time domain, where M is an integer.
  • 23. A wireless communication receiver apparatus, comprising: a radio frequency (RF) front end;a memory storing instructions;a processor that reads the instructions from memory to receive a wireless signal from the RF front end and recover information bits from the wireless signal, the instructions comprising:instructions for processing a wireless signal comprising information bits modulated using an orthogonal time frequency and space (OTFS) modulation scheme to generate time-frequency domain digital samples;instructions for performing linear equalization of the time-frequency domain digital samples resulting in an equalized signal; andinstructions for inputting the equalized signal to a feedback filter operated in a delay-time domain to produce a decision feedback equalizer (DFE) output signal;instructions for extracting symbol estimates from the DFE output signal; andinstructions for recovering the information bits from the symbol estimates;wherein the instructions for producing the DFE output signal include instructions for performing a single input multi-output (SIMO) decision feedback equalization (DFE) to produce the DFE output signal;wherein the SIMO-DFE is performed by operating a set of M parallel noise-predictive DFE feedback filters in the delay-time domain, where M is an integer.
  • 24. The wireless communication receiver apparatus of claim 23, wherein the instructions further include: instructions for computing an output of the equalizer by:instructions for transforming, for a given OTFS symbol, the output of the equalizer to a delay-time domain representation;instructions for computing an estimate of a delay-domain error covariance matrix;instructions for computing a truncated error covariance matrix;instructions for obtaining filter coefficients of a feedforward filter; andinstructions for calculating the output of the equalizer using the filter coefficients.
  • 25. A wireless communication method, implemented by a wireless communication receiver, comprising: processing a wireless signal comprising information bits modulated using an orthogonal time frequency and space (OTFS) modulation scheme to generate time-frequency domain digital samples;performing linear equalization of the time-frequency domain digital samples resulting in an equalized signal; andinputting the equalized signal to a feedback filter operated in a delay-time domain to produce a decision feedback equalizer (DFE) output signal;extracting symbol estimates from the DFE output signal; andrecovering the information bits from the symbol estimates;wherein the DFE is performed by operating a set of M parallel noise-predictive DFE feedback filters in the delay-time domain, where M is an integer.
  • 26. The method of claim 25, further including: computing an output of the equalizer by:transforming, for a given OTFS symbol, the output of the equalizer to a delay-time domain representation;computing an estimate of a delay-domain error covariance matrix;computing a truncated error covariance matrix;obtaining filter coefficients of a feedforward filter; andcalculating the output of the equalizer using the filter coefficients.
CROSS-REFERENCE TO RELATED APPLICATIONS

This patent document is a 371 National Phase Application of PCT Application No. PCT/US2017/023892, entitled “RECEIVER-SIDE PROCESSING OF ORTHOGONAL TIME FREQUENCY SPACE MODULATED SIGNALS” filed on Mar. 23, 2017, which claims priority to U.S. Provisional Application Ser. No. 62/257,171, entitled “RECEIVER-SIDE PROCESSING OF ORTHOGONAL TIME FREQUENCY SPACE MODULATED SIGNALS” filed on Mar. 23, 2016. The entire content of the aforementioned patent applications is incorporated by reference herein.

PCT Information
Filing Document Filing Date Country Kind
PCT/US2017/023892 3/23/2017 WO 00
Publishing Document Publishing Date Country Kind
WO2017/165697 9/28/2017 WO A
US Referenced Citations (182)
Number Name Date Kind
4754493 Coates Jun 1988 A
5083135 Nagy et al. Jan 1992 A
5182642 Gersdorff et al. Jan 1993 A
5483557 Webb Jan 1996 A
5623511 Bar-David et al. Apr 1997 A
5831977 Dent Nov 1998 A
5872542 Simons et al. Feb 1999 A
5956624 Hunsinger et al. Sep 1999 A
6212246 Hendrickson Apr 2001 B1
6289063 Duxbury Sep 2001 B1
6356555 Rakib et al. Mar 2002 B1
6388621 Lynch May 2002 B1
6426983 Rakib et al. Jul 2002 B1
6608864 Strait Aug 2003 B1
6631168 Izumi Oct 2003 B2
6704366 Combes et al. Mar 2004 B1
6956814 Campanella Oct 2005 B1
7010048 Shattil Mar 2006 B1
7327812 Auer Feb 2008 B2
7392018 Ebert et al. Jun 2008 B1
7689049 Monro Mar 2010 B2
7773685 Tirkkonen et al. Aug 2010 B2
7864877 Hottinen Jan 2011 B2
8229017 Lee et al. Jul 2012 B1
8259845 Dent Sep 2012 B2
8401131 Fety et al. Mar 2013 B2
8547988 Hadani et al. Oct 2013 B2
8619892 Vetter et al. Dec 2013 B2
8717210 Eldar et al. May 2014 B2
8879378 Rakib et al. Nov 2014 B2
8892048 Turner Nov 2014 B1
8976851 Hadani et al. Mar 2015 B2
9031141 Hadani et al. May 2015 B2
9071285 Hadani et al. Jun 2015 B2
9071286 Hadani et al. Jun 2015 B2
9083483 Rakib et al. Jul 2015 B1
9083595 Rakib et al. Jul 2015 B2
9130638 Hadani et al. Sep 2015 B2
9282528 Hashimoto Mar 2016 B2
9294315 Hadani et al. Mar 2016 B2
9444514 Hadani et al. Sep 2016 B2
9548840 Hadani et al. Jan 2017 B2
9553984 Krause et al. Jan 2017 B2
9590779 Hadani et al. Mar 2017 B2
9634719 Rakib et al. Apr 2017 B2
9660851 Hadani et al. May 2017 B2
9668148 Hadani et al. May 2017 B2
9712354 Hadani et al. Jul 2017 B2
9729281 Hadani et al. Aug 2017 B2
20010031022 Petrus et al. Oct 2001 A1
20010033614 Hudson Oct 2001 A1
20010046205 Easton et al. Nov 2001 A1
20020001308 Heuer Jan 2002 A1
20020034191 Shattil Mar 2002 A1
20020181388 Jain et al. Dec 2002 A1
20020181390 Mody et al. Dec 2002 A1
20020181607 Izumi Dec 2002 A1
20030073464 Giannakis et al. Apr 2003 A1
20030185295 Yousef Oct 2003 A1
20030235147 Walton et al. Dec 2003 A1
20040044715 Aldroubi et al. Mar 2004 A1
20040174812 Murakami et al. Sep 2004 A1
20040189581 Sako et al. Sep 2004 A1
20040218523 Varshney et al. Nov 2004 A1
20050157778 Trachewsket et al. Jul 2005 A1
20050157820 Wongwirawat et al. Jul 2005 A1
20050180517 Abe Aug 2005 A1
20050207334 Hadad Sep 2005 A1
20050251844 Martone et al. Nov 2005 A1
20050265490 Sestok, IV Dec 2005 A1
20060008021 Bonnet Jan 2006 A1
20060039270 Strohmer et al. Feb 2006 A1
20060182193 Monsen Aug 2006 A1
20070014272 Palanki et al. Jan 2007 A1
20070038691 Candes et al. Feb 2007 A1
20070058739 Aytur et al. Mar 2007 A1
20070078661 Sriram et al. Apr 2007 A1
20070104283 Han et al. May 2007 A1
20070110131 Guess et al. May 2007 A1
20070211952 Faber et al. Sep 2007 A1
20070237181 Cho et al. Oct 2007 A1
20070253465 Muharemovic et al. Nov 2007 A1
20070253504 Hasegawa Nov 2007 A1
20080043857 Dias et al. Feb 2008 A1
20080117999 Kadous et al. May 2008 A1
20080130777 Landau Jun 2008 A1
20080186843 Ma et al. Aug 2008 A1
20080187062 Pan et al. Aug 2008 A1
20080212722 Heikkila Sep 2008 A1
20080232504 Ma et al. Sep 2008 A1
20080310383 Kowalski Dec 2008 A1
20090080403 Hamdi Mar 2009 A1
20090092259 Jot et al. Apr 2009 A1
20090103593 Bergamo Apr 2009 A1
20090122854 Zhu et al. May 2009 A1
20090161804 Chrabieh et al. Jun 2009 A1
20090204627 Hadani Aug 2009 A1
20090222226 Baraniuk et al. Sep 2009 A1
20090303961 Popovic et al. Dec 2009 A1
20100001901 Baraniuk et al. Jan 2010 A1
20100008432 Kim et al. Jan 2010 A1
20100027608 Priotti Feb 2010 A1
20100111138 Hosur et al. May 2010 A1
20100142476 Jiang et al. Jun 2010 A1
20100187914 Rada et al. Jul 2010 A1
20100238787 Guey Sep 2010 A1
20100277308 Potkonjak Nov 2010 A1
20100303136 Ashikhmin et al. Dec 2010 A1
20100322349 Lee et al. Dec 2010 A1
20110007789 Garmany Jan 2011 A1
20110110532 Svendsen May 2011 A1
20110116489 Grandhi May 2011 A1
20110116516 Hwang et al. May 2011 A1
20110126071 Han et al. May 2011 A1
20110131463 Gunnam Jun 2011 A1
20110142153 Yoon et al. Jun 2011 A1
20110216808 Tong et al. Sep 2011 A1
20110286502 Adachi et al. Nov 2011 A1
20110287778 Levin et al. Nov 2011 A1
20110292971 Hadani et al. Dec 2011 A1
20110293030 Rakib et al. Dec 2011 A1
20110299379 Sesia et al. Dec 2011 A1
20110305267 Rius et al. Dec 2011 A1
20120021769 Lindoff et al. Jan 2012 A1
20120051457 Ma et al. Mar 2012 A1
20120140716 Baldemair et al. Jun 2012 A1
20120170684 Yim et al. Jul 2012 A1
20120201322 Rakib et al. Aug 2012 A1
20120213098 Sun Aug 2012 A1
20120235795 Liao et al. Sep 2012 A1
20120269201 Atungsiri et al. Oct 2012 A1
20120272117 Stadelmeier et al. Oct 2012 A1
20120320994 Loghin et al. Dec 2012 A1
20130021977 Yang et al. Jan 2013 A1
20130058390 Haas et al. Mar 2013 A1
20130077579 Cho et al. Mar 2013 A1
20130083661 Gupta et al. Apr 2013 A1
20130121497 Smaragdis et al. May 2013 A1
20130230010 Kim et al. Sep 2013 A1
20130260787 Hashimoto Oct 2013 A1
20130279627 Wu et al. Oct 2013 A1
20130315133 Wang et al. Nov 2013 A1
20140143639 Loghin et al. May 2014 A1
20140161154 Hadani et al. Jun 2014 A1
20140169385 Hadani Jun 2014 A1
20140169406 Hadani et al. Jun 2014 A1
20140169433 Hadani et al. Jun 2014 A1
20140169436 Hadani et al. Jun 2014 A1
20140169437 Hadani et al. Jun 2014 A1
20140169441 Hadani et al. Jun 2014 A1
20140247803 Arambepola et al. Sep 2014 A1
20140348252 Siohan et al. Nov 2014 A1
20140364128 Lee et al. Dec 2014 A1
20150117395 Hadani et al. Apr 2015 A1
20150326273 Rakib et al. Nov 2015 A1
20150327085 Hadani et al. Nov 2015 A1
20150382231 Jabbar et al. Dec 2015 A1
20160043835 Hadani et al. Feb 2016 A1
20160135132 Donepudi et al. May 2016 A1
20160182269 Hadani et al. Jun 2016 A1
20160191217 Hadani et al. Jun 2016 A1
20160191280 Hadani et al. Jun 2016 A1
20160254889 Shattil Sep 2016 A1
20160277225 Frenne et al. Sep 2016 A1
20160309345 Tehrani et al. Oct 2016 A1
20160380743 Rakib Dec 2016 A1
20160381576 Hadani et al. Dec 2016 A1
20170012749 Rakib et al. Jan 2017 A1
20170012810 Rakib et al. Jan 2017 A1
20170019297 Rakib Jan 2017 A1
20170033899 Rakib et al. Feb 2017 A1
20170040711 Rakib et al. Feb 2017 A1
20170078054 Hadani et al. Mar 2017 A1
20170099122 Hadani et al. Apr 2017 A1
20170099607 Hadani et al. Apr 2017 A1
20170149594 Rakib May 2017 A1
20170149595 Rakib et al. May 2017 A1
20170201354 Hadani et al. Jul 2017 A1
20170207817 Hadani et al. Jul 2017 A1
20170222700 Hadani et al. Aug 2017 A1
20170230215 Rakib et al. Aug 2017 A1
20170244524 Hadani et al. Aug 2017 A1
Foreign Referenced Citations (18)
Number Date Country
1235720 Nov 1999 CN
101682316 Mar 2010 CN
101939935 Jan 2011 CN
1432168 Jun 2004 EP
2011127910 Jun 2011 JP
2007004297 Jan 2007 WO
2011137699 Nov 2011 WO
2011150315 Dec 2011 WO
2013148546 Oct 2013 WO
2014004585 Jan 2014 WO
2016014596 Jan 2016 WO
2016014598 Jan 2016 WO
2016176642 Nov 2016 WO
2016183230 Nov 2016 WO
2016183240 Nov 2016 WO
2016209848 Dec 2016 WO
2017003952 Jan 2017 WO
2017011478 Jan 2017 WO
Non-Patent Literature Citations (70)
Entry
International Search Report and Written Opinion for International Application No. PCT/US2017/025797, dated Jun. 21, 2017, 6 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/030259, dated Aug. 1, 2016, 13 pages.
Office Action for U.S. Appl. No. 15/152,464, dated Apr. 6, 2017, 10 pages.
Examination Report No. 1 for Australian Application No. 2013280487, dated May 2, 2016, 3 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/031928, dated Oct. 7, 2016, 10 pages.
Office Action for U.S. Appl. No. 15/188,946, dated May 8, 2017, 14 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/038584, dated Sep. 26, 2016, 8 pages.
Office Action for U.S. Appl. No. 15/187,668, dated Feb. 16, 2017, 6 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/031909, dated Aug. 11, 2016, 13 pages.
Office Action for U.S. Appl. No. 15/194,494, dated May 5, 2017, 16 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/039662, dated Nov. 29, 2016, 14 pages.
Office Action for U.S. Appl. No. 15/436,653, dated Jun. 2, 2017, 10 pages.
Office Action for U.S. Appl. No. 15/208,545, dated Aug. 21, 2017, 15 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/041940, dated Oct. 20, 2016, 8 pages.
Supplementary European Search Report for European Application No. 13768150.8, dated Oct. 30, 2015, 7 pages.
International Search Report and Written Opinion for International Application No. PCT/US2013/033652, dated Jun. 12, 2013, 8 pages.
International Search Report and Written Opinion for International Application No. PCT/US2015/041417, dated Oct. 1, 2015, 7 pages.
Office Action for U.S. Appl. No. 14/805,407, dated Dec. 14, 2016, 7 pages.
International Search Report and Written Opinion for International Application No. PCT/US2015/041420, dated Oct. 1, 2015, 6 pages.
International Search Report and Written Opinion for PCT Application No. PCT/US2017/023892, dated Jun. 9, 2017, 20 pages.
Office Action for U.S. Appl. No. 13/117,119, dated Aug. 5, 2013, 5 pages.
Notice of Allowance for U.S. Appl. No. 13/117,119, dated Feb. 28, 2014, 13 pages.
Banelli, P. et al., “Modulation Formats and Waveforms for 5G Networks: Who Will Be the Heir of OFDM?,” IEEE Signal Processing Magazine, vol. 81, pp. 80-93, Nov. 2014.
El Hattachi, R. et al., “NGMN 5G Initiative White Paper,” NGMN Alliance, Feb. 17, 2015. [Online]. Available: https://www.ngmn.org/uploads/media/NGMN_5G_White_Paper_V1_0.pdf, 125 pages.
Rusek, F. et al., “Scaling Up MIMO, Opportunities and Challenges with Very Large Arrays,” IEEE Signal Processing Magazine, pp. 40-60 (2013).
Vodafone, “Cellular Internet of Things: Architectural Aspects,” RP-150869, 3GPP RAN#68, Malmo, Sweden (Jun. 9, 2015), 19 pages.
Supplementary European Search Report for European Application No. 11787483.4, dated Sep. 9, 2014, 6 pages.
International Search Report and Written Opinion for International Application No. PCT/US2011/038302, dated Nov. 15, 2011, 8 pages.
International Preliminary Report on Patentability for International Application No. PCT/US2011/038302, dated Dec. 4, 2012, 7 pages.
Office Action for U.S. Appl. No. 13/117,124, dated Feb. 22, 2013, 7 pages.
Notice of Allowance for U.S. Appl. No. 13/117,124, dated Aug. 8, 2013, 10 pages.
Office Action for U.S. Appl. No. 14/605,957, dated Jun. 22, 2017, 6 pages.
Supplementary European Search Report for European Application No. 13809004.8, dated Apr. 14, 2016, 8 pages.
Communication Pursuant to Article 94(3) EPC for European Application No. 13809004.8, dated Feb. 17, 2017, 5 pages.
Notice of Allowance for U.S. Appl. No. 13/927,087, dated Feb. 25, 2015, 9 pages.
Office Action for U.S. Appl. No. 13/927,087, dated Nov. 12, 2014, 14 pages.
Gurevich, S. et al. “Group Representation Design of Digital Signals and Sequences,” S.W. Golomb et al. (eds.), SETA 2008, LNCS 5203, pp. 153-166, Springer-Verlag Berlin Heidelberg (2008).
International Search Report and Written Opinion for International Application No. PCT/US2013/047723, dated Oct. 29, 2013, 17 pages.
International Preliminary Report on Patentability for International Application No. PCT/US2013/047723, dated Dec. 31, 2014, 15 pages.
Notice of Allowance for U.S. Appl. No. 13/927,088, dated Feb. 18, 2015, 7 pages.
Office Action for U.S. Appl. No. 13/927,088, dated Nov. 28, 2014, 13 pages.
Notice of Allowance for U.S. Appl. No. 13/927,086, dated Dec. 26, 2014, 8 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 13/927,086, dated Mar. 19, 2015, 4 pages.
Office Action for U.S. Appl. No. 13/927,086, dated Oct. 14, 2014, 10 pages.
Office Action for U.S. Appl. No. 13/927,089, dated Dec. 24, 2014, 13 pages.
Office Action for U.S. Appl. No. 13/927,089, dated Aug. 14, 2015, 7 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 13/927,091, dated Jun. 11, 2015, 4 pages.
Notice of Allowance for U.S. Appl. No. 13/927,091, dated Apr. 24, 2015, 8 pages.
Office Action for U.S. Appl. No. 13/927,091, dated Jan. 27, 2015, 15 pages.
Office Action for U.S. Appl. No. 13/927,092, dated Oct. 8, 2014, 5 pages.
Notice of Allowance for U.S. Appl. No. 13/927,092, dated Oct. 24, 2014, 7 pages.
Office Action for U.S. Appl. No. 13/927,095, dated Apr. 30, 2015, 11 pages.
Office Action for U.S. Appl. No. 13/927,095, dated Nov. 4, 2015, 9 pages.
Office Action for U.S. Appl. No. 13/927,095, dated Jun. 1, 2016, 10 pages.
Office Action for U.S. Appl. No. 14/717,886, dated Apr. 19, 2016, 10 pages.
Office Action for U.S. Appl. No. 14/709,377, dated Dec. 11, 2015, 12 pages.
Office Action for U.S. Appl. No. 14/709,377, dated Jul. 13, 2016, 17 pages.
Examination Report No. 1 for Australian Application No. 2013239970, dated Dec. 8, 2015, 3 pages.
“AT&T Annual Report 2014,” Opening Our Network [Online]. Retrieved from the Internet: Sep. 22, 2016. <URL: http://www.att.com/Investor/ATT_Annual/2014/att_introduces_new_concepts_for_telecom_network.html>, 5 pages.
Catt, “UL ACK/NACK transmission methods for LTE-A,” 3GPP TSG RAN WG1 Meeting #60bis, R1-102453, Beijing, China, Apr. 12-16, 2010, 8 pages.
Toskala, A. et al., “Physical Layer,” Chapter 5 in: “LTE for UMTS: OFDMA and SC-FDMA Based Radio Access,” Holma, H. et al. (eds.), John Wiley & Sons, Ltd., United Kingdom, 2009, pp. 83-135.
Mecklenbrauker, W., “A Tutorial on Non-Parametric Bilinear Time-Frequency Signal Representations,” In: Time and Frequency Representation of Signals and Systems, Longo, G. et al. (eds.), Springer-Verlag Wien, vol. 309, pp. 11-68 (1989).
Nehorai, A. et al., “MURI: Adaptive waveform design for full spectral dominance (2005-2010),” AFOSR FA9550-05-1-0443, Final Report, [online], Mar. 11, 2011 Retrieved on May 11, 2013, Retrieved from the Internet <URL: http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=ADA565420>, 103 pages.
Office Action for Japanese Application No. 2015-518647, dated Jul. 7, 2015, 10 pages.
Office Action for U.S. Appl. No. 14/754,596, dated Apr. 19, 2016, 18 pages.
Office Action for U.S. Appl. No. 14/809,129, dated Jul. 19, 2016, 5 pages.
Office Action for U.S. Appl. No. 15/617,962, dated Sep. 6, 2017, 10 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/050825, dated Feb. 8, 2017, 12 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/052524, dated Dec. 20, 2016, 8 pages.
Office Action for U.S. Appl. No. 15/374,995, dated Aug. 7, 2017, 6 pages.
Related Publications (1)
Number Date Country
20190081836 A1 Mar 2019 US
Provisional Applications (1)
Number Date Country
62312367 Mar 2016 US