Detection process for a receiver of a wireless MIMO communication system

摘要

A detection process for a receiver of a wireless communication system based on Multiple-In-Multiple-Out antennas, the process involving: —a preprocessing which only depends on the channel H, said preprocessing involving: —A QRD decomposition (61) for the purpose of decomposing said channel H into two Q and R matrices, with QHQ=I and R being upper triangular; —a lattice reduction (62) for the purpose of generating (formula AA, formula BB) and a permutation matrix T; —a loading phase (63, 64, 65) comprising a linear LRA-Minimum-Mean-Square-Error equalization applied on said symbols y in accordance with the result of said lattice reduction for the purpose of generating a value (formula CC). The process is characterized by the fact that it further involves the steps of: —Performing a neighborhood search with a search center being equal to the result (formula CC) of said lattice reduction; —Determining the -BKest symbols in accordance with a Partial Euclidean Distance (PED) defined in accordance with the following formula (formula DD)—detecting each layer and with the result of said detection performing an update of the search center so as to perform detection of the next layer; —multiplying the estimated value (formula EE) by said matrix T plus quantizing it onto the original constellation so as to generate the estimated value (formula FF).

主权项

1. Detection process for a receiver of a wireless communication system based on Multiple-In-Multiple-Out antennas, said receiver processing observations symbols y derived from symbols x transmitted by an emitter through a channel H; said process comprising:
a preprocessing which only depends on the channel H, said preprocessing involving:
A QRD decomposition for the purpose of decomposing said channel H into two Q and R matrices, with QHQ=I and R being upper triangular;a lattice reduction for the purpose of generating {tilde over (Q)}, {tilde over (R)} and a permutation matrix T comprising complexes values having real and imaginary parts being integers and a determinant which absolute value is equal to 1; a loading phase comprising a linear LRA-Minimum-Mean-Square-Error equalization applied on said symbols y in accordance with the result of said lattice reduction for the purpose of generating a value {tilde over (z)}LRA-MMSE given by the formula below:
{tilde over (z)}LRA-MMSE=({tilde over (H)}H{tilde over (H)}+σn2THT)−1{tilde over (H)}Hy; wherein said process further involves the steps of:
performing a neighborhood search with a search center being equal to the result {tilde over (z)}LRA-MMSE of said lattice reduction; determining the K-Best symbols in accordance with a Partial Euclidean Distance (PED) defined in accordance with the following formula:
∥{tilde over (R)}({tilde over (z)}LRA-MMSE−Z)∥2