FIELD OF THE INVENTION

This invention relates generally to the field of encoding and error correction for transmission systems and, more particularly, to use of an advanced vocoder with bit mapping and encoding for retrofit of legacy communications systems to enhance error correction performance.

BACKGROUND OF THE INVENTION

Waveform source coding and decoding (codec) is widely used in early digital mobile communication systems such as the Personal Handyphone System (PHS). Due to technology limitations at the time of implementation, some of the system designs did not provide appropriate channel encoding/decoding to protect the transferred data. For such systems, when the channel quality condition degrades, the ensuing high bit error rate makes voice performance unacceptable and some important control bits are easily corrupted. As the result, upper layer protocol and control mechanisms in the system would be likely active to turn off the channel. This is one of the most prevalent reasons for a lost connection during an ongoing communication session.

There are adaptive multi-rate (AMR) vocodec and corresponding channel coding capabilities in some advanced 2G mobile systems and all the 3G systems. Under the AMR standard, there are 8 different data rates for code Excited Linear Prediction (CELP) speech codec. These data rates range from 12.2kbps to 4.75kps. The more speech information is transferred, the better the voice performance is achieved. The basic approach employed in the AMR standard is that when the channel condition become worse, the system uses the modes with lower data transfer rate (of course, the voice performance is worse.). This saves more channel bandwidth and other resources for the system to increase the bit error correction ability. The

lack comparable technology in legacy digital mobile systems (such as PHS) derives from under-developed algorithms and the expense of integrated circuit resources related to power and instruction speed requirements. With the advent of silicon technology, the use of digital signal processors (DSP) is no longer a luxury element in a PHS handset.

It is therefore desirable to make use of AMR vocodec capability in legacy systems.

It is also desirable to apply AMR and error correction in a manner which can be retrofit into early 2G systems by re-arranging bit mapping to provide up to 6 to 7 dB gain for bit error reduction ability for certain AMR modes.

SUMMARY OF THE INVENTION

An encoding and error correction system and method according to the present invention employs the modern benefits of AMR codec by stripping header data from a plurality of legacy system frames 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. The speech data is then convolutionally encoded and the long frame header and encoded speech data are combined as a long frame. The long frame is then deconstructed into a plurality of equal segments and the segments are transmitted as TCH data in the legacy system frame format.

BRIEF DESCRIPTION OF THE DRAWINGS These and other features and advantages of the present invention will be better understood by reference to the following detailed description when considered in connection with the accompanying drawings wherein:

FIG. 1 is a block diagram of a prior art PHS system traffic channel frame and slot structure;

FIG. 2 is a block diagram of bit mapping and encoding for creation of a long frame for deconstruction into standard PHS slots for transmission;

FIG. 3 is a block diagram of the bit mapped long frame;

FIG. 4 is a block diagram of the Robust AMR Traffic Synchronized Control Channel (RATSCCH) format for the long frame;

FIG. 5 is a block diagram of an interleaving scheme for the encoded data;

FIG. 6 is a schematic diagram of the elements of a handset and base station system employing the present invention;

FIG. 7a is a table representation of the AMR mode and division into Mode and class for use in the present invention; and,

FIG. 7b is a flow chart representation of the mode switching algorithm using class as employed in the present invention..

DETAILED DESCRIPTION OF THE INVENTION The present invention is defined for an exemplary embodiment employing the

PHS communication system and standard (a 2G legacy mobile system). The PHS system incorporating technology according to the invention will be referred to herein as Advanced PHS (APHS).

Data mapping of the Traffic Channel (TCH) of an exemplary PHS system is shown in FIG. 1. PHS is a time division multiplex (TDMA) system. One frame 10 is 5ms in length and is divided into 8 slots, four for uplink and four for downlink. In each direction, three slots, Tl , T2 and T3, are available for three different users and the last slot is the common control channel alternating uplink mode commands and downlink mode commands, C_up and C_down, for all three users. Slot T2 is expanded in FIG. 1 as an example slot 12 and discussed in detail for the explanation of the invention herein. Areas PR and UW are employed for synchronization of the physical layer. Block UW incorporates 16 bits. As discussed in greater detail subsequently, PR and UW are inserted in the transmitted frame before the decoder so that they cannot be encoded. CI and SA are the protocol for slot format information and connection status and are important for connection reliability.

