Iterative channel estimation and equalization with superimposed reference signals

Information

  • Patent Grant
  • 10938602
  • Patent Number
    10,938,602
  • Date Filed
    Friday, May 19, 2017
    7 years ago
  • Date Issued
    Tuesday, March 2, 2021
    3 years ago
Abstract
In a transmitter apparatus, a known reference signal is superimposed on top of a data signal that is typically not known a priori to a receiver and the combined signal is transmitted. At a receiver, an iterative channel estimation and equalization technique is used to recover the reference signal and the unknown data signal. In the initial iteration, the known reference signal is recovered by treating the data signal as noise. Subsequent iterations are used to improve estimation of received reference signal and the unknown data signal.
Description
TECHNICAL FIELD

The present document relates to wireless communication, and more particularly, transmission and reception of reference signals in single-input-single-output (SISO) and multiple-input-multiple-output (MIMO) systems.


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 techniques for reduced overhead transmission and reception of reference signals that may be used for channel estimation.


In one example aspect, a transmitter-side technique for generating and transmitting a reference signal and information bits by superimposing on top of each other. The technique includes receiving information bits for transmission, performing encoding operation on the information bits to generate encoded information bits, mapping the encoded information bits to symbols of a constellation to generate a sequence of symbols, generating an output signal for transmission by either (a) first superimposing a reference signal on the sequence of symbols to generate a composite signal and by modulating the composite signal into the output signal, or (b) first modulating the sequence of symbols to produce a modulated signal and by superimposing the reference signal over the modulated signal to generate the output signal. The superimposing the reference signal refrains from increasing transmission bandwidth required for transmission of the output signal.


In another example aspect, a receiver-side technique is disclosed. The technique includes (A) generating a channel estimate using the known reference signal and received and demodulated signal, (B) using the channel estimate to equalize the channel, thereby producing an estimation of the data symbols and the superimposed reference signal, (C) removing the known reference signal from the estimation obtained in Step (B), (D) decoding data output after removing the known reference signal in Step (C) thereby generating estimation on the unknown data signal and extrinsic estimations on the encoded symbols, (E) applying the channel estimate on the estimation of the unknown data signal and subtracting resulting signal from the received samples to generate a revised estimate of received reference signal, (F) generating a new channel estimation using the revised estimate of the received reference signal, and (G) iterating Step (B) to step (G) until an exit criteria is met.


In another example aspect, a receiver side technique is disclosed. The technique includes (A) generating a channel estimate using the known reference signal and by demodulating the signal, (B) applying the channel estimate obtained in Step (A) to the known reference signal and subtracting the result from the received signal, (C) using the channel estimate to equalize the signal obtained in Step (B), thereby producing an estimation of the data symbols, (D) decoding data output thereby generating estimation of the unknown data signal and extrinsic estimations of encoded symbols in the signal, (E) applying the channel estimate to the estimation of the unknown data signal and subtracting resulting signal from the received signal to generate a revised estimate of the received reference signal, (F) generating a new channel estimation using the revised estimate of the received reference signal, and (G) iterating Step (B) to step (G) until an exit criteria is met.


In another example aspect, a receiver-side technique is disclosed. The technique includes (A) generating a channel estimate using the known reference signal and by demodulating the signal; (B) using the channel estimate to equalize the channel, and subtracting the known reference signal therefrom; (C) producing an estimation of the data symbols from signal resulting from subtracting in in Step (B); (D) decoding data output from the estimation of the data symbols obtained in step (C), thereby generating estimation on the unknown data signal and extrinsic estimations of encoded symbols in the signal; (E) applying the channel estimate on the estimation of the unknown data signal and subtracting resulting signal from the received samples to generate a revised estimate of the received reference signal; (F) generating a new channel estimation using the revised estimate of the received reference signal; and (G) iterating Step (B) to step (G) until an exit criteria is met.


In another example aspect, a receiver-side technique is disclosed. The technique includes (A) generating a channel estimate using the known reference signal and received demodulated signal, (B) applying the channel estimate on the known reference signal and removing it from the received demodulated signal, (C) using the channel estimate to equalize the channel, thereby producing an estimation of the data symbols, (D) decoding data output thereby generating estimation on the unknown data signal and extrinsic estimations on the encoded symbols, (E) applying the channel estimate on the estimation of the unknown data signal and subtracting resulting signal from the received samples to generate a revised estimate of received reference signal, (F) generating a new channel estimation using the revised estimate of the received reference signal, and (G) iterating Step (B) to step (G) until an exit criteria is met.


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





