Abstract:
The present invention relates to a decoder (10) for convolutional self-orthogonal codes which includes a multistage syndrome register (16) and is responsive to two separate threshold levels. The first threshold level, as in prior art arrangements, includes a first majority logic circuit (24) connected to selected stages of the syndrome register and functions to correct the information bits (X 1  -X 7 ) currently being processed. Instead of also using this majority logic circuit to correct the syndrome register, as in the prior art, the present invention includes a second majority logic circuit (28), which operates at a different threshold level than the first and functions to correct the selected stages of the multistage syndrome register.

Description:
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention relates to a decoder for convolutional self-orthogonal codes (CSOC&#39;s), and more particularly, to a dual threshold decoder wherein a first threshold logic circuit is employed to correct the information bit currently being processed and a second threshold logic circuit is employed in a feedback arrangement to correct selected bits contained in a syndrome register storing a plurality of syndrome bits used to correct the received convolutional self-orthogonal code. 
     2. Description of the Prior Art 
     Two systematic procedures are known for threshold decoding of a redundant sequence which includes information signals encoded in accordance with a convolutional, self-orthogonal code. One of these procedures, defined as direct decoding, is embodied in the error-correcting system disclosed in U.S. Pat. No. 3,227,999 issued to D. W. Hagelbarger on Jan. 4, 1966. There, each decoding correction made with respect to an information signal is not fed back to change the nature of a stored syndrome or error pattern representation. If such a change were made, the decoding of subsequently processed information signals would be directly influenced. In other words, in direct decoding there is no feedback connection in the decoding circuitry. Hence, an erroneous decision by the decoder cannot lead to other faulty decisions in subsequent processing. In effect, a positive immunity against error propagation in the decoding process is thereby achieved (but at the expense of reduced error-correcting capabilities). 
     The other available procedure for processing convolutional self-orthogonal codes is known as feedback decoding. As disclosed in U.S. Pat. No. 3,439,334 issued to J. L. Massey on Apr. 15, 1969, each decoding correction made not only corrects the information bit, but is also fed back to the syndrome register to correct (rightly or wrongly) the affected bits of the syndrome register. It is apparent that in a feedback decoder a bad decoding decision can introduce additional errors in the decoding process. 
     The problem remaining in the prior art, therefore, is to provide a decoder for convolutional self-orthogonal codes which has greater error-correcting capabilities than a direct decoder but which exhibits considerably less of an error propagation problem than a conventional feedback decoder. 
     SUMMARY OF THE INVENTION 
     The problem remaining in the prior art has been solved in accordance with the present invention, which relates to a decoder for convolutional self-orthogonal codes (CSOC&#39;s), and more particularly, to a dual threshold decoder wherein a first threshold logic circuit is employed to correct the information bit currently being processed and a second threshold logic circuit is employed in a feedback arrangement to correct selected bits contained in syndrome register storing a plurality of syndrome bits used to correct the received convolutional self-orthogonal code. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIGS. 1 and 2 illustrates an exemplary decoder for convolutional self-orthogonal codes formed in accordance with the present invention including a code rate=7/8 and a constraint length K=384. 
    
    
     DETAILED DESCRIPTION 
     In convolutional coding schemes, groups of a m code bits are transmitted during a given time interval, where a given group of m code bits include k data bits and (m-k), or p, parity bits. In contrast with block codes which generate m code bits in a particular time span based only upon the k data bits from the corresponding time interval, convolutional codes generate m code bits based upon both the k data bits from the corresponding time interval and a subset of the (N-1)·k data bits from the (N-1) previous time intervals. The parameter N, multiplied by m, gives the constraint length of the code, that is, K=Nm. A code rate, r, is defined as the ratio of data bits to total bits transmitted per group, or r=k/m. Upon reception, the parity bits are separated from the information bits and the parity bits are incorporated into a set of equations called the syndrome equations. The solution to these syndrome equations are then used by the decoder to check the accuracy of the received information bits. Several techniques exist in the art for generating these syndrome equations and are discussed in the book &#34;Threshold Decoding&#34; by J. L. Massey (M.I.T. Press, Cambridge, Mass., 1963). 
     For illustrative purposes, the remaining discussion of the present invention will utilize a code rate 7/8, constraint length 384 convolutional self-orthogonal code. The syndrome equations for this code, wich may be employed in a T1 data rate digital FDMA satellite system, are included in Table I. 
     
         ______________________________________  g.sub.1 (D) = D.sup.0 + D.sup.3 + D.sup.19 + D.sup.42  g.sub.2 (D) = D.sup.0 + D.sup.21 + D.sup.34 + D.sup.43  g.sub.3 (D) = D.sup.0 + D.sup.29 + D.sup.33 + D.sup.47  g.sub.4 (D) = D.sup.0 + D.sup.25 + D.sup.36 + D.sup.37  g.sub.5 (D) = D.sup.0 + D.sup.15 + D.sup.20 + D.sup.46  g.sub.6 (D) = D.sup.0 + D.sup.2 + D.sup.8 + D.sup.32  g.sub.7 (D) = D.sup.0 + D.sup.7 + D.sup.17 + D.sup.45______________________________________ 
    
     In encoding this 7/8 code rate CSOC, a single parity bit is appended to each group of seven unaltered data bits, and the eight-channel-bit code groups are then transmitted in sequence. Each parity bit is a parity check on 28 data bits, which include the seven data bits from the current group plus one data bit from each of 21 earlier groups. Each data bit contributes to the parity bit of its own group, and is retained in memory to contribute to the parity bit in each of three future groups, thus each data bit affects the value of four parity bits. However, no two data bits, whether different bits in the same group, corresponding bits in different groups, or different bits from different groups, affect more than a single common parity bit. This is known as the &#34;self-orthogonal&#34; property. 
     An exemplary decoder 10 capable of receiving and decoding a transmitted 7/8 code rate CSOC is illustrated in FIGS. 1 and 2. As shown, a received sequence R comprises a databit sequence D and a parity-bit sequence P. Upon arrival, received sequence R is divided into its separate data and parity sequences. Data-bit sequence D is applied as an input to a local encoder 12, where local encoder 12 is a replica of the encoder used to generate the transmitted sequence denoted X 1  -X 7 . Parity-bit sequence P is applied as a first input to a modulo-2 adder 14, where the second input to modulo-2 adder 14 is a locally generated parity-bit sequence L. The output of modulo-2 adder 14 is a syndrome sequence S which is subsequently applied as an input to a syndrome register 16. In this example, syndrome register 16 is a 48-bit shift register and syndrome sequence S is clocked and stored in syndrome register 16 at the group rate. As described in greater detail hereinafter, data-bit sequence X will also be stored through 48 clock cycles to ensure that all four syndrome bits affected by any one data bit have been accumulated in syndrome register 16 at the time that the decision on that particular data bit is to be rendered. 
     Included in a first threshold logic circuit 24 of decoder 10 is a plurality of seven majority logic gates (MLG) 18 1  -18 7 , each with five inputs. The five inputs to an exemplary MLG 18 i  comprise the oldest bit in syndrome register 16, S O , the three remaining (later) syndrome bits affected by a data bit X i  of the current data-bit sequence X (as determined by the related syndrome sequence g i  (D) of Table I), and a fifth input which is permanent ground (i.e., always equal to zero). For example, referring to Table I, the syndrome bit applied as inputs to MLG 18 3  will be bits S O , S 29 , S 33  and S 47  from syndrome register 16, that is, those syndrome bits related to data bit X 3 . The inputs for the remaining majority logic gates are determined in the same fashion. In accordance with the present invention, each MLG 18 1  -18 7  includes a threshold value of 3, that is, the output from an exemplary MLG 18 i  will be equal to the value 1 if and only if at least three out of the five inputs applied thereto are equal to the value 1. 
     The outputs from MLG 18 1  -18 7 , denoted data correction outputs C 1  -C 7 , are subsequently applid as separate inputs to a plurality of seven exclusive OR (EOR) gates 20 1  -20 7 . In particular, data correction output C 1  from MLG 18 1  is applied as an input to EOR gate 20 1 , data correction output C 2  to EOR gate 20 2 , and so on, with data correction output C 7  from MLG 18 7  applied as an input to EOR gate 20 7 . Each EOR gate 20 1  -20 7  is also responsive to a separate one of the plurality of data bits X 1  -X 7  forming data sequence X. Since the decoding process must wait until the syndrome sequence S associated with the current data sequence X propagates through the 48 bits forming syndrome register 16 and occupies bit S 0  of syndrome register 16, data sequence X must be subjected to a 48-bit delay prior to being applied as separate inputs to the plurality of EOR 20 1  -20 7 . Therefore, as shown in FIG. 2, each data bit X 1  -X 7  is applied as an input to a separate one of a plurality of seven delay elements 22 1  -22 7 , where each delay element functions to hold the associated data bit and suspend processing thereon until the associated parity bit P reaches the last bit, S 0 , of syndrome register 16. Hence, an exemplary EOR gate 20 i  receives as simultaneous inputs both data correction bit C i  from MLG 18 i  and received data bit X i  from delay element 22 i . 
     In accordance with the exclusive OR function, the output of EOR gate 20 i  will be equal to the value 1 if and only if either data bit X i  is equal to 1 or data correction bit C i  is equal to 1, but not both are equal to 1, and is defined as a corrected data bit X. Table II below shows the relation between C i , X i  and X i . 
     
         ______________________________________C.sub.i  X.sub.i     X.sub.i                    Explanation______________________________________0      0           0     uncorrected data bit0      1           1     uncorrected data bit1      0           1     corrected data bit1      1           0     corrected data bit______________________________________ 
    
     As seen by reference to Table II, a data bit X i  is corrected only when date correction bit C i  is equal to the value 1, that is, when at least three elements of the associated syndrome equation g i  (D) are equal to 1. 
     The set of majority logic gates 18 1  -18 7 , EOR gates 20 1  -20 7 , and delay elements 22 1  -22 7 , therefore, form a first threshold logic circuit 24 of decoder 10, where as mentioned hereinbefore, the threshold level is set at 3-out-of-5. Thus, first threshold logic circuit 24 functions to correct data bits X 1  -X 7  of data-bit sequence D, but does not interfere at all with the syndrome bit values S 47  -S 0  contained in syndrome register 16. In accordance with the present invention, a second threshold logic circuit 26 functions to correct the separate bits S 47  -S 0  of syndrome register 16, where second threshold logic circuit 26 comprises a higher threshold level than that associated with first threshold logic circuit 24. For the exemplary decoder 10 illustrated in FIG. 1, therefore, where first threshold logic circuit 24 comprises a threshold level of 3, second threshold logic circuit 26 will comprise a threshold level of four. 
     As shown in FIG. 2, second threshold logic circuit 26 comprises a plurality of seven AND gates 28 1  -28 7 , where each AND gate 28 1  -28 7  is added in parallel with its associated MLG 18 1  -18 7 . It is to be understood that instead of AND gates 28 1  -28 7 , second threshold logic circuit 26 could comprise a second plurality of majority logic gates which are arranged to include a threshold level of four. Referring back to FIG. 2, each AND gate 28 1  -28 7  is coupled to receive as separate inputs the four syndrome bits which are applied as inputs to its associated MLG 18 1  -18 7 . For example, as shown in FIGS. 1 and 2 syndrome bits S 0 , S 29 , S 33  and S 47  are applied as separate inputs to AND gate 28 3 . Therefore, in order for the output syndrome correction bit S i  of AND gate 28 i  to be equal to the value 1, all four syndrome bits applied as inputs thereto must also equal 1. Thus, in association with the dualthreshold aspect of the present invention, for the same current data bit X i , data correction bit C i  could be equal to 1 and syndrome correction bit S i  could be equal to 0, where this situation will occur when three out of four syndrome bits related to data bit X i  are equal to one. 
     Each syndrome correction bit S 1  -S 7  is subsequently fed back and applied as an input to a separate one of a plurality of seven sets of EOR gates 30 1  -30 7 , where each set includes three separate EOR gates. In order to avoid complicating the illustration of decoder 10, only the set of EOR gates 30 3 ,1, 30 3 ,2, and 30 3 ,3 associated with syndrome correction bit S 3  and the set of EOR gates 30 7 ,1, 30 7 ,2, and 30 7 ,3 associated with syndrome correction bit S 7  are included in the illustration of FIG. 1. A syndrome correction bit S i  equal to one usually indicates that the four syndrome bits from syndrome register 16 which were applied as inputs to its associated AND gate 28 i  were true indicators of the incorrect state of data bit X i , and consequently are usually false indicators of the correct state of the remaining received data bits related thereto. A number of these data bits are included in later code groups and would, therefore, benefit by removal of the false indicators before they in turn are decoded. Therefore syndrome correction bit S i , via EOR gate set 30 i , is fed back to syndrome register 16 to correct the associated syndrome bits before they are shifted into their subsequent positions in syndrome register 16. The correction process is illustrated in detail in FIG. 1 for syndrome correction bits S 3  and S 7 . As described hereinbefore, the four syndrome bits which are associated with syndrome correction bit S 3  are S 47 , S 33 , S 29  and S 0 , as can be seen by reference to syndrome equation g 3  (S) in Table I. Thus, in accordance with the present invention, syndrome bits S 47 , S 33  and S 29  must be corrected before they are shifted into syndrome bit positions S 46 , S 32  and S 28 , respectively. Note, syndrome bit S 0  need not be corrected since this bit will be removed from syndrome register 16 when the next shift takes place. 
     To initiate the correction procedure, syndrome bit S 47  and syndrome correction bit S 3  are applied as separate inputs to EOR gate 30 3 ,1, where the output of EOR gate 30 3 ,1, defined as corrected syndrome bits S 3 ,1, is subsequently applied as the input to syndrome bit S 46  of syndrome register 16. Therefore, in association with the exclusive-OR function, when the S 3  input to EOR gate 30 3 ,1 is equal to the value one, corrected syndrome bit S 3 ,1 will be equal to the opposite of syndrome bit S 47  (S 47 ), thus correcting the false value from syndrome bit S 47 . In a similar manner, syndrome bit S 33  and syndrome correction bit S 3  are applied as separate inputs to EOR gate 30 3 ,2, where the output corrected syndrome bit S 3  &#39;.sub.,1 is subsequently applied as the input to syndrome bit S 32 . Likewise, syndrome bit S 29  and syndrome correction bit S 3  are applied as separate inputs to EOR gate 30 3 ,3 and output corrected syndrome bit S.sub. 3 &#39;.sub.,3 is applied as the input to syndrome bit S 28 . 
     The above-described process simultaneously takes place in relation to the remaining syndrome correction bits, where the correspondence between an exemplary syndrome correction bit S i  and the actual syndrome bits to be corrected may be determined by reference to the related syndrome equation g i  (D) in Table I and is illustrated for syndrome correction bit S 7 . 
     In summary, a decoder for convolutional selforthogonal codes has been disclosed, which improves upon the minimal burstiness properties of direct decoding while also retaining the low bit error rate (BER) associated with feedback decoding by maintaining a relatively low threshold level for first threshold logic circuit 24, and a relatively high threshold level for second threshold logic circuit 26. Finally, it is to be understood that the above-described decoder arrangement is exemplary only, since a decoder formed in accordance with the present invention may be arranged to accommodate convolutional self-orthogonal codes which comprise any desired code rate and constraint length.