EP1384345A2 - Procede de conversion de bits d'entree en symboles de modulation - Google Patents

Procede de conversion de bits d'entree en symboles de modulation

Info

Publication number
EP1384345A2
EP1384345A2 EP02740245A EP02740245A EP1384345A2 EP 1384345 A2 EP1384345 A2 EP 1384345A2 EP 02740245 A EP02740245 A EP 02740245A EP 02740245 A EP02740245 A EP 02740245A EP 1384345 A2 EP1384345 A2 EP 1384345A2
Authority
EP
European Patent Office
Prior art keywords
bits
coded
modulation symbols
input bits
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP02740245A
Other languages
German (de)
English (en)
Inventor
Matthias Marke
Wen Xu
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Original Assignee
Siemens AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens AG filed Critical Siemens AG
Publication of EP1384345A2 publication Critical patent/EP1384345A2/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0059—Convolutional codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H04L1/0042—Encoding specially adapted to other signal generation operation, e.g. in order to reduce transmit distortions, jitter, or to improve signal shape
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
    • H04L1/0083—Formatting with frames or packets; Protocol or part of protocol for error control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L2001/0098—Unequal error protection

Definitions

  • the invention relates to a process for reacting a ⁇ output bits onto modulation symbols, in particular involving a convolution coding.
  • Source signals such as voice, sound, image and video almost always include statistical redundancy. This redundancy can be removed by the source coding, so that an efficient transmission or storage of the source signal is made possible.
  • redundancy can be removed by the source coding, so that an efficient transmission or storage of the source signal is made possible.
  • channel coding it is necessary to add redundancy by channel coding in order to eliminate channel interference. It is known to perform convolutional coding as channel coding.
  • Flexible multirate coding and adaptive decoding are often required, since the data to be transmitted generally require different degrees of error protection and / or the transmission channel is time-variant and / or not (fully) known.
  • Flexible multi-rate coding is also understood to mean source and / or channel coding, which makes it possible to extract more or less redundant information from source signals or to add them for error protection, depending on the requirements.
  • a convolutional code is usually described by so-called generator polynomials, by means of which input bits of the convolutional encoder in implemented convolution-encoded and channel encoded code bits ⁇ to.
  • generator polynomial also means a quotient of generator polynomials .
  • the convolutional coding itself is well known to the experts, which is why it will not be discussed further here.
  • a multirate coding scheme is usually implemented by puncturing (removal) of code bits (punctured convolutional / PC code) and / or by repeating code bits (repetition convolutional / RC code) after the fold coding.
  • code bits Punctured convolutional / PC code
  • repeating code bits repetition convolutional / RC code
  • IC insertion convolutional
  • code bits In digital communication, (channel-coded) bits (code bits) are usually transmitted in modulated form.
  • the code bits are combined into symbols or mapped onto them using modulation techniques.
  • modulation techniques The situation arises in particular in the case of higher-order modulation methods that the bit positions which are assigned to a modulation symbol have different channel error susceptibilities due to their relative phases and / or amplitude positions.
  • a higher susceptibility to channel errors means a lower reliability for the correct reception of a bit position if the transmission of the modulation symbol takes place via a disturbed channel.
  • the invention is therefore based on the object of specifying a method for converting input bits to modulation symbols which enables the input bits to be transmitted more reliably than in the prior art. This problem is solved by the features of the independent An ⁇ entitlement. Further developments are evident from the dependi ⁇ gen claims.
  • the invention is based on the fundamental idea that fal ⁇ processing coded input bits, ie code bits ⁇ on the Fal tung coding of input based to assign a prioritization approximation, and the mapping of the convolution-coded input bits to bits of the modulation symbols taking into account the Kanalschreibanfallmaschine of bits the modulation symbols and the prioritization value of the convolutionally coded input bit.
  • the prioritization value describes the relevance of a convolutionally coded input bit (code bits) for incorrectly correcting convolutional decoding on the receiving side.
  • the convolutionally coded input bits are mapped to bit positions of the modulation symbols in such a way that convolutionally coded input bits which have a relatively high prioritization value are mapped to bit positions of the modulation symbols which have a relatively low susceptibility to errors.
  • "Relatively large / small” also means larger / smaller than the corresponding average value.
  • Insertioncode When using a Insertioncodes the receiver side at fixed known value positio ⁇ nen in the data stream, for example, dummy bits with transmitter and voice coded Since ⁇ th inserted.
  • positio ⁇ nen in the data stream, for example, dummy bits with transmitter and voice coded Since ⁇ th inserted.
  • the input bits dummy bits contain, be rules for the assignment of priority values to convolutionally coded input bits is ⁇ , which turned out in the above-mentioned simulations to be particularly advantageous.
  • All convolutionally coded information bits i.e. all bits that are based on convolutional coding of information bits.
  • special convolutionally coded information bits can be excluded in order to achieve lower protection for certain information bits (cf. example below). Priority 6 is then assigned to these excluded bits.
  • the convolutionally coded input bits (code bits) are distributed to the modulation symbols in accordance with the following steps: 1. Start with the bits (code bits) of the highest priority value
  • bit positions with the lowest susceptibility to channel errors are assigned, then the bit positions with the next lowest susceptibility to channel errors become positions with the lowest susceptibility to channel errors within the meaning of rules 2 to 4. Now place the bits that have not yet been placed in accordance with rules 2 to 5.
  • an EDGE 8PSK channel is considered as an exemplary embodiment in which the bits to be transmitted are combined into symbols of 3 bits due to the modulation.
  • This channel is used to transmit speech that has been source-coded with the Adaptive Multi-Rate speech codec when using the lowest data rate of 4.75 kbit / s.
  • a code rate H is chosen for the convolutional encoder.
  • generator polynomials are the generator polynomials
  • G5 / G4 1 + D + D 4 + D 6/1 + D 2 + D 3 + D 5 + D 6
  • G6 / G4 1 + D + D + D 3 + D 4 + D 6/1 + D 2 + D 3 + D 5 + D 6
  • G7 / G4 1 + D + D2 + D3 + D6 / 1 + D 2 + D 3 + D 5 + D 6
  • Bits can be punctured. There remain 246 bits to be transmitted. To terminate the code with memory 6, 6 termination bits are necessary, which result in 24 bits coded. Two bits are punctured. 22 bits remain.
  • Another embodiment of the invention provides, when using repeat codes, to assign a relatively low prioritization value to convolutionally coded repeat bits.
  • the expression "convolutionally coded repeat bit” includes both the convolutional coding of a repeated bit and the repetition of a convolutionally coded bit. This embodiment variant is based on the knowledge that if an output bit of the convolutional encoder is repeated to increase the data rate, this bit is not as susceptible to channel errors due to the multiple transmission. Therefore, such convolution-coded repeat bits can be mapped to bit positions with a relatively high susceptibility to channel errors.
  • G6 / G4 1 + D + D 2 + D 3 + D 4 + D 6/1 + D 2 + D 3 + D 5 + D 6
  • G7 / G4 1 + D + D2 + D3 + D6 / 1 + D 2 + D 3 + D 5 + D 6
  • G5 / G4 1 + D + D + D 6/1 + D 2 + D 3 + D 5 + D 6
  • G6 / G4 1 + D + D 2 + D 3 + D 4 + D 6/1 + D 2 + D 3 + D 5 + D 6
  • the last 3 generator polynomials are a repetition of the first 3 generator polynomials.
  • the 7 bits that are output by the convolutional encoder when the frame bit u (k) is present at the input are: ⁇ C (7k), C (7k + 1), C (7k + 2), C (7k + 3), C (7k + 4), C (7k + 5), C (7k + 6) ⁇ .
  • One or two bits of the double transmitted bits can now be placed on weak bits. The higher channel error susceptibility of these bit positions is then compensated for by the repetition. For example, the assignment could be designed in this way (bold print means: placement on a strong bit)

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)

