Patent classifications
H04L25/0246
Method and apparatus for interference estimation in wireless communication networks
An apparatus including a processor configured to receive a digital communication signal, wherein the digital communication signal includes a common reference signal and transmitted data. The processor determines a first interfering channel matrix for a first interfering cell based on a channel estimation of the common reference signal, and estimates a first power offset ratio and a first effective pre-coding matrix for the first interfering cell by evaluating a maximum likelihood metric, wherein the maximum likelihood metric is based on a first interfering channel correlation. The processor then reconstructs a channel covariance matrix based on the estimated first power offset ratio and the first effective pre-coding matrix and detects the transmitted data based on the reconstructed channel covariance matrix.
Interference rejection combining method, device and storage medium
Disclosed in an embodiment of the disclosure is an interference rejection combining (IRC) method supporting transmit diversity, in which an N*N interference and noise covariance matrix corresponding to one subcarrier is generated from signals, in a transmit diversity mode, received at cell reference signal (CRS) resource positions via N receiving antennas, where N is greater than or equal to 3; Cholescy decomposition and upper triangular matrix inversion is performed on the N*N interference and noise covariance matrix to obtain an N*N block matrix; the N*N block matrix is expanded to a 2N*2N noise whitening matrix; and the received signals and channel estimation values are whitened according to the noise whitening matrix, and the whitened received signals and channel estimation values used to obtain a minimum mean square error-IRC (MMSE-IRC) processing result. Also disclosed are an IRC device supporting the transmit diversity, and a computer storage medium.
Multi-Stream Faster-Than-Nyquist Transmission Using Bandwidth Partitioning
The present disclosure generally relates to the field of Faster-Than-Nyquist Signaling More specifically, the present disclosure relates to a technique of supporting Faster-Than-Nyquist transmission of data in a Multiple Input Multiple Output environment. A method embodiment comprises: forming two or more spatial data streams from data to be transmitted in the MIMO environment; partitioning a frequency band available for transmission of the data in the MIMO environment over the two or more spatial data streams into two or more sub-bands; and processing each of the two or more spatial data streams using FTN sampling.
INTERFERENCE REJECTION COMBINING METHOD, DEVICE AND STORAGE MEDIUM
Disclosed in an embodiment of the disclosure is an interference rejection combining (IRC) method supporting transmit diversity, in which an N*N interference and noise covariance matrix corresponding to one subcarrier is generated from signals, in a transmit diversity mode, received at cell reference signal (CRS) resource positions via N receiving antennas, where N is greater than or equal to 3; Cholescy decomposition and upper triangular matrix inversion is performed on the N*N interference and noise covariance matrix to obtain an N*N block matrix; the N*N block matrix is expanded to a 2N*2N noise whitening matrix; and the received signals and channel estimation values are whitened according to the noise whitening matrix, and the whitened received signals and channel estimation values used to obtain a minimum mean square error-IRC (MMSE-IRC) processing result. Also disclosed are an IRC device supporting the transmit diversity, and a computer storage medium.
BUNDLE SIZE REPORTING FOR PRECODING RESOURCE BLOCK GROUPS
Methods, systems, and devices for wireless communications are described. A first wireless device may receive a first signal from a second wireless device and may identify a first bundle size for a precoding resource group (PRG) based on a characteristic of the first signal and, in some examples, based on performing channel estimation on the first signal. The first wireless device may transmit a feedback message to the second wireless device indicating a second bundle size for the PRG and associated with a second signal based on identifying the first bundle size. In some examples, the first wireless device may receive the second signal on a set of resources in accordance with the second bundle size. The first signal may be an example of a channel state information reference signal (CSI-RS), and the second signal may be an example of a precoded CSI-RS or a demodulation reference signal (DMRS).
USER SCHEDULING METHOD IN MULTI-ANTENNA SIGNAL TRANSMISSION, AND ELECTRONIC DEVICE AND STORAGE MEDIUM
The embodiments of the present application relate to the technical field of communications. Disclosed are a user scheduling method in multi-antenna signal transmission, and an electronic device and a storage medium. The method comprises: acquiring channel information of channels that are used by a plurality of users, and according to the channel information of the channels that are used by the users, constructing a channel information covariance corresponding to each user; calculating a correlation coefficient between every two users according to the channel information covariance of each user; and selecting a scheduled user on the basis of the number of scheduled users and the correlation coefficient between every two users.
Multi-input multi-output (MIMO) detection systems
Embodiments of the present invention provide efficient greedy LLL algorithms that not only converge faster but also exhibit much lower complexity than the existing greedy LLL variants while similar error performance is maintained. First, a relaxed Lovsz condition is designed for searching the candidate set of LLL iterations with column swap operations. This relaxation does not need size reduction operations so that it can save complexity compared to the existing greedy LLL algorithms. Further, a relaxed criterion of the decrease in LLL potential is designed to select the optimal one in the candidate set of LLL iterations, which also exhibits lower complexity than the existing greedy LLL algorithms. Furthermore, simulations show that the inventive algorithm needs less LLL iterations compared to the existing greedy LLL algorithms.
SEMI-EXHAUSTIVE RECURSIVE BLOCK DECODING METHOD AND DEVICE
Embodiments of the invention provides a decoder for decoding a signal received through a transmission channel in a communication system, said signal carrying information symbols selected from a given alphabet and being associated with a signal vector, said transmission channel being represented by a channel matrix, wherein said decoder comprises: a sub-block division unit (301) configured to divide the received signal vector into a set of sub-vectors in correspondence with a division of a matrix related to said channel matrix; a candidate set estimation unit (305) for recursively determining candidate estimates of sub-blocks of the transmitted signal corresponding to said sub-vectors, each estimate of a given sub-block being determined from at least one candidate estimate of the previously processed sub-blocks, wherein said candidate set estimation unit is configured to determine a set of candidate estimates for at least one sub-block of the transmitted signal by applying at least one iteration of a decoding algorithm using the estimates determined for the previously processed sub-blocks, the number of candidate estimates determined for said sub-block being strictly inferior to the cardinal of the alphabet and superior or equal to two, the decoder further comprising a signal estimation unit (306) for calculating an estimate of the transmitted signal from said candidate estimates determined for said sub-blocks.
Prefiltering in MIMO receiver
Data signals transmitted by a plurality of transmitting antennas over a radio channel are demodulated. The method comprises receiving (202) on a plurality of receiving antennas, a data signal and a reference signal, the contents of the reference signal being known a priori to the receiver. The contents of the reference signal are used for calculating (204) an estimated polynomial channel matrix. A polynomial pre-filter matrix is calculated (206, 208) by a decomposition of the estimated polynomial channel matrix into a product of a paraunitary polynomial matrix and an upper triangular polynomial matrix with minimum phase filters on its main diagonal, where the polynomial pre-filter matrix is obtained by calculating the paraconjugate of the paraunitary polynomial matrix. The received data signal is demodulated (212) where the received data signal is multiplied with the calculated polynomial pre-filter matrix.
Method of processing compressed sensing signal and apparatus thereof
A method of processing a signal in a compressive sensing receiver, includes: obtaining a first signal received via an antenna; generating a first baseband signal by mixing the first signal with a second signal generated by a local oscillator based on a pseudo random binary sequence (PRBS); removing a spurious from the first baseband signal based on a pre-stored estimation value obtained by estimating the spurious generated by the local oscillator in advance; and detecting a spectral slice including the first signal based on the first baseband signal from which the spurious is removed and a measurement matrix.