BRIEF 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 shows an example of a transmitter embodiment.



FIG. 3 shows another example of a transmitter embodiment.



FIG. 4 shows an example of a receiver embodiment.



FIG. 5 is a flowchart depiction of an example of an iterative channel estimation and equalization method.



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



FIG. 7A shows a flowchart of another example wireless communication reception method.



FIG. 7B shows a flowchart of another example wireless communication reception method.



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





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.


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.


Many communication systems use reference signals (sometimes also called pilot symbols), which are pre-determined signals that are transmitted over the channel and used in the receiver to improve the quality of reception by allowing estimation of unknown parameters such as channel response, frequency offset, etc. These signals are typically separated from the information data signals and require additional resources such as bandwidth or throughput.


This document addresses the problem of training signal (or pilot signal) overhead that is required in wireless communication systems in order for the receiver to estimate the channel. This overhead increases significantly for fast varying channels found in cases of high mobility. Further, this overhead increases significantly with large numbers of transmit and receive antennas in MIMO (Multiple-Input-Multiple-Output) systems, since each information stream transmitted over the MIMO system typically requires a separate set of pilot signals. Due to these difficulties in channel estimation, current systems and prior art limit MIMO transmission to low mobility use cases.


Using the techniques described in the present document, some embodiments may implement a transmission scheme in which the reference signals are super-imposed on the information data signals and therefore do not require any additional bandwidth or throughput. The present document also provides, among other things, a method for channel estimation and equalization using pilots that are overlaid on the data on the same time and bandwidth resources eliminating the need for pilot bandwidth overhead.


Some implementations of the disclosed technique may be incorporated into a system that includes a transmitter, an unknown channel and a receiver. One example method disclosed herein provides ways for joint channel estimation and equalization without any loss of bandwidth or throughput.



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.


Example Transmitter Embodiments

The transmitter encodes information data and maps the encoded bits to data symbols. FIG. 2 shows an example transmitter embodiment 201 in which known reference signal 203 is super-imposed on the data signal before modulation. The data is received by an encoder 205 that performs data encoding and produces encoded data output. The encoded data output is converted into symbols by a symbol mapper 207. The super-imposition operation is performed by the module 211. The superimposed signal is then modulated using a modulator 209 and the output is upconverted and transmitted over the transmission medium using one or more antennas. By super-imposing the reference signal on the data signal, there is no loss of bandwidth of throughput comparing to only transmitting the data symbols.



FIG. 3 shows an example transmitter embodiment 301 in which a known reference signal is super-imposed on the data signal after modulation.


Examples of Transmission Channel

The signal is transmitted over an unknown channel, such as a fading wireless channel. Various mathematical models are known to one of skill in the art.


Example Receiver Embodiments and Reception Methods


FIG. 4 shows an example receiver apparatus 401. The receiver 401 jointly estimates the channel, equalizes it and decodes the data symbols to generate estimates of the information data. The receiver 401 includes one or more antennas that receive signal over the wireless channel and demodulate the received signal to generate a symbol stream. The symbol stream is fed into a channel equalizer that uses results from channel estimation to equalize the channel and generate channel equalized signal. The known reference signal is locally generated and is coupled to a subtracter that removes the reference signal from the channel equalized signal. The output of the subtraction is fed into a symbol demapper. The output of the demapper is input to a decoder that decodes data bits. The decoder also provides its output to a symbol mapper, whose output is fed back to the channel estimation process, as further described below.


The receiver 401 iteratively performs the following operations. The numbering of operations matches the numbering provided in FIG. 4 example.


(1) Generate an initial estimation of the channel using the known reference signal and the received demodulated signal. In this step, the data symbols which are super-imposed on the reference signal are treated as noise.


(2) Use the channel estimation from the previous step to equalize the channel. The result is an estimation of the data symbols and the reference signal.


(3) Remove the known reference signal from the equalized data of step 2.


(4) Decode the data output of step 3. Generate estimation on the source information data and extrinsic estimations on the encoded symbols.


(5) Apply the channel estimation (from steps 1 or 6) on the estimated encoded symbols (step 4) and subtract the result from the received samples, to generate a new and cleaner received reference signal.


(6) Generate a new channel estimation using the reference signal of step 5.


Go to step 2. The iteration is terminated when an exit criterion is met. In some embodiments, the receiver 401 may also include an arrangement in which the output of symbol mapper is connected to the channel estimation module and may be used to improve channel estimates at time-frequency locations where no reference signals are sent.