Abstract

L'invention concerne un procédé de conversion de bits d'entrée en symboles de modulation, selon lequel les symboles de modulation comportent des emplacements de bits qui se différencient l'un de l'autre au moins partiellement en ce qui concerne leur sensibilité aux erreurs de canal. Des bits d'entrée à codage de convolution sont générés à partir des bits d'entrée, au moyen de polynômes de générateur, une valeur de priorisation étant attribuée à chacun de ces bits d'entrée. La reproduction des bits d'entrée à codage de convolution aux emplacements de bits des symboles de modulation se fait avec prise en compte de la sensibilité aux erreurs de canal des emplacements de bits des symboles de modulation et de la valeur de priorisation du bit d'entrée à codage de convolution.
EP02740245A 2001-05-04 2002-04-11 Procede de conversion de bits d'entree en symboles de modulation Withdrawn EP1384345A2 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE10121755 2001-05-04
DE10121755A DE10121755A1 (de) 2001-05-04 2001-05-04 Verfahren zur Umsetzung von Eingangsbits auf Modulationssymbole
PCT/DE2002/001358 WO2002091654A2 (fr) 2001-05-04 2002-04-11 Procede de conversion de bits d'entree en symboles de modulation

Publications (1)

Publication Number Publication Date
EP1384345A2 true EP1384345A2 (fr) 2004-01-28

Family

ID=7683644

Family Applications (1)

Application Number Title Priority Date Filing Date
EP02740245A Withdrawn EP1384345A2 (fr) 2001-05-04 2002-04-11 Procede de conversion de bits d'entree en symboles de modulation

Country Status (5)

