Source: http://www.google.com/patents/US7111219?dq=KOI-18
Timestamp: 2015-06-02 02:36:04
Document Index: 476677543

Matched Legal Cases: ['Application No. 10', 'Application No. 10', 'Application No. 10', 'Application No. 10', 'Application No. 10', 'Application No. 10', 'Application No. 10', 'Application No. 10']

Patent US7111219 - Data transmission apparatus using a constellation rearrangement - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA hybrid ARQ retransmission method involves encoding data packets with a forward error correction (FEC) technique prior to transmission. The data packets are retransmitted based on an automatic repeat request (ARQ) and subsequently soft-combined with previously received erroneous data packets either...http://www.google.com/patents/US7111219?utm_source=gb-gplus-sharePatent US7111219 - Data transmission apparatus using a constellation rearrangementAdvanced Patent SearchPublication numberUS7111219 B2Publication typeGrantApplication numberUS 11/003,405Publication dateSep 19, 2006Filing dateDec 6, 2004Priority dateFeb 21, 2001Fee statusPaidAlso published asCA2406234A1, CA2406234C, CN1426641A, CN1655493A, CN100393021C, CN100394718C, DE60102296D1, DE60102296T2, EP1293059A1, EP1293059B1, US6892341, US20040049725, US20050097424, WO2002067491A1Publication number003405, 11003405, US 7111219 B2, US 7111219B2, US-B2-7111219, US7111219 B2, US7111219B2InventorsAlexander Golitschek, Christian Wengerter, Michael Philipp Schmitt, Eiko SeidelOriginal AssigneeMatsushita Electric Industrial Co., Ltd.Export CitationBiBTeX, EndNote, RefManPatent Citations (46), Non-Patent Citations (38), Referenced by (4), Classifications (22), Legal Events (3) External Links: USPTO, USPTO Assignment, EspacenetData transmission apparatus using a constellation rearrangement
US 7111219 B2Abstract
A hybrid ARQ retransmission method involves encoding data packets with a forward error correction (FEC) technique prior to transmission. The data packets are retransmitted based on an automatic repeat request (ARQ) and subsequently soft-combined with previously received erroneous data packets either on a symbol-by-symbol or a bit-by-bit basis. The symbols of the erroneous data packets are modulated by employing a first signal constellation. The symbols of the re-transmitted data packets are modulated by employing at least a second signal constellation. Each symbol bit has a mean bit reliability defined by the individual bit reliabilities over all symbols of the predetermined signal constellation. The first constellation and the at least second signal constellation are selected such that the combined mean bit reliabilities for the respective bits of all transmissions are averaged out.
a reception section that (i) receives data modulated and transmitted using a first constellation pattern, and (ii) receives all or a part of said data modulated and retransmitted using a second constellation pattern, and
a demodulating section that demodulates said data, received in operation (i), using said first constellation pattern and demodulates said all or a part of said data, received in operation (ii), using said second constellation pattern, wherein:
each of said first and second constellation patterns is a constellation for a 16 QAM modulation scheme, and
said second constellation pattern is different from the first constellation pattern, with respect to a sequence of bits (i1q1i2q2) in a symbol, by at least one of (a) exchanging the positions of the first bit i1 and third bit i2 as well as that of the second bit q1 and fourth bit q2 relative to one another and (b) inverting the third bit i2 and fourth bit q2 respectively.
2. A data reception apparatus according to claim 1, further comprising a constellation table that stores a plurality of constellation patterns including said first constellation pattern and said second constellation pattern to be used in said demodulating section.
3. A data reception apparatus according to claim 1, further comprising a storage that stores a sequence of constellation patterns including said first constellation pattern and said second constellation pattern to be used in said demodulating section.
4. A data reception apparatus according to claim 1, wherein said second constellation pattern is different from said first constellation pattern with respect to a reliability of a bit mapped onto a symbol in each of the first and second constellation patterns.
5. A base station apparatus equipped with the data reception apparatus according to claim 1.
6. A communication terminal apparatus equipped with the data reception apparatus according to claim 1.
a reception section that (i) in a first reception, receives data modulated and transmitted using a first constellation pattern, and (ii) in a second reception, receives all or a part of said data modulated and retransmitted using a second constellation pattern, and
a demodulating section that in said first reception, demodulates said data, received in said first reception, using said first constellation pattern and -in said second reception, demodulates said all or a part of said data, received in said second reception, using said second constellation pattern, wherein:
one of said first constellation pattern and said second constellation pattern is produced, with respect to a sequence of bits (i1q1i2q2)in a symbol, by at least one of (a) exchanging the positions of the first bit i1 and third bit i2 as well as that of the second bit q1 and fourth bit q2 relative to one another and (b) inverting the third bit i2 and fourth bit q2 respectively.
8. A data reception apparatus according to claim 7, further comprising a constellation table that stores a plurality of constellation patterns including said first constellation pattern and said second constellation pattern to be used in said demodulating section.
9. A data reception apparatus according to claim 7, further comprising a storage that stores a sequence of constellation patterns including said first constellation pattern and said second constellation pattern to be used in said demodulating section.
10. A data reception apparatus according to claim 7, wherein said second constellation pattern is different from said first constellation pattern with respect to a reliability of a bit mapped onto a symbol in each of the first and second constellation patterns.
This is a continuation of application Ser. No. 10/239,794 filed Nov. 29, 2002 (now U.S. Pat. No. 6,892,341 B2).
A common technique in communication systems, with unreliable and time-varying channel conditions is to correct errors based on automatic repeat request (ARQ) schemes together with a forward error correction (FEC) technique called hybrid ARQ (HARQ). If an error is detected by a commonly used cyclic redundancy check (CRC), the receiver of the communication system requests the transmitter to resend the erroneously received data packets.
Employing soft-combining the retransmission packets carry identical symbols compared with the previously received symbols. In this case the multiple received packets are combined either by a symbol-by-symbol or by a bit-by-bit basis as for example disclosed in D. Chase, Code combining: A maximum-likelihood decoding approach for combining an arbitrary number of noisy packets, IEEE Trans. Commun., Vol. COM-33, pp. 385–393, May 1985 or B. A. Harvey and S. Wicker, Packet Combining Systems based on the Viterbi Decoder, IEEE Transactions on Communications, Vol. 42, No. 213/4, April 1994. By combining this soft-decision values from all received packets the reliabilities of the transmitted bits will increase linearly with the number and power of received packets. From a decoder point of view the same FEC scheme (with constant code rate) will be employed over all transmissions. Hence, the decoder does not need to know how many retransmissions have been performed, since it sees only the combined soft-decision values. In this scheme all transmitted packets will have to carry the same number of symbols.
The varying bit reliabilities evolve from the constraint of two-dimensional signal constellation mapping, where modulation schemes-carrying more than 2 bits per symbol cannot have the same mean reliabilities for all bits under the assumption that all symbols are transmitted equally likely. The term mean reliabilities is consequently meant as the reliability of a particular bit over all symbols of a signal constellation.
Choose Level 1 for i1 Level 2 for i2—free choice if 2a or 2b 1. Mapping defined 2. Step (2. Transmission)
Choose Level 1 for i2 Level 2 for i1—free choice if 2a or 2b 2. Mapping defined 3. Step
Options: (a) Go to 1. Step and proceed with alternating between 1. and 2. Mapping (b) Use 2. Mapping and proceed with using 2 times 1. Mapping, 2 times 2. Mapping and so on . . .
1. Step. (1. Transmission)
Choose Level 1 for i2 Level 2 for i1—free choice if 2a or 2b 2. Mapping defined 3. Step (3. Transmission)
(b1) if in 2. Transmission 2a was used then use 2b (b2) if in 2. Transmission 2b was used then use 2a 3. Mapping defined 4. Step (4. Transmission)
(a1) if in 1. Transmission 2a was used then use 2b (a2) if in 1. Transmission 2b was used then use 2a 4. Mapping defined 5. Step (5., 9., 13., . . . Transmission)
Choose one out of 4 defined mappings 6. Step (6., 10., 14., . . . Transmission)
Choose one out of 2 remaining mappings not used in last 2 transmissions 8. Step (8., 12., 16., . . . Transmission)
Choose mapping not used in last 3 transmissions 9. Step
Level 2b: Inverted mapping of 2a: in to outer columns and qn to outer rows respectively.
Level 3b: Inverted mapping of 2a: in to columns 1-4-5-8 and qn to rows 1-4-
It has to be considered that the bit-mapping order is open prior initial transmission, but has to remain through retransmissions, e.g. bit-mapping for initial transmission: i1q1i2q2i3q3 bit-mapping all retransmissions: i1q1i2q2i3q3.
Choose Level 1 for i1 Choose Level 2 for i2 (free choice if 2a or 2b) Level 3 for i3—free choice if 3a or 3b 1. Mapping defined 2. Step (2. Transmission)
Options: (a) Choose Level 1 for i2 Choose Level 2 for i3 (free choice if 2a or 2b) Level 3 for i1—free choice if 3a or 3b (b) Choose Level 1 for i3 Choose Level 2 for i1 (free choice if 2a or 2b) Level 3 for i2—free choice if 3a or 3b 2. Mapping defined 3. Step (3. Transmission)
if (a) in 2. Step Choose Level 1 for i3 Choose Level 2 for i1 (free choice if 2a or 2b) Level 3 for i2—free choice if 3a or 3b if (b) in 2. Step Choose Level 1 for i2 Choose Level 2 for i3 (free choice if 2a or 2b) Level 3 for i1—free choice if 3a or 3b 3. Mapping defined 4. Step (4., 7., 10, . . . Transmission)
Choose one out of 3 defined mappings 5. Step (5., 8., 11, . . . Transmission)
Choose one out of 3 defined mappings except the mapping used in last 2 transmissions 7. Step
if (a) in 2. Step Choose Level 1 for i3 Choose Level 2 for i1 (free choice if 2a or 2b) Level 3 for i2—free choice if 3a or 3b if (b) in 2. Step Choose Level 1 for i2 Choose Level 2 for i3 (free choice if 2a or 2b) Level 3 for i1—free choice if 3a or 3b 3. Mapping defined 4. Step (4. Transmission)
(b1) if in one of the previous transmission 3a was used for this bit then use 3b (b2) if in one of the previous transmission 3b was used for this bit then use 3a 4. Mapping defined 5. Step (5. Transmission)
(b1) if in one of the previous transmission 3a was used for this bit then use 3b (b2) if in one of the previous transmission 3b was used for this bit then use 3a 5. Mapping defined 6. Step (6. Transmission)
Choose Level 1 for bit not having Level 1 in 4. Step and 5. Step Choose Level 2 for bit not having Level 2 in 4. Step and 5. Step with following restrictions
(b1) if in one of the previous transmission 3a was used for this bit then use 3b (b2) if in one of the previous transmission 3b was used for this bit then use 3a 6. Mapping defined 7. Step (7., 13., 19., . . . Transmission)
Choose one out of 6 defined mappings 8. Step (8., 14., 20., . . . Transmission)
Choose one out of 6 defined mappings with giving Level 1 reliability to the bit not having Level 1 in last 2 transmissions 10. Step (10., 16., 22., . . . Transmission)
Choose one out of 3 remaining mappings not used in last 3 transmissions 11. Step (11., 17., 23., . . . Transmission)
Choose one out of 2 remaining mappings not used in last 4 transmissions 12. Step (12., 18., 24., . . . Transmission)
Choose remaining mapping not used in last 5 transmissions 13. Step
Go to 7. Step FIG. 5 shows an exemplary embodiment of a communication system to which the present invention can be applied. More specifically, the communication system comprises a transmitter 10 and a receiver 20 which communicate through a channel 30 which can either be wire-bound or wireless, i.e. an air interface. From a data source 11, data packets are supplied to a FEC encoder 12, where redundancy bits are added to correct errors. The n bits output from the FEC decoder are subsequently supplied to a mapping unit 13 acting as a modulator to output symbols formed according to the applied modulation scheme stored as a constellation pattern in a table 15. Upon transmission over the channel 30, the receiver 20 checks the received data packets, for example, by means of a cyclic redundancy check (CRC) for correctness. If the received data packets are erroneous, the same are stored in a temporary buffer 22 for subsequent soft combining with the retransmitted data packets.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4344171Dec 11, 1980Aug 10, 1982International Business Machines CorporationEffective error control scheme for satellite communicationsUS4495619Feb 13, 1984Jan 22, 1985At&T Bell LaboratoriesTransmitter and receivers using resource sharing and coding for increased capacityUS4523323Feb 11, 1983Jun 11, 1985Nippon Electric Co., Ltd.Digital signal communication system for multi-level modulation including unique encoder and decoderUS5134694Apr 11, 1989Jul 28, 1992U.S. Philips CorporationMethod and device for the processing of address wordsUS5428643Jul 28, 1993Jun 27, 1995U.S. Philips CorporationMethod of, and transmitter for, transmitting a digital signalUS5524025Nov 16, 1992Jun 4, 1996At&T Corp.Coding for digital transmissionUS5831561Apr 29, 1997Nov 3, 1998Lucent Technologies Inc.System and method for dynamically optimizing a symbol table and modem employing the sameUS5914959 *Oct 31, 1996Jun 22, 1999Glenayre Electronics, Inc.Digital communications system having an automatically selectable transmission rateUS5953376Nov 25, 1996Sep 14, 1999Lucent Technologies Inc.Probabilistic trellis coded modulation with PCM-derived constellationsUS6126310Jul 25, 1997Oct 3, 2000Telefonaktiebolaget Lm EricssonMethod apparatus and packet transmission system using error correction of data packetsUS6134694Oct 10, 1996Oct 17, 2000Ntt Mobile Communications Network, Inc.Error control method and error control device for digital communicationUS6138260Mar 10, 1998Oct 24, 2000Conexant Systems, Inc.Retransmission packet capture system within a wireless multiservice communications environment with turbo decodingUS6233254Mar 20, 1998May 15, 2001Glen A. MyersUse of feature characteristics including times of occurrence to represent independent bit streams or groups of bits in data transmission systemsUS6247150Feb 29, 2000Jun 12, 2001Nokia Networks OyAutomatic retransmission with order of information changedUS6463106Nov 18, 1998Oct 8, 2002Agere Systems Guardian Corp.Receiver with adaptive processingUS6473878Nov 30, 1999Oct 29, 2002Lucent Technologies Inc.Serial-concatenated turbo codesUS6476734Sep 7, 2001Nov 5, 2002Texas Instruments IncorporatedMethod and apparatus for prioritizing information protection in high order modulation symbol mappingUS6567475Dec 29, 1998May 20, 2003Ericsson Inc.Method and system for the transmission, reception and processing of 4-level and 8-level signaling symbolsUS6584190Sep 7, 1999Jun 24, 2003Nortel Networks LimitedCommunications of telephony control signaling over data networksUS6606355Oct 22, 1999Aug 12, 2003Lucent Technologies Inc.Channel coding in the presence of bit robbingUS6625165 *Jul 27, 1999Sep 23, 2003Lucent Technologies Inc.Data link protocol for wireless systemsUS6647069Apr 30, 1999Nov 11, 2003Texas Instruments IncorporatedMethod and apparatus for capacity increase and enhanced communications performance in CATV networksUS6769085Nov 18, 2002Jul 27, 2004Matsushita Electric Industrial Co., Ltd.Method for modifying a bit sequence in an ARQ restransmission, receiver and transmitter thereforUS6798846Nov 18, 2002Sep 28, 2004Matsushita Electric Industrial Co., Ltd.ARQ retransmission with reordering scheme employing multiple redudancy versions and receiver/transmitter thereforUS6892341 *Feb 21, 2001May 10, 2005Matsushita Electric Industrial Co., Ltd.Data transmission apparatus using a constellation rearrangementUS20050097424Dec 6, 2004May 5, 2005Matsushita Electric Industrial Co., Ltd.Data transmission apparatus using a constellation rearrangementCN1411236ASep 30, 2001Apr 16, 2003华为技术有限公司Data retransmission method based on bit conversionDE19705354A1Feb 12, 1997Aug 13, 1998Siemens AgDigital signal transmission system for radio communications networkEP0938207A2Feb 23, 1999Aug 25, 1999Lucent Technologies Inc.System and method for incremental redundancy transmission in a communication systemEP1043858A1Nov 8, 1999Oct 11, 2000Matsushita Electric Industrial Co., Ltd.Transmitting/receiving device and transmitting/receiving methodEP1447935A1Mar 29, 2002Aug 18, 2004Huawei Technologies Co., Ltd.A data retransmission method based on bit transformJP2000188609A Title not availableJP2000201132A Title not availableJPH066399A Title not availableJPH0738448A Title not availableJPH0865279A Title not availableJPH0879325A Title not availableJPH02312338A Title not availableJPH03274933A Title not availableJPH06252971A Title not availableJPH07143185A Title not availableJPH09307517A Title not availableJPH11177648A Title not availableJPS6455942A Title not availableWO1999059269A1May 11, 1999Nov 18, 1999Ericsson Telefon Ab L MMethod and system for multiplexing of multiple users for enhanced capacity radiocommunicationsWO2003019794A2Aug 14, 2002Mar 6, 2003Nokia CorpMethod and apparatus implementing retransmission in a communication system providing h-arq* Cited by examinerNon-Patent CitationsReference1"ARQ Error Control Techniques," TSG-RAN Working Group 2 (Radio layer and Radio layer3), TSGR2#2(99)085, Stockholm, pp. 1-5, Mar. 8-11, 1999.2"Enhanced HARQ Method with Signal Constellation Rearrangement" TSG-RAN Working Group 1 Meeting #19, Las Vegas, USA, Feb. 27-Mar. 2, 2001, Panasonic, AH24 (HSDPA), XP-02229383 pp. 1-11.36.8 Hybrid ARQ (H-ARQ with Full IR (H-ARQ-Type-II) 3G TR25.848 V0.6.0 (May 2000), TSG-RAN Working Group 1 meeting #19 Las Vegas, USA, Feb. 27-Mar. 2, 2001, pp. 30-45.4A. Burr; Modulation and Coding for Wireless Communications, Pearson Education, Prentice Hall, pp. 133-315.5B. A. Harvey, et al.; "Packet Combininb Systems Based on the Viterbi Decoder", IEEE Transactions on Communications, vol. 42, No. 2/3/4, Feb./Mar./Apr. 1994, pp. 1544-1557.6C. Berrou, et al.; "Near Shannon Limit Error-Correcting Coding and Decoding:Turbo-Codes(1)", IEEE 1993, pp. 1064-1070.7Chinese Office Action dated Feb. 10, 2006 with English translation.8Chinese Office Action dated Jan. 20, 2006 with English translation.9Copy of Application No. 10/182,569.10Copy of Application No. 10/295,899.11Copy of Application No. 10/298,207.12D. Chase; "Code Combining-A Maximum-Likelihood Decoding Approach for Combining an Arbitrary Number of Noisy Packets", IEEE Transactions of Communications, vol. comm.-33, No. 5, May 1985, pp. 385-393.13European Office Action dated Sep. 5, 2005.14European Search Report dated May 31, 2002 related to Application No. 10/295,899.15European Search Report dated May 31, 2002 related to Application No. 10/298/207.16European Search Report dated Oct. 14, 2004.17European Search Report dated Sep. 6, 2005.18Indian Office Action dated Nov. 3, 2004.19International Search Report dated Jan. 29, 2002.20International Search Report dated Oct. 16, 2001.21Japanese Office Action dated Oct. 14, 2003 with English Translation related to Application No. 10/182,569.22K. Narayanan, et al., "A Novel ARQ Technique using the Turbo Coding Principle", IEEE Communications Letter, IEEE Service Center, vol. 1, No. 2, Mar. 1, 1997, pp. 49-51, XP000687091.23Korean Office Action dated Jan. 15, 2005.24M. Isaka, et al., "On the design of bit-interleaved coded modulation with Turbo codes", Institute of Industrial Science, The University of Tokyo, 1999, p. 311.25M. Morimoto, et al.; "A Hierarchical Image Transmission System for Multimedia Mobile Communications," First International Workshop on Wireless Image/Video Communications, IEEE COMSOC, EURASIP, Department of Communications Engineering, Faculty of Engineering, Osaka University, Osaka, Japan, pp. 80-84, Sep. 1996.26M. Morimoto, et al.; "A Hierarchical Image Transmission System in a Fading Channel," Department of Electral Engineering, Faculty of Engineering, Osaka, Japan, IEEE, pp. 769-772, Nov. 1995.27M. P. Schmitt, "Hybrid ARQ Scheme Employing TCM and Packet Combining", Electronics Letters, vol. 34, No. 18, Sep. 3, 1998, pp. 1725-1726.28M. P. Schmitt; "Improved Retransmission Strategy for Hybrid ARQ Schemes Employing TCM", IEEE 1999, pp. 1226-1228.29Office Action dated Aug. 22, 2005 in 11/003,437.30Office Action dated Aug. 30, 2005 in 10/853,266.31Office Action dated Feb. 14, 2006 in 11/003,437.32S. Kallel, et al.; "Throughput Performance of Memory ARQ Schemes", IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999, pp. 891-899.33S. Kallel; "Analysis of a Type II Hybrid ARQ Scheme with Code Combining", IEEE Transactions on Communications, vol. 38, No. 8, Aug. 1999, pp. 1133-1137.34S. Le Goff et al.; "Turbo-Codes and High Spectral Efficiency Modulation", Telecom Bretagne, France Telecom University, IEEE 1994, pp. 645-649.35S. Lin, et al.; "A Hybrid ARQ Scheme with Parity Retransmission for Error Control of Satellite Channels," IEEE Transactions on Communications, vol. com-30, No. 7, Jul. 1982, pp. 1701-1719.36Schmitt, M.P.: Hybrid ARQ scheme employing TCM and packet combining, Electronics Letters, vol. 34, Issue: 18, Sep. 3, 1998 pp. 1725-1726.37US Office Action dated Dec. 8, 2003 in Application No. 10/298,207.38US Office Action dated Jan. 12, 2004 in Application No. 10/295,899.Referenced byCiting PatentFiling datePublication dateApplicantTitleUS7693179 *Dec 6, 2004Apr 6, 2010Panasonic CorporationData transmission apparatus using a constellation rearrangementUS7697565 *Jun 7, 2007Apr 13, 2010Panasonic CorporationData transmission apparatus and communication system using a constellation rearrangementUS7925953 *Dec 11, 2003Apr 12, 2011Nokia CorporationRedundancy strategy selection schemeUS8578231Mar 9, 2011Nov 5, 2013Nokia CorporationRedundancy strategy selection scheme* Cited by examinerClassifications U.S. Classification714/748, 370/465International ClassificationH04L1/16, H04L29/02, H04L5/12, H04L27/34, H04L23/02, H04L1/00, H04L1/18, G08C25/02Cooperative ClassificationH04L1/1819, H04L27/3472, H04L1/1867, H04L27/3416, H04L27/34, H04L1/0003European ClassificationH04L27/34E3C, H04L1/18T, H04L1/00A1M, H04L27/34, H04L27/34C3, H04L1/18D2Legal EventsDateCodeEventDescriptionMay 27, 2014ASAssignmentEffective date: 20140527Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PANASONIC CORPORATION;REEL/FRAME:033033/0163Owner name: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMEFeb 19, 2014FPAYFee paymentYear of fee payment: 8Mar 3, 2010FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services