摘要:
A modulator (100) comprises a symbol mapper (110) mapping respective bit sets of a bit sequence corresponding to a burst and comprising data, training, tail and guard bits into respective symbols to form a symbol sequence of data, training, tail and guard symbols. A vector precoder (120) applies a vector precoding transformation to the data and training symbols to form precoded symbols. These precoded symbols are combined with the tail and guard symbols in a symbol processor (130) to from a sequence of transmit symbols. The vector precoding conducted by the modulator (100) of a transmitter (200) enables improved link performance without the cost of increased processing complexity of the receiver algorithm.
摘要:
Precoder weights employed at a base station which coordinates with other base stations to form a super-cell are determined by (a) determining an initial downlink preceding matrix at the base station for a mobile station serviced by the base station in the super-cell, (b) revising a downlink receiver matrix associated with the mobile station based on the initial downlink precoding matrix; (c) transforming the downlink receiver matrix to an uplink precoder matrix associated with the mobile station, (d) revising an uplink receiver matrix associated with each base station in uplink communication with the mobile station based on the uplink precoder matrix associated with the mobile station, and (e) revising the initial downlink preceding matrix by transforming the uplink receiver matrix to a revised downlink precoding matrix Steps (b), (c), (d) and (e) are repeated for a pellicular number of iterations to determine a final downlink preceding matrix for the mobile station.
摘要:
According to the teachings presented herein, each base station (14) in a group of base stations (14) is linked to an associated terminal (18) as a receiver-transmitter pair. These receiver-transmitter pairs reuse channelization resources, such that each terminal (18) represents a source of other-cell interference (also referred to as multi-user interference or MUI) for other terminals (18) in neighboring cells that are reusing all or some of the same channelization resources. Accordingly, the base stations (14) implement a gaming- based algorithm to mitigate MLJI for the multiple-input-multiple-output, MIMO, uplink signals received from their associated terminals (18). More particularly, each base station (14) functions as a player in a game, in which the allowed gaming action is the selection of the precoding matrix to be used for MIMO uplink transmissions to the base station (14) from an associated terminal (18).
摘要:
According to methods and apparatus taught herein, user equipments (UEs) in a wireless communication network are scheduled based on determining received signal power densities for a plurality of UEs to be scheduled, allocating UEs to scheduling intervals based on a sorting of their received signal power densities, and assigning UEs in the same scheduling interval to mirror frequency bands within an available frequency spectrum according to the sorting. For example, UEs to be scheduled are assigned to a given scheduling interval in rank order of their received signal power densities until the scheduling interval is fully allocated. Remaining UEs are assigned in rank order to one or more other scheduling intervals, and the process may be repeated or otherwise carried out on an ongoing basis. Such an allocation scheme tends to minimize both adjacent frequency and mirror frequency interferences between UEs scheduled in the same interval.
摘要:
Methods are proposed herein to perform rate matching for polar codes via circular buffering of the polar encoded bits. Embodiments are directed to methods of operation of a transmitting node in a wireless system including performing polar encoding of a set of information bits in accordance with a polar sequence of length N B to thereby generate N B coded bits. The method can further include interleaving the coded bits to thereby provide an interleaved coded bit sequence, and storing the interleaved coded bit sequence into a circular buffer of length N B . According to certain embodiments, the method can further include extracting N coded bits for transmission from the circular buffer. N can be greater than, equal to, or less than N B .
摘要:
The present application relates to the adaptation of the CRC length in the context of 3GPP NR. In a first step, the maximum uplink control information (UCI) size is determined. Then, this maximum UCI size is scaled with a scaling factor F that is greater than zero but smaller than or equal to 1. The CRC length L is obtained as the minimum integer 2**(L-1)-L-1 that is greater than or equal to F*(maximum UCI size) and relates to a CRC code having a generator polynomial of the form g(x) = (x+1)*b(x), wherein b(x) is primitive polynomial of length L-1. The determined CRC code is of length N=2**(L-1)-1 with information length N-L.