Optimal decoder for tall-biting convolutional codes

Details Optimal decoder for tall-biting convolutional codes Optimal decoder for tall-biting convolutional codes

1999-01-15

2000-07-11

Ghebretinsae, Temesghen

Pulse or digital communications

Receivers

Particular pulse demodulator or detector

714786, 714795, H04L 2706, H03M 1312

Patent

active

060884053

ABSTRACT:
A decoder of digital data signals for a message sequence of N symbols from a data source, encoded with a tail-biting convolutional code, and for correcting all combinations of up to a preselected number e of bit errors, operates upon the sequentially-received collection of consecutive-encoded tail-biting data symbols and selects an unmerged decision depth LU(e), a forward decision depth LF(e) and then a decoder decision depth L, before executing in a processor of the Viterbi type, which has a decision depth of L trellis levels, a decoding algorithm for a total of (N+LF(e)+LU(e)) trellis stages to produce a decoded data bit output sequence representative of the N transmitted source digital symbols.

REFERENCES:
patent: 5721745 (1998-02-01), Hladik et al.
patent: 5721746 (1998-02-01), Hladik et al.

Affiliated with

Also associated with

Rating

Optimal decoder for tall-biting convolutional codes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimal decoder for tall-biting convolutional codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal decoder for tall-biting convolutional codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-549709