Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate

Details Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate

2012-02-08

arxiv.org/abs/1202.1692v1

Computer Science

Information Theory

5 pages, submitted to ISIT 2012

Scientific paper

Partial Unit Memory (PUM) codes are a special class of convolutional codes, which are often constructed by means of block codes. Decoding of PUM codes may take advantage of existing decoders for the block code. The Dettmar--Sorger algorithm is an efficient decoding algorithm for PUM codes, but allows only low code rates. The same restriction holds for several known PUM code constructions. In this paper, an arbitrary-rate construction, the analysis of its distance parameters and a generalized decoding algorithm for PUM codes of arbitrary rate are provided. The correctness of the algorithm is proven and it is shown that its complexity is cubic in the length.

Affiliated with

Also associated with

No associations

Rating

Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-64700