Sequential decoding

About: Sequential decoding is a research topic. Over the lifetime, 8667 publications have been published within this topic receiving 204271 citations.

Finite-length unequal error protection rateless codes: design and analysis

Abstract: A generalization of rateless codes (LT and Raptor codes) to provide unequal error protection (UEP) property is proposed in this paper. The proposed codes (UEP-LT and UEP-Raptor codes) are analyzed for the best possible performance over the binary erasure channel (BEC) in finite-length cases. We derive upper and lower bounds on the bit error probabilities under the maximum-likelihood (ML) decoding. We further verify our work with simulations. Simulation results indicate that the bounds are tight for small error rates, and the proposed codes have strong UEP property.

Fiber-optic ladder networks for inverse decoding coherent CDMA

Abstract: Coherent fiber-optic networks are used to improve upon incoherent CDMA schemes. If a single-channel network is used between transmitters and receivers, standard coherent correlation takes place. If several parallel spatial channels (fibers and/or polarizations) are used, ideal inverse decoding can be implemented, with perfect delta -function response of the matched decoder. The two-channel case is studied in detail. The rules for finding inverses of a given coding network and the relationship between matched networks for one-channel decoding and two-channel inverse decoding are given. Phase and frequency differences among stations imply that unwanted signals add up incoherently. The ideal two-channel network with inverse decoding has no loss due to encoding/decoding, only inevitable loss due to the broadcast network. In experiments using a single fiber between a transmitter and a receiver by orthogonal polarizations, delta -function inverse response was observed. >

An Efficient Algorithm for Soft-Decision Decoding of the (24, 12) Extended Golay Code

Abstract: An efficient algorithm for soft-decision decoding of the (24, 12) extended Golay code is described. Results obtained for white Gaussian noise are presented which show that performance is only a few tenths of a decibel away from that of an ideal correlator.

Polar Codes for Arbitrary DMCs and Arbitrary MACs

Abstract: Polar codes are constructed for arbitrary channels by imposing an arbitrary quasi-group structure on the input alphabet. Just as with usual polar codes, the block error probability under successive cancellation decoding is $o(2^{-N^{1/2-\epsilon }})$ , where $N$ is the block length. Encoding and decoding for these codes can be implemented with a complexity of $O(N\log N)$ . It is shown that the same technique can be used to construct polar codes for arbitrary multiple access channels by using an appropriate Abelian group structure. Although the symmetric sum capacity is achieved by this coding scheme, some points in the symmetric capacity region may not be achieved. In the case where the channel is a combination of linear channels, we provide a necessary and sufficient condition characterizing the channels whose symmetric capacity region is preserved by the polarization process. We also provide a sufficient condition for having a maximal loss in the dominant face.

A generic buffer occupancy expression for stop-and-wait hybrid automatic repeat request protocol over unstable channels

Abstract: Recently, there has been a rapid progress in the field of wireless networks and mobile communications which makes the constraints on the used links clearly unconcealed. Wireless links are characterized by limited bandwidth and high latencies. Moreover, the bit-error-rate (BER) is very high in such environments for various reasons out of which weather conditions, cross-link interference, and mobility. High BER causes corruption in the data being transmitted over these channels. Therefore, convolutional encoding has been originated to be a professional means of communication over noisy environments. Sequential decoding, a category of convolutional codes, represents an efficient error detection and correction mechanism which attracts the attention for most of current researchers as for having a complexity that is dependent to the channel condition. In this paper, we propose a new queuing study over networking systems that make use of sequential decoders. Hence, the adopted flow and error control refer to stop-and-wait hybrid automatic repeat request. However, our queuing study is a novel extension to our prior work in which the lowest decoding complexity was fixed and did not account for the channel state. In other words, our proposed closed-form expression of the average buffer occupancy is totally generic and parameterized by not only channel condition and packet incoming rate, but also those that are automatically adapted to the channel conditions which include lower and upper bound decoding limits.