Fast space-time decoding using soft demapping with table look-up
View Patent ↗From potential symbol combinations transmitted from a transmitter, Euclidean distances between the received signals and the symbol vectors are determined in light of the corresponding channel responses and stored in a Euclidean distance table, from which the smallest Euclidean distance is selected as a hard decision. The hard decision is used to find a bit vector corresponding to the estimated symbol vector associated with the hard decision. For each bit in the bit vector, a reduced Euclidean distance table is created to include only Euclidean distances associated with a competing bit associated with the hard decision. The minimum Euclidean distance from each reduced Euclidean distance table becomes a soft demapping decision for a corresponding bit. Log likelihood ratios for each bit are determined by the difference between the hard decision and respective soft demapping decisions. The differences are provided to a channel decoder to recover the originally transmitted bits.
1. A method comprising:
a) providing a symbol vector table comprising symbol vectors corresponding to potential combinations of transmitted symbols;
b) determining first Euclidean distances between a received signal and a plurality of the symbol vectors in light of corresponding channel responses;
c) selecting a first smallest distance from the first Euclidean distances as a hard decision;
d) determining a bit vector corresponding to the first smallest distance; and
e) for each bit in the bit vector:
i) selecting second Euclidean distances corresponding to a competing bit from the first Euclidean distances; and
ii) selecting a competing smallest distance from the second Euclidean distances as a soft demapping value.
2. The method of claim 1 wherein for each bit in the bit vector, further comprising determining a difference between the hard decision and the corresponding soft demapping value.
3. The method of claim 2 wherein the difference is a log likelihood ratio.
4. The method of claim 2 further comprising decoding the differences for each bit using channel decoding to recover transmitted bits.
5. The method of claim 1 wherein the first Euclidean distances are calculated using:
{
∑
i
=
1
N
r
i
-
∑
j
=
1
M
h
ij
s
j
2
}
,
such that r is the received signal, s i is a symbol vector, h ij is a channel response vector, N is a number of receiver antennas, and M is a number of transmitter antennas.
6. The method of claim 5 wherein the channel decoding is Turbo decoding.
7. The method of claim 1 wherein the bit vector is determined by identifying one of the symbol vectors corresponding to the hard decision and selecting the bit vector based on the one of the symbol vectors.
8. The method of claim 1 further comprising creating a Euclidean distance table comprising the first Euclidean distances and creating a plurality of reduced Euclidean distance tables comprising the second Euclidean distances, wherein the first smallest distance is selected from the Euclidean distance table and the competing smallest distances for each bit are selected from corresponding ones of the reduced Euclidean distance tables.
9. The method of claim 1 further comprising:
a) decoding the received signal, which originates from a plurality of transmit antennas, using a separate STC decoding technique to determine a plurality of initial solutions;
b) identifying a limited area about each of the initial solutions; and
c) creating a decoding space corresponding to the limited area,
wherein the first Euclidean distances are determined from within the limited area.
10. The method of claim 9 wherein the limited area corresponds to a limited set of constellation points in a constellation lattice containing constellation points corresponding to possible symbols transmitted from the plurality of transmit antennas.
11. The method of claim 9 wherein the limited area corresponds to a set of four constellation points in a constellation lattice containing constellation points corresponding to possible symbols transmitted from the plurality of transmit antennas.
12. The method of claim 9 wherein the decoding space is a limited space in a multi-dimensional constellation lattice corresponding to a limited set of constellation points.
13. The method of claim 9 wherein there is an initial solution for each of the plurality of transmit antennas.
14. The method of claim 9 wherein the separate STC decoding technique is zero-forcing.
15. The method of claim 9 wherein the separate STC decoding technique is minimum mean square error decoding.
16. A system for receiving signals comprising:
A) an antenna;
B) RF circuitry for demodulating and amplifying the received signal;
C) analog-to-digital converter for receiving the output of the RF circuitry; and
D) decoder circuitry for receiving the output of the analog-to-digital converter, the decoder circuitry for:
a) providing a symbol vector table comprising symbol vectors corresponding to potential combinations of transmitted symbols;
b) determining first Euclidean distances between a received signal and a plurality of the symbol vectors in light of corresponding channel responses;
c) selecting a first smallest distance from the first Euclidean distances as a hard decision;
d) determining a bit vector corresponding to the first smallest distance; and
e) for each bit in the bit vector:
i) selecting second Euclidean distances corresponding to a competing bit from the first Euclidean distances; and
ii) selecting a competing smallest distance from the second Euclidean distances as a soft demapping value.
17. The system of claim 16 wherein for each bit in the bit vector, the decoding circuitry further determines a difference between the hard decision and the corresponding soft demapping value.
18. The system of claim 17 wherein the difference is a log likelihood ratio.
19. The system of claim 17 wherein the decoding circuitry further decodes the differences for each bit using channel decoding to recover transmitted bits.
20. The system of claim 16 wherein the first Euclidean distances are calculated using:
{
∑
i
=
1
N
r
i
-
∑
j
=
1
M
h
ij
s
j
2
}
,
such that r is the received signal, s i is a symbol vector, h ij is a channel response vector, N is a number of receiver antennas, and M is a number of transmitter antennas.
21. The system of claim 20 wherein the channel-decoding is Turbo decoding.
22. The system of claim 16 wherein to determine the bit vector, the decoding circuitry further identifies one of the symbol vectors corresponding to the hard decision and selects the bit vector based on the one of the symbol vectors.
23. The system of claim 16 wherein the decoding circuitry further creates a Euclidean distance table comprising the first Euclidean distances and creates a plurality of reduced Euclidean distance tables comprising the second Euclidean distances, wherein the first smallest distance is selected from the Euclidean distance table and the competing smallest distances for each bit are selected from corresponding ones of the reduced Euclidean distance tables.
24. The system of claim 16 wherein the decoding circuitry further:
a) decodes the received signal, which originates from a plurality of transmit antennas, using a separate STC decoding technique to determine a plurality of initial solutions;
b) identifies a limited area about each of the initial solutions; and
c) creates a decoding space corresponding to the limited area,
wherein the first Euclidean distances are determined from within the limited area.
25. The system of claim 24 wherein the limited area corresponds to a limited set of constellation points in a constellation lattice containing constellation points corresponding to possible symbols transmitted from the plurality of transmit antennas.
26. The system of claim 24 wherein the limited area corresponds to a set of four constellation points in a constellation lattice-containing constellation points corresponding to possible symbols transmitted from the plurality of transmit antennas.
27. The system of claim 24 wherein the decoding space is a limited space in a multi-dimensional constellation lattice corresponding to a limited set of constellation points.
28. The system of claim 24 wherein there is an initial solution for each of the plurality of transmit antennas.
29. The system of claim 24 wherein the separate STC decoding technique is zero-forcing.
30. The system of claim 24 wherein the separate STC decoding technique is minimum mean square error decoding.
31. A method comprising:
a) determining first terms associated with differences between a received signal and a plurality of symbol vectors in light of corresponding channel responses, the symbol vectors corresponding to potential combinations of transmitted symbols;
b) selecting a first smallest term from the first terms as a hard decision;
c) determining bits corresponding to the first smallest term; and
d) for each bit of the bits:
i. selecting second terms corresponding to a competing bit from the first terms; and
ii. selecting a competing smallest term from the second terms as a soft demapping value.
32. The method of claim 31 wherein for each bit, further comprising determining a difference between the hard decision and the corresponding soft demapping value.
33. The method of claim 32 wherein the difference is a log likelihood ratio.
34. The method of claim 32 further comprising decoding the differences for each bit using channel decoding to recover transmitted bits.
35. The method of claim 31 wherein the first and second terms are Euclidean distances.
36. The method of claim 31 wherein the first terms are calculated using:
{
∑
i
=
1
N
r
i
-
∑
j
=
1
M
h
ij
s
j
2
}
.