Efficiency of the Viterbi algorithm

Excavating

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

371 30, 375 96, G06F 1110, H03M 1312

Patent

active

053274393

ABSTRACT:
The efficiency of a Viterbi algorithm in a communication system, in which the transmission channel contains memory, is improved when several sequences in a signal string are detected in descending probability order. An error detecting operation then selects the correct sequence, if any, to be the received sequence.

REFERENCES:
patent: 4748626 (1988-05-01), Wong
patent: 4757506 (1988-07-01), Heichler
patent: 4837766 (1989-06-01), Yoshida
patent: 4885757 (1989-12-01), Provence
patent: 5073940 (1991-12-01), Zinser et al.
patent: 5151904 (1992-09-01), Reiner et al.
European Conference on Speech Communication and Technology Sep. 1989, Paris pp. 378-381; H. Thompson et al: "A Chart Parsing Realisation of Dynamic Programming, with Best-First Enumeration of paths in a Lattice"--the whole document.
Proceedings of the Global Telecommunications Technology and Exhibition--Globecom 89, Nov. 27-30, 1989, Dallas vol. 3, 1989, New York, IEEE pp. 1680-1686; J. Hagenauer et al.: "A Viterbi Algorithm with Soft-Decision Outputs and its Applications"--Introduction; Paragraph 3.1.2.
IEEE Transactions on Communications. vol. 38, No. 8, Aug. 1990, New York US pp. 1130-1144; E. Paaske: "Improved Decoding for a Concentrated Coding System Recommended by CCSDS"--p. 1140, paragraph IV; figure 4.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Efficiency of the Viterbi algorithm does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficiency of the Viterbi algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiency of the Viterbi algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-802087

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.