Coded data generation or conversion – Digital code to digital code converters
Reexamination Certificate
2000-12-04
2004-02-17
Tokar, Michael (Department: 2019)
Coded data generation or conversion
Digital code to digital code converters
C341S094000, C714S755000, C714S786000, C714S774000, C375S259000, C375S341000, C375S222000
Reexamination Certificate
active
06693566
ABSTRACT:
FIELD OF THE INVENTION
The present disclosure relates to digital signal reception and, in particular, signal coding which assists in the synchronization of receivers with turbo decode capability.
BACKGROUND OF THE INVENTION
In recent years, transmission of data via satellite has increased considerably. Recently, the number of personal satellite receivers have also been increasing. As large satellite receiving antennas and expensive receivers are replaced by smaller and less expensive equipment, the demand for such systems continues to rise. As the demand for satellite communication systems rises, systems which have increased performance have a distinct market advantage. Improving designs and increasing the level of system integration within satellite receivers can offer the dual benefits of decreasing system costs and increasing performance. Accordingly, there is a need for improved satellite communication systems within the art.
SUMMARY OF THE INVENTION
In one aspect of the present invention, a method of creating a data sequence includes placing a training sequence at a beginning of a data frame, placing a plurality of the blocks of turbo encoded data within the data frame following the training sequence, and interspersing a plurality of submarkers within the turbo encoded data blocks.
In another aspect of the present invention, a training sequence and submarker insertion apparatus includes an input adapted to receive a plurality of turbo encoded data blocks, and an inserter adapted to insert a training sequence before the turbo encoded data blocks and insert a plurality of submarkers within the turbo encoded data blocks thereby creating a data frame.
In yet another aspect of the present invention, a training sequence and submarker insertion apparatus includes receiving means for receiving a plurality of turbo encoded data blocks, insertion means for inserting a training sequence before the turbo encoded data blocks, and inserting a plurality of submarkers within the turbo encoded data blocks thereby creating a data frame.
In a further aspect of the present invention, a transmitter includes a forward error correction device having a turbo encoder and a training sequence and submarker insertion device coupled to the turbo decoder, the training sequence and submarker insertion device comprising an input adapted to receive a plurality of turbo encoded data blocks from the turbo encoder, and an inserter adapted to insert a training sequence before the turbo encoded data blocks and insert a plurality of submarkers within the turbo encoded data blocks thereby creating a data frame, and a modulator coupled to the forward error correction device to modulate the data frame.
In yet a further aspect of the present invention, a method of creating a data sequence includes turbo encoding data into a plurality of turbo encoded data blocks, creating a data frame comprising a first portion and a second portion, the first portion preceding the second portion in time, placing a training sequence in the first portion of the data frame, placing the turbo encoded data blocks in the second portion of the data frame, and interspersing a plurality of submarkers within the turbo encoded data blocks.
It is understood that other embodiments of the present invention will become readily apparent to those skilled in the art from the following detailed description, wherein it is shown and described only embodiments of the invention by way of illustration of the best modes contemplated for carrying out the invention. As will be realized, the invention is capable of other and different embodiments and its several details are capable of modification in various other respects, all without departing from the spirit and scope of the present invention. Accordingly, the drawings and detailed description are to be regarded as illustrative in nature and not as restrictive.
REFERENCES:
patent: 4677625 (1987-06-01), Betts et al.
patent: 4677626 (1987-06-01), Betts et al.
patent: 4979175 (1990-12-01), Porter
patent: 5181209 (1993-01-01), Hagenauer et al.
patent: 5349608 (1994-09-01), Graham et al.
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5446747 (1995-08-01), Berrou
patent: 5563897 (1996-10-01), Pyndiah et al.
patent: 5666378 (1997-09-01), Marchetto et al.
patent: 5675585 (1997-10-01), Bonnot et al.
patent: 5703911 (1997-12-01), Lin et al.
patent: 5721745 (1998-02-01), Hladik et al.
patent: 5734962 (1998-03-01), Hladik et al.
patent: 5742612 (1998-04-01), Gourgue et al.
patent: 5761248 (1998-06-01), Hagenauer et al.
patent: 5784300 (1998-07-01), Neumeier et al.
patent: 5841818 (1998-11-01), Lin et al.
patent: 5907582 (1999-05-01), Yi
patent: 5933462 (1999-08-01), Viterbi et al.
patent: 5970085 (1999-10-01), Yi
patent: 5978365 (1999-11-01), Yi
patent: 5983384 (1999-11-01), Ross
patent: 5983385 (1999-11-01), Khayrallah et al.
patent: 5996104 (1999-11-01), Herzberg
patent: 6014411 (2000-01-01), Wang
patent: 6016568 (2000-01-01), Wolf et al.
patent: 6065147 (2000-05-01), Pyndiah et al.
patent: 6119264 (2000-09-01), Berrou et al.
patent: 6122763 (2000-09-01), Pyndiah et al.
patent: 6182261 (2001-01-01), Haller et al.
patent: 6304996 (2001-10-01), Van Stralen et al.
patent: 6330277 (2001-12-01), Gelblum et al.
patent: 6334197 (2001-12-01), Eroz et al.
patent: 6339834 (2002-01-01), Crozier et al.
patent: 6351832 (2002-02-01), Wei
patent: 6427214 (2002-07-01), Li et al.
patent: 6484283 (2002-11-01), Stephen et al.
patent: 6530059 (2003-03-01), Crozier et al.
patent: 6574766 (2003-06-01), Obuchi et al.
patent: 2001/0028690 (2001-10-01), Ebel, Sr.
patent: 0 843 437 (1998-05-01), None
patent: 0891656 (1999-09-01), None
patent: 0 940 957 (1999-09-01), None
patent: 0973292 (2000-01-01), None
patent: 0986181 (2000-03-01), None
patent: 1 009 098 (2000-06-01), None
patent: 1030457 (2000-08-01), None
patent: 2724522 (1996-03-01), None
patent: 2346782 (2000-08-01), None
patent: WO 99/19994 (1999-04-01), None
patent: WO-01/43384 (2001-06-01), None
patent: WO 02/19552 (2002-03-01), None
patent: WO-02/21702 (2002-03-01), None
patent: WO-02/23738 (2002-03-01), None
patent: WO-02/23739 (2002-03-01), None
patent: WO 02/37691 (2002-05-01), None
patent: WO 02/41563 a2 (2002-05-01), None
Benedetto, S., et al., “Parallel Concatenated Trellis Coded Modulation,” Jet Propulsion Laboratory, California Institute of Technology, 5 pages.
Ramsey, John L., “Realization of Optimum Interleavers,”IEEE Transactions on Information Theory, May 1970, pp. 338-345, vol. IT-16, No. 3.
Ungerboeck, Gottfried, “Channel Coding with Multilevel/Phase Signals,”IEEE Transactions on Information Theory, Jan. 1982, pp. 55-66, vol. IT-28, No. 1.
Battail, Gérard, et al., “Suboptimum Decoding Using Kullback Principle,” inLecture Notes in Computer Science, 1988, pp. 93-101, No. 313, B. Bouchon et al. Eds.
Berrou, Claude, et al., “Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes,”IEEE International Conference on Communications'93, Geneva Switzerland, May 23, 1993, pp. 1064-1070, Technical Program, Conference Record, vol. 2/3.
Moher, Michael, “Decoding Via Cross-Entropy Minimization,”Proceedings IEEE GLOBECOM Conference, Houston, TX, Dec. 1993, pp. 809-813.
Dolinar, S., et al., “Weight Distribution for Turbo Codes Using Random and Nonrandom Permutations,” TDA Progress Report 42-122, Jet Propulsion Laboratory, Aug. 1995, pp. 56-65.
Fazel, K., et al., “Combined Multilevel Turbo-Code with 8PSK Modulation,”Global Telecommunications Conference, 1995. Conference Record. Communication Theory Mini-Conference, GLOBECOM '95. IEEE Singapore, Nov. 13, 1995, pp. 649-653.
Divsalar, D., et al., “Effective Free Distance of Turbo Codes,”Electronics Letters, Feb. 29, 1996, pp. 445-446, vol. 32, No. 5.
Hagenauer, Joachim, et al., “Iterative Decoding of Binary Block and Convolutional Codes,”IEEE Transactions on Information Theory, Mar. 1996, pp. 429-445, vol. 42, No. 2.
Berrou, Claude, “Near Optimum Error Correcting Coding and Decoding: Turbo-Codes,”IEEE Transactions on Communications, Oct. 1996, pp. 1261-1271, vol. 44, No. 10.
Pietrobon, Steven S., “Implemen
Cameron Kelly B.
Jaffe Steven T.
Broadcom Corporation
Christie Parker & Hale LLP
Mai Lam T.
Tokar Michael
LandOfFree
Interspersed training for turbo coded modulation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Interspersed training for turbo coded modulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interspersed training for turbo coded modulation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3338528