摘要:
A structured parity-check matrix H is proposed, wherein H is an expansion of a base matrix Hb and wherein Hb comprises a section Hb1 and a section Hb2, and wherein Hb2 comprises a first part comprising a column hb having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, and 0 elsewhere. The expansion of the base matrix Hb uses identical submatrices for 1s in each column of the second part H′b2, and the expansion uses paired submatrices for an even number of 1s in hb.
摘要:
During operation of a transmitter a circular buffer is created where only column tops of the circular buffer are defined as a starting position for a redundancy version. Where the circular buffer is in sequence format, all possible redundancy versions are at positions ┌Kstream/32┐(12×i+σ), i=0, 1, . . . , 7 where σ indicates the column index of the starting position of the first RV (RV0).
摘要:
During operation of a transmitter a circular buffer is created where only column tops of the circular buffer are defined as a starting position for a redundancy version. Where the circular buffer is in sequence format, all possible redundancy versions are at positions ┌Kstream/32┐(12×i+σ), i=0, 1, . . . , 7 where σ indicates the column index of the starting position of the first RV (RV0).
摘要:
A wireless communication transmitter (200) configured to segment a transport block into C segments, encode each segment into a set of encoded bits, determine, for γ encoded segments, a subset of size M0′ of encoded bits for each encoded segment and for C−γ encoded segments, a subset of size M1′ of encoded bits for each encoded segment, wherein the subset sizes M0′ and M1′ differ at most by P bits, where P is a product of a modulation order and a number of transmission layers over which the transport block is transmitted. The selected subsets of encoded bits are concatenated and grouped to form modulation symbols of the modulation order.
摘要:
A structured parity-check matrix H is proposed, wherein H is an expansion of a base matrix Hb. Base matrix Hb comprises a section Hb1 and a section Hb2. Section Hb2 comprises column hb having weight wh>=3 and H′b2 having a dual-diagonal structure with matrix elements at row i, column j equal to 1 for i=j, 1 for i=j+1, and 0 elsewhere. The 1's of hb and Hb1 are arranged such that one or more groups of the rows of Hb can be formed so that the rows of Hb within each group do not intersect. Further more, the rows of base matrix Hb can be permuted such that every two consecutive rows do not intersect.
摘要翻译:提出了一种结构化奇偶校验矩阵H,其中H是基本矩阵H B b的扩展。 基本矩阵H B b包括部分H b1和部分H b2b。 部分H b2包括具有重量w SUB> = 3的第hb个b和具有双重键的H' 对于i行j矩阵元素的对角线结构,对于i = j,列j等于1,i = j + 1为1,其他地方为0。 hB1和H b1的1个被布置成使得可以形成一行或多组H B b的行,使得行 每个组中的H b b不相交。 此外,基矩阵H B b的行可以被置换,使得每两个连续的行不相交。
摘要:
A method and apparatus for rate matching is described. During operation of a transmitter, multiple data streams are received and individually interleaved with a permutation of a same length KΠ. A permutation (πp0) of a second stream is the same as a permutation (πsys) of a first stream and a permutation (πp1) of a third stream is different from the permutation of the first stream. Each element of πp1 is derived from the corresponding element of πsys. The plurality of interleaved streams are multiplexed to form a circular buffer. Finally, data is transmitted from the circular buffer.
摘要:
A method and apparatus for decoding data is provided herein to show how to turbo decode LDPC codes that contain a partial dual diagonal parity-check portion, and how to avoid memory access contentions in such a turbo decoder. During operation, a decoder will receive a signal vector corresponding to information bits and parity bits and separate the received signal vector into two groups, a first group comprising signals corresponding to the information bits and one or more parity bits, a second group comprising a remainder of the parity bits. The first group of received signals is passed to a first decoder and the second group of received signals is passed to a second decoder. The decoders are separated by an interleaver and a deinterleaver. Iterative decoding takes place by passing messages between the decoders, through the interleaver and the deinterleaver, and producing an estimate of the information bits from the output of the first decoder.
摘要:
A method for cooperative relaying within multi hop wireless communication systems includes a base station, in an attempt to decode a data packet, combining hard sliced channel bits and Logarithmic Likelihood Ratio (LLR) quality information received from relay stations who had also received the data packet with stored information about the data packet.
摘要:
A method and structure of processing soft information in a block code decoder, includes a soft-input soft-output decoder receiving a length n soft input vector, creating a binary vector Y corresponding to the soft input vector, hard decoding each linear function Xi of Y and a test pattern Zi of one or more test patterns, wherein if the hard decoding is successful a codeword produced by the hard decoding of Xi is added to a set S, removing redundant codewords in S to form a reduced set S′ based on processing a number of errors found during the hard decoding and a guaranteed error correcting capability of the block code decode, and an extrinsic value estimator generating n soft outputs based on c estimated soft output values and (n-c) non-estimated soft output values wherein the c estimated soft output values are computed from one or more positions of soft input vector and one or more codewords in S′.
摘要:
A method for cooperative relaying within multi hop wireless communication systems includes a base station, in an attempt to decode a data packet, combining hard sliced channel bits and Logarithmic Likelihood Ratio (LLR) quality information received from relay stations who had also received the data packet with stored information about the data packet.