OFDM networks with pseudo-random phase precoding
View Patent ↗In an orthogonal frequency division multiplexing (OFDM) network, a set of pseudo random sequences (PRS) are stored at a transmitter and a receiver. Each OFDM symbol is mapped to subcarriers for a set of transmit antennas to produce a mapped symbol. The mapped symbol is encoded using a pseudo-random phase precoder (PRPP) and the PRS to produce a precoded symbol. An inverse fast Fourier transform (IFFT) is applied to the precoded symbol, and the encoded symbol is transmitted to the receiver using the set of transmit antennas.
1. A method for communicating symbols in a network including a transmitter and a receiver, wherein the network uses orthogonal frequency division multiplexing (OFDM), wherein the transmitter has a set of transmit antenna, and wherein the receiver has a set of receive antennas, comprising:
storing a set of pseudo random sequences (PRS) at the transmitter and the receiver;
mapping each symbol to subcarriers for the set of transmit antennas to produce a mapped symbol;
encoding the mapped symbol using a pseudo-random phase precoder (PRPP) and the PRS to produce a precoded symbol, wherein the PRPP uses a K-by-K pseudo-random phase precoding (PRPP) matrix W n at time n, where a number of channels is K, p denotes a row index and q denotes a column index of the matrix W n , and an element (p, q) in the matrix W n is exp(j*θ(p, q))/√{square root over (K)}, where θ(p, q) is a pseudo-randomly phase generated by the PRS uniformly distributed between −π and π;
applying an inverse fast Fourier transform (IFFT) to the precoded symbol; and
transmitting the encoded symbol to the receiver using the set of transmit antennas.
2. The method of claim 1 , wherein the network is a single-input and multiple-output (SIMO) network.
3. The method of claim 1 , wherein the network is a multiple-input and multiple-output (MIMO) network.
4. The method of claim 1 , further comprising:
receiving the encoded symbol at the set of receive antennas;
applying a fast Fourier transform to the received symbol to produce a transformed symbol;
applying an iterative likelihood search (ILS) procedure to the transformed symbol using the PRS to produce a detected symbol;
de-mapping the detected symbol.
5. The method of claim 1 , wherein the PRPP deliberately introduces inter-channel interference.
6. The method of claim 1 , wherein the receiver is a linear minimum mean-square error (LMMSE) receiver.
7. The method of claim 1 , wherein the receiver is a zero-forcing (ZF) receiver.
8. The method of claim 6 , wherein the receiver is the LMMSE receiver uses ordered successive interference cancellation (SIC) techniques.
9. The method of claim 6 , wherein the receiver is a matched-filter receiver.
10. The method of claim 6 , where the receiver uses a tabu search procedure with the LMMSE as an initial vector.
11. The method of claim 7 , where the receiver is a tabu search procedure with the ZF as an initial vector.
12. The method of claim 1 , where the receiver uses a tabu search procedure with matched-filter as an initial vector.
13. The method of claim 6 , where the receiver uses a reactive tabu search procedure with the LMMSE as an initial vector.
14. The method of claim 7 , where the receiver uses a reactive tabu search procedure with the ZF as an initial vector.
15. The method of claim 1 , where the receiver uses a reactive tabu search procedure with matched-filter as an initial vector.
16. The method of claim 6 , where the receiver uses a generalized probabilistic data association (GPDA) procedure with the LMMSE as the initial vector.
17. The method of claim 16 , where the receiver uses the GPDA procedure zero forcing as the initial vector.
18. The method of claim 16 , where the receiver uses the a GPDA procedure with matched-filter as the initial vector.