Low-Complexity High-Throughput Decoding Architecture for Convolutional Codes (2012)
Type of ContentJournal Article
PublisherUniversity of Canterbury. Electrical and Computer Engineering
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.
CitationXu, 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).
This citation is automatically generated and may be unreliable. Use as a guide only.
Keywordsarchitecture; convolutional code; Fano algorithm; high-throughput decoding; scheduling; sequential de-coding; wirelessHD
ANZSRC Fields of Research10 - Technology::1005 - Communications Technologies::100510 - Wireless Communications
46 - Information and computing sciences::4613 - Theory of computation::461301 - Coding, information theory and compression
08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity
Showing items related by title, author, creator and subject.
Lin, R.; Martin, P.A.; Taylor, D.P. (University of Canterbury. Electrical and Computer Engineering, 2010)We propose a Decode-and-Forward (DF) scheme using distributed Turbo code (DTC) for a three-node (source, relay, and destination) wireless cooperative communication system. The relay decodes, then interleaves, and reencodes ...
Girs, S.; Willig, A.; Uhlemann, E.; Bjoerkman, M. (University of Canterbury. Computer Science and Software Engineering, 2016)The interest in wireless communication systems for industrial applications has grown significantly over the last years. More flexible, easier to install and maintain wireless networks present a promising alternative to ...
Oo, C. H. (University of Canterbury. Computer Science, 1978)The Dantzig-Wolfe decomposition (linear programming) principle published in 1960 involves the solving of large-scale mathematical programming problems of particular structure. Large practical problems of this type typically ...