Granted Patent B2

US 9,231,677 · App. 13/790,011 · Granted Jan 5, 2016

Abstract

Claims (50)

1. A communication method comprising:

receiving a complex vector, y, corresponding to a transmitted sparse-space codeword, at M receive antennas;

processing the received complex vector and a plurality of candidate received sparse-space codewords, wherein the processing comprises:

constructing a set of candidate transmit sparse-space code words by permuting over all possible combinations of S constellation symbols paired with all known S-sparse vectors of lenght N;

computing a location of said received vector in a complex space of dimension M; and

computing a distance between the location of said received complex vector and a location of each candidate received sparse-space codeword in said complex space.

2. The method of claim 1 , wherein the positions of non-zero elements in each known S-sparse vector are occupied by each possible combination; generating the set of candidate received sparse-space codewords by mapping the set of candidate transmit codewords using a channel estimation matrix.

3. The method of claim 1 wherein the processing of said complex vector codeword comprises: generating matrix data corresponding to a MxN channel estimate matrix, where M corresponds to the number of receive antennas and N corresponds to the number of transmit antennas.

4. The method of claim 3 , further comprising:

normalizing each of the candidates;

computing inner product of the received codeword with each normalized candidate;

ranking the inner products by magnitude from largest to smallest;

identifying a non-zero position in the transmit codeword as the index of a normalized candidate which yielded the highest ranking inner product;

augmenting an estimated basis with the column, h, of the channel estimation matrix producing the highest ranking;

using the basis to estimate a complex scalar associated with the identified column h; and

comparing the complex scalar with all possible constellation symbols to identify a selected constellation symbol, x.

5. The method of claim 4 , further comprising:

forming a new working value y by subtracting h times x from the present working value y;

operating on y to identify a column of the channel estimation matrix other than h with which to augment the basis; and

operating on y with the augmented basis to identify a second selected constellation symbol.

6. The method of claim 4 , further comprising:

identifying a non-zero position in the transmit codeword as the index of the runner-up column which yielded the second highest ranking;

augmenting an estimated basis with the runner-up column;

using the basis to estimate a complex scalar associated with the runner-up column; and

comparing the complex scalar with all possible constellation symbols to identify a runner-up constellation symbol.

7. A communication device comprising:

processing logic configured to:

receive a complex vector, y, corresponding to a transmitted sparse-space codeword, at M receive antennas;

process the received complex vector and a plurality of candidate received sparse-space codewords, wherein the processing comprises:

constructing a set of candidate transmit sparse-space code words by permuting over all possible combinations of S constellation symbols paired with all known S-spare vectors of length N; and

computing a location of said received vector in a complex space of dimension M and computing a distance between the location of said received complex vector and a location of each candidate received sparse-space codeword in said complex space.

8. The communication device of claim 7 , the positions of non-zero elements in each known S-sparse vector are occupied by each possible combination; generating the set of candidate received sparse-spaced codewords by mapping the set of candidate transmit codewords using a channel estimation matrix.

9. The communication device of claim 7 wherein the processing of said complex vector codeword comprises: generating matrix data corresponding to a MxN channel estimate matrix, where M corresponds to the number of transmit antennas and N corresponds to the number receive of antennas.

10. The communication device of claim 9 wherein said processing logic is further configured to:

normalize each of the candidates;

compute inner product of the received codeword with each normalized candidate;

rank the inner products by magnitude from largest to smallest;

identify a non-zero position in the transmit codeword as the index of a normalized candidate which yielded the highest ranking inner product;

augment an estimated basis with the column, h, of the channel estimation matrix producing the highest ranking;

use the basis to estimate a complex scalar associated with the identified column h; and

compare the complex scalar with all possible constellation symbols to identify a selected constellation symbol, x.

11. The communication device of claim 10 , wherein said processing logic is further configured to:

generate a new working value y by subtracting h times x from the present working value y;

operate on y to identify a column of the channel estimation matrix other than h with which to augment the basis; and

operate on y with the augmented basis to identify a second selected constellation symbol.

12. The communication device of claim 11 , wherein said processing logic is further configured to:

identify a non-zero position in the transmit codeword as the index of the runner-up column which yielded the second highest ranking;

augment an estimated basis with the runner-up column;

use the basis to estimate a complex scalar associated with the runner-up column; and

compare the complex scalar with all possible constellation symbols to identify a runner-up constellation symbol.

Assignments (9)