Patent Document

CROSS REFERENCE TO RELATED APPLICATION 
   This application is based on Korean Patent Application No. 2001-76934 filed on Dec. 6, 2001 in the Korean Intellectual Property Office, the content of which is incorporated herein by reference. 
   BACKGROUND OF THE INVENTION 
   (a) Field of the Invention 
   The present invention relates to a blind rate detection method and device in an asynchronous mobile communication system. More specifically, the present invention relates to a blind rate detection method and device in an asynchronous mobile communication system with simpler hardwired implementation and improved reliability. 
   (b) Description of the Related Art 
   In general, a transmitter in an asynchronous mobile communication system performs a channel encoding process and a modulation process on blind rate data to transmit them to a receiver via a radio channel. 
   The receiver receives the blind rate data from the transmitter through the radio channel, a demodulator demodulates them, and a Viterbi decoder performs a decoding process on them. 
   In this instance, a transmission speed of input data must be previously known in order for the Viterbi decoder to decode symbols of the received data. 
   Transmission speed information of image data or control signals but not speech data is transmitted to the decoder through various paths, for example, an additional channel or a transport format combination indicator (TFCI). 
   However, in the case of the speech data, blind rate information is not previously transmitted to the decoder. Therefore, in order to determine various speeds transmitted by the transmitter, the Viterbi decoder uses information such as a cyclic redundancy code (CRC) check to determine a transmission speed. Hence, in the case there is no TFCI, the asynchronous IMT-2000 system requires an algorithm for detecting a blind rate, that is, a blind transport format detection (BTFD) algorithm. 
   A conventional BTFD algorithm for detecting the blind rate is represented in  FIG. 1 , but prior to describing the BTFD algorithm, a data structure that has a blind rate will be described with reference to  FIG. 2 . 
   Referring to  FIG. 2 , the variable length data stream undergoes block encoding and convolutional encoding using a CRC, and CRC parity bits are provided at the end of the variable length data stream in a reverse order. The receiver is notified of a transmittable format or a last bit&#39;s possible position N end , which can be plural, and it is now restricted to nine positions, each of which is defined to be 39, 42, 49, 55, 58, 61, 65, 75, and 81. 
   First, various parameters needed for detecting the blind rate are reset in step S 101 . Here, the parameters include a last bit&#39;s possible position N end , a minimum value S min  of path selection values, and a last detection position N detected     —     end . The last bit&#39;s possible position N end  and the last detection position N detected     —     end  are reset to be 1, and the minimum value S min  of the path selection values is reset to be a path selection threshold value TH path-selection  that is previously set as a predetermined value. 
   Next, Viterbi decoding is performed, and an accurate trellis path is terminated in the 0 state at the last bit&#39;s possible position N end  in step S 103 . In this step, the Viterbi decoder performs add, compare, and select operations (i.e., ACS) to generate a maximum path metric value a max , a minimum path metric value a min  at the last bit&#39;s possible position N end , and a path metric value a 0  in the 0 state. 
   Next, a path selection value S(N end ) at the last bit&#39;s possible position N end  is found by Equation 1 in step S 105 . 
   
     
       
         
           
             
               
                 
                   S 
                   ⁡ 
                   
                     ( 
                     
                       N 
                       end 
                     
                     ) 
                   
                 
                 = 
                 
                   10 
                   ⁢ 
                   
                     log 
                     ⁡ 
                     
                       ( 
                       
                         
                           
                             
                               a 
                               max 
                             
                             ⁡ 
                             
                               ( 
                               
                                 N 
                                 end 
                               
                               ) 
                             
                           
                           - 
                           
                             
                               a 
                               0 
                             
                             ⁡ 
                             
                               ( 
                               
                                 N 
                                 end 
                               
                               ) 
                             
                           
                         
                         
                           
                             
                               a 
                               max 
                             
                             ⁡ 
                             
                               ( 
                               
                                 N 
                                 end 
                               
                               ) 
                             
                           
                           - 
                           
                             
                               a 
                               min 
                             
                             ⁡ 
                             
                               ( 
                               
                                 N 
                                 end 
                               
                               ) 
                             
                           
                         
                       
                       ) 
                     
                   
                 
               
             
             
               
                 Equation 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 1 
               
             
           
         
       
     
   
   Next, in order to remove the generation of a detection error, it is determined whether the path selection value S(N end ) at the last bit&#39;s possible position N end  is equal to or less than the path selection threshold value TH path-selection  in step S 107 . That is, according to the path selection threshold value TH path-selection , it is determined whether the trellis path connected to the 0 state is to be traced back to the last bit&#39;s possible position N end . 
   If the path selection value S(N end ) fails to satisfy Equation 1, that is, when the path selection value S(N end ) is greater than the path selection threshold value TH path-selection , it is determined whether the last bit&#39;s possible position N end  is a maximum value in step S 119 . When the last bit&#39;s possible position N end  is not the maximum value, the last bit&#39;s possible position N end  is increased by 1 in step S 121 , and the steps S 103 , S 105 , S 107 , and S 119  are repeated so that the last bit&#39;s possible position N end  may be the maximum value, that is, 81. Accordingly, when the last bit&#39;s possible position N end  is the maximum value, the maximum value is output to the last detection position N detected     —     end  in step S 123 . 
   When the path selection value S(N end ) satisfies Equation 1, that is, when the path selection value S(N end ) is less than or equal to the path selection threshold value TH path-selection , its path is traced back from the last bit&#39;s possible position N end  so as to restore frame data in step S 109 . 
   Next, the CRC parity is calculated from the restored data in step S 111 , and a CRC check is performed in step S 113 . 
   If a CRC error occurs in the CRC check step S 113 , the step S 119  is executed, and if no CRC error occurs, it is determined in step S 115  whether the path selection value S(N end ) at the last bit&#39;s possible position N end  is less than the minimum value S min  of the path selection values reset in the reset step S 101 . 
   In this instance, when the path selection value S(N end ) is equal to or greater than the minimum value S min  of the path selection values, the step S 119  is executed, and if the path selection value S(N end ) is less than the minimum value S min  of the path selection values, the path selection value S(N end ) of the last bit&#39;s possible position N end  is stored as the minimum value S min  of the path selection values, the last bit&#39;s possible position N end  is stored as the last detection position N detected     —     end  in step S 117 , and the step S 119  is executed. 
   As described, the conventional blind rate detection algorithm uses a logarithmic function as shown in the previous step S 105 , and since it is very complicated to implement the logarithmic function in hardware, the hardware requires an unnecessarily large amount of storage. 
   Further, when the CRC check is passed in the previous step S 113 , the path selection value S(N end ) of the last bit&#39;s possible position N end  is routinely compared to the minimum value S min  of the path selection values, and hence, the last detection position N detected     —     end  cannot be accurately found under a very bad channel environment. 
   SUMMARY OF THE INVENTION 
   It is an object of the present invention to provide a blind rate detection method and device in an asynchronous mobile communication system for easy hardware implementation, and for outputting reliable results under a bad channel environment. 
   In one aspect of the present invention, a blind rate detection method in an asynchronous mobile communication system comprises: a) restoring data when a path selection value at a last bit&#39;s possible position of a reset last bit satisfies a predetermined path selection condition; b) determining whether a symbol error rate (SER) of the restored data satisfies a predetermined SER condition when no error occurs in a cyclic redundancy code (CRC) of the restored data; c) determining whether it is needed to update a minimum value of path selection values when it is determined that the SER satisfies the predetermined SER condition; d) setting a path selection value of the last bit&#39;s possible position as the minimum value of the path selection values and setting the last bit&#39;s possible position as a last detection position when it is determined that it is needed to update the minimum value of the path selection values; and e) repeating the steps of a) to d) until the last bit&#39;s possible position reaches a predetermined maximum value, and outputting the last detection position when the last bit&#39;s possible position becomes the predetermined maximum value. 
   The step a) comprises: 1) calculating a branch metric value up to the reset last bit&#39;s possible position, performing add, compare and select (ACS) operation on the calculated metric value, and generating metric data; 2) using the generated metric data to find a path selection value at the last bit&#39;s possible position; and 3) performing a trace-back from the last bit&#39;s possible position to restore data when the found path selection value satisfies the predetermined path selection condition. 
   The step b) comprises: 1) calculating a parity of the CRC from the restored data; 2) using the calculated parity to determine whether a CRC error occurs in the restored data; 3) calculating the data&#39;s SER when it is determined that no CRC error occurs in the restored data; and 4) determining whether the calculated SER satisfies the predetermined SER condition. 
   The step e) comprises: 1) determining whether the last bit&#39;s possible position is the predetermined maximum value; 2) increasing the last bit&#39;s possible position by a predetermined value and repeating the steps of a) to d) when the last bit&#39;s possible position is not the predetermined maximum value; and 3) setting the last bit&#39;s possible position as the last detection position and outputting it when the last bit&#39;s possible position is the predetermined maximum value. 
   In another aspect of the present invention, a blind rate detector in an asynchronous mobile communication system comprises: an add-compare-select (ACS) unit for calculating a branch metric value from input data, performing an ACS operation on the calculated metric value and a path metric value, and generating metric data; a trace-back unit for using the data generated by the ACS unit to trace back to a predetermined length and output relation data; a cyclic redundancy code (CRC) checker for performing a CRC check on the data output from the trace-back unit, and outputting results; a symbol error rate (SER) calculator for calculating the SER of the data output by the trace-back unit; and a controller for controlling the ACS unit, the trace-back unit, the CRC checker, and the SER calculator to determine the blind rate of the input data, and comparing a path selection value at the last bit&#39;s possible position and the SER to a predetermined condition and updating the path selection value&#39;s minimum value and its corresponding last bit&#39;s possible position until the last bit&#39;s possible position reaches a predetermined maximum value. 

   
     BRIEF DESCRIPTION OF THE DRAWINGS 
     The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate an embodiment of the invention, and, together with the description, serve to explain the principles of the invention: 
       FIG. 1  shows a conventional flowchart of a blind rate detection method of an asynchronous mobile communication system; 
       FIG. 2  shows a data structure having a variable length; 
       FIG. 3  shows a block diagram of a blind rate detector of an asynchronous mobile communication system according to a preferred embodiment of the present invention; and 
       FIG. 4  shows a flowchart of a blind rate detection method of an asynchronous mobile communication system according to the preferred embodiment of the present invention. 
   

   DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
   In the following detailed description, only the preferred embodiment of the invention has been shown and described, simply by way of illustration of the best mode contemplated by the inventor(s) of carrying out the invention. As will be realized, the invention is capable of modification in various obvious respects, all without departing from the invention. Accordingly, the drawings and description are to be regarded as illustrative in nature, and not restrictive. 
     FIG. 3  shows a block diagram of a blind rate detector of an asynchronous mobile communication system according to a preferred embodiment of the present invention. 
   As shown, the blind rate detector comprises: an add-compare-select (ACS) unit  100 ; a trace-back unit  200 ; a CRC checker  300 ; a symbol error rate (SER) calculator  400 ; and a controller  500 . 
   The ACS unit  100  calculates a branch metric value from the variable data stream transmitted from the transmitter, performs an ACS process on the calculated branch metric value and a path metric value, and outputs metric data. The metric data include a maximum path metric value a max , a minimum path metric value a min , and a path metric value a 0  in the 0 state. 
   The trace-back unit  200  uses the data output from the ACS unit  100  to trace them back to a predetermined length, and outputs data. 
   The CRC checker  300  performs a CRC check on the data output from the trace-back unit  200 , and outputs checking results. 
   The SER calculator  400  calculates the SER of the data output from the trace-back unit  200 , and outputs results. 
   The controller  500  controls the ACS unit  100 , the trace-back unit  200 , the CRC checker  300 , and the SER calculator  400  to determine the blind rate of the variable data transmitted from the transmitter. 
   Referring to  FIG. 4 , a blind rate detection method of an asynchronous mobile communication system according to the preferred embodiment of the present invention will now be described in detail. 
   First, the controller  500  resets various parameters needed for detecting the blind rate in step S 201 . Here, the parameters include: a last bit&#39;s possible position N end  ; a minimum value S min  of path selection values; and a last detection position N detected     —     end . The last bit&#39;s possible position N end  and the last detection position N detected     —     end  are reset to be 1, and the minimum value S min  of the path selection values is reset to be a path selection threshold value TH path-selection  that is previously set as a predetermined value. 
   Next, the ACS unit  100  performs Viterbi decoding by control of the controller  500  so that an accurate trellis path may be terminated in the 0 state at the last bit&#39;s possible position N end  in step S 203 . In this step, the ACS unit  100  calculates branch metric values of the input data, and performs add, compare, and select operations (i.e., ACS) on the calculated metric value to generate a maximum path metric value a max , a minimum path metric value a min  at the last bit&#39;s possible position N end , and a path metric value a 0  in the 0 state. 
   Next, the controller  500  uses the parameters generated by the ACS unit  100 , that is, the maximum path metric value a max , the minimum path metric value a min  at the last bit&#39;s possible position N end , and the path metric value a 0  in the 0 state, to find a path selection value S(N end ) at the last bit&#39;s possible position N end  by Equation 2 in step S 205 . 
   
     
       
         
           
             
               
                 
                   S 
                   ⁡ 
                   
                     ( 
                     
                       N 
                       end 
                     
                     ) 
                   
                 
                 = 
                 
                   
                     
                       
                         a 
                         
                           0 
                           ⁢ 
                           
                               
                           
                         
                       
                       ⁡ 
                       
                         ( 
                         
                           N 
                           end 
                         
                         ) 
                       
                     
                     - 
                     
                       
                         a 
                         min 
                       
                       ⁡ 
                       
                         ( 
                         
                           N 
                           end 
                         
                         ) 
                       
                     
                   
                   
                     
                       
                         a 
                         max 
                       
                       ⁡ 
                       
                         ( 
                         
                           N 
                           end 
                         
                         ) 
                       
                     
                     - 
                     
                       
                         a 
                         min 
                       
                       ⁡ 
                       
                         ( 
                         
                           N 
                           end 
                         
                         ) 
                       
                     
                   
                 
               
             
             
               
                 Equation 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 2 
               
             
           
         
       
     
   
   By finding the path selection value S(N end ) at the last bit&#39;s possible position N end  by Equation 2 and not by a conventional logarithmic function, the hardware is implemented using adders and inverters, thereby reducing hardware complexity. 
   Next, in order to remove the generation of a detection error, the controller  500  determines whether the path selection value S(N end ) at the last bit&#39;s possible position N end  is equal to or less than the path selection threshold value TH path-selection  in step S 207 . That is, according to the path selection threshold value TH path-selection , it is determined whether the trellis path connected to the 0 state is to be traced back to the last bit&#39;s possible position N end . 
   If the path selection value S(N end ) fails to satisfy Equation 2, that is, when the path selection value S(N end ) is greater than the path selection threshold value TH path-selection  the controller  500  determines whether the last bit&#39;s possible position N end  is a maximum value in step S 223 , and when the last bit&#39;s possible position N end  is not the maximum value, the controller  500  increases the last bit&#39;s possible position N end  by 1 in step S 225 , and repeats the steps S 203 , S 205 , S 207 , and S 223  so that the last bit&#39;s possible position N end  may be the maximum value. Accordingly, when the last bit&#39;s possible position N end  is the maximum value, the controller  500  outputs the maximum value to the last detection position N detected     —     end  in step S 227 , and terminates the blind rate detection process. In this instance, in the step S 225 , the last bit&#39;s possible position N end  is increased by 1, but the technical scope of the present invention is not restricted to this, and by setting gaps of the last bit&#39;s possible position its increase ranges may be varied. 
   When the path selection value S(N end ) satisfies Equation 2 in the step S 207 , that is, when the path selection value S(N end ) is less than or equal to the path selection threshold value TH path-selection , the controller  500  controls the trace-back unit  200  so that the path may be traced back from the last bit&#39;s possible position N end , in order to restore frame data in step S 209 . 
   Next, the controller  500  controls the CRC checker  300  to calculate the CRC parity from the data restored by the trace-back unit  200  in step S 211 , and performs a CRC check in step S 213 . 
   If a CRC error occurs in the CRC check step S 213 , the controller  500  executes the step S 223 , and if no CRC error occurs, the controller  500  controls the SER calculator  400  to calculate the SER of the restored data in step S 215 . 
   After this, the controller  500  determines whether the SER calculated in step S 215  is less than or equal to the SER&#39;s threshold value TH SER  in step S 217 , and if the SER is greater than the SER&#39;s threshold value TH SER , that is, when the radio channel environment is very bad and is not reliable, the controller  500  executes the step S 223 . 
   However, if the SER is less than or equal to the SER&#39;s threshold value TH SER , that is, when the radio channel environment is good and reliable, the controller  500  determines in step S 219  whether the path selection value S(N end ) at the last bit&#39;s possible position N end  is less than the minimum value S min  of the path selection values reset in the reset step S 201 . 
   In this instance, when the path selection value S(N end ) is equal to or greater than the minimum value S min , of the path selection values, the controller  500  executes the step S 119 , and if the path selection value S(N end ) is less than the minimum value S min  of the path selection values, the controller stores the path selection value S(N end ) of the last bit&#39;s possible position N end  as the minimum value S min  of the path selection values, stores the last bit&#39;s possible position N end  as the last detection position N detected     —     end  in step S 221 , and executes the step S 223 . 
   Since the hardware for finding the path selection value S(N end ) at the last bit&#39;s possible position N end  can be implemented by use of adders and inverters according to the present invention, its complexity is greatly reduced. 
   Further, by performing a CRC check and then comparing SERs, the present invention differently processes the case when the radio channel environment is bad and unreliable and the other case when the radio channel environment is good and reliable, thereby greatly increasing reliability. 
   While this invention has been described in connection with what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Technology Category: h