Low-Complexity High-Throughput Decoding Architecture for Convolutional Codes

Type of content
Journal Article
Publisher's DOI/URI
Thesis discipline
Degree name
University of Canterbury. Electrical and Computer Engineering
Journal Title
Journal ISSN
Volume Title
Xu, R.
Morris, K.A.
Woodward, G.K.
Kocak, T.

Sequential decoding can achieve a very low computational complexity and short decoding delay when the signal- to-noise ratio (SNR) is relatively high. In this paper, a low-complexity high-throughput decoding architecture based on a sequential decoding algorithm is proposed for convolutional codes. Parallel Fano decoders are scheduled to the codewords in parallel input buffers according to buffer occupancy, so that the processing capabilities of the Fano decoders can be fully utilized, resulting in high decoding throughput. A discrete time Markov chain (DTMC) model is proposed to analyse the decoding architecture. The relationship between the input data rate, the clock speed of the decoder and the input buffer size can be easily established via the DTMC model. Different scheduling schemes and decoding modes are proposed and compared. The novel high-throughput decoding architecture is shown to incur 3%-10% of the computational complexity of Viterbi decoding at a relatively high SNR.

Xu, R., Morris, K.A., Woodward, G.K, Kocak, T. (2012) Low-Complexity High-Throughput Decoding Architecture for Convolutional Codes. EURASIP Journal on Wireless Communications and Networking, (In press).
architecture, convolutional code, Fano algorithm, high-throughput decoding, scheduling, sequential de-coding, wirelessHD
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Field of Research::10 - Technology::1005 - Communications Technologies::100510 - Wireless Communications
Fields of Research::46 - Information and computing sciences::4613 - Theory of computation::461301 - Coding, information theory and compression
Field of Research::08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity