DATA MODULATION
    61.
    发明公开
    DATA MODULATION 审中-公开
    数据调制

    公开(公告)号:EP2517430A1

    公开(公告)日:2012-10-31

    申请号:EP09852653.6

    申请日:2009-12-21

    IPC分类号: H04L27/36

    摘要: 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.

    ITERATIVE PRECODER MATRIX COMPUTATION METHOD AND APPARATUS
    62.
    发明公开
    ITERATIVE PRECODER MATRIX COMPUTATION METHOD AND APPARATUS 有权
    方法和设备VORKODIERUNGSMATRIX的迭代计算

    公开(公告)号:EP2484071A2

    公开(公告)日:2012-08-08

    申请号:EP10776815.2

    申请日:2010-09-28

    IPC分类号: H04L25/03 H04L25/02

    摘要: 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.

    CIRCULAR BUFFER RATE MATCHING FOR POLAR CODES

    公开(公告)号:EP4243290A2

    公开(公告)日:2023-09-13

    申请号:EP23179959.4

    申请日:2018-02-09

    IPC分类号: H03M13/00

    摘要: 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 .

    ADAPTATION OF THE CRC CODE LENGTH FOR 3GPP NR

    公开(公告)号:EP3863181A1

    公开(公告)日:2021-08-11

    申请号:EP21166250.7

    申请日:2018-03-23

    IPC分类号: H03M13/09 H03M13/35

    摘要: 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.