Block CI contains 4 bits while block SA contains 16 bits. TCH contains the speech data and comprises 160 bits. The CRC block of 16 bits provides the error detection bits. It can be seen that within one frame, there are 160 bits of speech data and the whole vocodec rate is therefore 160/0.05=32Kbps. This is the data rate for ADPCM (ITU G.726) as employed in PHS.

The present invention employs AMR codec in combination with bit mapping to create frames compatible with PHS transmission standards while adding encoding for performance enhancement. There are eight vocodec modes in an AMR system. The eight modes are defined by GSM and 3GPP international standards and the data rates employed are 12.2, 10.2, 7.95, 7.4, 6.7, 5.9, 5.15, and 4.75 (Kbps). Each of these rates is lower than the 32 Kbps basic capability of the PHS system and allows flexibility in formatting the data to be encoded.

As will be described in greater detail subsequently, the source speech and channel coding provided in the present invention is accomplished within 20ms, or four PHS slot times. Interleaving of 20 ms blocks is beneath the sensitivity threshold of the human ear. The new encoding "frame" is referred to herein as a long-frame. To be compatible with the bit mapping of the PHS standard frame, the present invention does not make use of the CI, SA and CRC areas. That is, the encoded CI and SA data are put into the TCH block. The vocodec mode related message is encoded with a particular channel code mode and employs a special area and encoder. The larger the channel coding data block size, the better the result (higher bit error ability). Finally, a new control channel Robust AMR Traffic Synchronized Control Channel (RATSCCH) for long- frame synchronization is employed at the very beginning of the connection between of handset and the base station. RATSCCH is also used for a mode message in some special cases.

The TCH block is used for speech data, SA/CI and in-band data. Different vocodec modes have different speech and channel encoding parameters and require different data transfer rates. The SA/CI and in-band information are encoded and need a constant data rate. The encoding and bit mapping in APHS are shown in Figure 2.

Four PHS slots 12a, 12b, 12c and 12d nominally provide the long frame. CI and SA data for the four slots are stripped and combined in an APHS long frame header block 14. Nominally 20 ms of speech samples 16 are processed through AMR vocodec 18. The long frame header data is processed through a first encoder 20 and in-band data 22 is inserted followed by the AMR processed speech samples which are routed through a second encoder 24 which is convolutional. The resulting long frame is shown in FIG. 3 wherein the header 26 comprises 156 bits of CI and SA data, an in-band block 28 carries 8 bits followed by an encoded speech data block 30 of 476 bits resulting in a long frame 32 of 640 bits. As previously described, this long frame is then split into four 160 bit lengths for insertion into the standard TCH block of 4 APHS frames 34a, 34b, 34c, and 34d for transmission.

In the PHS system, the data rate resource in area TCH for use in a long-frame is

TCHM = 160*4 = 640bits. For compatibility, the original area containing SA/CI data in each slot is reserved in APHS but the data is ignored for processing in the APHS. Message SA/CI together with in-band message data are encoded and put in original TCH area.

The maximum encoded speech data in a long-frame is 476bits in the APHS embodiment described. Different vocode mode and channel code mode with different parameters are combined to generate different encoded speech data blocks of different size. If the generated encoded speech data block is larger than 476 bits, some bits have to be punctured. In APHS embodiment disclosed herein, channel coding is accomplished using a convolutional encoder. Other channel coding methods are employed in alternative embodiments. Based on interleaving of the data, as will be discussed subsequently, the CI data need only be transmitted once in each long frame (the equivalent of one of every 4 PHS frames). The SA data needs to be transmitted for every slot. The resulting long frame data for SA/CI is shown in Table 1.

Table 1

Name SAO SAl SA2 SA3

Eight bits are employed for mode information which is mapped into the final \ bits of the long frame as will be shown below.

Table 2 shows the Codec mode and the associated convolution rate, the number of bits input into the convolutional coder, the resulting output number of bits from the coder, the number of SA bits after CRC and a '/_ convolutional encoder, the total number of bits and the preferred class.

Table 2

As can be seen in the table, with the fixed number of bits for SA/CI data of 156 and the total 640 bits available to fit within the PHS TCH of 160 bits for four frames, bits from the voice data convolutional encoder should total 476 and bits must be punctured to fit the long frame.

Exemplary convolution coding for each of the codec modes is shown in Tables 3 - 10 with definition of the punctured bits to maintain the long frame size of 640 bits.

Table 3 TCH/AFS12.2 Codec:

