Systems and modules for use with trellis-based decoding

Pulse or digital communications – Systems using alternating or pulsating current – Plural channels for transmission of a single pulse train

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C375S265000, C375S341000, C704S242000, C714S795000

Reexamination Certificate

active

07623585

ABSTRACT:
Systems and modules for use in trellis-based decoding of convolutionally encoded sets of data bits. A first calculation module receives an encoded set of data bits and calculates a signal distance or a measure of the differences between the encoded set and each one of a group of predetermined states. The first calculation module consists of multiple parallel calculation submodules with each submodule being tasked to perform an XOR operation between the encoded set and one of the predetermined states. Multiple parallel second calculation modules each receiving the output of the first calculation module, calculate cumulative signal distances using the output of the first calculation module. Each second calculation module outputs its lowest valued cumulative signal distance and this may be used as input to a memory system for storing a database used in further decoding of the encoded data.

REFERENCES:
patent: 4606027 (1986-08-01), Otani
patent: 4614933 (1986-09-01), Yamashita et al.
patent: 5150369 (1992-09-01), Costa et al.
patent: 5329537 (1994-07-01), Alard et al.
patent: 5418795 (1995-05-01), Itakura et al.
patent: 5448583 (1995-09-01), Miyamoto et al.
patent: 5596604 (1997-01-01), Cioffi et al.
patent: 5787127 (1998-07-01), Ono et al.
patent: 5802115 (1998-09-01), Meyer
patent: 5907586 (1999-05-01), Katsuragawa et al.
patent: 6189126 (2001-02-01), Ulmer et al.
patent: 6301314 (2001-10-01), Murayama
patent: 6317472 (2001-11-01), Choi et al.
patent: 6868521 (2005-03-01), Cohen
patent: 7143335 (2006-11-01), Choi
patent: 2002/0031195 (2002-03-01), Honary
patent: 0543554 (1993-05-01), None
patent: 0553050 (1993-07-01), None
patent: 0762659 (1997-03-01), None
patent: 0762659 (1997-03-01), None
patent: WO02/21699 (2002-03-01), None
patent: WO02/21699 (2002-03-01), None
He et. al., “An area efficient analog VLSI architecture for state-parallel Viterbi Decoding”, IEEE 1999.
Black et. al., “A 140Mb/s, 32-State, Radix-4 Viterbi decoder” IEEE 1992.
Black et al. “A 140-Mb/s, 32-State, Radix-4 Viterbi Decoder”. IEEE, Dec. 1992.
PCT Communication Relating to the Results of the Partial International Search for Application No. PCT/CA2004/000282.
E. Paaske et al.,An area-efficient path memory structure for VLSI implementation of high speed Viterbi decoders, 8220 Integration, The VLSI Journal, Nov. 1991, No. 1, pp. 79-91, Amsterdam, NL.
G. Fettweis et al.,Feedforward Architectures for Parallel Viterbi Decoding, Journal of VLSI Signal Processing, 3, pp. 105-119 (1991).
Proakis, John G., Chapter 8—Block and Convolutional Channel Codes, Digital Communications, Third Edition, pp. 483-500, McGraw-Hill, Inc.
United States Patent and Trademark Office; U.S. Appl. No. 11/668,998, filed Jan. 30, 2007; File History.
United States Patent and Trademark Office; U.S. Appl. No. 10/377,860, filed Feb. 28, 2003; File History.
International Bureau of WIPO; PCT/CA2004/000282 filed Feb. 26, 2004; International Preliminary Report on Patentability; Sep. 2, 2005.

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

Systems and modules for use with trellis-based decoding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Systems and modules for use with trellis-based decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and modules for use with trellis-based decoding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4132799

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