FIG. 5 is a flowchart depiction of an example method 501 of signal reception. The method 501 may be implemented by a receiver apparatus in a wireless communication system. For example, the receiver 102 may implement the method 501.


At 503, prior probabilities of the transmitted data are initialized. For example, the initialization operation may include accessing previously calculated probabilities stored in a local memory. These probabilities may have been computed in a previous iteration of method 501. At 505, estimated data may be subtracted, or removed, from the received waveform. At 507, channel estimation may be performed from the result of data subtraction. At 509, based on the results of channel estimate, the channel transfer function may be equalized and the transmitted data probabilities are updated (e.g., for subsequent use in a next iteration of operation 503).


At 513, data decoding is performed. The output of the data decoding may be used for deciding whether or not to perform additional iterations to improve the receiver operation. At 511, a check is made regarding a termination condition for the method 501. For example, a check may be made for whether a maximum number of iterations has been performed. Other possible conditions may include passage of an allotted amount of time or improvement in data estimates in successive iterations falling below an improvement threshold or being able to successfully decode and recover data in Step 513. As per the decision in 513, a next iteration of data estimation is performed starting at operation 505.



FIG. 6 is a flowchart of a method 200 implemented at a transmitter for generating and transmitting a reference signal and information bits by superimposing on top of each other.


The method 200 includes receiving (202) information bits for transmission. The information bits may form data symbols and may be generated by, e.g., user applications and thus be generally unknown a priori to the transmitter and the receiver.


The method 200 includes performing (204) encoding operation on the information bits to generate encoded information bits. Various encoding operations are known in the art to increase data protection, e.g., error correction coding. The encoding operation may also include bandwidth improving operations that reduce inter-data bit transitions (e.g., NRZ coding, differential coding, gray coding, etc.).


The method 200 includes mapping (206) the encoded information bits to symbols of a constellation to generate a sequence of symbols. Various symbol mapping techniques may be used to map to QAM or QPSK constellations. In general, the transmission system may map a vector of input data bits on to a SISO or an MIMO OFDM symbols.


The method 200 includes generating (208) an output signal for transmission by either (a) first superimposing a reference signal on the sequence of symbols to generate a composite signal and by modulating the composite signal into the output signal, or (b) first modulating the sequence of symbols to produce a modulated signal and by superimposing the reference signal over the modulated signal to generate the output signal. The superimposing the reference signal refrains from increasing transmission bandwidth required for transmission of the output signal. The resulting composite signal is the transmitted on a wireless channel.



FIG. 7A depicts a flow chart for a receiver-side method 300 of receiving signals.


The method 300 includes (A) generating (302) a channel estimate using the known reference signal and received demodulated signal. In some embodiments, reference signals may be sent only on a subset of all time-frequency locations. In such embodiments, the method 300 may include interpolating channel estimates at the locations of the reference signal to other time-frequency locations where reference signal is not present. In some embodiments, the channel estimates at these location may be improved by using feedback based on data estimates from previous iterations.


The method 300 includes (B) using the channel estimate to equalize the channel, thereby producing (304) an estimation of the received symbols, e.g., data symbols and the superimposed reference signal.


The method 300 includes (C) removing (306) the known reference signal from the estimation obtained in Step (B), (D) decoding data output after removing the known reference signal in Step (C) thereby generating estimation on the unknown data signal and extrinsic estimations on the encoded symbols.


The method 300 further includes (E) applying the channel estimate on the estimation of the unknown data signal and subtracting resulting signal from the received samples to generate a revised estimate of received reference signal (308).


The method 300 also includes (F) generating a new channel estimation using the revised estimate of the received reference signal (310).


The method 300 may iterate the previous steps until an exit criteria is met. The exit criteria may be, e.g., number of iterations performed, a time budget allocated for the iterative process, resources available for the computations, whether or not there is sufficient improvement over the previous iteration, etc. The exit criteria may also be error-free decoding of the unknown information signal.


In an alternate method 350 to method 300, as depicted in the flowchart of FIG. 7B, after channel estimation (352), the reference signal may be removed from the received signal (354) by applying the channel estimate to the reference signal and subtracting thus estimated contribution of the reference signal from the receiving signal. At this point, the subsequent channel equalization will thus provide estimation of the data symbol portion (356) of the received signal. This step may be followed by a decoding operation to generate data estimates (358) and the data estimates may be used to revise the estimate of the received reference signal (360). Such alternative processing flow may be obtained, e.g., by reversing order of Step (B) and Step (C) described with respect to method 300.


