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
TL;DR: An algorithm that permits a receiver to calculate the probability of packet error in parallel with the Viterbi decoding process is presented and it is shown that this scheme can be used to guarantee any required bound on the packet error probability.
Abstract: We present an algorithm that permits a receiver to calculate the probability of packet error in parallel with the Viterbi decoding process. This packet reliability value may be used to request retransmissions in a type-I hybrid ARQ scheme. It is shown that this scheme can be used to guarantee any required bound on the packet error probability. In addition, this scheme can be used in conjunction with packet combining. The performance of this scheme is compared with that of the Yamamoto-Itoh algorithm and is shown to provide a significant improvement in throughput.
45 citations
12 Nov 2007
TL;DR: Slepian-Wolf codes based on overlapped quasi-arithmetic codes, where overlapping allows lossy compression of the source below its entropy and the presence of correlated side information at the decoder is used to remove ambiguity and achieve a vanishing error probability.
Abstract: This paper describes Slepian-Wolf codes based on overlapped quasi-arithmetic codes, where overlapping allows lossy compression of the source below its entropy. In the context of separate decoding, these codes are not uniquely decodable: the overlap introduces ambiguity in the decoding process leading to decoding errors. The presence of correlated side information at the decoder is used to remove this ambiguity and achieve a vanishing error probability. The state models and the automata of the overlapped quasi-arithmetic codes are described. The soft decoding algorithm with side information is then presented. The performance of these codes has been assessed first on theoretical sources and integrated in a distributed video coding platform.
45 citations
TL;DR: This paper describes a channel-tolerant approach identified as "telesonar type-B signaling," designed to accommodate network architectures requiring multiple access to the channel while simultaneously providing covertness and energy efficiency.
Abstract: Undersea acoustic channels can exhibit multipath propagation with impulse-response duration and coherence time both of the order of tens to hundreds of milliseconds. Signal reception is further impaired by the presence of time-varying nonwhite ambient-noise spectra having a dynamic range of 30 dB or more. Acoustic communication requires appropriate waveform design and associated signal processing to accommodate these adverse transmission characteristics while also providing desired performance features such as low-probability-of-detection (LPD) and multi-access networking. Adaptive-equalization techniques provide good performance only for channels with stable multi-paths and high signal-to-noise ratios (SNR's) accommodating the signaling rates needed to sample and compensate for rapid changes. An alternative approach is to design for robustness against channel fluctuations. This paper describes a channel-tolerant approach identified as "telesonar type-B signaling." The technique has been designed to accommodate network architectures requiring multiple access to the channel while simultaneously providing covertness and energy efficiency. Specialized frequency-hopped M-ary frequency-shift-key (FH-MFSK) waveforms are combined with related signal processing, including nonlinear adaptive techniques to mitigate the effects of all types of interference. This effectively results in a channel that has uniformly distributed noise in both time and frequency. Powerful error-correction coding permits low SNR transmissions. Nonbinary, long-constraint-length, convolutional coding and related sequential decoding is a classical solution for difficult low-rate channels. The probability of bit errors below 10/sup -10/ is obtainable, even in Rayleigh-faded channels near the computational cutoff rate, and the probability of failure to decode frames of data is extremely small. Both simulations and analyses of at-sea experiments demonstrate the performance of this noncoherent approach to reliable acoustic communications.
45 citations
TL;DR: A decoding algorithm for linear codes that uses the minimum weight words of the dual code as parity checks is defined and is able to correct beyond the half minimum distance and has the capability of including soft-decision decoding.
Abstract: A decoding algorithm for linear codes that uses the minimum weight words of the dual code as parity checks is defined. This algorithm is able to correct beyond the half minimum distance and has the capability of including soft-decision decoding. Results on applying this algorithm to quadratic residue (QR) codes, BCH codes, and the Golay codes (with and without soft-decision decoding) are presented.
45 citations
07 Mar 2000
TL;DR: This paper combines techniques for early stopping and error detection in order to stop the iterative turbo code decoding process and detect if errors are present in the decoded bit sequence.
Abstract: In this paper we combine techniques for early stopping and error detection in order to stop the iterative turbo code decoding process and detect if errors are present in the decoded bit sequence. The simple and efficient approaches we introduce are based on monitoring the mean of the absolute values of the log-likelihood ratios at the output of the component decoders over each frame.
45 citations