摘要:
A method and apparatus for encoding and decoding data is described herein. During operation, data enters a convolutional encoder (101). The encoder encodes the information bits from the data at encoding rate (1/R0) to produce data symbols vectors P0, P1, . . . , PR0. Vectors P1, . . . , PR0 are each interleaved separately to form vectors P0′, P1′, . . . , PR0′. A multiplexer (105) multiplexes P0′, P1′, . . . , PR0′ to produce vector Q. The multiplexed interleaved symbols Q are input into symbol adder/remover (107) where appropriate symbols are added or removed to match an over-the-channel transmission rate. Finally, vector Q′ is transmitted via over-the-channel transmission.
摘要:
A method of improving block turbo decoder performance that comprises receiving soft input information corresponding to a first set of constituent codes of a block product code, scaling soft extrinsic information from a second set of constituent codes of the block product code, processing the scaled soft extrinsic information and the soft input information to produce soft output information suitable for a soft-input soft-output decoder, and performing one or more of: modifying encoded bit positions of the block product code, modifying decoded bit positions of a the block product code, permuting decoding parameters of the block product code to effect a preferred decoding order, detecting cases where a number of test patterns is insufficient to decode the soft output information and thereafter providing a different number of test patterns suitable for decoding the soft output information, and adapting the number of test patterns in the soft-input soft-output decoder.
摘要:
A deterministic structure for controlled distribution of weight-2 columns is proposed for a parity-check matrix H that reduces the occurrence of undetected frame errors and significantly enhances the code performance in comparison to a randomly-constructed parity-check matrix. H comprises a non-deterministic section H1 and a deterministic section H2, and wherein H2 comprises a first part comprising a column h 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, 0 elsewhere.
摘要翻译:对于奇偶校验矩阵H,提出了权重2列的受控分布的确定性结构,其减少了未检测到的帧错误的发生,并且与随机构造的奇偶校验矩阵相比显着增强了代码性能。 H包括非确定性部分H 1和确定性部分H 2 H 2,并且其中H 2 H 2包括第一部分,其包含具有 大于2的奇数,以及包括用于行i的矩阵元素的第二部分,对于i = j,列j等于1,对于i = j + 1,0,其他地方为1。
摘要:
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 and apparatus for encoding and decoding data is described herein. During operation, data enters a convolutional encoder (101). The encoder encodes the information bits from the data at encoding rate (1/R0) to produce data symbols vectors P0, P1, . . . , PR0. Vectors P1, . . . , PR0 are each interleaved separately to form vectors P0′, P1′, . . . , PR0′. A multiplexer (105) multiplexes P0′, P1′, . . . , PR0′ to produce vector Q. The multiplexed interleaved symbols Q are input into symbol adder/remover (107) where appropriate symbols are added or removed to match an over-the-channel transmission rate. Finally, vector Q′ is transmitted via over-the-channel transmission.
摘要:
Decoding signals represented by a trellis of block length N divided into windows of length L includes a step of decoding a backward recursion from a point P that is after the end of a window back to the end of the window. P is chosen at a sufficient distance from the end of the window such that backward recursion determines a known state metric at the end of the window. A next step includes decoding the window using backward recursion from the known state at the end of the window back to the beginning of the window to define a set of known backward recursion state metrics which are stored. A next step includes decoding using forward recursion starting from a known state at the beginning of the window and moving forward. A next step includes calculating a soft output at each stage of the forward recursion using the stored backward recursion state metrics, and branch metrics at each stage, and outputting the soft output for that stage.
摘要:
Decoding signals represented by a trellis of block length N divided into windows of length L includes a step of decoding a forward recursion from a point P1 that is before the beginning of a window up to the beginning of the window and decoding a backward recursion from a point P2 that is after the end of a window back to the end of the window to define known states at the beginning and end of the window. A next step includes decoding the window using backward recursion from the known state at the end of the window back to the beginning of the window to define a set of backward recursion state metrics. A next step includes decoding using forward recursion starting from a known state at the beginning of the window and moving forward to the end of the window to define a set of forward recursion state metrics. A next step includes calculating a soft output at each stage of the window using the forward and backward recursion state metrics, and branch metrics at each stage, and outputting the soft output for that stage.