Zhipei Chi

Learn More
Turbo decoders inherently have a large latency and low throughput due to iterative decoding. To increase the throughput and reduce the latency, high speed decoding schemes have to be employed. In this paper, following a discussion on basic parallel decoding archi-tectures, two types of area-efficient parallel decoding schemes are proposed. Detailed(More)
—In this comment we position the work of [1], [2] in terms of the prior literature and note that many of its results are subsumed by previous papers. I N [1], [2] modifications to the decoding of binary block Turbo codes/ Turbo product codes, as described in [3], [4], are considered. Unfortunately, the work ignores much of the existing relevant literature,(More)
QR decomposition based multi-channel least square lattice (QRD-MLSL) algorithm possesses good numerical property and regularity which are attractive for VLSI implementation. But due to the presence of local recursive loop in its implementation, the algo-rithm's speed is limited to the computation time of each computation cell. In this paper, a novel(More)
Protecting short frames using turbo coding is a challenging task because of the small interleave size and the need for transmission efficiency. In this paper, we explore possible trade-off between power consumption (estimated by the average number of iterations) and performance of turbo decoders when short frame turbo codes are used. Three encoding/decoding(More)
  • 1