Method for implementing turbo equalization compensation, turbo equalizer and system
AssigneeHuawei Technologies Co., Ltd.
InventorsDeyuan CHANG, Zhiyu XIAO, Fan YU, Yu ZHAO
Life of this patent
Estimating the term…
Abstract
Embodiments of the present application relate to a method for implementing Turbo equalization compensation. The equalizer divides a first data block into n data segments, where D bits in two adjacent data segments in the n data segments overlap, performs recursive processing on each data segment in the n data segments, before the recursive processing, merges the n data segments to obtain a second data block; and performs iterative decoding on the second data block, to output a third data block, where data lengths of the first data block, the second data block, and the third data block are all 1/T of a code length of a LDPC convolutional code.
Claims12
A method for implementing Turbo equalization compensation, comprising:
- dividing a first data block into n data segments, wherein D bits in two adjacent data segments in the n data segments overlap, n is a positive integer greater than or equal to 2, and D is a positive integer greater than or equal to 1, performing recursive processing on each data segment in the n data segments, after recursive processing, merging the n data segments to obtain a second data block;
- and
- performing iterative decoding on the second data block, to output a third data block,
- wherein data lengths of the first data block, the second data block, and the third data block are all 1/T of a code length of a low density parity check (LDPC) convolutional code, and T is a quantity of layers of a step-shaped check matrix of the LDPC convolutional code.
A Turbo equalizer, comprising:
- a processor;
- and
- a computer readable medium having a plurality of computer executable instructions that, when executed by the processor, cause the processor to perform:
- dividing a first data block into n data segments, wherein D bits in two adjacent data segments in the n data segments overlap, n is a positive integer greater than or equal to 2, and D is a positive integer greater than or equal to 1, performing recursive processing on each data segment in the n data segments, after recursive processing, merging the n data segments to obtain a second data block;
- and
- performing iterative decoding on the second data block, to output a third data block,
- wherein data lengths of the first data block, the second data block, and the third data block are all 1/T of a code length of a low density parity check (LDPC) convolutional code, and T is a quantity of layers of a step-shaped check matrix of the LDPC convolutional code.
Dependencies are inferred from the claim text.