CN101107781B - Encoding and error correction system for enhanced performance of legacy communications networks, and method thereof - Google Patents
Encoding and error correction system for enhanced performance of legacy communications networks, and method thereof Download PDFInfo
- Publication number
- CN101107781B CN101107781B CN2005800443386A CN200580044338A CN101107781B CN 101107781 B CN101107781 B CN 101107781B CN 2005800443386 A CN2005800443386 A CN 2005800443386A CN 200580044338 A CN200580044338 A CN 200580044338A CN 101107781 B CN101107781 B CN 101107781B
- Authority
- CN
- China
- Prior art keywords
- data
- classification
- coding
- header
- long frame
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 16
- 238000012937 correction Methods 0.000 title claims abstract description 12
- 238000004891 communication Methods 0.000 title description 5
- 230000011218 segmentation Effects 0.000 claims description 14
- 230000005540 biological transmission Effects 0.000 claims description 12
- 238000010586 diagram Methods 0.000 description 6
- 238000013507 mapping Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 4
- 230000000875 corresponding effect Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000002596 correlated effect Effects 0.000 description 2
- 230000006866 deterioration Effects 0.000 description 2
- 230000008676 import Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 206010019133 Hangover Diseases 0.000 description 1
- XUIMIQQOPSSXEZ-UHFFFAOYSA-N Silicon Chemical compound [Si] XUIMIQQOPSSXEZ-UHFFFAOYSA-N 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000001276 controlling effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
- 229910052710 silicon Inorganic materials 0.000 description 1
- 239000010703 silicon Substances 0.000 description 1
- 238000005728 strengthening Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Images
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/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
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)
Abstract
An encoding and error correction system and method employs an AMR codec (18) by stripping header data from a plurality of legacy system frames (10) having header and traffic channel (TCH) data blocks.Speech data is then encoded using the AMR to create bits for a data block substantially the same as contained in the plurality of frames. The stripped header data is encoded as a long frame header using a fixed convolution coder(24). The speech data is then convolutionally encoded and the long frame header and encoded speech data are combined as a long frame (32). The long frame is then deconstructed into a plurality of equal segments (106, 110) and the segments are transmitted as TCH data in the legacy system frame format.
Description
Technical field
Relate generally to of the present invention is used for the coding and the field of error correction of transmitting system, more specifically, relates to the use of the senior vocoder (vocoder) that has bit mapping and coding, leaves over (legacy) communication system to strengthen error-correcting performance thereby improve.
Background technology
Sources of waveforms Code And Decode (codec) is widely used in the early stage digital mobile communication system, for example personal handyphone system (PHS).Since the technical limitations when realizing, the data that some system design does not provide suitable channel coding/decoding to be transmitted with protection.For these systems, when channel quality conditions worsens, make that in order to ensure high bit-error the control bit that speech performance can't be accepted and some is important is destroyed easily.As a result, upper-layer protocol in the system and controlling mechanism may be activated to turn-off channel.This is one of common reason of losing during ongoing communication session connection.
In some senior 2G mobile system and all 3G systems, there are adaptive many speed (AMR) vocoder and corresponding chnnel coding ability.Under the AMR standard,, there are 8 different data rates for Code Excited Linear Prediction (CELP) audio coder ﹠ decoder (codec).The scope of these data rates is from 12.2kbps to 4.75kbps.The voice messaging that is transmitted is many more, and the sound performance of being realized is just good more.The basic skills that adopts in the AMR standard is such: when the channel condition variation, system uses the pattern (certainly, sound performance is relatively poor) with lower data transmission rate.These other resources of having saved more channel width and system improve the bit error correcting capability.Leave over that to lack comparable technology in the digital mobile system (for example PHS) be to derive from the algorithm researched and developed and require the cost of relevant integrated circuit resource with power and command speed.Along with the appearance of silicon technology, the use of digital signal processor (DSP) in the PHS mobile phone no longer is luxurious element.
Therefore, hope can be used AMR vocoder ability in Legacy System.
Also wishing to provide up to 6 to 7dB gains with the errored bit reduction ability to some AMR pattern by rearranging the bit mapping, comes to use AMR and error correction in the mode that can improve early stage 2G system.
Summary of the invention
According to coding of the present invention and error correction system and method by from a plurality of Legacy System frames with head and traffic channel (TCH) data block, peeling off the modern benefit that header data is utilized the AMR codec.Speech data utilizes AMR to be encoded subsequently, thinks the essentially identical data block establishment bit that comprises in a plurality of frames.The header data utilization of peeling off fixedly convolution coder is encoded as long frame header.Speech data is subsequently by convolutional encoding, and long frame header and the encoded speech data growth frame that is combined.Long frame is deconstructed into a plurality of equal segmentations subsequently, and these segmentations are sent out with the Legacy System frame format as the TCH data.
Coding and error correction method according to the embodiment of the invention may further comprise the steps: peel off header data from a plurality of Legacy System frames with head and traffic channel (TCH) data block; Collect and interior speech data of the essentially identical period of period of a plurality of time slots; With the header data coding growth frame header that separates; To described encoded speech data; Speech data behind described long frame header and the coding is combined into long frame; Described long frame is deconstructed into a plurality of equal segmentations; And described segmentation sent with the form of described Legacy System frame as the TCH data.
Wherein, the coding of described speech data comprises and adopts the AMR codec. the described header data that separates comprises the Channel Identifier slow associated control channel data of ease up. the coding of the described header data that separates comprises and uses fixedly convolution coder. described AMR codec has various modes and described method also comprises the step of selecting codec mode based on channel quality. described convolution coder is 1/2 convolution coder. when the step of described preference pattern is included in the BER deterioration in a classification to descending Move Mode, striding classification when the minimum classification limit moves, when BER improves, in a classification, upwards move, and when the highest classification limit, stride classification and move.
Coding and error correction system according to the embodiment of the invention comprise: the device (20) that is used for peeling off from a plurality of Legacy System frames with head and traffic channel (TCH) data block (12a, 12b, 12c, 12d) header data; Be used to collect with the essentially identical period of the period of a plurality of time slots in the device (18) of speech data; The device (20) that is used for header data coding growth frame header that to separate; Be used for device (24) to described encoded speech data; Be used for the speech data behind described long frame header and the coding is combined into the device of long frame (32); Be used for described long frame is deconstructed into the device of a plurality of equal segmentations (34a, 34b, 34c, 34d); And be used for described segmentation as the device of TCH data with the form transmission of described Legacy System frame.
Wherein, the coding of described speech data comprises employing AMR codec (18), and it has various modes, and described system also comprises the device that is used for selecting based on channel quality codec mode.At the described device that is used for selecting codec mode, also comprise and being used for when BER worsens in a classification to Move Mode (72,74,76) down, and when the minimum classification limit, stride the device that classification moves (78), in a classification, upwards move (80,82,84) with being used for when BER improves, and when the highest classification limit, stride the device that classification moves (86).
Description of drawings
With reference to following detailed description, will better understand these and other feature and advantage of the present invention in conjunction with the drawings, in the accompanying drawings:
Fig. 1 is the block diagram of prior art PHS flow system flow channel frame and structure of time slot;
Fig. 2 is used to make up long frame with bit mapping that is deconstructed into the standard P HS time slot that is used to send and the block diagram of encoding;
Fig. 3 is the block diagram of the long frame after the bit mapping;
Fig. 4 is the block diagram of robust (Robust) AMR flow synchronization control channel (RATSCCH) form that is used for long frame;
Fig. 5 is the block diagram of the interleaving scheme of the data after being used to encode;
Fig. 6 is the schematic diagram that adopts the element of mobile phone of the present invention and base station system;
Fig. 7 a is used for AMR pattern of the present invention and to the table of the division of pattern (Mode) and classification (class); And
Fig. 7 b is the flow chart of the mode switch algorithm of the use classes that adopts of the present invention.
Embodiment
The present invention is defined for the exemplary embodiment that adopts PHS communication system and standard (2G leaves over mobile system).The PHS system that has incorporated technology of the present invention into will be called as senior PHS (APHS) here.
The data map of the traffic channel (TCH) of exemplary PHS system .PHS as shown in Figure 1 is a kind of time division multiplexing (TDMA) system. frame 10 length are 5ms and are divided into 8 time slots, wherein 4 time slots are used for up link, 4 time slots are used for down link. in each direction, three time slot T1, T2 can be used to three different users with T3, and last time slot is the Common Control Channel that is used for all three users, and it replaces between uplink mode order and downlink mode order C_up and C-down.
In Fig. 1, time slot T2 is expanded to example time slot 12 here and is discussed in detail with explanation the present invention.Zone PR and UW are used for the synchronous of physical layer.Piece UW has incorporated 16 bits into.With more detailed argumentation, PR and UW were inserted into before decoder in the frame of transmission so that they can't be encoded as subsequently.CI and SA are the agreements that is used for time slot format information and connection status, and they are extremely important for connection reliability.Piece CI comprises 4 bits, and piece SA comprises 16 bits.TCH comprises speech data and is made of 160 bits.The crc block of 16 bits provides detection bits.As can be seen, in a frame, have the speech data of 160 bits, therefore total vocoder rate is 160/0.05=32Kbps.This is the data rate of the ADPCM (ITU G.726) of PHS employing.
The present invention adopts the AMR codec to shine upon in conjunction with bit and makes up the frame that sends operating such with PHS, adds coding simultaneously and carries out the performance enhancing.In the AMR system, there are 8 kinds of vocoder mode.These 8 kinds of patterns are by GSM and the definition of 3GPP international standard, and the data rate that is adopted is 12.2,10.2,7.95,7.4,6.7,5.9,5.15 and 4.75 (Kbps).In these speed each all is lower than the 32Kbps basic capacity of PHS system, and allows to format neatly the data with being encoded.
As subsequently will be in greater detail, source provided by the invention voice and chnnel coding be finished in 20ms (or 4 PHS slot times).Interweaving below people's ear susceptibility threshold of 20ms piece." frame " of new coding is called as long frame here.For compatible with the bit mapping of PHS standard frame, the present invention does not utilize CI, SA and CRC zone.In other words, CI behind the coding and SA data are placed in the TCH piece.The vocoder mode related news are coded in the particular channel code pattern, and adopt special region and encoder.The size of channel-encoded data piece is big more, and the result is good more (the errored bit ability is high more) just.Finally, beginning most of the connection between mobile phone and base station is used for the new control channel of long frame synchronization, robust AMR flow synchronization control channel (RATSCCH).At some in particular cases, RATSCCH also is used to mode message.
The TCH piece is used to data in speech data, SA/CI and the band.Different vocoder mode has different voice and chnnel coding parameter and the different message transmission rate of needs.SA/CI and in-band information are encoded and need constant data rate.Coding among the APHS and bit mapping are as shown in Figure 2.
Nominally four PHS time slot 12a, 12b, 12c and 12d provide long frame.The CI of these four time slots and SA data are stripped from and are combined in the long frame header piece 14 of APHS.Nominally the speech samples 16 of 20ms is processed by AMR vocoder 18.Long frame header data are processed by first encoder 20, and data 22 are inserted in the band, then are the speech samples of handling through AMR, and this speech samples is routed by second encoder 24 of convolution.The long frame that is produced as shown in Figure 3, wherein head 26 comprises the CI and the SA data of 156 bits, piece 28 delivery 8 bits then are the coded voice data pieces 30 of 476 bits, thereby obtain the long frame 32 of 640 bits in the band.As mentioned above, this long frame is divided into four 160 bit lengths subsequently to be used for transmission in the standard TCH piece that is inserted into 4 APHS frame 34a, 34b, 34c and 34d.
In the PHS system, the data rate resource that is used for the regional TCH of long frame is the TCH*4=160*4=640 bit.For compatibility, the original area that comprises the SA/CI data in each time slot is reserved in APHS, but for the processing among the APHS, these data are left in the basket.Message SA/CI is encoded with the in-band message data and is placed in the original TCH zone.
In described APHS embodiment, the maximum coded voice data in the long frame is 476 bits.Different vocoder mode and chnnel coding pattern with different parameters are combined, and have the different coding speech data block of different size with generation.If the coded voice data piece that generates then has to clip some bit greater than 476 bits.Among the disclosed here APHS embodiment, chnnel coding utilizes convolution coder to realize.In alternative embodiment, adopt other channel coding methods.
To discuss subsequently, based on interweaving of data, the CI data only need be sent out once (be equal to per 4 PHS frames and send one) .SA data in each long frame needs each time slot to be sent out. and for SA/CI, the long frame data that is produced is as shown in table 1.
Table 1
| Title | SA0 | SA1 | SA2 | |
| Bit number | ||||
| 16 | 16 | 16 | 16 |
| Title | |
| Bit number | |
| 4 | |
| The |
6 multinomial D 6+D 5+D 3+D 2+D 1+1 |
| The input bit number that is used for convolution coder | 74 |
| The multinomial that is used for 1/2 convolution coder | Multinomial G0/G0=1 G1/G0=1+D+D 3+D 4/1+D 3+D 4Have hangover 8 bits |
| The number of output bit | 148+8＝156 |
8 bits are used to pattern information, and pattern information is mapped to last 8 bits of long frame, and this will illustrate below.
Table 2 illustrates codec mode and relevant convolution rate, is input to the bit number of convolution coder, SA bit number, total bit number and preferred classes after output bit number, CRC and 1/2 convolution coder from encoder produced.
Table 2
| Codec mode | Ratio | Be input to the bit number of convolution coder | Bit number (should be 476) from convolution coder output | SA bit number after CRC and 1/2 convolution coder | Total bit number (632+8=640 altogether) for a piece 20ms | Preferred classes |
| TCH/AFS 12.2 | 1/2 | 250 | 508 |
156 | 632 | 1 |
| TCH/AFS 10.2 | 1/3 | 210 | 642 clip 166 bits | 156 | 632 | 2 |
| TCH/AFS | 1/3 | 165 | 513 | 156 | 632 | 1 |
| 7.95 | Clip 37 bits | |||||
| TCH/AFS 7.4 | 1/3 | 154 | 474 | 156 | 630 | 2 |
| TCH/AFS 6.7 | 1/4 | 140 | 576 |
156 | 632 | 1 |
| TCH/AFS 5.9 | 1/4 | 124 | 520 clip 44 bits | 156 | 632 | 2 |
| TCH/AFS 5.15 | 1/5 | 109 | 565 clip 89 bits | 156 | 632 | 1 |
| TCH/AFS 4.75 | 1/5 | 101 | 535 clip 59 bits | 156 | 632 | 2 |
As shown in Table, the fixed number of bits of SA/CI data is 156, and for four frames, always has 640 bits and can be used for being filled in the PHS TCH of 160 bits, from the bit of speech data convolution coder 476 bits altogether, and bit must be adapted to long frame by brachymemma.
Shown in the table 3-10, wherein to keep long frame size be 640 bits to the bit clipped of definition for the exemplary convolutional encoding of every kind of codec mode.
Table 3
TCH/AFS 12.2 codecs:
The piece of 250 bits { u (0) ... u (249) } is to utilize by 1/2 ratio convolutional encoding of following multinomial definition to encode:
G0/G0＝1
G1/G0＝1+D+D
3+D
4/1+D
3+D
4
Produce the bit { C (0) ... C (507) } of 508 codings, define by the following:
r(k)＝u(k)+r(k-3)+r(k-4)
C(2k)＝u(k)
C (2k+1)=r (k)+r (k-1)+r (k-3)+r (k-4) is for k=0, and 1 ..., 249;
R (k)=0 is for k＜0
And (for the termination of encoder):
(k)＝0
C(2k)＝r(k-3)+r(k-4)
C (2k+1)=r (k)+r (k-1)+r (k-3)+r (k-4) is for k=250, and 251 ..., 253
Code is in the following manner by brachymemma, and promptly following 32 bits are not sent out: C (417), C (421), C (425), C (427), C (429), C (433), C (437), C (441), C (443), C (445), C (449), C (453), C (457), C (459), C (461), C (465), C (469), C (473), C (475), C (477), C (481), C (485), C (489), C (491), C (493), C (495), C (497), C (499), C (501), C (503), C (505) and C (507).
Table 4
TCH/AFS 10.2 codecs:
The piece of 210 bits { u (0) ... u (209) } is to utilize by 1/3 ratio convolutional encoding of following multinomial definition to encode:
G1/G3＝1+D+D
3+D
4/1+D+D
2+D
3+D
4
G2/G3＝1+D
2+D
4/1+D+D
2+D
3+D
4
G3/G3＝1
Thereby produce the bit { C (0) ... C (641) } of 642 codings, define by the following:
r(k)＝0
C(3k)＝r(k)+r(k-1)+r(k-3)+r(k-4)
C(3k+1)＝r(k)+r(k-2)+r(k-4)
C (3k+2)=r (k-1)+r (k-2)+r (k-3)+r (k-4) is for k=210, and 211 ..., 213
Code is in the following manner by brachymemma, and promptly following 22 bits are not sent out: C (1), C (4), C (7), C (10), C (16), C (19), C (22), C (28), C (31), C (34), C (40), C (43), C (46), C (52), C (55), C (58), C (64), C (67), C (70), C (76), C (79) and C (82).All these operations will produce 620 bits.
Code is in the following manner by brachymemma, and promptly following 166 bits are not sent out: C (1), C (4), C (7), C (10), C (16), C (19), C (22), C (28), C (31), C (34), C (40), C (43), C (46), C (52), C (55), C (58), C (64), C (67), C (70), C (76), C (79), C (82), C (88), C (91), C (94), C (100), C (103), C (106), C (112), C (115), C (118), C (124), C (127), C (130), C (136), C (139), C (142), C (148), C (208), C (211), C (214), C (220), C (223), C (226), C (232), C (235), C (238), C (244), C (247), C (250), C (256), C (259), C (151), C (154), C (160), C (163), C (166), C (172), C (175), C (178), C (184), C (187), C (190), C (196), C (199), C (202), C (262), C (268), C (271), C (274), C (280), C (283), C (286), C (292), C (295), C (298), C (304), C (307), C (310), C (316), C (319), C (322), C (325), C (328), C (331), C (334), C (337), C (340), C (343), C (346), C (349), C (352), C (355), C (358), C (361), C (364), C (367), C (370), C (373), C (376), C (379), C (382), C (385), C (388), C (391), C (394), C (397), C (400), C (403), C (406), C (409), C (412), C (415), C (418), C (421), C (424), C (427), C (430), C (433), C (436), C (439), C (442), C (445), C (448), C (451), C (454), C (457), C (460), C (463), C (466), C (469), C (472), C (475), C (478), C (481), C (484), C (487), C (490), C (493), C (496), C (499), C (502), C (505), C (508), C (511), C (514), C (517), C (520), C (523), C (526), C (529), C (532), C (535), C (538), C (541), C (544), C (547), C (550), C (553) and C (556).
Table 5
TCH/AFS 7.95 codecs:
The piece of 165 bits { u (0) ... u (164) } is to utilize by 1/3 ratio convolutional encoding of following multinomial definition to encode:
G4/G4＝1
G5/G4＝1+D+D
4+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
Thereby produce the bit { C (0) ... C (512) } of 513 codings, define by the following:
r(k)＝u(k)+r(k-2)+r(k-3)+r(k-5)+r(k-6)
C(3k)＝u(k)
C(3k+1)＝r(k)+r(k-1)+r(k-4)+r(k-6)
C(3k+2)＝r(k)+r(k-1)+r(k-2)+r(k-3)+r(k-4)+r(k-6)
For k=0,1 ..., 164
R (k)=0 is for k＜0
And (for the termination of encoder):
r(k)＝0
C(3k)＝r(k-2)+r(k-3)+r(k-5)+r(k-6)
C(3k+1)＝r(k)+r(k-1)+r(k-4)+r(k-6)
C (3k+2)=r (k)+r (k-1)+r (k-2)+r (k-3)+r (k-4)+r (k-6) is for k=165, and 166 ..., 170
Code is in the following manner by brachymemma, and promptly following 37 bits are not sent out: C (1), C (2), C (4), C (5), C (8), C (22), C (70), C (118), C (166), C (214), C (262), C (310), C (317), C (319), C (325), C (332), C (334), C (341), C (343), C (349), C (356), C (358), C (365), C (367), C (373), C (380), C (382), C (385), C (389), C (391), C (397), C (404), C (406), C (409), C (413), C (415), and C (512).
Table 6
TCH/AFS 7.4 codecs:
The piece of 154 bits { u (0) ... u (153) } is to utilize by 1/3 ratio convolutional encoding of following multinomial definition to encode:
G1/G3＝1+D+D
3+D
4/1+D+D
2+D
3+D
4
G2/G3＝1+D
2+D
4/1+D+D
2+D
3+D
4
G3/G3＝1
Thereby produce the bit { C (0) ... C (473) } of 474 codings, define by the following:
r(k)＝u(k)+r(k-1)+r(k-2)+r(k-3)+r(k-4)
C(3k)＝r(k)+r(k-1)+r(k-3)+r(k-4)
C(3k+1)＝r(k)+r(k-2)+r(k-4)
C (3k+2)=u (k) is for k=0, and 1 ..., 153
And (for the termination of encoder):
r(k)＝0
C(3k)＝r(k)+r(k-1)+r(k-3)+r(k-4)
C(3k+1)＝r(k)+r(k-2)+r(k-4)
C (3k+2)=r (k-1)+r (k-2)+r (k-3)+r (k-4) is for k=154, and 155 ..., 157
Table 7
TCH/AFS 6.7 codecs:
The piece of 140 bits { u (0) ... u (139) } is to utilize by 1/4 ratio convolutional encoding of following multinomial definition to encode:
G1/G3＝1+D+D
3+D
4/1+D+D
2+D
3+D
4
G2/G3＝1+D
2+D
4/1+D+D
2+D
3+D
4
G3/G3＝1
G3/G3＝1
Thereby produce the bit { C (0) ... C (575) } of 576 codings, define by the following:
r(k)＝u(k)+r(k-1)+r(k-2)+r(k-3)+r(k-4)
C(4k)＝r(k)+r(k-1)+r(k-3)+r(k-4)
C(4k+1)＝r(k)+r(k-2)+r(k-4)
C(4k+2)＝u(k)
C (4k+3)=u (k) is for k=0, and 1 ... .139
R (k)=0 is for k＜0
And (for the termination of encoder):
r(k)＝0
C(4k)＝r(k)+r(k-1)+r(k-3)+r(k-4)
C(4k+1)＝r(k)+r(k-2)+r(k-4)
C(4k+2)＝r(k-1)+r(k-2)+r(k-3)+r(k-4)
C (4k+3)=r (k-1)+r (k-2)+r (k-3)+r (k-4) is for k=140, and 141 ..., 143
Code is in the following manner by brachymemma, and promptly following 100 bits are not sent out: C (1), C (3), C (7), C (11), C (15), C (27), C (39), C (55), C (67), C (79), C (95), C (107), C (119), C (135), C (147), C (159), C (175), C (187), C (199), C (215), C (227), C (239), C (255), C (267), C (279), C (287), C (291), C (295), C (299), C (303), C (307), C (311), C (315), C (319), C (323), C (327), C (331), C (335), C (339), C (343), C (347), C (351), C (355), C (359), C (363), C (367), C (369), C (371), C (375), C (377), C (379), C (383), C (385), C (387), C (391), C (393), C (395), C (399), C (401), C (403), C (407), C (409), C (411), C (415), C (417), C (419), C (423), C (425), C (427), C (431), C (433), C (435), C (439), C (441), C (443), C (447), C (449), C (451), C (455), C (457), C (459), C (463), C (465), C (467), C (471), C (473), C (475), C (479), C (481), C (483), C (487), C (489), C (491), C (495), C (497), C (499), C (5O3), C (505), C (507) and C (511).
Table 8
TCH/AFS 5.9 codecs:
The piece of 124 bits { u (0) ... u (123) } is to utilize by 1/4 ratio convolutional encoding of following multinomial definition to encode:
G4/G6＝1+D
2+D
3+D
5+D
6/1+D+D
2+D
3+D
4+D
6
G5/G6＝1+D+D
4+D
6/1+D+D
2+D
3+
4+D
6
G6/G6＝1
G6/G6＝1
Thereby produce the bit { C (0) ... C (519) } of 520 codings, define by the following:
r(k)＝u(k)+r(k-1)+r(k-2)+r(k-3)+r(k-4)+r(k-6)
C(4k)＝r(k)+r(k-2)+r(k-3)+r(k-5)+r(k-6)
C(4k+1)＝r(k)+r(k-1)+r(k-4)+r(k-6)
C(4k+2)＝u(k)
C (4k+3)=u (k) is for k=0, and 1 ...., 123
R (k)=0 is for k＜0
And (for the termination of encoder):
r(k)＝0
C(4k)＝r(k)+r(k-2)+r(k-3)+r(k-5)+r(k-6)
C(4k+1)＝r(k)+r(k-1)+r(k-4)+r(k-6)
C(4k+2)＝r(k-1)+r(k-2)+r(k-3)+r(k-4)+r(k-6)
C (4k+3)=r (k-1)+r (k-2)+r (k-3)+r (k-4)+r (k-6) is for k=124, and 125 ..., 129
Code is in the following manner by brachymemma, and promptly following 44 bits are not sent out: C (0), C (1), C (3), C (5), C (7), C (11), C (15), C (31), C (47), C (63), C (79), C (95), C (111), C (127), C (143), C (159), C (175), C (191), C (207), C (223), C (239), C (255), C (271), C (287), C (303), C (319), C (327), C (331), C (335), C (343), C (347), C (351), C (359), C (363), C (367), C (375), C (379), C (383), C (391), C (395), C (399), C (407), C (411) and C (415).
Table 9
TCH/AFS 5.15 codecs:
The piece of 109 bits { u (0) ... u (108) } is to utilize by 1/5 ratio convolutional encoding of following multinomial definition to encode:
G1/G3＝1+D+D
3+D
4/1+D+D
2+D
3+D
4
G1/G3＝1+D+D
3+D
4/1+D+D
2+D
3+D
4
G2/G3＝1+D
2+D
4/1+D+D
2+D
3+D
4
G3/G3＝1
G3/G3＝1
Thereby produce the bit { C (0) ... C (564) } of 565 codings, define by the following:
r(k)＝u(k)+r(k-1)+r(k-2)+r(k-3)+r(k-4)
C(5k)＝r(k)+r(k-1)+r(k-3)+r(k-4)
C(5k+1)＝r(k)+r(k-1)+r(k-3)+r(k-4)
C(5k+2)＝r(k)+r(k-2)+r(k-4)
C(5k+3)＝u(k)
C (5k+4)=u (k) is for k=0, and 1 ..., 108
R (k)=0 is for k＜0
And (for the termination of encoder):
r(k)＝0
C(5k)＝r(k)+r(k-1)+r(k-3)+r(k-4)
C(5k+1)＝r(k)+r(k-1)+r(k-3)+r(k-4)
C(5k+2)＝r(k)+r(k-2)+r(k-4)
C(5k+3)＝r(k-1)+r(k-2)+r(k-3)+r(k-4)
C (5k+4)=r (k-1)+r (k-2)+r (k-3)+r (k-4) is for k=109, and 110 ..., 112
Code is in the following manner by brachymemma, and promptly following 89 bits are not sent out: C (0), C (4), C (5), C (9), C (10), C (14), C (15), C (20), C (25), C (30), C (35), C (40), C (50), C (60), C (70), C (80), C (90), C (100), C (110), C (120), C (13O), C (140), C (150), C (160), C (170), C (180), C (190), C (200), C (210), C (220), C (230), C (240), C (250), C (260), C (270), C (280), C (290), C (300), C (310), C (315), C (320), C (325), C (330), C (334), C (335), C (340), C (344), C (345), C (350), C (354), C (355), C (360), C (364), C (365), C (370), C (374), C (375), C (380), C (384), C (385), C (390), C (394), C (395), C (400), C (404), C (405), C (410), C (414), C (415), C (420), C (424), C (425), C (430), C (434), C (435), C (440), C (444), C (445), C (450), C (454), C (455), C (460), C (464), C (465), C (470), C (474), C (475), C (480) and C (484).
Table 10
TCH/AFS 4.75 codecs:
The piece of 101 bits { u (0) ... u (100) } is to utilize by 1/5 ratio convolutional encoding of following multinomial definition to encode:
G4/G6＝1+D
2+D
3+D
5+D
6/1+D+D
2+D
3+D
4+D
6
G4/G6＝1+D
2+D
3+D
5+D
6/1+D+D
2+D
3+D
4+D
6
G5/G6＝1+D+D
4+D
6/1+D+D
2+D
3+D
4+D
6
G6/G6＝1
G6/G6＝1
Thereby produce the bit { C (0) ... C (534) } of 535 codings, define by the following:
r(k)＝u(k)+r(k-1)+r(k-2)+r(k-3)+r(k-4)+r(k-6)
C(5k)＝r(k)+r(k-2)+r(k-3)+r(k-5)+r(k-6)
C(5k+1)＝r(k)+r(k-2)+r(k-3)+r(k-5)+r(k-6)
C(5k+2)＝r(k)+r(k-1)+r(k-4)+r(k-6)
C(5k+3)＝u(k)
C (5k+4)=u (k) is for k=0, and 1 ..., 100
R (k)=0 is for k＜0
And (for the termination of encoder):
r(k)＝0
C(5k)＝r(k)+r(k-2)+r(k-3)+r(k-5)+r(k-6)
C(5k+1)＝r(k)+r(k-2)+r(k-3)+r(k-5)+r(k-6)
C(5k+2)＝r(k)+r(k-1)+r(k-4)+r(k-6)
C(5k+3)＝r(k-1)+r(k-2)+r(k-3)+r(k-4)+r(k-6)
C (5k+4)=r (k-1)+r (k-2)+r (k-3)+r (k-4)+r (k-6) is for k=101, and 102 ..., 106
Code is in the following manner by brachymemma, and promptly following 59 bits are not sent out: C (0), C (5), C (15), C (25), C (35), C (45), C (55), C (65), C (75), C (85), C (95), C (105), C (115), C (125), C (135), C (145), C (155), C (165), C (175), C (185), C (195), C (205), C (215), C (225), C (235), C (245), C (255), C (265), C (275), C (285), C (295), C (305), C (315), C (325), C (335), C (345), C (355), C (365), C (375), C (385), C (395), C (400), C (405), C (410), C (415), C (420), C (425), C (430), C (435), C (440), C (445), C (450), C (455), C (459), C (460), C (465), C (470), C (475) and C (479).
The long frame of RATSCCH adopts different-format in TCH piece shown in Figure 4.RATSCCH is used in both cases.What connect between mobile phone and base station begins most, and it is used to long frame synchronization.And under some difficult situation, the in-band message among the RATSCCH is used to the in-band message of encoder modes information with conventional frame provided.In the present invention the RATSCCH of Shi Yonging can with the GSM/3G system in be widely used in that to inform that PS/CS changes the form of AMR pattern and classification comparable.
What in one embodiment, be used to send in the standard P HS 5ms burst realizes by mode shown in Figure 5 interweaving of long frame data.The bit of long frame is interleaved by mode shown in the table 11.
Table 11
In order to interweave, bit is divided into even number and odd number bit 102,104, and is interleaved according to this table.In 108 eight segmentations 106 that obtain 80 Bit datas, it interweaves with eight segmentations from 20ms segmentation before 110 subsequently.After interweaving, in the TCH of PHS time slot piece, once send two segmentations.
In the routine data transmission mode, system with GSM and 3GPP system in the similar mode of AMR work. as shown in Figure 6, in mobile phone 36, be used to import 38 pairs of data samplings of speech coder of voice, and the data after will encoding are provided to channel encoder 40, this channel encoder 40 converts long frame to PHS form 5ms frame to be used for transmission. and the uplink voice data are sent to base station 42 subsequently, in base station 42, channel decoder 44 is disassembled the growth frame format with the PHS standard frame, this length frame format is passed to Voice decoder 46. subsequently during decoding, in the convolution decoder process, estimate errored bit and corresponding SNR (correlated channels condition) by the Viterbi decoder. after estimating in a certain period, whether 48 pairs of codec adaptation units should change coding mode on receive direction adjudicates (will be described in detail this subsequently). and request message (up link node order 50) is inserted in the band inner region and is transferred to mobile phone.
The operation of the down link data from the base station to the mobile phone can be comparable with the speech data of speech coder 52 codings that are used to import voice, data after its sampled data also will be encoded are provided to channel encoder 54, and this channel encoder 54 converts long frame to PHS form 5ms frame to be used for transmission.The downlink voice data are sent to mobile phone subsequently, and in mobile phone, channel decoder 56 is disassembled the growth frame format with the PHS standard frame, and this length frame format is passed to Voice decoder 58 subsequently.During decoding, estimate errored bit and corresponding SNR (correlated channels condition).After estimating in a certain period, whether 60 pairs of codec adaptation units should change coding mode on receive direction adjudicates.Request message (downlink node order 62) is inserted in the band inner region and is transferred to the base station.
For the long frame of each transmission, the coding mode of transmitter (index) is based on that mode command determines, described mode command utilizes algorithm to come Move Mode based on classification shown in Fig. 7 a and the 7b.The algorithm that the permission of PHS standard-required is simplified is used for the mode adjustment in the standard GSM/3G system.Adjacent pattern is in the different classifications, and described classification is cut apart the pattern sum effectively, shown in the table among Fig. 7 a.Shown in Fig. 7 b, carry out if be sent in pattern 11 and the classification 1 (12.2kbps), and estimate that from the mistake of convolutional decoder indication needs to reduce bit rate, the mode command a kind of pattern in the same classification that then makes moves down 72, promptly moves to pattern 10 classifications 1 (7.95kbps).If BER is still too high, then order moves down 74 for the second time to pattern 01 classification 1 (6.7kbps).BER is still too high to cause moving down once more 76 to pattern 00 classification 1 (5.15kbps).If BER is still too high, then carries out the last class of striding and move 78 to pattern 00 classification 2 (4.74kbps).Therefore, the gamut of enabled mode is crossed over 4 subcommands and is moved.Similarly, if BER is reduced to below the predetermined threshold, move classification in the order then to increase transmission speed.For example, if system has been in the lowest mode, promptly be in pattern 00 classification 2 (4.74kbps), and BER improves now, order then moves up 80 patterns to pattern 01 classification 2 (5.9kbps), rather than backtrack mode 00 classification 1.Further improve to cause and move 82, further improve again to cause and move 84 to pattern 11 classifications 2 (10.2kbps) to pattern 10 classifications 2 (7.4kbps).If can obtain further improvement, algorithm causes pattern to stride class and moves 86, promptly moves to pattern 11 classifications 1 (12.2kbps) to be used for the highest transmission speed.Improvement or the deterioration of BER in the middle of the class scope causes in classification and move up or down, and be shown as moving 88 and 90.This algorithm allows the circulation move mode based on the classification internal schema, when moving of classification only occurred over just the minimum or maximum transmitting capacity that arrives in the classification.
By patent statute, more than described the present invention in detail, those skilled in the art will recognize that modification and replacement to specific embodiment disclosed herein.These modifications are in the scope of the present invention and intention of claims qualification.
Claims (10)
1. encode and error correction method for one kind, may further comprise the steps:
From a plurality of Legacy System frames, peel off header data with head and traffic channel TCH data block;
Collect and interior speech data of the essentially identical period of period of a plurality of time slots;
With the header data coding growth frame header that separates;
To described encoded speech data;
Speech data behind described long frame header and the coding is combined into long frame;
Described long frame is deconstructed into a plurality of equal segmentations; And
Described segmentation is sent as the form of TCH data with described Legacy System frame.
2. the method for claim 1, the coding of wherein said speech data comprise and adopt the AMR codec.
3. the method for claim 1, the wherein said header data that separates comprise that the gentle slow phase of Channel Identifier closes control data.
4. the method for claim 1, the coding of the wherein said header data that separates comprise uses fixedly convolution coder.
5. method as claimed in claim 2, wherein said AMR codec has various modes and described method also comprises the step of selecting codec mode based on channel quality.
6. method as claimed in claim 4, wherein said convolution coder are 1/2 convolution coders.
7. method as claimed in claim 5, the step of wherein said preference pattern be included in BER when worsening in a classification to Move Mode down, when the minimum classification limit, stride classification and move, when BER improves, in a classification, upwards move, and when the highest classification limit, stride classification and move.
8. encode and error correction system for one kind, comprising:
Be used for peeling off the device (20) of header data from a plurality of Legacy System frames with head and traffic channel TCH data block (12a, 12b, 12c, 12d);
Be used to collect with the essentially identical period of the period of a plurality of time slots in the device (18) of speech data;
The device (20) that is used for header data coding growth frame header that to separate;
Be used for device (24) to described encoded speech data;
Be used for the speech data behind described long frame header and the coding is combined into the device of long frame (32);
Be used for described long frame is deconstructed into the device of a plurality of equal segmentations (34a, 34b, 34c, 34d); And
Be used for described segmentation as the device of TCH data with the form transmission of described Legacy System frame.
9. coding as claimed in claim 8 and error correction system, the coding of wherein said speech data comprise employing AMR codec (18), and it has various modes, and described system also comprises the device that is used for selecting based on channel quality codec mode.
10. coding as claimed in claim 9 and error correction system, wherein at the described device that is used for selecting codec mode, also comprise and being used for when BERization in a classification to Move Mode (72,74,76) down, and when the minimum classification limit, stride the device that classification moves (78), in a classification, upwards move (80,82,84) with being used for when BER improves, and when the highest classification limit, stride the device that classification moves (86).
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US62139204P | 2004-10-22 | 2004-10-22 | |
| US60/621,392 | 2004-10-22 | ||
| PCT/US2005/038044 WO2006047339A2 (en) | 2004-10-22 | 2005-10-21 | Encoding and error correction system for enhanced performance of legacy communications networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101107781A CN101107781A (en) | 2008-01-16 |
| CN101107781B true CN101107781B (en) | 2010-05-12 |
Family
ID=36228296
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2005800443386A Expired - Fee Related CN101107781B (en) | 2004-10-22 | 2005-10-21 | Encoding and error correction system for enhanced performance of legacy communications networks, and method thereof |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101107781B (en) |
| WO (1) | WO2006047339A2 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101968962B (en) * | 2010-09-19 | 2012-03-21 | 北京航空航天大学 | FAAC and FAAD2-based single track constant bit rate audio realtime coding and decoding error correcting method |
| CN102082633B (en) * | 2010-12-27 | 2014-04-16 | 华为终端有限公司 | Method and device for positioning adaptive multi-rate (AMR) frame header, and player |
| CN103208290B (en) * | 2012-01-17 | 2015-10-07 | 展讯通信（上海）有限公司 | Parameter analysis of electrochemical and preprocess method and device in codec, code stream |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6058106A (en) * | 1997-10-20 | 2000-05-02 | Motorola, Inc. | Network protocol method, access point device and peripheral devices for providing for an efficient centrally coordinated peer-to-peer wireless communications network |
| US20020006138A1 (en) * | 2000-01-10 | 2002-01-17 | Odenwalder Joseph P. | Method and apparatus for supporting adaptive multi-rate (AMR) data in a CDMA communication system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE69927198T2 (en) * | 1998-03-19 | 2006-06-29 | Hitachi, Ltd. | Broadcast information delivering system |
-
2005
- 2005-10-21 WO PCT/US2005/038044 patent/WO2006047339A2/en active Application Filing
- 2005-10-21 CN CN2005800443386A patent/CN101107781B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6058106A (en) * | 1997-10-20 | 2000-05-02 | Motorola, Inc. | Network protocol method, access point device and peripheral devices for providing for an efficient centrally coordinated peer-to-peer wireless communications network |
| US20020006138A1 (en) * | 2000-01-10 | 2002-01-17 | Odenwalder Joseph P. | Method and apparatus for supporting adaptive multi-rate (AMR) data in a CDMA communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2006047339A3 (en) | 2006-11-02 |
| WO2006047339A2 (en) | 2006-05-04 |
| CN101107781A (en) | 2008-01-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7712005B2 (en) | Encoding and error correction system for enhanced performance of legacy communications networks | |
| US7010001B2 (en) | Method and apparatus for supporting adaptive multi-rate (AMR) data in a CDMA communication system | |
| KR100299132B1 (en) | TURBO ENCODING/DECODING DEVICE AND METHOD FOR PROCESSING FRAME DATA ACCORDING TO QoS | |
| CN1720683B (en) | Re-formatting variable-rate vocoder frames for inter-system transmissions | |
| US7746832B2 (en) | Method and apparatus for supporting adaptive multi-rate (AMR) data in a CDMA communication system | |
| FI112894B (en) | Procedure for reducing the likelihood of frame errors in data transfer in the form of data frames | |
| JP3825750B2 (en) | Method and system for assigning convolutionally encoded bits to symbols prior to modulation | |
| EP1421729B1 (en) | A method and a system for transfering amr signaling frames on halfrate channels | |
| WO2006032192A1 (en) | Method for encoding enhanced uplink signalling in wcdma system | |
| KR100484555B1 (en) | Method and apparatus for error correction | |
| KR100377939B1 (en) | Frame Composition Device and Method for Subframe Transmission in Mobile Communication System | |
| CN101107781B (en) | Encoding and error correction system for enhanced performance of legacy communications networks, and method thereof | |
| US8009550B2 (en) | Method and communications device for adapting the data transfer rate in a communications device | |
| JP3254126B2 (en) | Variable rate coding | |
| KR20050054405A (en) | Rate matching method and apparatus for multiplexing channels with different transmission time intervals in communication systems | |
| KR20010080764A (en) | Method and arrangement for channel coding or decoding of frame-structured information | |
| CA2762915C (en) | A method and a system for transfering amr signaling frames on halfrate channels | |
| KR100770819B1 (en) | Method and system for performing discontinuous transmission in a communications system | |
| WO2004047355A1 (en) | Method and apparatus for channel coding and rate matching | |
| ZA200401569B (en) | A method and a system for transfering AMR signaling frames on halfrate channels. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1116603 Country of ref document: HK |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: WD Ref document number: 1116603 Country of ref document: HK |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20191012 Address after: Hamilton, Bermuda Patentee after: MARVELL INTERNATIONAL Ltd. Address before: Babado J San Michael Patentee before: MARVELL WORLD TRADE Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211013 Address after: Texas, USA Patentee after: NXP USA, Inc. Address before: Hamilton, Bermuda Patentee before: Marvell International Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100512 |