Alternatively, in methods 300 and 350, steps 310 and 360 could be modified to use the estimates of received data may be used in addition to or in lieu of the estimates of reference signals.


In some embodiments, a receiver-side method includes (A) generating a channel estimate using the known reference signal and received demodulated signal, (B) applying the channel estimate on the known reference signal and removing it from the received demodulated signal, (C) using the channel estimate to equalize the channel, thereby producing an estimation of the data symbols, (D) decoding data output thereby generating estimation on the unknown data signal and extrinsic estimations on the encoded symbols, (E) applying the channel estimate on the estimation of the unknown data signal and subtracting resulting signal from the received samples to generate a revised estimate of received reference signal, (F) generating a new channel estimation using the revised estimate of the received reference signal, and (G) iterating Step (B) to step (G) until an exit criteria is met.



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


The methods described herein can be used in an OFDM (orthogonal frequency division multiplexing) or OTFS (orthogonal time frequency space modulation) system. The known reference signal can be added to the data symbols in the delay-Doppler plane (in OTFS) or in the time-frequency plane (in OFDM and OTFS). It may also be defined over the whole plane or part of it.


In some embodiments, the methods described herein may be embodied in the form of code and stored into memory of a wireless apparatus. The wireless apparatus may also include a processor that reads the instructions from the memory and implements the corresponding method.


It will be appreciated that techniques for wireless data reception are disclosed in which reference signal superimposed on top of data signal are transmitted and are received at a receiver. It will further be appreciated that, in one advantageous aspect, the disclosed technique reduces transmission resource overhead required for transmission of test signals, reference signals or pilots in a convention digital communication system.


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 at a receiver-side, for receiving over a channel a signal comprising a known reference signal superimposed on an unknown data signal; comprising: (A) generating a channel estimate using the known reference signal and by demodulating the signal;(B) using the channel estimate to equalize the channel, thereby producing an estimation of the data symbols and the superimposed reference signal;(C) removing the known reference signal from the estimation obtained in Step (B);(D) decoding data output after removing the known reference signal in Step (C) thereby generating estimation of the unknown data signal and extrinsic estimations of encoded symbols in the signal;(E) applying the channel estimate to the estimation of the unknown data signal and subtracting resulting signal from the received signal to generate a revised estimate of the received reference signal;(F) generating a new channel estimation using the revised estimate of the received reference signal; and(G) iterating Step (B) to step (G) until an exit criteria is met.
  • 2. The method of claim 1, wherein the exit criteria comprises exceeding a number of iterations.
  • 3. The method of claim 1, wherein the exit criteria comprises achieving an error-free decoding of the unknown data signal.
  • 4. The method of claim 1, wherein in Step (A), the unknown data signal superimposed on the known reference signal are treated as noise.
  • 5. The method of claim 1, wherein, in Step (A), the generating the channel estimate includes interpolating estimates at time-frequency locations where there is no known reference signal present.
  • 6. The method of claim 5, wherein the interpolating includes using feedback information from a prior iteration to estimate the channel at the time-frequency locations where there is no known reference signal present.
  • 7. A wireless communication method, implemented at a receiver-side, for receiving over a channel a signal comprising a known reference signal superimposed on an unknown data signal; comprising: (A) generating a channel estimate using the known reference signal and by demodulating the signal;(B) applying the channel estimate obtained in Step (A) to the known reference signal and subtracting the result from the received signal;(C) using the channel estimate to equalize the signal obtained in Step (B), thereby producing an estimation of the data symbols;(D) decoding data output thereby generating estimation of the unknown data signal and extrinsic estimations of encoded symbols in the signal;(E) applying the channel estimate to the estimation of the unknown data signal and subtracting resulting signal from the received signal to generate a revised estimate of the received reference signal;(F) generating a new channel estimation using the revised estimate of the received reference signal; and(G) iterating Step (B) to step (G) until an exit criteria is met.
  • 8. The method of claim 7, wherein the exit criteria comprises exceeding a number of iterations.
  • 9. The method of claim 7, wherein the exit criteria comprises achieving an error-free decoding of the unknown data signal.
  • 10. The method of claim 7, wherein in Step (A), the unknown data signal superimposed on the known reference signal are treated as noise.
  • 11. The method of claim 7, wherein, in Step (A), the generating the channel estimate includes interpolating estimates at time-frequency locations where there is no known reference signal present.
  • 12. The method of claim 11, wherein the interpolating includes using feedback information from a prior iteration to estimate the channel at the time-frequency locations where there is no known reference signal present.
  • 13. A wireless communication method, implemented at a receiver-side, for receiving a signal comprising a known reference signal superimposed on an unknown data signal over a channel; comprising: (A) generating a channel estimate using the known reference signal and by demodulating the signal;(B) using the channel estimate to equalize the channel, and subtracting the known reference signal therefrom;(C) producing an estimation of the data symbols from signal resulting from subtracting in Step (B);(D) decoding data output from the estimation of the data symbols obtained in step (C), thereby generating estimation on the unknown data signal and extrinsic estimations of encoded symbols in the signal;(E) applying the channel estimate on the estimation of the unknown data signal and subtracting resulting signal from the received samples to generate a revised estimate of the received reference signal;(F) generating a new channel estimation using the revised estimate of the received reference signal; and(G) iterating Step (B) to step (G) until an exit criteria is met.
  • 14. The method of claim 13, wherein the exit criteria comprises exceeding a number of iterations.
  • 15. The method of claim 13, wherein the exit criteria comprises achieving an error-free decoding of the unknown data signal.
  • 16. The method of claim 13, wherein in Step (A), the unknown data signal superimposed on the known reference signal are treated as noise.
  • 17. A wireless communication method, implemented at a receiver-side, for receiving a signal comprising a known reference signal superimposed on an unknown data signal over a channel; comprising: (A) generating a channel estimate using the known reference signal and by demodulating the signal;(B) applying the channel estimate obtained in Step (A) to the known reference signal and subtracting the result from the received signal;(C) using the channel estimate to equalize the signal obtained in Step (B), thereby producing an estimation of the data symbols;(D) decoding data output from the estimation of the data symbols obtained in step (C), thereby generating estimation on the unknown data signal and extrinsic estimations of encoded symbols in the signal;(E) applying the channel estimate on the estimation of the unknown data signal and subtracting resulting signal from the received samples to generate a revised estimate of the received reference signal;(F) generating a new channel estimation using the revised estimate of the received reference signal; and(G) iterating Step (B) to step (G) until an exit criteria is met.
  • 18. The method of claim 17, wherein the exit criteria comprises exceeding a number of iterations.
  • 19. The method of claim 17, wherein the exit criteria comprises achieving an error-free decoding of the unknown data signal.
  • 20. The method of claim 17, wherein in Step (A), the unknown data signal superimposed on the known reference signal are treated as noise.