The block of 250 bits {u(0)... u(249)} is encoded with the 1/2 rate convolutional code defined by the following polynomials: GO/GO = 1

G l/G0 = l + D + D ³ + D ⁴ / 1 + D ³ + D ⁴ resulting in 508 coded bits, (C(O).. C(507)} defined by r(k) = u(k) + r(k-3) + r(k-4)

C(2k) = u(k) C(2k+l) = r(k)+r(k-l)+r(k-3)+r(k-4) for k = 0, 1 , .., 249; r(k) = 0 for k<0 and (for termination of the coder)- r(k) = 0

C(2k) = r(k-3) + r(k-4)

C(2k+1) = r(k)+r(k-l)+r(k-3)+r(k-4) for k = 250, 251 , , 253

The code is punctured in such a way that the following 32 bits. 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) are not transmitted.

Table 4 TCH/AFS10.2 Codec:

The block of 210 bits {u(0) u(209)} is encoded with the 1/3 rate convolutional code defined by the following polynomials G1/G3 = 1 + D + D ³ + D ⁴ / 1 + D + D ² + D ³ + D ⁴

G2/G3 = 1 + D ² + D ⁴ / 1 + D + D ² + D ³ + D ⁴

G3/G3 = 1 resulting in 642 coded bits, (C(O) C(641)} defined by r(k) = u(k) + r(k- 1 ) + r(k-2) + r(k-3) + r(k-4) C(3k) = r(k) + r(k-l ) + r(k-3) + _r (k-4)

C(3k+1) = r(k)+r(k-2)+r(k-4)

C(3k+2) = u(k) for k = 0, 1 , , 209 and (for termination of the coder) r(k) = 0 C(3k) = r(k)+r(k-l) + r(k-3) + r(k-4)

C(3k+1) = r(k)+r(k-2)+r(k-4)

C(3k+2) = r(k-l)+r(k-2)+r(k-3)+r(k-4) for k = 210, 21 1 , , 213

The code is punctured in such a way that the following 22 bits

C(I), C(4), C(7), C(I O), 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) are not transmitted All these operations will result in 620 bits

The code is punctured in such a way that the following 166 bits C(I), C(4), C(7), C(IO), 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(1 12), C(115), C(118), C( 124), C( 127), C(130), C(136), C(139), C(142), C(148), 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(208), C(21 1), 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(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(51 1 ), 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) are not transmitted

Table 5 TCH/AFS7.95 Codec

The block of 165 bits {u(0) u(164)} is encoded with the 1/3 rate convolutional code defined by the following polynomials G4/G4 = 1

G5/G4 = 1 + D + D ⁴ + D ⁶ / 1 + D ² + D ³ + D ⁵ + D ⁶

G6/G4 = 1 + D + D ² + D ³ + D ⁴ + D ⁶ / 1 + D ² + D ³ + D ⁵ + D ⁶ generating 513 coded bits, (C(O) C(512)} defined by 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- l)+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 for k<0 and (for termination of the coder) r(k) = 0 C(3k) = r(k-2) + r(k-3) + r(k-5) + r(k-6)

C(3k+1) = r(k)+r(k- l)+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 = 165, 166, , 170

The code is punctured in such a way that the following 37 bits C(I), C(2), C(4), C(5), C(8), C(22), C(70), C(1 18), 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) are not transmitted

Table 6

TCH/AFS7.4 Codec

The block of 154 bits (u(0) u(153)} is encoded with the 1/3 rate convolutional code defined by the following polynomials

G1/G3 = 1 + D + D ³ + D ⁴ / 1 + D + D ² + D ³ + D ⁴ G2/G3 = 1 + D ² + D ⁴ / 1 + D + D ² + D ³ + D ⁴

G3/G3 = 1 resulting in 474 coded bits, (C(O) C(473)} defined by 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) for k = 0, 1, , 153 and (for termination of the coder) r(k) = 0

C(3k) = r(k)+r(k-l) + r(k-3) + r(k-4) C(3 k+ 1 ) = r(k)+r(k-2)+r(k-4)

C(3k+2) = r(k-l)+r(k-2)+r(k-3)+r(k-4) for k = 154, 155, , 157

Table 7 TCH/AFS6.7 Codec:

The block of 140 bits {u(0)... u(139)} is encoded with the 1/4 rate convolutional code defined by the following polynomials: G 1/G3 = 1 + D + D ³ + D ⁴ / 1 + D + D ² + D ³ + D ⁴

