H04L25/03242

MULTIPLE-INPUT AND MULTIPLE-OUTPUT (MMO) DETECTION IN WIRELESS COMMUNICATIONS
20230040774 · 2023-02-09 ·

Introduced here is at least one technique to better estimate interference at a receiver. The technique includes receiving a plurality of reference signals, which each have information indicative of noise. Thus, the technique further includes, for each reference signal, determining a noise estimation and determining a distance metric and log-likelihood ratio (LLR) of the noise estimation. Once the distance metric and LLR of each reference signal is determined, the receiver can determine a final LLR based on the distance metric and LLR of each reference signal. In this manner, a final LLR is determined. This technique can be applied by any device operating on MIMO technology.

Lattice reduction in wireless communication

Methods, systems and devices for lattice reduction in decision feedback equalizers for orthogonal time frequency space (OTFS) modulation are described. An exemplary wireless communication method, implementable by a wireless communication receiver apparatus, includes receiving a signal comprising information bits modulated using OTFS modulation scheme. Each delay-Doppler bin in the signal is modulated using a quadrature amplitude modulation (QAM) mapping. The method also includes estimating the information bits based on an inverse of a single error covariance matrix of the signal, with the single error covariance matrix being representative of an estimation error for all delay-Doppler bins in the signal.

METHODS AND DEVICES FOR SEQUENTIAL SPHERE DECODING

Embodiments of the invention provide a decoder for decoding a signal received through a transmission channel in a communication system, said signal comprising a vector of information symbols, said transmission channel being represented by a channel matrix, wherein the decoder comprises: an initial radius determination unit (307) configured to determine an initial radius; a symbol estimation unit (309) configured to iteratively determine a current radius to search a lattice point inside a current spherical region defined by said current radius, said current radius being initially set to said initial radius, said symbol estimation unit (309) being configured, for each lattice point found in said current spherical region, to store said lattice point in association with a metric, said symbol estimation unit (309) being further configured to update said current radius using a linear function, said linear function having a slope parameter strictly inferior to one,

The decoder being configured to determine at least one estimate of said vector of information symbols from at least one of the lattice points found by the symbol estimation unit (309).

LATTICE REDUCTION IN WIRELESS COMMUNICATION
20210399926 · 2021-12-23 ·

Methods, systems and devices for lattice reduction in decision feedback equalizers for orthogonal time frequency space (OTFS) modulation are described. An exemplary wireless communication method, implementable by a wireless communication receiver apparatus, includes receiving a signal comprising information bits modulated using OTFS modulation scheme. Each delay-Doppler bin in the signal is modulated using a quadrature amplitude modulation (QAM) mapping. The method also includes estimating the information bits based on an inverse of a single error covariance matrix of the signal, with the single error covariance matrix being representative of an estimation error for all delay-Doppler bins in the signal.

Massive multiple-input multiple-output system and method

A detection method is presented that combines two non-linear approaches, the Sphere Decoder (SD) and the K-best algorithms, to identify symbols transmitted over a communication channel in a multiple input-multiple output (MIMO) communication system. A parallel implementation on a x86 computer system is presented, which reduces the number of evaluations by branching over plural symbols and diversifies the search process, which may rapidly reduce the radius and thus, the time complexity of the computer system.

DEVICES AND METHODS FOR MACHINE LEARNING ASSISTED SPHERE DECODING
20220247605 · 2022-08-04 ·

A decoder for decoding a signal received through a transmission channel represented by a channel matrix using a search sphere radius. The decoder comprises a radius determination device for determining a search sphere radius from a preliminary radius. The radius determination device is configured to: i. apply a machine learning algorithm to input data derived from the received signal, the channel matrix and a current radius, the current radius being initially set to the preliminary radius, which provides a current predicted number of lattice points associated with the current radius; ii. compare the current predicted number of lattice points to a given threshold; iii. update the current radius if the current predicted number of lattice points is strictly higher than the given threshold, the current radius being updated by applying a linear function to the current radius; Steps i to iii are iterated until a termination condition is satisfied, the termination condition being related to the current predicted number, the radius determination device being configured to set the search sphere radius to the current radius in response to the termination condition being satisfied.

Using lattice reduction for reduced decoder complexity

Methods, systems, and devices for wireless communications are described. Some wireless communications systems may utilize beamforming techniques to process wireless communications transmitted in millimeter wave (mmW) frequency ranges. In such cases, a user equipment (UE) may perform lattice reduction (LR)-based preprocessing for a received resource element (RE), which allows the UE to utilize demapping techniques (e.g., minimum mean square error (MMSE)-based demapping techniques or successive interference cancellation (SIC) demapping techniques) that are less computationally-complex than conventional demapping techniques (e.g., maximum likelihood (ML)-based demapping techniques) while providing a similar performance as conventional techniques. Further, due to mmW systems' robustness to time-dispersion, the UE may apply the same LR to multiple REs across multiple symbols in the time domain and across multiple sub-carriers in the frequency domain. The computational cost of performing the LR calculation may be spread across multiple REs and further increase the efficiency of utilizing low-complexity demapping techniques.

Efficient sphere detector algorithm for large antenna communication systems using graphic processor unit (GPU) hardware accelerators

A method of detecting a symbol transmitted over a communication channel in a multiple input-multiple output communication system. The method includes receiving a plurality of symbols transmitted over a communication channel of a multiple input-multiple output communication system. A sphere radius is initialized based on attributes of the communication channel. A first matrix of possible transmitted signals is defined as well as a second matrix of received symbols. The matrix of possible transmitted signals is searched using a breadth-first search (BFS). Each level of the search tree is analyzed utilizing matrix multiplication to determine selected symbols satisfying the initialized sphere radius. A maximum likelihood solution is of the transmitted symbols is derived based on the selected symbols.

MASSIVE MULTIPLE-INPUT MULTIPLE-OUTPUT SYSTEM AND METHOD

A detection method is presented that combines two non-linear approaches, the Sphere Decoder (SD) and the K-best algorithms, to identify symbols transmitted over a communication channel in a multiple input-multiple output (MIMO) communication system. A parallel implementation on a x86 computer system is presented, which reduces the number of evaluations by branching over plural symbols and diversifies the search process, which may rapidly reduce the radius and thus, the time complexity of the computer system.

Apparatus and method for selecting candidates in a K-Best algorithm of a multiple input multiple output decoder

The invention relates to an apparatus for selecting candidates in a K-Best algorithm of a MIMO decoder. The K-Best algorithm uses a layered structure comprising a first layer and subsequent layers. In each subsequent layer 2.sup.L candidates are selected by iteratively carrying out a selection step, wherein in the selection step the apparatus is configured to calculate and select at least two candidates having minimum distance values of a candidate group, and after each iteratively carried out selection step, the selected at least two candidates are sent to a further subsequent layer for iteratively generating a further candidate group of 2.sup.L candidates in the further subsequent layer.