CROSS REFERENCE TO RELATED APPLICATIONS

This patent document is a 371 National Phase Application of PCT Application No. PCT/US2017/033632 entitled “ITERATIVE CHANNEL ESTIMATION AND EQUALIZATION WITH SUPERIMPOSED REFERENCE SIGNALS” filed on May 19, 2017 which claims priorities to and benefits of U.S. Provisional Application No. 62/339,476 entitled “ITERATIVE CHANNEL ESTIMATION AND EQUALIZATION WITH SUPERIMPOSED REFERENCE SIGNALS” filed on May 20, 2016. The entire contents of the aforementioned patent applications are incorporated by reference as part of the disclosure of this patent document.

PCT Information
Filing Document Filing Date Country Kind
PCT/US2017/033632 5/19/2017 WO 00
Publishing Document Publishing Date Country Kind
WO2017/201467 11/23/2017 WO A
US Referenced Citations (186)
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
6751273 Park Jun 2004 B1
6952394 Kim Oct 2005 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
9172413 Chen Oct 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
20040013084 Thomas Jan 2004 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
20050018794 Tang Jan 2005 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
20050226341 Sun Oct 2005 A1
20050251844 Martone et al. Nov 2005 A1
20060008021 Bonnet Jan 2006 A1
20060039270 Strohmer et al. Feb 2006 A1
20060203771 Molev-Shteiman Sep 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
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
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
20090222226 Baraniuk et al. Sep 2009 A1
20090268803 Merched Oct 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
20100111157 Sawai 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
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
20130121393 Fang May 2013 A1
20130121497 Smaragdis et al. May 2013 A1
20130230010 Kim et al. Sep 2013 A1
20130260787 Hashimoto Oct 2013 A1
20130279558 Tang 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
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 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
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 (69)
Entry
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.
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. 4, 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.
Related Publications (1)
Number Date Country
20200322185 A1 Oct 2020 US
Provisional Applications (1)
Number Date Country
62339476 May 2016 US