Coding apparatus, coding method and recording medium having...

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S777000

Reexamination Certificate

active

06901548

ABSTRACT:
To carry out error correction coding and decoding according to a serially concatenated coded modulation system with a small circuit scale and high performance. A coding apparatus1is designed so that an interleaver20interleaves order of bits so that all weights are coded by a convolutional coder30with respect to data comprising a series of 3 bits supplied from a convolutional coder10; the convolutional coder30makes as small as possible the total value of the hamming distance of input bit between passes to be the minimum Euclidean distance with respect to data of 3 bits supplied from the interleaver20; and a multi-value modulation mapping circuit40causes the hamming distance of input bits in the convolutional coder30as the distance between signal point on the I/Q plane is smaller to subject data of 3 bits supplied from the convolutional coder30to mapping.

REFERENCES:
patent: 4882733 (1989-11-01), Tanner
patent: 5781542 (1998-07-01), Tanaka et al.
patent: 5844922 (1998-12-01), Wolf et al.
patent: 6351832 (2002-02-01), Wei
patent: 6473878 (2002-10-01), Wei
patent: 1 075 088 (2001-02-01), None
patent: 1 137 191 (2001-09-01), None
Divsalar D et al: “Serial Concatenated Trellis Coded Modulation With Rate-1 Inner Code” GLOBECOM'00. 2000 IEEE Global Telecommunications Conference. San Francisco, CA, Nov. 27-Dec.1, 2000, IEEE Global Telecommunications Conference, New York, NY : IEEE, US, vol. vol. 2 of 4, Nov. 27, 2000, pp. 777-782, XP001017192 ISBN: 0-7803-6452-X.
Peleg M et al: “On interleaved, differentially encoded convolutional codes” IEEE Transactions on Information Theory, IEEE Inc. New York, US, vol. 45, No. 7, Nov. 1999, pp. 2572-2582, XP002185118 ISSN: 0018-9448.
Benedetto S et al: “Serial concatenated trellis coded modulation with iterative decoding” Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on ULM, Germany Jun. 29-Jul. 4, 1997, New York, NY, USA, IEEE, US, Jun. 29, 1997, p. 8, XP010240061ISBN: 0-7803-3956-8.
Benedetto S et al: “Serial concatenation of interleaved codes: performance analysis, design and iterative decoding” Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on ULM, Germany Jun. 29-Jul. 4, 1997, New York, NY, USA, IEEE, US, Jun. 29, 1997, p. 106, XP010240159 ISBN: 0-7803-3956-8.
Divsalar D et al: “Serial and Hybrid Concatenated Codes With Applications” International Symposium on Turbo Codes, XX, XX, Sep. 1997, pp. 80-87, XP001034844.
Ho M Ed—Fargues M P et al: “Performance bounds for serially-concatenated trellis-coded modulation” Signals, Systems & Computers, 1997. Conference Record of the Thirsty-First Asilomar Conference on Pacific Grove, CA, USA Nov. 2-5, 1997, Los Alamitos, CA, USA,IEEE Comput. Soc, US, Nov. 2, 1997, pp. 1364-1368, XP010280612 ISBN: 0-8186-8316-3.
Keang-Po Ho et al: “Soft-decoding combined trellis-coded quantization/modulation” Communication Theory, vol. 5, Dec. 5, 1999, pp. 2451-2455, XP010373393.
Franz V et al: “Concatenated Decoding With a Reduced-Search BCJR Algorithm” IEEE Journal on Selected Areas in Communications, IEEE Inc. New York, US, vol. 16, No. 2, Feb. 1, 1998, pp. 186-195, XP000741773 ISSN: 0733-8716.

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

Coding apparatus, coding method and recording medium having... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Coding apparatus, coding method and recording medium having..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coding apparatus, coding method and recording medium having... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3434567

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