The present document relates to wireless communication, and more particularly, synchronization at a receiver.
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.
This document discloses techniques for receiver-side processing in which signals modulated using orthogonal time frequency space (OTFS) modulations are received and processed to extract modulated data.
In one example aspect, a signal reception method is disclosed. The method includes receiving an OTFS modulated wireless signal comprising pilot signal transmissions interspersed with data transmissions, calculating autocorrelation of the wireless signal using the wireless signal and a delayed version of the wireless signal that is delayed by a pre-determined delay, thereby generating an autocorrelation output, processing the autocorrelation filter through a moving average filter to produce a fine timing signal, and performing synchronization with the wireless signal using the fine timing signal.
In another aspect a signal reception method is disclosed. The method includes receiving an OTFS modulated wireless signal comprising pilot signal transmissions interspersed with data transmissions, performing an initial automatic gain correction of the received OTFS wireless signal by peak detection and using clipping information, performing coarse automatic gain correction on results of a received and initial automatic gain control (AGC)-corrected signal.
In another example aspect, a wireless communication apparatus that implements the above-described method is disclosed.
In yet another example aspect, the method may be embodied as processor-executable code and may be stored on a computer-readable program medium.
These, and other, features are described in this document.
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.
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.
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.
In recent years, to meet the increased demand of ever higher data throughput many new techniques have been introduced in wireless communications. For example, the amount of bandwidth, measured as a total number or as a number of bits per Hertz per second number, has grown steadily over years in prevalent communication standards such as the Long Term Evolution (LTE). This trend is expected to grow even more due to the explosion of smartphones and multimedia streaming services.
Recently, a modulation scheme called orthogonal time frequency space (OTFS), has been proposed for wireless data transmissions. An OTFS transmitter may generate transmission signals by modulating the incoming bit stream into OTFS frames. An OTFS receiver may be used to receive OTFS modulated signals and recover data bits from the signal.
The OTFS receiver should reliably and accurately (a) estimate the receiver gain required and apply it through RF and base band (both analog and digital) stages such that the digital sections of the OTFS receiver obtain samples with maximum fidelity (this is sometimes called automatic gain control or AGC) and (b) acquire synchronization in the presence of channels with a multitude of reflectors that has a range of delay and Doppler characteristics.
This document provides the requirements for AGC and synchronization and outlines a technical approach to meet these requirements. In general terms, both the AGC and synchronization is achieved by multiple stages of intertwined processing, including the computation of auto-correlation followed by moving average filtering to perform initial, coarse and fine AGC and coarse synchronization and fine synchronization. These, and other aspects, are described in the present document.
Section headings are used only to facilitate readability and are not intended to limit the embodiments and technology described in each section only to that section.
An example system with OTFS modulation parameters described below is considered in this document. In the example system, Nv is 512 and Nh is 16. In some embodiments, a 2D spreading sequence, or basis, may also be a part of this design. When Nv=512 and Nh=16, there will be 512×16 QAM symbols (8K) per OTFS frame. Based on the QAM level (BPSK, QPSK, 16QAM, 64QAM, . . . ) level, an OTFS frame would carry 8K, 16K, 32K . . . bits of information. In the example implementation, channel bandwidth (BW) considered in 10 MHz. The number of OTFS frames transmitted is approximately 1000 frames per second. When the BW doubles, the number of frames per second will double, thus enabling double the throughput. An OTFS frame in (f, t) domain is padded with appropriate cyclic suffix (CS) and prefix (CP). This will contain (512+CP+CS)×16 complex samples. This frame, after serialization gets transmitted after appropriate up-sampling and up-conversion.
Some terms and their example embodiments are described next.
OTFS frame or OTFS symbol or Data frame—OTFS modulated (2D modulation) data symbol. This frame resides in the (delay, Doppler) also called (τ, v) domain. In the (τ, v) domain, OTFS frame is a matrix of QAM symbols of size (Nv×Nh). Transformation to other domains are possible by means of Simpletic Fourier Transform which is achieved by Discreet Fourier Transform (or Fast Fourier Transform). Conversion from (τ, v) to (frequency, time) also called (f, t) is achieved by performing a 2D FFT on a frame in (τ, v). A 1D FFT on a (τ, v) frame along the Doppler dimension (Nh) gives rise to a frame in (τ, t) whereas a 1D FFT along the delay dimension (Nv) gives rise to a frame in (f, v).
A sample—At the transmitter, the above OTFS symbols are up-sampled and fed to the ADC. They are called transmit samples. Similarly, the received analog signal at the OTFS receiver is sampled and goes through a down conversion process. At different stages of the receiver each QAM symbol could be constituted by one or more samples.
Pilot Frame—An OTFS frame of pilot symbols. This is a frame constituted on a sparse grid. In the current system each pilot symbol (512×1 matrix in this realization) is interleaved with a data frame. 16 such pilot symbols constitute a pilot frame.
Carrier Offset Recovery—the process of detecting carrier phase/frequency offset and using a) one-time frequency correction and b) a continuously tracking phase-locked loop (PLL) to lock the phase and frequency to the transmit carrier.
Frame Detection/recovery—the process of aligning the receiver to the start of OTFS frame to the nearest symbol interval.
Timing Offset Recovery—the process of detecting fractional symbol timing phase offset and aligning the receiver sample phase to the most “appropriate” value either by using a PLL or a one-time symbol timing phase correction.
Symbol timing—the process of adjusting the receiver timing phase by a fractional (QAM) symbol timing offset. Timing offset recovery and symbol timing are used interchangeably.
Carrier Offset recovery, Frame Detection and symbol Timing recovery constitute synchronization.
Pilot auto-correlator—Performs a sample-by-sample linear correlation of the received pilot with the subsequent received pilot. Information from this is used for carrier frequency offset detection and adjusting the AGC gain.
Matched Filter (MF) correlator—It correlates a received pilot with the original transmitted pilot sequence. Information from this is for symbol timing and absolute carrier phase offset detection.
Using auto-correlation of pilot transmissions instead of other alternatives (e.g., matched filtering) may provide operational benefits for a variety of reasons. For example, pilots are often used for channel sounding and so they are packed such that pilot frame spacing is relatively short in comparison to channel time variability. Therefore, coherence time, even under high Doppler situations, is typically higher than pilot frame spacing. In other words, relative variations between adjacent pilot transmissions will not be significant, even under high Doppler conditions. Therefore, a pilot auto-correlation sequence will be less susceptible to Doppler induced channel changes, and thus it may be relatively easy to discern peaks in the auto-correlation, even under extreme Doppler conditions and carrier frequency offsets. On the other hand, a matched filter based auto-correlation peak generation scheme typically matches the received pilot signals with a fixed sequence, and often is susceptible to Doppler and frequency offsets. Therefore, in some embodiments, matched filtering may be unsuitable for frequency offset determination.
In some embodiments, data frames may be scrambled so as to eliminate unwanted data correlations, which may lead to false correlation peaks.
Step 1: initial gain adjustment. At the beginning, the modem receiver typically has no idea about the strength of the input signal. It may be too weak or too strong. So set the initial AGC gain to the maximum possible. If the incoming signal is too strong, it will cause clipping in the Analog to Digital converter. As a first step, sense the clipping and perform gross adjustment of the receiver front end gain such that signal after gain stabilization is not clipping any more. In some embodiments, the initial gain adjustment may be performed using code running on a microprocessor.
Step 2: coarse gain adjustment. Pilot autocorrelation peaks can be used to estimate the incoming signal power at this stage (taking the average amplitude of the correlation peaks and use a look up table). However, this estimation need not be very accurate as the signal peak amplitudes themselves will be highly varying if there is high carrier frequency offset or Doppler offset. Hence this power estimation and associated gain adjustment will be coarse. In some embodiments, the coarse gain adjustment may be performed using a combination of code and FPGA.
Step 3: using the pilot autocorrelation peak positions estimate the gross carrier frequency error. It is customary that the carrier frequency and QAM symbol frequency are derived from the same crystal oscillator (frequency synthesizer/VCO) at the transmitter and receiver. If there is a big carrier frequency offset, there will be a proportional clock frequency (symbol clock) offset as well. This will get manifested as a gradual drift in the pilot auto-correlation peak positions. Collecting the auto-correlation peak positions over a long period (for example 1000 peak positions) and performing a linear fit as described in the sequel can give a good estimate of the symbol frequency drift. Oscillator frequency offsets as high as 20 to 25 parts per million (ppm) can be estimated using this method. After the estimation, the corresponding correction is applied to the VCXO at the receiver. Once the correction has taken effect, the expected frequency offset is much smaller. In this example realization, this could be typically less than 2 ppm. At this stage, correlation peaks will be well stabilized and they can be used for a) a more accurate estimate of the received power and b) OTFS Frame start.
Step 4: Coarse carrier frequency offset (CFO) correction. Correlating samples that are 512 samples apart (in this example realization) will produce 16 distinct peaks for the data frame and 1 peak for the pilot sub-frame. Each of these peaks can be used to compute the remaining frequency offset as described later. This is called the coarse frequency offset. Once estimated, it can be corrected at the VCXO.
Step 5: Determination of coarse frame start (frame start detection). Correlation peak index may be used for this step.
Step 6: Fine frame start estimation is performed using demodulated channel peak index.
Step 7: Symbol timing offset (STO) estimation. This may be performed using interpolation of the channel response amplitude as described in detail later.
Step 8a: At this stage, the carrier frequency offset is expected to be a few Hz, frame detection is functional and the symbol timing offset is insignificant. From the phase values of the pilot-auto-correlation peaks, the frequency error can be estimated. Note that these error values are obtained at regular intervals (in this case˜1 ms). This is fed into a 2nd order PLL, which tracks the carrier frequency offset at the receiver.
Step 8b: Receiver Gain need to be tracked to account for the slow varying power variations. This can be achieved by computing the received power from the pilot auto-correlation peaks.
In some embodiments, Steps 1-8 could be performed partly in hardware circuits and partly using one or several microprocessors.
The digital signal from ADC may be filtered through a half-band filter and down sampled. A digital gain correction mechanism may also be part of the FE. The resulting signal may output to a port for further processing such as pilot autocorrelation detection. As further shown in
The average power of a sequence, represented as r(n) may be written as:
If the signal doesn't undergo much change in N samples, one can approximate r(n)˜=r(n−N). Thus Eq. (1) may be re-written as
Eq. (2), therefore, maps correlation peak amplitude to received signal power.
b(n)=Σk=n−511nr(k)×r*(k−N) Eq. (3)
The value of 512 unit delay is used as an example only.
c(n)=Σk=n−L+1nb(k) Eq. (4)
The parameter L may be a programmable parameter. For example, L may be selected to be equal to the number of samples in CP and CS combined. This choice of L always avoid flat top for correlation peaks at all channel conditions. MA filter filters amplitude swings due to noise, by averaging over L samples.
E(n)=E(n−1)·α+(1−α)·b(n)·b*(n) Eq. (5a)
In the above equation, b(n) represents value at time n, α is an exponential window factor. It is a real number between 0 and 1, and E(n) represents power estimate at time n.
Initial Coarse Carrier Frequency Offset (CFO) Estimation and Correction.
Transmit & Receive VCOs are free running oscillators. Even if both the VCOs are set to identical operating points, the frequency deviation between them could be significant. For example, these oscillators can have a deviation as high as 22 ppm. For synchronization at the receiver, both these VCOs need be synchronized. Objective of the initial Frequency adjustment is to bring down this difference to less than a tenth of the original offset, for example 2 ppm. In some implementations, the symbol clock (e.g. 10 MHz) and carrier frequency (e.g., 3.6 GHz) are derived from the same VCO clock (e.g. 40 MHz). By synchronizing the VCOs of Transmitter and Receiver, symbol clock and carrier frequency synchronization can be achieved. A large VCO frequency offset will result in a symbol clock offset that is measurable in a fairly large observation window (e. g., 1 second).
With reference to
(xi,yi) for i=1,2, . . . ,N Eq. (5b)
The slope can be expressed as
Let tpilot denote the time interval between 2 consecutive pilot sub-frames, fexp denote the number of symbol clock cycles per second when the transmitter and receiver are synchronized and Δfc denotes the symbol clock frequency deviation between the transmitter and receiver, then it can be seen that Δfc is given by,
In some implementations, the carrier frequency may nominally be a large multiple of VCO frequency (e.g., 90 times the VCO frequency). Due to this multiplicative factor, any ‘mis-alignment’ in the VCO frequency will results in high carrier frequency offset. In some embodiments, the initial frequency estimation is based on VCO frequency drift measurement (as described in the previous section). The inaccuracy could still result in a fairly high carrier frequency offset. However, it has been found empirically that the above VCO estimation and correction usually results in a residual carrier offset error that is much less than half the sub-carrier width (for example <˜9 KHz (½* 1/512*1/(10*10{circumflex over ( )}6) for 10M symbols/second transmission)). Coarse CFO estimation/correction may be applied further, to bring down the carrier frequency offset to sub 100 Hz range.
Coarse Frequency Estimation and Correction
In
a(n)=Σk=n−CP−CS+1nr(k)×r*(k−N) Eq. (9)
The value N=512 may be used in some implementations. In some embodiments, the circuit shown in
In some embodiments, Δfc from multiple peaks may be averaged to get a better coarse CFO estimate. Further, Δfc computed from different receive chains can be averaged for better noise immunity. This carrier frequency error estimate can appropriately be scaled to obtain and correct the coarse VCO error.
Coarse Frame Boundary Detection
Correlation peaks, in general, may not be a very accurate metric. Frame boundary detection based on this technic may still be coarse. The boundary detected can be off by a few samples. This may not be a critical issue because the existence of CP protects against data loss.
Fine Frame Boundary Detection
Fractional Offset Delay Estimation and Correction
In general, channel impulse response can be such that the peak of the impulse response does not coincide with a sample boundary. To align the peak with a sample boundary, a fractional offset adjustment of the received samples should be performed. Once the phase offset it detected, the correction can be implemented with an appropriately sampled poly-phase filter. There are two mechanisms to determine this phase offset error.
One mechanism may be to use interpolation of the channel using sinc function and determining the peak and thus the fractional offset. The other mechanism is to perform band edge timing recovery (e.g., see
STO Error Estimation and STO Correction
Similarly
PLL Tracking
In some examples, the angle between I and Q of the auto-correlation peaks is proportional to the carrier frequency error (if the frequency error is less than ½ the rate of pilot occurrence). In some examples, after the coarse frequency correction, the residual frequency error is much less than this. Driving a 2nd order PLL using this error signal helps to track the carrier frequency. PLL error sampling frequency (the rate of pilot occurrence) is the inverse of pilot Frame Spacing. This is generally, very small compared to the sampling rate of the incoming data. This constrains the bandwidth of the PLL to be generally narrow. Additionally the correction has to be applied at the VCO level (at a much lower frequency than the carrier frequency). This reduces the applicable BW further. This causes the PLL to convergence slowly. As a result, the instantaneous frequency deviations due to Doppler cannot be effectively tracked.
A mathematical model for the auto-correlation of the received pilot signal may be developed as follows:
Denote pilot signals by P. Let channel have N taps with delay, Doppler and attenuation τi, vi, ai. Let the time between pilot columns be denoted as T. Pilot received at kT may be represented as:
Similarly, pilot received at (k+1)T may be represented as:
Correlating signals at kT and (k+1)T is obtained by taking the inner product of the above 2 terms. Mathematically,
corrn,m=exp(2πivn(t−τn))p(t−τn),exp(2πivm(t−τm))p(t−τm)
The above operation will result in 2 terms as below. The first term is a sinusoid that has oscillation frequency equal to the Doppler frequency. The amplitude of this term is a function of the channel magnitude (an). When the system is not carrier locked, the Doppler frequency will encompass the carrier frequency offset as well. However, when the carrier frequency offset is nil, this term will represent the Doppler frequency offset between the transmitter and receiver. The 2nd term is proportional to the Doppler frequency beats. Usually these beat frequencies will be quite low compared to the Doppler frequency in the system.
The beats (the second term in Eq. 15), may be removed using a low pass filter. This low-passed filtered error signal is sent to the PLL for tracking. In order to obtain a constant amplitude error signal, it is recommended to obtain the phase of the peaks of this signal and compute the equivalent frequency error and use it to drive the PLL.
PLL Tracking Using Pilot Autocorrelation Peaks
AGC Gain Adjustment
The process depicted in
As depicted in
As depicted in
Peak Detection State Machine
In some embodiments, the method 3200 includes calculating (3204) autocorrelation of the wireless signal using the wireless signal and a delayed version of the wireless signal that is delayed by a pre-determined delay, thereby generating an autocorrelation output. For example, the autocorrelation may be calculated by using a number of values of the pre-determined delay to obtain a functional relationship between amount of autocorrelation as a function of the delay. The method 3200 further includes processing (3206) the autocorrelation filter by applying a moving average filter to produce a fine timing signal. For example, the timing signal may be used to produce a clean autocorrelation peak signal independent of the channel response (for example, as discussed with respect to
In some implementations, the method 3200 further includes identifying frame boundaries for data transmissions based on the autocorrelation output. For example,
In some embodiments, the method 3200 may further include determining magnitudes of autocorrelation peaks. This determination may be performed using a curve representative of the magnitude of autocorrelation as a function of time delay. For example,
In some implementations, frame boundaries may be identified using a linear fit operation in which a linear approximation on the autocorrelation output. For example,
The method 3300 includes receiving an OTFS modulated signal (3302), performing initial AGC correction (3306; e.g., Step 1 of
In some embodiments, the method 3300 may further include determining magnitudes of autocorrelation peaks, and performing a gain adjustment based on the determined magnitudes of autocorrelation peaks. As described with respect to method 3200 and in the present document, an exponential windowing function may be used for the calculation of the autocorrelation peaks. In some embodiments, magnitudes of the autocorrelation peaks may be used to determine a symbol timing offset value for symbols in the OTFS modulated wireless signal.
In some implementations of method 3200 or 3300, an estimate of the carrier frequency in the OTFS signal that is received may be obtained and tracked using a phase-locked loop using the autocorrelation output. Some example embodiments are discussed with reference to
In some embodiments, another phase-locked loop may be used to track values of the gain adjustment that is used during the method 3300 to recover or extract information bits from the OTFS signal. The symbol timing offset value is calculated based on interpolating channel amplitude estimates or by performing band-edge timing recovery. Example embodiments are described with reference to
It will be appreciated that techniques for achieving accurate synchronization in OTFS receiver are disclosed. In one advantageous aspect, the disclosed techniques are robust to Doppler shifts in the received signals. In another advantageous aspect, successively finer synchronization and AGC is achieved using auto-correlation followed by a moving average.
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 (for e.g., T2080) and special purpose microprocessors (for e.g., MicroBlaze or ARC), 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.
This patent document is a continuation of U.S. patent application Ser. No. 16/645,585, filed Mar. 9, 2020, which is a 371 National Phase Application of PCT Application No. PCT/US2018/051199 entitled “ACHIEVING SYNCHRONIZATION IN AN ORTHOGONAL TIME FREQUENCY SPACE SIGNAL RECEIVER” filed on Sep. 14, 2018 which claims the benefit of priority U.S. Provisional Patent Application No. 62/559,398, filed on Sep. 15, 2017. The entire content of the before-mentioned patent application is incorporated by reference as part of the disclosure of this document.
Number | Name | Date | Kind |
---|---|---|---|
4754493 | Coates | Jun 1988 | A |
5083135 | Nagy et al. | Jan 1992 | A |
5182642 | Gersdorff et al. | Jan 1993 | 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 |
7058151 | Kim | Jun 2006 | B1 |
7327812 | Auer | Feb 2008 | B2 |
7392018 | Ebert et al. | Jun 2008 | B1 |
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 |
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 |
9661604 | O'Shea | May 2017 | B1 |
9667307 | Hadani et al. | May 2017 | B1 |
9668148 | Hadani et al. | May 2017 | B2 |
9712354 | Hadani et al. | Jul 2017 | B2 |
9722741 | Rakib et al. | Aug 2017 | B1 |
9729281 | Hadani et al. | Aug 2017 | B2 |
10651912 | Wang et al. | May 2020 | B2 |
10667148 | Hadani et al. | May 2020 | B1 |
10681568 | Hadani et al. | Jun 2020 | B1 |
10693581 | Rakib et al. | Jun 2020 | B2 |
10693692 | Hadani et al. | Jun 2020 | B2 |
10716095 | Rakib et al. | Jul 2020 | B2 |
10749651 | Hebron et al. | Aug 2020 | B2 |
10826728 | Tsatsanis et al. | Nov 2020 | B2 |
10855425 | Kons et al. | Dec 2020 | B2 |
10873418 | Kons et al. | Dec 2020 | B2 |
10886991 | Akoum et al. | Jan 2021 | B2 |
11050530 | Wang et al. | Jun 2021 | B2 |
11190308 | Namboodiri | Nov 2021 | 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 |
20040190438 | Maltsev | Sep 2004 | A1 |
20040218523 | Varshney et al. | Nov 2004 | A1 |
20050157778 | Trachewsky 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 |
20060008021 | Bonnet | Jan 2006 | A1 |
20060039270 | Strohmer et al. | Feb 2006 | A1 |
20070014272 | Palanki et al. | Jan 2007 | A1 |
20070038691 | Candes et al. | Feb 2007 | A1 |
20070078661 | Sriram et al. | Apr 2007 | A1 |
20070104283 | Han et al. | May 2007 | A1 |
20070110131 | Guess et al. | May 2007 | A1 |
20070133386 | Kim | Jun 2007 | A1 |
20070211952 | Faber et al. | Sep 2007 | A1 |
20070230403 | Douglas | Oct 2007 | A1 |
20070237181 | Cho et al. | Oct 2007 | A1 |
20070253465 | Muharemovic | Nov 2007 | A1 |
20070253504 | Hasegawa | Nov 2007 | A1 |
20070263752 | Guey et al. | Nov 2007 | A1 |
20080043857 | Dias et al. | Feb 2008 | A1 |
20080117999 | Kadous et al. | May 2008 | A1 |
20080186843 | Ma et al. | Aug 2008 | A1 |
20080187062 | Pan et al. | Aug 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 |
20090213943 | Gu | Aug 2009 | A1 |
20090222226 | Baraniuk et al. | Sep 2009 | A1 |
20090225741 | Wang | Sep 2009 | A1 |
20090225822 | Tupala | 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 |
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 | Riu et al. | Dec 2011 | A1 |
20120020439 | Belveze | Jan 2012 | 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 | 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 et al. | 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 |
20150003567 | Stadelmeier | Jan 2015 | A1 |
20150117395 | Hadani | Apr 2015 | A1 |
20150326273 | Rakib | Nov 2015 | A1 |
20150327085 | Hadani | Nov 2015 | A1 |
20150382231 | Jabbar et al. | Dec 2015 | A1 |
20160043835 | Hadani et al. | Feb 2016 | A1 |
20160135132 | Donepudi et al. | May 2016 | A1 |
20160149741 | Fujikura | 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 |
20160277230 | Zhu | 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 et al. | 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 |
20170288913 | Rakib et al. | Oct 2017 | A1 |
20170289961 | Rakib et al. | Oct 2017 | A1 |
20180109284 | Hadani et al. | Apr 2018 | A1 |
20180167165 | Kons et al. | Jun 2018 | A1 |
20180205481 | Rakib et al. | Jul 2018 | A1 |
20180227159 | Rakib et al. | Aug 2018 | A1 |
20180242170 | Hadani et al. | Aug 2018 | A1 |
20180262306 | Hadani et al. | Sep 2018 | A1 |
20180288809 | Delfeld et al. | Oct 2018 | A1 |
20180302802 | Fanfelle | Oct 2018 | A1 |
20190036577 | Delfeld et al. | Jan 2019 | A1 |
20190036741 | Hadani et al. | Jan 2019 | A1 |
20190044682 | Hebron et al. | Feb 2019 | A1 |
20190075551 | Hadani et al. | Mar 2019 | A1 |
20190081836 | Hadani | Mar 2019 | A1 |
20190159177 | Rakib et al. | May 2019 | A1 |
20190173617 | Kons et al. | Jun 2019 | A1 |
20190173630 | Kons et al. | Jun 2019 | A1 |
20190215109 | Hadani et al. | Jul 2019 | A1 |
20190238189 | Delfeld et al. | Aug 2019 | A1 |
20190327054 | Kons et al. | Oct 2019 | A1 |
20190342126 | Hadani et al. | Nov 2019 | A1 |
20190342136 | Hadani et al. | Nov 2019 | A1 |
20190379422 | Hadani et al. | Dec 2019 | A1 |
20200045562 | Hadani et al. | Feb 2020 | A1 |
20200119868 | Rakib et al. | Apr 2020 | A1 |
20200137774 | Molisch et al. | Apr 2020 | A1 |
20200145273 | Rakib et al. | May 2020 | A1 |
20200153107 | Rakib | May 2020 | A1 |
20200186397 | Tsatsanis et al. | Jun 2020 | A1 |
20200204309 | Namboodiri | Jun 2020 | A1 |
20200204410 | Hadani | Jun 2020 | A1 |
20200228170 | Delfeld et al. | Jul 2020 | A1 |
20200259604 | Hadani et al. | Aug 2020 | A1 |
20200259692 | Hadani et al. | Aug 2020 | A1 |
20200259697 | Delfeld | Aug 2020 | A1 |
20200280138 | Fanfelle et al. | Sep 2020 | A1 |
20200287672 | Namboodiri | Sep 2020 | A1 |
20200288333 | Rakib et al. | Sep 2020 | A1 |
20200305010 | Hadani et al. | Sep 2020 | A1 |
20200313695 | Namboodiri et al. | Oct 2020 | A1 |
20200313949 | Hadani | Oct 2020 | A1 |
20200322185 | Kons et al. | Oct 2020 | A1 |
20200322202 | Hadani et al. | Oct 2020 | A1 |
20200351836 | Rakib et al. | Nov 2020 | A1 |
20200367252 | Hebron et al. | Nov 2020 | A1 |
20200389268 | Sathyanarayan et al. | Dec 2020 | A1 |
20200403829 | Namboodiri et al. | Dec 2020 | A1 |
20210028877 | Rakib et al. | Jan 2021 | A1 |
20210036823 | Hebron et al. | Feb 2021 | A1 |
20210058114 | Molisch et al. | Feb 2021 | A1 |
20210077625 | Kons et al. | Mar 2021 | A1 |
20210105155 | Kons et al. | Apr 2021 | A1 |
20210126750 | Kons et al. | Apr 2021 | A1 |
20210135905 | Kons et al. | May 2021 | A1 |
20210194732 | Kons et al. | Jun 2021 | A1 |
20220158780 | Namboodiri | May 2022 | A1 |
Number | Date | Country |
---|---|---|
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 |
2017011455 | Jan 2017 | WO |
2017011478 | Jan 2017 | WO |
2017044501 | Mar 2017 | WO |
2017087706 | May 2017 | WO |
2017100666 | Jun 2017 | WO |
2017147439 | Aug 2017 | WO |
2017165697 | Sep 2017 | WO |
2017173160 | Oct 2017 | WO |
2017173389 | Oct 2017 | WO |
2017201467 | Nov 2017 | WO |
2018031938 | Feb 2018 | WO |
2018031952 | Feb 2018 | WO |
2018032016 | Feb 2018 | WO |
2018064587 | Apr 2018 | WO |
2018064605 | Apr 2018 | WO |
2018106731 | Jun 2018 | WO |
2018129554 | Jul 2018 | WO |
2018140837 | Aug 2018 | WO |
2018191309 | Oct 2018 | WO |
2018195548 | Oct 2018 | WO |
2018200567 | Nov 2018 | WO |
2018200577 | Nov 2018 | WO |
2019014332 | Jan 2019 | WO |
2019032142 | Feb 2019 | WO |
2019032605 | Feb 2019 | WO |
2019036492 | Feb 2019 | WO |
2019051093 | Mar 2019 | WO |
2019051427 | Mar 2019 | WO |
2019055861 | Mar 2019 | WO |
2019068053 | Apr 2019 | WO |
2019060596 | May 2019 | WO |
2019089986 | May 2019 | WO |
2019113046 | Jun 2019 | WO |
2019157230 | Aug 2019 | WO |
2019173775 | Sep 2019 | WO |
2019241436 | Dec 2019 | WO |
2019241589 | Dec 2019 | WO |
2020142520 | Jul 2020 | WO |
2020206304 | Oct 2020 | WO |
2020227619 | Nov 2020 | WO |
2020247768 | Dec 2020 | WO |
2021026212 | Feb 2021 | WO |
2021062354 | Apr 2021 | WO |
Entry |
---|
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. |
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). |
“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 Co-Pending Chinese Application No. 201880060120.7, dated May 7, 2022, 13 pages with unofficial translation. |
Co-pending Chinese Patent Application No. 201880060120.7, filed Sep. 14, 2018, Notice to Grant Patent Right dated Jan. 5, 2023, 2 pages. |
Number | Date | Country | |
---|---|---|---|
20220158780 A1 | May 2022 | US |
Number | Date | Country | |
---|---|---|---|
62559398 | Sep 2017 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16645585 | US | |
Child | 17456843 | US |