CN1471780A - Method and system for channel decoding based on combination of punctured convolutional code and QAM - Google Patents
Method and system for channel decoding based on combination of punctured convolutional code and QAM Download PDFInfo
- Publication number
- CN1471780A CN1471780A CNA018178227A CN01817822A CN1471780A CN 1471780 A CN1471780 A CN 1471780A CN A018178227 A CNA018178227 A CN A018178227A CN 01817822 A CN01817822 A CN 01817822A CN 1471780 A CN1471780 A CN 1471780A
- Authority
- CN
- China
- Prior art keywords
- corpse
- measurement value
- branch metric
- bit
- branched measurement
- 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.)
- Granted
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/0045—Arrangements at the receiver end
-
- 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/0067—Rate matching
- H04L1/0068—Rate matching by puncturing
-
- 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/0071—Use of interleaving
Abstract
A method and device for channel decoding. In the transmitter, input bits are encoded based upon a punctured convolutional code, the symbols synthesized with the encoded bits are interleaved and then provided to a QAM modulator; In the receiver, the received signal is de-interleaved, and the de-interleaved data is decoded to out put the estimate values of the coded bits the values of the branch metrics are gained by processing the real part and imaginary part of the received signal respectively utilizing the information of modulation mode and truncated-bit-matrix. Comparing with other decoding method, the calculation in thep resent is simple and improves efficiency of the communication system.
Description
It is combined based on reliability enhanced deleting convolution code with QAM modulation
Channel decoding method and systems technology field
Channel decoding method and the system background technology that reliability enhanced deleting convolution code (Punctured Convolut iona l Code) is combined with QAM modulation are based on the present invention relates to one kind of communication technical field, more particularly to communication system
Due to the influence that data signal is interfered in transmitting procedure, signal element waveform is degenerated, therefore be transferred to after receiving terminal the judgement that may make a mistake.In order to solve the influence of interference, in addition to considering in terms of reasonably selecting modulation mode, demodulation method and transmit power, it is also contemplated that Error Control measure.In Modern Communication System, modem and error correction CODEC are two main parts, they are also to improve communication system information transmission rate, reduce by two key equipments of the bit error rate, in the prior art, the method being combined with channel coding will be modulated by proposing, and show preferably gain characteristic.
How digital communication system is concerned about in given signal to noise ratio（SNR the handling capacity of transmission data is improved under).Error correcting code is to improve the important means of communications system transmission information reliability, the use of error correcting code（Such as convolutional code）Enable the system to use lower signal to noise ratio（) or higher data rate reaches the identical bit error rate (BER) SNR.The reduction of signal to noise ratio is commonly known as coding gain.Coding gain can be determined by bit error rate performance curve.In a bit error rate performance curve, do not encode and various code rates performance curve all using Eb/NO as abscissa, wherein Eb be bit power, NO be white Gauss noise one-sided power spectrum density.Coding gain is for fixed BER, not coding and the difference of the abscissa Eb/NG values corresponding to coded curve.
Convolution coder and viterbi decoder are defined with code rate and constraint degree.Code rate（M/n) represent that correspondence encoder produces n code word of output, input inputs m bit.Constraint degree K adds one for the register number of convolution coder.
Viterbi（VB) basic thought of decoding algorithm is the encoded codeword information stream for receiving a Noise, trrellis diagram is shifted using the state of convolutional code, effectively calculate and update the conditional probability of 2 kinds of states so as to search a maximum likelihood path, wherein k is constraint degree.In order to calculate maximum likelihood path, each group of input bit ^-1The conditional probability of the state of kind is required for calculating.To the coding that speed is 1/2, each calculated decision value is stored in path memory with a bit.The storage depth of path memory, which is sufficiently large, causes the probability for selecting the paths to tend to 1.To the coding that bit rate is 1/2, selectable path length is about 5K.One bit rate should accordingly be increased for 2/3 Punctured Code preferably path length.
In article " Development of Var iable-Rate Vi terbi Decoder and I t s Performance Character i s t ics " (the 6th digital communication by satellite international conference, Phoenix Ar iz., September 1983, Y. Yasuda, Y. Hi rata, K. Nakamura and S. Otani) in mention a kind of method, i.e. high-speed binary system convolutional encoding can be formed by a simple low rate binary system convolutional encoding construction, that is to say that reliability enhanced deleting is encoded.It deletes a part of bit data after coding to reach high-speed, passes letter rate except improving system, the direct coding method with code check relatively does not have the decline in performance, the advantage is that：System need to only use a kind of speed（Such as coding, decoder 1/2), various high bit rates can be but obtained.
QAM (Quadra ture Ampl i tude Modulat ion) quadrature amplitude modulation is a kind of amplitude modulation(PAM), is the efficient narrowband modulation mode of technology maturation.With the development of mobile communication, it is desirable to high-speed, the Digital Transmission of spectral efficient, attention of the QAM because causing people the characteristics of it has spectral efficient is special
It is not 16QAM therein and 64QAM.
The interpretation method of original reliability enhanced deleting convolution code, it is the signal message with the Noise received, according to known coded system and cut position matrix, first calculate the branched measurement value of the input bit at each moment, input again in decoder and search out a maximum likelihood path, be the estimate of originator bit sequence.But in the decoding process of this method is calculated, when calculating corresponding bit and being cut out the branch metric at position, exhaustive all situations introduce more unnecessary calculating, the information for not making full use of coding and modulation system to be provided.The content of the invention
It is an object of the invention to provide a kind of new channel decoding method being combined based on reliability enhanced deleting convolution code with QAM modulation and system, the information for taking into full account and being provided using coding and modulation system is provided, the various information of QAM constellation are particularly considered, simplify the computation complexity of similar approach in the prior art.In addition, by using the present invention this channel decoding method, can effectively reduce related hardware-design complexity, saved cost, it ensure that the bit error rate does not increase or increased seldom in the case of high transmission speeds and more multidimensional simplex mode.This is highly profitable for Modern Mobile Communications Systems.
According to an aspect of the invention, there is provided a kind of channel decoding method being combined based on reliability enhanced deleting convolution code with QAM modulation, including：
Transmitting terminal input information bits；Reliability enhanced deleting convolution code coding is carried out to input bit；Coded-bit is converted into symbol；The symbol is interleaved；Sent after being modulated with qam mode；
Received modulated signal is deinterleaved using the mode corresponding with transmitting terminal interleaving mode in receiving terminal；It is determined that branched measurement value required during decoding；Using the branched measurement value to deinterleaving after
Modulated signal enters row decoding；Export the estimate of transmitting terminal input bit；
It is characterized in that using the cut position matrix and modulated signal spatial coordinated information of precognition, when calculating the branched measurement value at cut position, calculating respectively real part, imaginary part.
According to another aspect of the present invention, there is provided a kind of signal sending/receiving system for realizing above-mentioned channel decoding method, dispensing device and reception device including signal, wherein described dispensing device includes signal input apparatus, reliability enhanced deleting convolution code encoder, truncator, signal converter, interleaver, QAM modulation device；Reception device includes deinterleaver, and branch metric calculator, VB soft decision decoders, is characterized in that：The information bit of dispensing device is encoded in reliability enhanced deleting convolution code encoder, and is converted in signal converter symbol；The symbol is interleaved in interleaver, modulated in QAM modulation device, and send；Reception device deinterleaves received modulated signal in the interleaver corresponding to transmitting terminal interleaver, data after deinterleaving are used to calculate branched measurement value in branch metric calculator, the result of output is used in the decoding of VB soft decision decoders, to search for the maximum likelihood path of transmitting terminal sequences of code bits, and export the estimate of transmitting terminal input bit
When branched measurement value required during decoding is determined wherein in the branch metric calculator, using the cut position matrix and modulated signal spatial coordinated information of precognition, when calculating the branched measurement value at cut position, real part, Virtual portions are calculated respectively.
According to the present invention channel decoding method and system, under the same conditions（Identical low-rate speech coder, identical code rate, identical cut position matrix, identical modulation system）Other method can be compared（Common method as described above）More coding gains are brought with system, while the complexity calculated has declined, and the design complexities of relevant device is simplified, improves the efficiency of communication system.Brief description of the drawings
Below in conjunction with the accompanying drawings, the embodiment to the present invention is described in further detail.
Fig. 1:Preferred embodiment transmitter architecture；
Fig. 2:Preferred embodiment receiver structure；
Fig. 3:The R- 16QAM modulation constellations used in present pre-ferred embodiments；
Fig. 4:Under conditions of identical, the inventive method and performance comparision of the previous methods under awgn channel；
Fig. 5:The R-64QAM used in present pre-ferred embodiments modulation constellation.Embodiment
Below by embodiment and accompanying drawing, the present invention will be described in detail.
This channel decoding method being combined based on reliability enhanced deleting convolution code with QAM modulation of the present invention, it is the branched measurement value needed for being determined by making full use of the information that coding and modulation system are provided during decoding, when calculating branched measurement value, value of real part and imaginary values to signal message are individually handled, reduce unnecessary calculating, the design complexities of relevant device are simplified, the efficiency of transmission of communication system is improved.
This channel decoding method being combined based on reliability enhanced deleting convolution code with QAM modulation of the present invention, in transmitting terminal：Bit stream is input in reliability enhanced deleting convolution coder, coded-bit synthesis symbol, carries out symbol interleaving, then input in QAM modulation device and be modulated in a particular manner.
Receiving end is input in branch metric calculator after deinterleaving the signal real part received, imaginary values, VB soft decision decoders（According to previously known cut position mode）The metric exported using branch metric calculation is progressively decoded, the estimate of output originator bit.
Refer to the attached drawing 1, accompanying drawing 1 shows the transmitter architecture of a preferred embodiment of the present invention.This compared with
In good embodiment, from signal input apparatus（It is not shown）Incoming bit stream ^2... encoded device 1 is encoded.Encoder 1 is the convolution coder that a code rate is R=l/2, and truncator 2 is according to predetermined matrix PM to coded-bit（Or code word）Reliability enhanced deleting is carried out, code rate can be made to bring up to K/N.Wherein correspond to every K bit of input（2K coded-bit of correspondence）, only N- K are by encoder 1 to coded-bit while two coded-bits exported（Referred to as a pair of coded-bits）Synthesis, it is that remaining two coded-bits are synthesized after cut position in the two pairs of coded-bits exported by encoder 1 to coded-bit to have 2K-N.In this specific embodiment, the speed of reliability enhanced deleting convolutional encoding is 2/3.
The coded-bit of output synthesizes a symbol per S bit.R- 16QAM modulation system=4 of correspondence the present embodiment.
The effect of intertexture is to improve the adjacent spacing between the coherent signal sent.When there is one section of burst error, these burst errors can be diffused on incoherent symbol by intertexture, so as to improve the error correcting capability of viterbi decoder.The symbol of one group of interleaved device 4 is sent in R-16QAM modulators 5, produces modulated signal, and the planisphere used in preferred embodiment is as shown in Figure 3.There are certain mapping relations in the horizontal stroke of modulated signal, ordinate value and the bit being encoded, the relation is determined by reliability enhanced deleting matrix P and modulation system, there is specific utilize and embodiment during following decoding.
Refer to the attached drawing 2, accompanying drawing 2 shows the receiver structure of present pre-ferred embodiments.In the receiving end of receiver, receiver is directly inputted in branch metric calculator after deinterleaving the reality of the signals and associated noises received, Virtual portions value.VA decoders（According to previously known cut position mode）The metric exported to branch metric calculation is processed, and is progressively decoded, the estimate of output originator bit.
Referring also to accompanying drawing 2, the signals and associated noises received are separately input in deinterleaver 7 and 8 by receiver.Cut position matrix PM (cycle is P) is expressed as: (pu , pMp2„p22)...(pPi ,PP2) ' its equivalent rank transformation can be made for arbitrary cut position matrix, make two of only one of which 0 in a row to arrange adjacent.In the present embodiment
In, cut position matrix is（1011,1101) mode that 1/2 rate convolutional encodes two output port cut positions, is corresponded to respectively.Wherein 0 represents to delete, and 1 represents to retain.
By the reception signal ^ after deinterleaving) to send into branch metric calculator 9, calculated branched measurement value is input in VB soft decision decoders 10 again.
R- 16QAM as shown in Figure 3 are modulated, the branched measurement value used in decoder is based on following consideration.
16QAM modulated signals vector end-points signal space seat ' mark, determined by input information data.Real part, imaginary part are separate in modulation constellation.Two coded-bits and the real part of planisphere or the corresponding pass systems of imaginary values produced by encoder are as shown in table 1 below：
00—— 3.0a
01—— 1. Oa
10—— (-3.0a)
11 --- (- 1. Oa) table 1
As shown in Table 1, in two code words first code word respective coordinates value value of symbol,（0 corresponds to just, and 1 corresponds to bear）；The order of magnitude of second code word respective coordinates value（0 corresponds to 3.0a, and 1 corresponds to 1.0a).Wherein parameter a is determined by the mean power of signal.
Thus, with reference to presently preferred embodiments of the present invention（Code rate is R=2/3, and cut position matrix is（), 1011,1101) computational methods of branched measurement value are described in detail.
If the signal value now received is,）, the process cycle of presently preferred embodiments of the present invention is 3.
(1) if z' ° of moment/.3 = 0
1) calculate（Cl, c2) branch metric, be respectively that the two coded-bits and coordinate pair should
Square of difference between value.
Corpse 1 (0,0)
P1(1,0) = (r^ + 3.0α)2 Fl(l,l) = (^+1.0σ)2
2) calculate（*, 0) and（*, branch metric 1)：
2(0) -1.0。)2}
2(l)
+ 1.0α)2}
3) calculate（0, *) and（1, *) branch metric：
Corpse 3 (1)=min { { riy― 1.Oa)2, (riy +1.0a)2}
4) now in a decoder, state transition diagram top set metric corresponding to three bits of input respectively is：
dJ =P\(Mx(bmJ),M2(bmj))
dJ =P2(M2(bmJ))
Wherein M, bm 、 M2(bmj) represent encoder buffer status be m (m=0 ..., 2M- 1, M are register number）When, two bit values that input bit _/is exported, are 0 or 1. ( j =0, 1)
If) moment %3 1
1) calculate（D, c2) branch metric：
Corpse 1 (0,0)=(r -3.0a)2Corpse 1 (0,1)=(^-1.Oa)2
1(1,0) = + 3.0。)2 Pl(l,l) = (^+1.0。)2
2) calculate（Cl, C2) branch metric：
Corpse 1 (0,0)=(riy -3.0α)2Corpse 1 (0,1)={ riy -1.0α)2
^1(1,0) = (riy + 3.0α)2Corpse 1 (1,1)=(riy + 1.0a)2
3) now in a decoder, state transition diagram top set metric corresponding to three bits of input respectively is：
rfv = l( ,(bm;), 2(6m,))
(3) if moment %3==2
1) calculate（*, 0) and（*, branch metric 1)：
1(0) = πιίη{(^-3.0α)2,(Γώ-1.0α)2}
Ρ1(1) = πιίη{(^+3.0α)2,(^+1.0α)2}
2) calculate（0, *) and（1, *) branch metric：
F2(0) = πιίη{(^ -3.0α)2, (^ + 3.0α)2}
Corpse 2 (1)=min { (- 1.0 α)2,( +1·0。)2}
3) calculate（ cl,C2) branch metric：
Ρ3(0,0) = (^ -3.0α)2 Ρ3(0,1) = ( ― 1.0。)2
Corpse 3 (1,0)=(riy +3.0α)2Corpse 3 (1,1)=(riy + 1.0。)2
4) now in a decoder, state transition diagram top set metric corresponding to three bits of input respectively is：
. =P2( ,(0m;))
In branch metric calculation formula more than it can be seen that advantage of the invention is that：
(1) the branch metric number for precalculating out is identical with existing interpretation method, but the calculating of each branch metric is substantially reduced in terms of the number for comparing distance, and only original 1/4.This is due to when calculating branched measurement value, the information of modulation system and cut position matrix is taken full advantage of, so that relative to conventional interpretation method, calculating suitable cylinder list and effective, number of comparisons needed for simultaneously is also reduced, and adds the arithmetic speed of calculating.
(2) when calculating each branched measurement value, no longer using original Euclidean distance（Actual noisy acoustical signal and signal reality, the quadratic sum of the difference of imaginary part that should be obtained）And simply independent processing to real part or Virtual portions, it is square of the difference of coordinate value on the real part or imaginary values and planisphere of noisy acoustical signal, this calculating for allowing for the branched measurement value at each moment can be with parallel processing, so as to improve the speed of calculating, time delay is reduced.
Processing in VB soft decision decoders 10 is also comparatively simple, two coded-bits for only needing known various states to input after 0 or 1, and this is identical with the memory requirement of hard decision.Each decoding moment, each current state of correspondence and input bit, with reference to the rules of cut position, required branched measurement value are read from branched measurement value memory, an optimal path is searched out, provide the estimate of originator coded-bit.The specific mode for reading in data is as above shown in method.
Refer to the attached drawing 5, the R- 6 shown in accompanying drawing 54QAM modulation constellation, the branched measurement value used in its decoder is based on following consideration.
64QAM modulated signals vector end-points are determined in the coordinate of signal space by input information data.Real part, Virtual portions are separate in modulation constellation.Three coded-bits and the real part of planisphere or the corresponding relation of Virtual portions value produced by encoder are as shown in table 2 below：
000 7. Oa
001—— 5.0a
Oil—— 3. Oa
010—— 1. Oa
110——（- 1. Oa)
111—— (-3. Oa)
101——（—5. Oa)
100——（One 7. Oa) table 2 as shown in Table 2, the value of symbol of first code word respective coordinates value in three code words,（G is corresponded to just, and 1 corresponds to bear）；The order of magnitude of two code word respective coordinates values afterwards（00 corresponds to 7.0a, and 01 corresponds to 5.0a, and 11 correspond to 3.0a, and 10 correspond to 1.0a).Wherein parameter a is determined by the mean power of signal.With above-mentioned identical method, required branched measurement value equally can be simply calculated.
The other forms of planisphere shown in accompanying drawing 5 Gray arrangement be obviously also can with, the modulation system of more higher-dimension can use same method to promote.Convert cut position matrix, conversion modulation constellation all equally can obtain both simple and effective interpretation method using the method for the invention, for those skilled in the art, under the premise without departing from the spirit and scope of the present invention, the modulation system of more higher-dimension and various modifications is also easily to realize.
Claims (1)
- Claims1st, a kind of channel decoding method being combined based on reliability enhanced deleting convolution code with QAM modulation, including step：Transmitting terminal input information bits；Reliability enhanced deleting convolution code coding is carried out to input bit；Coded-bit is converted into symbol；The symbol is interleaved；Sent after being modulated with qam mode；Received modulated signal is deinterleaved using the mode corresponding with transmitting terminal interleaving mode in receiving terminal；It is determined that branched measurement value required during decoding；Row decoding is entered to the modulated signal after deinterleaving using the branched measurement value；Export the estimate of transmitting terminal input bit；Characterized in that, in the branched measurement value step required in the determination decoding, using the cut position matrix and modulated signal spatial coordinated information of precognition, when calculating the branched measurement value at cut position, calculating respectively real part, Virtual portions.2nd, channel decoding method as claimed in claim 1, it is characterised in that described coded-bit has following mapping relations with modulated signal space coordinate：The value of symbol of first code word respective coordinates value in two code words, wherein 0 corresponds to just, 1 corresponds to bear；The order of magnitude of second code word respective coordinates value, wherein 0 corresponds to 3. 0a, 1 corresponds to 1. 0a, and parameter a is determined by the mean power of signal. 3rd, channel decoding method as claimed in claim 1 or 2, it is characterised in that it is described row decoding is entered to the modulated signal after deinterleaving using the branched measurement value the step of in, value as follows when entering row decoding using branched measurement value：(1) if moment %3 0,1) calculate（D,C2) branch metric, is respectively square of difference between the two coded-bits and coordinate respective value.Ρ1(0,0) = -3.0α)2Corpse 1 (0,1)=- 1.OafThe α of (1,0)=+ 3.0 of corpse 1)2Corpse 1 (1,1)=(^+Ο α)22) calculate（*, 0) and（*, branch metric 1)：Corpse 2 (0)=min { (- 3.0a)2,(riy -1.0α)2}Corpse 2 (1)=min { (+3.0a)2,(riy + 1.Οα)2 }3) calculate（0, *) and（1, *) branch metric:3(0) = min{(^ -3.0a)2,(riy +3.0a)2}Corpse 3 (1)=min { (- 1.0 α)2,(^+1.0Ω)24) now in a decoder, state transition diagram top set metric corresponding to three bits of input respectively is：dJ. =Pl(Ml(bmJ))M2(bmJ))(2) if the moment
, then
1) calculate（D, c2) branch metric： Corpse 1 (0,0)=(r^ -3.0a)2Corpse 1 (0,1)=(- 1.0 α)2P1(1,0) = ( + 3.0α)2Corpse 1 (1,1)=(^+1. Ο α)22) calculate（Cl, c2) branch metric：1(0,0) = (riy -3.0α)2 Ρ1(0,1) = (riy -\.0α)2Corpse 1 (1,0)=(riy +3.0α)2Corpse 1 (1,1)=(riy + 1.0α)23) now in a decoder, state transition diagram top set metric corresponding to three bits of input respectively is：dj =Pl(Ml(bmJ),M2(bmJ)) dj =P\{M,{bmj),M2{bmj))(3) if the moment!' %3==2, then1) calculate（*, 0) and（*, branch metric 1)：Corpse 1 (0)=min { (rte -3.0a)2, - 1.0。)2 }l(l) = min{(rir+3.0a)2,(rir + 1.0a)2}2) calculate（0, *) and（1, *) branch metric:Ρ2(0) = πιίη{(^-3.0α)2,(^+3.0α)2Corpse 2 (1)=min { fe -1.0.)2 , + 1. af }3) calculate（Cl, c2) branch metric：Corpse 3 (0,0)=(riy-3.0a)2Corpse 3 (0,1)=(riy -1.0α)2Corpse 3 (1,0)=(riy + 3.0a)2Corpse 3 (1,1)
4) now in a decoder, state transition diagram top set metric corresponding to three bits of input is not successively：
dJ =P2(Ml(bmJ))d^P {M,(bmj) 2(bmj))Wherein (), M2() is represented when encoder buffer status is m, input bit；Two bit values exported are 0 or 1, here;《=0,1..., 2W- 1, M are register number, _ /=0,1.4th, channel decoding method as claimed in claim 1, it is characterised in that can make its equivalent rank transformation to the cut position matrix, makes two of only one of which 0 in a row to arrange adjacent.5th, the channel decoding method as described in claim 1 or 4, it is characterised in that the cut position matrix is (1011,1101), wherein 0 represents to delete, 1 represents to retain.6th, the channel decoding method as described in claim 1 or 4, it is characterised in that described QAM modulation is R -16QAM modulation or R -64QAM modulation.7th, the channel decoding method as described in claim 1 or 4, it is characterised in that described convolutional code rate is 1/2, the speed of reliability enhanced deleting convolutional encoding is 2/3.8th, a kind of signal sending/receiving system for realizing channel decoding method as claimed in claim 1, dispensing device and reception device including signal, wherein described dispensing device includes signal input apparatus, reliability enhanced deleting convolution code encoder, truncator, signal converter, interleaver, QAM modulation device；Reception device includes deinterleaver, branch metric calculator, VB soft decision decoders, it is characterised in that：The information bit of dispensing device is encoded in reliability enhanced deleting convolution code encoder, and is converted in signal converter symbol；The symbol is interleaved in interleaver, modulated in QAM modulation device, and send；Received modulated signal is solved friendship by reception device in the interleaver corresponding to transmitting terminal interleaver Knit, data after deinterleaving are used to calculate branched measurement value in branch metric calculator, and the result of output is used in the decoding of VB soft decision decoders, to search for the maximum likelihood path of transmitting terminal sequences of code bits, and export the estimate of transmitting terminal input bitWhen branched measurement value required during decoding is determined wherein in the branch metric calculator, using the cut position matrix and modulated signal spatial coordinated information of precognition, when calculating the branched measurement value at cut position, real part, imaginary part are calculated respectively.9th, system as claimed in claim 8, it is characterised in that described branched measurement value is cut position matrix and modulated signal spatial coordinated information using precognition to determine.10th, system as claimed in claim 8, it is characterised in that branched measurement value of the branched measurement value at correspondence cut position matrix cut position is that value of real part, the imaginary values of the docking collection of letters number respectively are individually handled.11st, system as claimed in claim 8, it is characterised in that：The encoder is one 1/2 encoder for convolution codes, and the speed of reliability enhanced deleting convolution coder is 2/3.12nd, system as claimed in claim 8, it is characterised in that：The QAM modulation device is R -16QAM modulators.13rd, system as claimed in claim 8, it is characterised in that：The QAM modulation device is R -64QAM modulators.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2001/001269 WO2003024043A1 (en) | 2001-08-24 | 2001-08-24 | A method and system for channel decoding based on a combination of punctured convolutional code and qam |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1471780A true CN1471780A (en) | 2004-01-28 |
| CN1211986C CN1211986C (en) | 2005-07-20 |
Family
ID=4574848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN01817822.7A Expired - Fee Related CN1211986C (en) | 2001-08-24 | 2001-08-24 | Method and system for channel decoding based on combination of punctured convolutional code and QAM |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN1211986C (en) |
| WO (1) | WO2003024043A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102055557A (en) * | 2010-12-29 | 2011-05-11 | 北京星河亮点通信软件有限责任公司 | Decoding method for 4*4SAST (Semiorthogonal Algebraic Space-Time) codes suitable for QAM (Quadrature Amplitude Modulation) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110958025B (en) * | 2019-12-17 | 2023-03-31 | 中山大学 | Short frame length coding and decoding method based on superposition |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5848102A (en) * | 1993-06-04 | 1998-12-08 | Qualcomm Incorporated | Method and apparatus for encoding/decoding QAM trellis coded data |
| US6347122B1 (en) * | 1998-01-13 | 2002-02-12 | Agere Systems Guardian Corp. | Optimal complement punctured convolutional codes for use in digital audio broadcasting and other applications |
| CA2289344C (en) * | 1998-12-21 | 2005-06-28 | Lucent Technologies Inc. | Optimal complementary punctured convolutional codes |
-
2001
- 2001-08-24 CN CN01817822.7A patent/CN1211986C/en not_active Expired - Fee Related
- 2001-08-24 WO PCT/CN2001/001269 patent/WO2003024043A1/en active Application Filing
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102055557A (en) * | 2010-12-29 | 2011-05-11 | 北京星河亮点通信软件有限责任公司 | Decoding method for 4*4SAST (Semiorthogonal Algebraic Space-Time) codes suitable for QAM (Quadrature Amplitude Modulation) |
| CN102055557B (en) * | 2010-12-29 | 2013-03-06 | 北京星河亮点技术股份有限公司 | Decoding method for 4*4SAST (Semiorthogonal Algebraic Space-Time) codes suitable for QAM (Quadrature Amplitude Modulation) |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2003024043A1 (en) | 2003-03-20 |
| CN1211986C (en) | 2005-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1140059C (en) | Iterative demapping | |
| US6662337B1 (en) | Digital transmission system and method | |
| USRE38010E1 (en) | Trellis encoder and decoder based upon punctured rate ½ convolutional codes | |
| KR20040091752A (en) | Communication device and communication method | |
| CN107231158B (en) | Polarization code iterative receiver, system and polarization code iterative decoding method | |
| US6944206B1 (en) | Rate one coding and decoding methods and systems | |
| US20030026346A1 (en) | Communication apparatus and communication method | |
| CN101262307B (en) | A serial cascaded compiling and decoding system including rotary modulation mode of constellation map | |
| Martin et al. | On multilevel codes and iterative multistage decoding | |
| CN115225202B (en) | Cascade decoding method | |
| JP4675312B2 (en) | Encoding device, decoding device, transmitter, and receiver | |
| JP4543479B2 (en) | Communication system and method | |
| WO2003017500A1 (en) | Coded modulation scheme for a wireless communication system and methods thereof | |
| US20020108083A1 (en) | Communication apparatus and communication method | |
| Lampe et al. | Coded differential space-time modulation for flat fading channels | |
| CN1471780A (en) | Method and system for channel decoding based on combination of punctured convolutional code and QAM | |
| CN109672500B (en) | 8APSK mapping method of LDPC-BICM-ID system | |
| US8098773B1 (en) | Communication method and apparatus | |
| CN1221113C (en) | Method and device of chennel decoding based on reliability enhanced deleting convolution code and QAM modulated code | |
| EP1184990A1 (en) | Communication apparatus and communication method | |
| JP2001217724A (en) | Communication apparatus | |
| CN108432168A (en) | A kind of method and apparatus demodulated and decode | |
| Öztürk et al. | A combined interleaving technique for trellis coded MPSK systems in Rayleigh fading channels | |
| Benmahmoud et al. | The Effects of Signal Mappings on the Performances of a BICM-ID System Based on 8PSK Constellation Operating over a Rayleigh Fading Channel | |
| ALBAJI et al. | INVESTIGATE THE PERFORMANCE OF 16-PHASE SHIFT KEYING (PSK) MODULATION TECHNIQUE IN AWGN ENVIRONMENT WITH AND WITHOUT CHANNEL CODING |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C19 | Lapse of patent right due to non-payment of the annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |