Topic
Sequential decoding
About: Sequential decoding is a research topic. Over the lifetime, 8667 publications have been published within this topic receiving 204271 citations.
Papers published on a yearly basis
Papers
More filters
••
09 Jul 2006TL;DR: This paper addresses the problem of distributed space-time coding with reduced decoding complexity for wireless relay network and admits code constructions with lower decoding complexity compared to codes based on some earlier system models.
Abstract: We address the problem of distributed space-time coding with reduced decoding complexity for wireless relay network. The transmission protocol follows a two-hop model wherein the source transmits a vector in the first hop and in the second hop the relays transmit a vector, which is a transformation of the received vector by a relay-specific unitary transformation. Design criteria is derived for this system model and codes are proposed that achieve full diversity. For a fixed number of relay nodes, the general system model considered in this paper admits code constructions with lower decoding complexity compared to codes based on some earlier system models.
77 citations
••
TL;DR: A novel reliability ratio based weighted bit-flipping decoding scheme is proposed for low-density parity-check codes, achieving a coding gain of 1 dB when communicating over an AWGN channel, while maintaining the same decoding complexity.
Abstract: A novel reliability ratio based weighted bit-flipping decoding scheme is proposed for low-density parity-check codes. A coding gain of 1 dB is achieved in comparison to the weighted bit-flipping scheme, when communicating over an AWGN channel, while maintaining the same decoding complexity.
77 citations
•
22 Dec 2009TL;DR: In this article, methods and systems for encoding and decoding signals using a Multi-input Multi-output Time Encoding Machine (TEM) and Time Decoding Machine are described.
Abstract: Methods and systems for encoding and decoding signals using a Multi-input Multi-output Time Encoding Machine (TEM) and Time Decoding Machine are disclosed herein.
76 citations
••
25 Mar 2003TL;DR: It is shown how conventional parallel (turbo) and serial concatenated convolutional codes can be used to compress close to the Slepian-Wolf limit for the correlated binary sources.
Abstract: It is shown how conventional parallel (turbo) and serial concatenated convolutional codes can be used to compress close to the Slepian-Wolf limit for the correlated binary sources. Conventional refers to codes already used in channel coding. Focusing on the asymmetric case of compression of an equipolarable memoryless binary source with side information at the decoder, the approach is based on modeling the correlation as a channel and using syndromes. The encoding and decoding procedures are explained in detail. The performance achieved is seen to be better than the recently published results using nonconventional turbo codes and close to the Slepian-Wolf limit.
76 citations
01 Jan 2000
TL;DR: This work proposes mutual information transfer characteristics for soft in/soft out decoders to design serially concatenated codes based on the convergence behavior of iterative decoding.
Abstract: The design of serially concatenated codes has yet been dominated by optimizing asymptotic slopes of error probability curves. We propose mutual information transfer characteristics for soft in/soft out decoders to design serially concatenated codes based on the convergence behavior of iterative decoding. The exchange of extrinsic information is visualized as a decoding trajectory in the Extrinsic Information Transfer Chart (EXIT chart).
75 citations