G2/G3 = 1 + D ² + D ⁴ / 1 + D + D ² + D ³ + D ⁴

G3/G3 = 1

G3/G3 = 1 producing 576 coded bits, (C(O)... C(575)} defined by: 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) for k = 0, 1, .... 139; r(k) = 0 for k<0 Also (for termination of the coder): 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- l)+r(k-2)+r(k-3)+r(k-4) C(4k+3) = r(k- l)+r(k-2)+r(k-3)+r(k-4) for k = 140, 141 , ..., 143

The code is punctured in such a way that the following 100 bits: C(I), C(3), C(7), C(1 1), C(15), C(27), C(39), C(55), C(67), C(79), C(95), C(107), C(1 19), 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(41 1), 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(51 1 ) are not transmitted.

Table 8 TCH/AFS5.9 Codec:

The block of 124 bits {u(0)... u(123)} is encoded with the 1/4 rate convolution code defined by the following polynomials: G4/G6 = 1 + D ² + D ³ + D ⁵ + D ⁶ / 1 + D + D ² + D ³ + D ⁴ + D ⁶

G5/G6 = 1 + D + D ⁴ + D ⁶ / 1 + D + D ² + D ³ + ⁴ + D ⁶

G6/G6 = 1

G6/G6 = l generating in 520 coded bits, (C(O)... C(519)} defined by: 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-l) + r(k-4) + r(k-6)

C(4k+2) = u(k)

C(4k+3) = u(k) for k = 0, 1, ..., 123; r(k) = 0 for k<0 and (for termination of the coder): 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-l )+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-l)+r(k-2)+ r(k-3)+r(k-4)+r(k-6) for k = 124, 125, ..., 129

The code is punctured in such a way that the following 44 bits: C(O), C( I), C(3), C(5), C(7), C(1 1),

C(15), C(31), C(47), C(63), C(79), C(95), C(I I l), 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) are not transmitted.

Table 9 TCH/AFS5.15 Codec

The block of 109 bits {u(0) u(108)} is encoded with the 1/5 rate convolution code defined by the following polynomials G 1/G3 = 1 + D + D ³ + D ⁴ / 1 + D + D ² + D ³ + D ⁴

G 1/G3 = 1 + D + D ³ + D ⁴ / 1 + D + D ² + D ³ + D ⁴

G2/G3 = 1 + D ² + D ⁴ / 1 + D + D ² + D ³ + D ⁴

G3/G3 = 1

G3/G3 = 1 generating 565 coded bits, {C(0) C(564)} defined by 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-l) + 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) for k = 0, 1 , , 108, r(k) = 0 for k<0 and (for termination of the coder) 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) for k = 109, 1 10, , 1 12

The code is punctured in such a way that the following 89 bits C(O), C(4), C(5), C(9), C(IO), 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(IOO), C(1 10), C(120),

C(BO), 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) are not transmitted

Table 10 TCH/AFS4.75 Codec:

The block of 101 bits {u(0) .. u(100)} is encoded with the 1/5 rate convolutional code defined by the following polynomials: G4/G6 = 1 + D ² + D ³ + D ⁵ + D ⁶ / 1 + D + D ² + D ³ + D ⁴ + D ⁶

G4/G6 = 1 + D ² + D ³ + D ⁵ + D ⁶ / 1 + D + D ² + D ³ + D ⁴ + D ⁶

G5/G6 = 1 + D + D ⁴ + D ⁶ / 1 + D + D ² + D ³ + D ⁴ + D ⁶

G6/G6 = 1

G6/G6 = l Generating 535 coded bits, (C(O)... C(534)} defined by: 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- l) + r(k-4) + r(k-6) C(5k+3) = u(k)

C(5k+4) = u(k) for k = 0, 1 , , 100, r(k) = O for k<0 and (for termination of the coder) 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-l)+r(k-4)+r(k-6)

C(5k+3) = r(k- l )+r(k-2)+ r(k-3)+r(k-4)+r(k-6)

C(5k+4) = r(k- l )+r(k-2)+ r(k-3)+r(k-4)+r(k-6) for k = 101, 102, , 106

The code is punctured in such a way that the following 59 bits: C(O), C(5), C(15), C(25), C(35), C(45), C(55), C(65), C(75), C(85), C(95), C(105), C(1 15), 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), are not transmitted.

