Abstract:
A rate-l/n or rate-k/n convolutional encoding method, in a digital communications system having a non-systematic convolutional encoder, includes the steps of: obtaining first to n-th block code words by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word; converting one of the first to n-th block code words to a systematic code word and obtaining a new information word corresponding to the systematic code word; and generating a convolutional code by encoding the new information code in the non-systematic convolutional encoder.

Description:
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention relates to an error correction encoding method in a digital communications system and, more particularly, to a systematic punctured convolutional encoding method. 
     2. Description of the Related Art 
     Error correction is an important feature for a digital modem and many error correction techniques have been suggested. For instance, the use of convolutional codes as error correction codes is widespread in mobile radio communications systems and has been adopted as a standard for an air interface in a CDMA (Code Division Multiple Access) digital cellular system, IS-95. 
     It is to be appreciated that a code rate, R, of 1/2 (i.e., k/n where k is number of bits in an information symbol and n is the number of bits in the code symbol) associated with a convolutional code is non-systematic, and a first code word c 1 (x) and a second code word c 2 (x) are generated from an input information word i(x), respectively, by: 
     
       
         c 1 (x)=g 1 (x)i(x)  (1) 
       
     
     
       
         c 2 (x)=g 2 (x)i(x)  (2) 
       
     
     where g 1 (x) and g 2 (x) represent the code word generating polynomials, where the code words c 1 (x) and c 2 (x) are non-systematic, and where the information word i(x), which is not independent of the code words, can be obtained only by an associated decoder. That is, unlike systematic codes, the k bits comprising the information word i(x) do not typically remain unaltered in a non-systematic code word. 
     A punctured convolutional code having a code rate larger than 1/2 can be obtained by periodically puncturing the code words c 1 (x) and c 2 (x) generated from equations (1) and (2), using a puncturing matrix A. It is to be further appreciated that a variety of forms of the puncturing matrix are well known in the field. Since the puncturing matrix A is a non-systematic matrix, it follows that the code words generated by use of this matrix are non-systematic punctured convolutional codes. 
     FIG. 1 is a block diagram of a conventional encoder and decoder of a rate-5/8 punctured convolutional code. Reference character A indicates a puncturing matrix [11101 10111]. It is to be understood that an information word is convolutionally coded by convolutional encoder  11  having a code rate of 1/2. That is, for every 1-bit information word, a 2-bit convolutional code word is generated. Next, to increase the code rate of the transmission encoding process, the convolutional code word is passed through a puncturer  12  having a deleting pattern or puncturing matrix associated therewith. The matrix A results in a punctured code rate of 5/8. That is for every 5-bits input to convolutional encoder  11 , 8-bits are output from the puncturer  12 . The punctured convolutional code word is then transmitted over the communications channel to a receiver which reverses the coding process. That is, the code word is passed through an erasure insertion device or depuncturer  13  which restores deleted bits in correspondence with the puncturing matrix employed in the encoding process. Then, the depunctured word is passed through a convolutional code decoder  14  having a rate of 1/2 which outputs the information word originally input to encoder  11 . 
     Conventional punctured convolutional codes are not available for a system requiring a systematic data structure because they are all generated from non-systematic puncturing matrices. With data and frames in systematic forms, much of the processing delay can be reduced in a transmission system employing an error corrector and detector which uses CRC (Cyclic Redundancy Check) for error detection. For example, to obtain a transmitted information word from a code word prior to decoding in the case of a current non-systematic convolutional code, a divider is required to divide the received code word by the code word generating polynomial g(x). This divider is composed of linear feedback shift registers (LFSRs), the number of LFSRs being equivalent to the order of the error correction code generating polynomial for the CRC code employed. In addition, the processing delays and operations associated with the detection of the information word from the received code word is a function of the size of the code word transmitted. Hence, processing delay increases with code word size, that is, frame size. It is to be appreciated that frames are large in applications involving high multispeed hard disk drivers or high speed data transmission systems such as, for example, ISDN (Integrated Services Digital Network). In other words, due to a high transmission rate within a very short time, a single frame has many bits or symbols, which implies that a large amount of time is required to obtain an information word. This adds to processing delay-related difficulties since it takes a long time to implement decoding in a conventional Viterbi decoder. It is well known that delay-incurred problems are not negligible in a communications system. 
     SUMMARY OF THE INVENTION 
     An object of the present invention is to provide a systematic punctured convolutional encoding method in which a non-systematic code word is converted to a systematic code word. 
     To achieve the above and other objects, there is provided a rate-l/n convolutional encoding method in a digital communication system having a non-systematic convolutional encoder. In the method, first to n-th block code words are obtained by multiplying first to n convolutional code generating polynomials by an information polynomial upon input of an information word, one of the first to n-th block code words is converted to a systematic code word, and a new information word corresponding to the systematic code word is obtained. Then, a convolutional code is generated by encoding the new information code in the non-systematic convolutional encoder. The resulting code word is then preferably processed by a systematic puncturer. 
     These and other objects, features and advantages of the present invention will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings in which the same reference numerals are used throughout the various figures to designate same or similar components. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a block diagram of a conventional encoder and decoder of a rate-5/8 punctured convolutional code; 
     FIG. 2 is a schematic view of an encoder of a rate-1/2 non-systematic convolutional code; 
     FIG. 3 is a conceptual view of a systematic convolutional encoder according to the present invention; 
     FIG. 4 is a block diagram of an encoder of a systematic punctured convolutional code according to an embodiment of the present invention; 
     FIGS. 5A,  5 B, and  5 C illustrate the bit structures of code words; 
     FIG. 6 is a block diagram of a decoder of a systematic punctured convolutional code according to an embodiment of the present invention; 
     FIG. 7 is a table illustrating weight spectra of rate-2/3 systematic punctured convolutional codes generated from a known code with a code rate of 1/2, 3≦K≦7, P of 2; and 
     FIG. 8 is a table illustrating weight spectra of systematic punctured convolutional codes generated from a known code with a code with a code rate of 1/2, K of 7, G 1 =[1011011], and G 2 =[1111001]. 
    
    
     DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS 
     Due to the fact that every linear code has different sets of code words, and each code word in one set corresponds to a code in another set with the same code weight spectrum, in accordance with the present invention, a systematic code word is matched one by one with a corresponding code word so that systematic code words having the same code weight spectra as those of non-systematic convolutional or punctured convolutional code words are obtained. A detailed description of a method of the invention will now follow. 
     1. Rate-1/2 convolutional code 
     It is to be understood that a rate-1/2 convolutional code can be interpreted as equivalent to an interleaved linear block code. 
     FIG. 2 is a schematic view of a convolutional code encoder with a code rate of 1/2 and a constraint length (K) of 3. Reference numerals  21  and  25  are modulo-2 adders and reference numeral  23  denotes a shift register. As shown, the rate 1/2 convolutional code encoder sequentially receives an information word I into shift register  23 . Shift register  23  has 3 binary stages (K=3) with the first and last stages connected to modulo-2 adder  21  and all three stages connected to modulo-2 adder  25 . As a result, code word C 1  is output from adder  21  and code word C 2  is output from adder  25 . Code word C may be considered as code word C interleaved with code word C 2 . 
     FIG. 3 is a conceptual view of a systematic convolutional encoder on the basis of the above interpretation. The encoder includes a C 1  encoder  24  and a C 2  encoder  26  for obtaining first and second block code words C 1  and C 2  by multiplying an input information word I by first and second convolutional code generating polynomials g 1 (x) and g 2 (x), respectively, and an interleaver  28  for generating a convolutional code word C by interleaving the first and second code words C 1  and C 2  with an interleaving depth (λ) of 2. 
     The basis for interpreting a rate-1/2 convolutional code as an interleaved linear block code is as follows. Assuming that a general convolutional code generating polynomial is g k (x) (k=1, 2, . . . , R) and an information word polynomial is I(x), a code word C k (x) (k=1, 2, . . . , R) can be expressed as: 
     
       
         C 1 (x)=g 1 (x)I(x)  (3) 
       
     
     
       
         C k (x)=g k (x)I(x)  (4) 
       
     
     It is to be appreciated that if each code word is considered a code word of a frame unit using zero-tail biting for block coding of a convolutional code, that is, a block code, each code word is equivalent to a linear block code. Thus, code words are generated from the code generating polynomials g k (x) (k=1, 2, . . . , R), and a code word C is obtained by interleaving these code words. All the code words are non-systematic. 
     2. Rate-l/n systematic punctured convolutional code 
     Every linear block code has a set of systematic code words associated therewith. Therefore, one code word is selected from R code words and converted to a systematic code word. Then, a new information word corresponding to this systematic code word is input to a conventional non-systematic convolutional encoder. One of the codewords output from the encoder includes the first input information word. Thus, in accordance with the invention, a systematic convolutional code can be generated from a non-systematic code word. 
     3. Rate-k/n systematic punctured convolutional code 
     Puncturing is implemented to obtain a high-rate convolutional code using the systematic convolutional encoder realized in the above step. Since it is important to retain a systematic code word, symbols of a code word selected as the systematic code word should typically be transmitted without puncturing. Nonetheless, a puncturing matrix may be employed according to the present invention, which can make the punctured convolutional code non-catastrophic. 
     Now, an encoder of a systematic punctured convolutional code will be described in detail. 
     FIG. 4 is a block diagram of one embodiment of a systematic punctured convolutional encoder according to the present invention. Assuming that the convolutional code generating polynomial employed is the previously described g k (x) (k=1, 2, . . . , R) and an information word is I n (x), then a code word C k (x) (k=1, 2, . . . R) generated from the encoder of FIG. 4 is expressed as: 
     
       
         C 1 (x)=g 1 (x)I n (x)  (5) 
       
     
     
       
         C k (x)=g k (x)I n (x)  (6) 
       
     
     If the first input information word is I(x), an encoder  41  generates a systematic code word C s (x) from I(x). It is to be understood that while any of R generating polynomials can be used, the performance of the systematic convolutional code word is varied depending on selection of the generating polynomial. Thus, a generating polynomial allowing the best performance for a particular application may be explored by simulation. As shown in the drawing, a divider  43 , connected to encoder  41 , selects a generating polynomial g 1 (x). 
     It is to be appreciated that the systematic code word C s (x) is converted to the new information word I n (x) in the divider  43 . This information word, generated via the operations of block  100  (encoder  41  and divider  43 ) and resulting in non-systematic code words, is input to a conventional convolutional encoder  45 . Thus, a convolutional code word generated from the new information word I n (x) is non-systematic. However, as is noted from comparison between the code word and the first input information word I(x), a code word generated from the convolutional encoder  45  is always systematic, if the generating polynomial g k (x) is employed in the systematic code encoder  41 . For example, by use of g 2 (x), the first input information word I(x) exists in C 2 (x) in a systematic form as shown in the following equation: 
     
       
           C   2   =r   2 ( x )+ x   m   I ( x ) 
       
     
     
       
         = I   n ( x ) g   2 ( x ) 
       
     
     
       
         = C   s ( x )  (7) 
       
     
     where r 2 (x) is a remnant produced from dividing x m I(x) by g 2 (x) and m is the number of shifters. Therefore, the code word C(x) is a systematic convolutional code. FIGS. 5A,  5 B, and  5 C illustrate the bit structures of code words, respectively, for C s (x), C 1 (x), and C i (x). 
     Next, code word C(x) is provided to a systematic puncturer  47 . Selection of a puncturing matrix employed by the systematic puncturer  47  will now be described. 
     The systematic puncturer  47  periodically punctures symbols of C(x). In this embodiment, a puncturing matrix A is represented as [R×P]. When an element of this matrix is 0, a corresponding symbol is punctured (i.e., deleted) and not transmitted. For generation of a systematic code word, the puncturing matrix should satisfy the following conditions: 
     (1) all elements in one of the row vectors are 1s in the puncturing matrix A; 
     (2) a convolutional code word generated by use of the puncturing matrix A should be non-catastrophic; and 
     (3) the convolutional code generated by use of the puncturing matrix A should have the largest value of minimum free distance (d-free) and a minimum information word error after decoding. 
     The systematic puncturer  47  then punctures the C(x) in accordance with the selected puncturing matrix to generate C p (x) for transmission over a channel to a decoder. 
     Examples of preferred puncturing matrices and corresponding weight spectra are listed below in Table I. 
     
       
         
               
               
             
               
               
               
               
               
             
           
               
                 TABLE I 
               
             
             
               
                   
               
               
                 input information 
                   
               
             
          
           
               
                 constraint 
                 first generating 
                 second generating 
                   
                 puncturing 
               
               
                 length (k) 
                 polynomial (G 1 ) 
                 polynomial (G 2 ) 
                 d-free 
                 matrix 
               
               
                   
               
               
                 3 
                 101 
                 111 
                 5 
                 
                   
                     
                       
                         
                           [ 
                           
                             
                               
                                 1 
                               
                               
                                 0 
                               
                             
                             
                               
                                 1 
                               
                               
                                 1 
                               
                             
                           
                           ] 
                         
                          
                       
                     
                             
                     
                         
                     
                   
                 
               
               
                   
               
               
                 4 
                 1101 
                 1111 
                 6 
                 
                   
                     
                       
                         
                           [ 
                           
                             
                               
                                 1 
                               
                               
                                 1 
                               
                             
                             
                               
                                 0 
                               
                               
                                 1 
                               
                             
                           
                           ] 
                         
                          
                       
                     
                             
                     
                         
                     
                   
                 
               
               
                   
               
               
                 5 
                 10011 
                 11101 
                 7 
                 
                   
                     
                       
                         
                           [ 
                           
                             
                               
                                 1 
                               
                               
                                 1 
                               
                             
                             
                               
                                 0 
                               
                               
                                 1 
                               
                             
                           
                           ] 
                         
                          
                       
                     
                             
                     
                         
                     
                   
                 
               
               
                   
               
               
                 6 
                 101011 
                 111101 
                 8 
                 
                   
                     
                       
                         
                           [ 
                           
                             
                               
                                 1 
                               
                               
                                 0 
                               
                             
                             
                               
                                 1 
                               
                               
                                 1 
                               
                             
                           
                           ] 
                         
                          
                       
                     
                             
                     
                         
                     
                   
                 
               
               
                   
               
               
                 7 
                 1011011 
                 1111001 
                 10  
                 
                   
                     
                       
                         
                           [ 
                           
                             
                               
                                 1 
                               
                               
                                 1 
                               
                             
                             
                               
                                 0 
                               
                               
                                 1 
                               
                             
                           
                           ] 
                         
                          
                       
                     
                             
                     
                         
                     
                   
                 
               
               
                   
               
             
          
         
       
     
     Referring now to FIG. 6, the operation of a decoder of a systematic punctured convolutional code according to the invention will be described. 
     As described referring to FIG. 4, though C(x) is a non-systematic code, one of R code words in the code is a systematic code word, i.e., C k (x) corresponding to g k (x) used for generating a systematic code in the encoder. The decoder of a systematic punctured convolutional code includes an erasure insertion device  51 , or depuncturer, which inserts an erasure bit in the location of a code word punctured by the systematic puncturer  47  of FIG.  4 . Then, a Viterbi decoder  52  decodes the erasure bit-inserted code word by the well-known Viterbi method and selects C s  from decoded code words. A truncator  54  separates symbols corresponding to the information code I(x) from the symbols of the code word according to equation (7) above. 
     The systematic punctured convolutional code of the present invention exhibits an excellent performance at a high rate, as compared to that used in a Viterbi chip of Qualcomm. In other words, because the performance difference between a non-systematic convolutional code and a systematic convolutional code increases with a higher rate, the systematic convolution code can be advantageously used for high speed transmission, a high rate coding scheme, and CDMA PCS (Personal Communication System) or FPLMTS (Future Public Land Mobile Telecommunication System) for data transmission, that is, packet transmission. 
     FIG. 7 is a table showing weight spectra of rate-2/3 systematic punctured convolutional codes generated from a known code with a code rate of 1/2, 3≦K≦7, a puncturing period (P) of 2, and FIG. 8 is a table showing weight spectra of systematic punctured convolutional codes generated from a known code with a code rate of 1/2, K of 7, G 1 =[1011011], and G 2 =[1111001]. 
     As described above, the present invention is advantageous in that an information word is directly obtained from received code words without passing through a decoder and thus it can be determined in a short time whether the received code words should be decoded. Though the performances of known systematic convolutional and punctured convolutional codes are considered as inferior to those of known non-systematic convolutional and punctured convolutional codes, the systematic convolutional and punctured convolutional codes of the present invention have the same code weight spectra as those of non-systematic ones and exhibit performances equal to or better at a high rate than the non-systematic ones. 
     While the present invention has been described in detail with reference to the specific embodiment of the present invention, it is a mere exemplary application. Thus, it is to be clearly understood that many variations can be made by anyone skilled in the art within the scope and spirit of the present invention.