Abstract:
An apparatus for cooperative multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) is provided. The apparatus uses a new carrier assignment scheme (CAS) called generalized interleaved CAS, along with non-data-aided timing synchronization. With the generalized interleaved CAS, random OFDM signals are formed into patterns similar to unequal period synchronization patterns (UPSPs), and a corresponding non-data-aided timing synchronization scheme is set. With the help of majority vote refinement (MVR), the present invention achieves better timing synchronization and enhances the quality of signal demodulation.

Description:
TECHNICAL FIELD OF THE INVENTION 
       [0001]    The present invention relates to orthogonal frequency-division multiplexing (OFDM); more particularly, relates to using a generalized interleaved carrier assignment scheme (CAS) for non-data-aided timing synchronization in a cooperative multiple-input multiple-output (MIMO) OFDM system. 
       DESCRIPTION OF THE RELATED ARTS 
       [0002]    Orthogonal frequency-division multiplexing (OFDM) is widely used for its high spectrum efficiency and robustness against frequency-selective fading channels. On the other hand, multiple-input multiple-output (MIMO) can effectively enhance performance and data throughput. MIMO can be further combined with OFDM to obtain ‘MIMO OFDM’, where the qualities of synchronization and channel estimation have critical influence on maintaining the orthogonality among OFDM carriers and on demodulating signals. However, most algorithms of synchronization and channel estimation are hard to be directly applied to MIMO OFDM systems. Besides, synchronization is closely related to channel estimation while it is still hard to combine synchronization and channel estimation. 
         [0003]    For a cooperative MIMO OFDM system, a plurality of communication devices are allocated at different places so that their signals arrive at a receiver on different timing. Thus, timing synchronization is more challenging and difficult in cooperative MIMO systems than in conventional MIMO systems. Up to now. Some training sequence designs are revealed for different timing synchronization methods. Among these data-aided methods, unequal period synchronization patterns (UPSPs) are provided as training sequences for the cooperating transmitters to improve timing synchronization performance. Although the performance is improved, the aiding data used result in increased cost and loss of data throughput. 
         [0004]    In  FIG. 4A  to  FIG. 4C , traditional CASs that are used to generate random OFDM data symbols include subband CAS, interleaved CAS, and generalized CAS are illustrated. For example, consider we have 24 OFDM subcarriers (N=24) and 2 cooperating transmitters (N T =2). In  FIG. 4A , disjoint sets of subcarriers  41 , 42  are assigned to different transmitters by using subband CAS. In  FIG. 4B , subcarriers  41 , 42  are assigned to different transmitters by using interleaved CAS with an equal space d (e.g., d=4 in this figure). Due to the interleaved CAS, the resultant random OFDM data symbols have the same cycle. In  FIG. 4C , subcarriers  41 , 42  can be assigned to any transmitter by using the generalized CAS for providing the best flexibility. 
       SUMMARY OF THE INVENTION 
       [0005]    The main purpose of the present invention is to use a generalized interleaved CAS for cooperative MIMO OFDM systems to process non-data-aided timing synchronization. 
         [0006]    Another purpose of the present invention is to provide a generalized interleaved CAS for generating random OFDM signals having patterns similar to unequal period synchronization patterns (UPSP-like); and to obtain a timing synchronization scheme for non-data-aided (blind) timing synchronization in cooperative MIMO OFDM systems. 
         [0007]    Another purpose of the present invention is to use any number of random OFDM signals to continuously process timing synchronization for effectively enhancing quality and efficiency of the receiver on receiving signals. 
         [0008]    To achieve the above purposes, the present invention is an apparatus of cooperative MIMO OFDM using non-data-aided timing synchronization, comprising at least two cooperating transmitters, where each transmitter is assigned with subcarriers based on the generalized interleaved CAS; there is an equal space between every neighboring two subcarriers; each transmitter has a unique equal space between the neighboring subcarriers; each transmitter forms different signal cycle by using inverse Fourier transform to transform the frequency-domain data to random time-domain OFDM signals having patterns similar to unequal period synchronization patterns (UPSP-like); majority vote refinement (MVR) is processed to a plurality of timing synchronization points estimated by a receiver of the transmitters; and any number of random OFDM signals can be used to continuously process timing synchronization. Accordingly, a novel apparatus of cooperative MIMO OFDM using non-data-aided timing synchronization is obtained. 
     
    
     
       BRIEF DESCRIPTIONS OF THE DRAWINGS 
         [0009]    The present invention will be better understood from the following detailed description of the preferred embodiment according to the present invention, taken in conjunction with the accompanying drawings, in which 
           [0010]      FIG. 1  is the view showing the structure of the generalized interleaved CAS; 
           [0011]      FIG. 2  is the view showing the signal curves of the UPSP-like random OFDM signals; 
           [0012]      FIG. 3  is the view showing the performance of the timing synchronization; and 
           [0013]      FIG. 4A  to  FIG. 4C  are the views of the prior arts. 
       
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENT 
       [0014]    The following description of the preferred embodiment is provided to understand the features and the structures of the present invention. 
         [0015]    Please refer to  FIG. 1  and  FIG. 2  which are a view showing a structure of generalized interleaved CAS in the frequency domain; and a view showing signal curves of the corresponding UPSP-like random OFDM signals in the time domain. As shown in the figures, the present invention is an apparatus of cooperative MIMO OFDM using non-data-aided timing synchronization, where a novel generalized interleaved CAS is provided for non-data-aided timing synchronization in cooperative MIMO OFDM systems. At least two transmitters are used, where subcarriers are assigned to each of the transmitters in an interleaved manner with a unique space between every neighboring two of the subcarriers. Each of the transmitters generates different signal cycle by transforming the frequency-domain data into the time domain via inverse Fourier transform, and the resultant random OFDM signals have patterns similar to unequal period synchronization patterns (UPSP-like). Thus, UPSP-like random OFDM signals are generated to enable non-data-aided timing synchronization. Then, a receiver of the transmitters processes majority vote refinement (MVR) to a plurality of timing synchronization points for a better result. 
         [0016]    For example, consider two cooperating transmitters, the subcarriers  11 , 12  are assigned to the transmitters with spaces d 1  and d 2 , respectively, in the system bandwidth between every two neighboring subcarriers  11 , 12  for generating a repeating structure in time domain. In  FIG. 1  and  FIG. 2 , carriers having equal spaces d 1 =6 and d 2 =4 are assigned to generate repeating structures in time domain. Therein, in general, d m  is a factor of N, i.e. d m |N; and, an N-point time-domain OFDM signal completely comprises d m  repetitive parts (with only known phase differences). 
         [0017]    For further demonstrating the generalized interleaved CAS used in the present invention, the above two transmitters (shown in  FIG. 1 ) are taken as an example. The carriers are assigned and expressed as follows 
         [0000]      Ω 1   ={k   1   d   1   +r   1   : ∀k   1 ε         ∪{0}},
 
         [0000]      Ω 2   ={k   2   +r   2   : ∀k   2 ε         ∪{0}},
 
         [0000]        d   1   ,d   2 ε         0 ≦r   1   d   1 ,0 ≦r   2   &lt;d   2 ,
 
         [0018]    Therein, Ω 1  and Ω 2  are two sets indicating the subcarriers assigned to the first transmitter and the second transmitter, respectively; and is the set of natural numbers. The present invention further comprises the following property: 
         [0000]      ∀ k   1   ,k   2 ε         ∪{0 },∃d   1   ,d   2 ε         0 ≦r   1   &lt;d   1 ,0 ≦r   2   &lt;d   2 ,
       such that k 1 d 1 +r 1 ≠k 2 d 2 +r 2          
 
         [0000]                  gcd ( d   1   ,d   2 ) || ( r   2   −r   1 ) 
         [0020]    Therein, a||b means that ‘a’ is not a factor of ‘b’; and, gcd(d 1 ,d 2 ) is the greatest common divisor of d 1  and d 2 . For example, in  FIG. 1 , subcarriers are assigned as (d 1 ,r 1 )=(6,0) and (d 2 ,r 2 )=(4,3); and, Ω 1 ∩Q 2 =Ø, which means the intersection of Ω 1  and Ω 2  is a null set. 
         [0021]    The subcarriers are assigned to a plurality of transmitters to be expressed as Ω m ={k m d m +r m : ∀k m ε         ∪{0}}, d m ε         0≦r m &lt;d m  with the following limitation: 
         [0000]        gcd ( d   m   ,d   m′ )|( r   m′   −r   m ),∀ m≠m′,  
 
         [0022]    Some possible solutions are shown in Table 1. When three transmitters are used, a first transmitter has an equal space of 6 for subcarriers; a second transmitter, 9; and a third transmitter, 15. When four transmitters are used, a first transmitter has an equal space of 8 for subcarriers; a second transmitter, 12; a third transmitter, 18; and a fourth transmitter, 20. 
         [0000]    
       
         
               
               
               
             
           
               
                   
                 TABLE 1 
               
               
                   
                   
               
             
             
               
                   
                 N T  = 2 
                 (d 1 , r 1 ) = (6, 0), (d 2 , r 2 ) = (4, 3) 
               
               
                   
                 N T  = 3 
                 (d 1 , r 1 ) = (6, 0), (d 2 , r 2 ) = (9, 2), (d 3 , r 3 ) = (15, 4) 
               
               
                   
                 N T  = 4 
                 (d 1 , r 1 ) = (8, 0), (d 2 , r 2 ) = (12, 1), (d 3 , r 3 ) = (18, 3), 
               
               
                   
                   
                 (d 4 , r 4 ) = (20, 2) 
               
               
                   
                   
               
             
          
         
       
     
         [0023]    After generating UPSP-like random OFDM signals, the following algorithm is used for non-data-aided timing synchronization: 
         [0000]    
       
         
           
             
               
                 
                   τ 
                   ^ 
                 
                 m 
               
               = 
               
                 argmax 
                  
                 
                   { 
                   
                      
                     
                       
                         φ 
                         m 
                       
                        
                       
                         ( 
                         n 
                         ) 
                       
                     
                      
                   
                   } 
                 
               
             
             , 
             
               
 
             
              
             
               
                 
                   φ 
                   m 
                 
                  
                 
                   ( 
                   n 
                   ) 
                 
               
               = 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     
                       - 
                       G 
                     
                   
                   
                     N 
                     - 
                     
                       N 
                       / 
                       
                         d 
                         m 
                       
                     
                     - 
                     1 
                   
                 
                  
                 
                   
                     r 
                      
                     
                       ( 
                       
                         n 
                         + 
                         i 
                       
                       ) 
                     
                   
                   · 
                   
                     
                       r 
                       * 
                     
                      
                     
                       ( 
                       
                         n 
                         + 
                         i 
                         + 
                         
                           N 
                           / 
                           
                             d 
                             m 
                           
                         
                       
                       ) 
                     
                   
                 
               
             
             , 
             
               
 
             
              
             
               m 
               ∈ 
               
                 { 
                 
                   1 
                   , 
                   2 
                   , 
                   
                     … 
                      
                     
                         
                     
                      
                     
                       N 
                       T 
                     
                   
                 
                 } 
               
             
             , 
           
         
       
     
         [0024]    Therein, G means the length of cyclic prefix (CP) in each random OFDM signal. 
         [0025]    The present invention can use any number of random OFDM signals to continuously process timing synchronization for improving accuracy of estimation with coordination of multiple estimations. It is supposed that M estimations in a continuous time are obtained through the above timing synchronization, which is expressed as 
         [0000]    
       
         
           
             
               { 
               
                 
                   
                     τ 
                     ^ 
                   
                   m 
                   1 
                 
                 , 
                 
                   
                     τ 
                     ^ 
                   
                   m 
                   2 
                 
                 , 
                 … 
                  
                 
                     
                 
                 , 
                 
                   
                     τ 
                     ^ 
                   
                   m 
                   M 
                 
               
               } 
             
             . 
           
         
       
     
         [0000]    The accurate time is confirmed in the set 
         [0000]    
       
         
           
             { 
             
               
                 
                   τ 
                   ^ 
                 
                 m 
                 1 
               
               , 
               
                 
                   
                     τ 
                     ^ 
                   
                   m 
                   2 
                 
                 - 
                 
                   ( 
                   
                     N 
                     + 
                     G 
                   
                   ) 
                 
               
               , 
               … 
                
               
                   
               
               , 
               
                 
                   
                     τ 
                     ^ 
                   
                   m 
                   M 
                 
                 - 
                 
                   
                     ( 
                     
                       M 
                       - 
                       1 
                     
                     ) 
                   
                    
                   
                     ( 
                     
                       N 
                       + 
                       G 
                     
                     ) 
                   
                 
               
             
             } 
           
         
       
     
         [0000]    according to MVR for obtaining refined time estimation to effectively improve quality and performance of a receiver on receiving signals. 
         [0026]    Please refer to  FIG. 3 , which is a view showing performance of timing synchronization. As shown in the figure, a cooperative MIMO system having two transmitters (N T =2) are used. Cooperative terminals transmit random OFDM signals using the generalized interleaved CAS according to the present invention. Examples of (d 1 ,r 1 )=(6,0) and (d 2 ,r 2 )=(4,3) use sizes of FFT/IFFT; and lengths of CPs are N=252 and G=63. A UPSP-based timing synchronization system is used for comparison with L ss =252, L sp   1 =42 and L sp   2 =63 based on L sp =63, where Z sp  is a Zadoff-Chu sequence having a length of 63. The sequence is further attached with G-point CPs. Therein, the random OFDM signals using the generalized interleaved CAS according to the present invention share the same repeated structure as the UPSPs. Besides, a typical 6-path Rayleigh fading channel with an exponentially decay power profile of {0.8111, 0.1532, 0.0289, 0.0055, 0.0010, 0.0002} is used for computer simulations. The propagation delay difference between two cooperating terminals is set to 10 sampling periods; and, a carrier frequency offset (CFO) is randomly generated in the interval from −0.5 to +0.5 OFDM subcarrier spacing for each of the 10 4  times of Monte Carlo simulation. 
         [0027]    In  FIG. 3 , the timing synchronization performance of the present invention is evaluated in terms of the probability of Δ τ ε[−3, 0], where Δ τ  means the residual time bias normalized to the sampling period after timing synchronization and Δ τ =0 means perfect timing synchronization. The simulation curves  21 , 22 , 23  of M=10, M=15 and M=20 are compared with a UPSP-based simulation curve  31 , which shows that the present invention obtains a better performance on using non-data-aided timing synchronization coordinated with MVR and especially in an environment having a low signal-to-noise ratio (SNR). It shows that the present invention can process timing synchronization at any time and, with the protection provided by the CPs, the requirement of an OFDM-based system are met. 
         [0028]    Thus, the present invention provides a structure of non-data-aided timing synchronization based on generalized interleaved CAS for cooperative MIMO OFDM systems. The CAS is novel by using generalized interleaved carrier assignment, where each transmitter is assigned with subcarriers in an equispaced way and each transmitter has a unique space between subcarriers. By transforming the frequency-domain generalized interleaved CAS into time domain through inverse Fourier transform, UPSP-like random OFDM signals are obtained. In another word, the non-data-aided timing synchronization structure can employ the UPSP-like random OFDM symbols without transmitting any training sequences. Then, a plurality of timing synchronization points estimated by a receiver is processed through MVR for a better performance than traditional UPSP methods. Besides, the non-data-aided timing synchronization provided by the present invention uses any number of random OFDM signals to continuously process timing synchronization for effectively enhancing quality and efficiency of the receiver on synchronizing signals. 
         [0029]    To sum up, the present invention is an apparatus of cooperative MIMO OFDM using non-data-aided timing synchronization, where a generalized interleaved CAS is used to generate UPSP-like random OFDM signals and a blind timing synchronization scheme is set in non-data-aided timing synchronization for obtaining better performance on transferring and receiving the signals. 
         [0030]    The preferred embodiment herein disclosed is not intended to unnecessarily limit the scope of the invention. Therefore, simple modifications or variations belonging to the equivalent of the scope of the claims and the instructions disclosed herein for a patent are all within the scope of the present invention.