The RATSCCH long frame employs a different format within the TCH block which is shown in FIG. 4. RATSCCH is used in two cases. At the very beginning of the connection between handset and base station, it is used for long-frame synchronization. Also, in some corner cases, the in-band message in RATSCCH is used to give the encoder mode information together with the in-band message of the normal frame. RATSCCH as used in the present invention is comparable to the formats widely used in GSM/3G systems for telling remote PS/CS to change AMR mode and class.

In one embodiment, interleaving of the data of the long frame for transmission in the standard PHS 5 ms bursts is accomplished as shown in FIG. 5. The bits of the long frame are interleaved as shown in Table 1 1.

Table 1 1

For interleaving, the bits are split into even and odd bits 102, 104 and interleaved according to the table. Eight segments 106 of 80 bits of data are obtained 108 which are then interleaved with eight segments from the prior 20 ms segment 1 10. After interleaving, two segments at a time are transmitted in the TCH block of the PHS slot.

In the normal data transfer mode, the system operates in a similar manner to AMR in GSM and 3GPP systems. As shown in FIG. 6. In the handset 36, speech encoder 38 for input voice samples the data and provides coded data to a channel encoder 40 which converts the long frames to PHS format 5 ms frames for transmission. Uplink speech data is then transmitted to the base station 42 in which a channel decoder 44 collapses the PHS standard frames into the long frame format which is then passed to the speech decoder 46. During the decoding, the bit error and corresponding SNR (relative channel condition) is estimated by the Viterbi decoder in the convolution decoding process. After estimation within a certain time period, the codec adaption unit 48 makes decision whether the encode mode should be changed

in the receiving direction, as will be described in detail subsequently. A request message, uplink node command 50, is inserted into the in-band area and transfer to the handset.

Operation of downlinking data from the base station to the handset is comparable with the speech data encoded by speech encoder 52 for input voice samples the data and provides coded data to a channel encoder 54 which converts the long frames to PHS format 5 ms frames for transmission. Downlink speech data is then transmitted to the handset in which a channel decoder 56 collapses the PHS standard frames into the long frame format which is then passed to the speech decoder 58. During the decoding, the bit error and corresponding SNR (relative channel condition) is estimated. After estimation within a certain time period, the codec adaption unit 60 makes decision whether the encode mode should be changed in the receiving direction. A request message, downlink mode command 62, is inserted into the in-band area and transfer to the base station. For each transmitted long- frame, the encode mode (index) of the transmitter is determined based on the mode command which shifts the mode using an algorithm based on class as shown in FIGs. 7a and 7b. PHS standard requirements allow a simplified algorithm for mode adjustment over standard GSM/3G systems. Adjacent modes are in different classes effectively splitting the total number of modes as shown in the table of FIG. 7a. As shown in FIG. 7b, if the transmission is proceeding in mode 11 and class 1 (12.2 kbps) and the error estimate from the convolution decoder indicates a reduction in bit rate is required, the mode command causes a shift 72 of one mode down within the same class, i.e. to mode 10 class 1 (7.95kbps). If the BER is still too high, a second shift 74 down is commanded to mode 01 class 1 (6.7 kbps). Continuing high BER results in yet another shift 76 down to mode 00 class 1 (5.15 kbps). If the BER remains too high, a final shift 78 across class to mode 00 class 2 (4.74 kbps) is made. Thus the entire range of available modes is spanned in four command shifts. Similarly, if BER is reduced below a predefined threshold, the command shifts up the class for increased transmission speed. For example if the system has been in lowest mode, i.e. mode 00 class 2 (4.74 kbps) and BER is now

improving, a command shift 80 raises the mode to mode 01 class 2 (5.9 kbps) as opposed to returning to mode 00 class 1. Further improvement results in a shift 82 to mode 10 class 2 (7.4 kbps), with yet further improvement resulting in a shift 84 to mode 11 class 2 (10.2 kbps). If further improvement is available, the algorithm then causes the mode to shift class 86, i.e. to mode 11 class 1 (12.2 kbps) for highest transmission speed. Improvement or deterioration in BER in the middle of a class range results in movement up or down within the class as exemplified by shifts 88 and 90. The algorithm allows a circular shifting pattern based on mode within the class, shifting class only when reaching a minimum or maximum transmission capability within the class.

Having now described the invention in detail as required by the patent statutes, those skilled in the art will recognize modifications and substitutions to the specific embodiments disclosed herein. Such modifications are within the scope and intent of the present invention as defined in the following claims.