Country Link
US (1) US20040177311A1 (fr)
EP (1) EP1384345A2 (fr)
CN (1) CN1518810A (fr)
DE (1) DE10121755A1 (fr)
WO (1) WO2002091654A2 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4469261B2 (ja) 2004-11-22 2010-05-26 パナソニック株式会社 ディジタル信号伝送装置

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1189380A2 (fr) * 2000-09-14 2002-03-20 Texas Instruments Inc. Procédé et système de transmission à niveau inégaux de protection contre les erreurs

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3645027B2 (ja) * 1995-09-20 2005-05-11 松下電器産業株式会社 可変長データ送受信装置
US6678311B2 (en) * 1996-05-28 2004-01-13 Qualcomm Incorporated High data CDMA wireless communication system using variable sized channel codes
GB9814960D0 (en) * 1998-07-10 1998-09-09 Koninkl Philips Electronics Nv Coding device and communication system using the same
EP1059755A1 (fr) * 1999-06-09 2000-12-13 Lucent Technologies Inc. Protection variable contre les erreurs pour réseaux à commutation par paquets
FI115178B (fi) * 2000-10-31 2005-03-15 Nokia Corp Menetelmä ja järjestely bittien suojaamiseksi parhaalla mahdollisella tavalla tiedonsiirtovirheitä vastaan
US6981202B2 (en) * 2001-01-08 2005-12-27 Nokia Corporation Method and system for allocating convolutional encoded bits into symbols before modulation for wireless communication

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1189380A2 (fr) * 2000-09-14 2002-03-20 Texas Instruments Inc. Procédé et système de transmission à niveau inégaux de protection contre les erreurs

Also Published As

Publication number Publication date
WO2002091654A2 (fr) 2002-11-14
WO2002091654A3 (fr) 2003-01-23
CN1518810A (zh) 2004-08-04
US20040177311A1 (en) 2004-09-09
DE10121755A1 (de) 2002-11-07

Similar Documents

Publication Publication Date Title
DE10008064B4 (de) Verfahren zum Anpassen der einem Turbo-Codierer zuzuführenden Datenblöcke und entsprechende Kommunikationsvorrichtung
EP1198913B1 (fr) Procede pour empecher les erreurs dans un train de bits d'information
DE60216040T2 (de) Verfahren und vorrichtung zur zuordnung faltungscodierter bits zu symbolen vor deren modulation
DE19935785A1 (de) Verfahren und Einrichtung zur Erzeugung eines ratenkompatiblen Codes
EP0353694A2 (fr) Procédé pour le codage à correction d'erreurs économe en redondance dans un système hertzien numérique à plusieurs niveaux
DE102017216264B4 (de) Decodierverfahren
WO2002091654A2 (fr) Procede de conversion de bits d'entree en symboles de modulation
DE19907728A1 (de) Vorrichtung und Verfahren zum Erzeugen eines Datenstroms und Vorrichtung und Verfahren zum Lesen eines Datenstroms
EP1142185B1 (fr) Procede et systeme pour le codage de canaux ou le decodage d'informations a structure de trame
EP1512242B1 (fr) Pointillage identique pour donnees d'identification d'equipement utilisateur et pour donnees utiles de canal hs-scch
EP0958685B1 (fr) Procede et configuration de circuit destines a une transmission de donnees amelioree
DE102013201422B3 (de) Verfahren zum Wiederherstellen verlorengegangener und/ oder beschädigter Daten
DE102016201408B4 (de) Verfahren zum Übertragen von Daten
DE19520987A1 (de) Verfahren zur Terminierung des Trellis bei rekursiven systematischen Faltungscodes
WO2000074295A1 (fr) Procede et dispositif pour le codage flexible de canal
EP1329024A1 (fr) Procede et dispositif de codage de canal
EP1016236B1 (fr) Decodage rapide de donnees codees par convolution, partiellement recues
WO2002056479A1 (fr) Procede et dispositif de codage ou de decodage
DE102017200075B4 (de) Entschlüsselungsverfahren sowie Kommunikationssystem
DE19953894B4 (de) Datenübertragungsverfahren und -vorrichtung
DE69426526T2 (de) Gerät zur Dekodierung mit Fehlerkorrektur in digitalen Datenübertragungssystemen
DE102014215477B3 (de) Verfahren zum Übertragen von Daten
DE102004003158A1 (de) Verfahren zur Erstellung zweier oder mehrerer Transportblöcke aus zwei oder mehreren Informationsblöcken, zugehörige Vorrichtung zur Durchführung des Verfahrens
DE10236006B3 (de) Verfahren zur Datenübertragung in einem Kommunikationssystem
WO2000035138A1 (fr) Procede de codage canal enchaine adaptatif

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20031027

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

17Q First examination report despatched

Effective date: 20040609

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Effective date: 20041006