Orthogonal Frequency Division Multiplexing (OFDM) signal processing method and system

Orthogonal Frequency Division Multiplexing (OFDM) signal processing method and system

  • CN 101,572,687 B
  • Filed: 06/05/2009
  • Issued: 01/20/2016
  • Est. Priority Date: 06/05/2009
  • Status: Active Grant
First Claim
Patent Images

1. an orthogonal Frequency Division Multiplexing (OFDM) signal processing method, comprises the treatment step of transmitting terminal:

  • Baseband modulation signal after serial to parallel conversion is formed frequency domain orthogonal frequency-division multiplex singal, and described frequency domain orthogonal frequency-division multiplex singal is divided into non-overlapping copies and there are multiple subsequences of formed objects;

    To the zero padding respectively of described multiple subsequence, and carry out inverse discrete Fourier transform, obtain multiple partial sequences of time domain;

    The peak-to-average power ratio expression formula obtained using phase rotation coefficient and described multiple partial sequence weighting carries out genetic operation as the optimization object function of genetic algorithm, and the optimal solution that computing obtains is as optimum angle twiddle factor;

    To described optimum angle twiddle factor and described multiple partial sequence weighting, obtain the time domain orthogonal frequency-division multiplex singal after weighting and send;

    In described genetic operation, introduce TABU search, concrete steps comprise;

    The peak-to-average power ratio expression formula obtained according to phase rotation coefficient and described multiple partial sequence weighting sets up the optimization object function of genetic algorithm, and selects corresponding fitness function, and setting TABU search table;

    The initial value of the phase rotation coefficient preset is selected to carry out binary coding, and initial crossover probability and mutation probability are set, before in the arrangement of the initial solution gone out according to the calculation of initial value of described phase rotation coefficient, how group phase rotation coefficient is recorded in TABU search table;

    Carry out interative computation, in the iteration of every generation, chromosome dyad is exchanged with described crossover probability to mixing into right individuality in solution group at random, and the value of one or more phase rotation coefficient is changed with described mutation probability, in intersection and mutation operation process, all compare with TABU search table, the phase rotation coefficient of having listed in TABU search table no longer processes, and then forms new solution group according to fitness function in conjunction with the solution group of previous generation;

    In an iterative process, if meet one or more exit criteria preset, then iteration ends, and optimal solution is exported as optimum angle twiddle factor;

    In genetic iteration in earlier stage, larger crossover probability and less mutation probability is adopted;

    In the genetic iteration later stage, increase mutation probability, crossover probability and the mutation probability of setting kth time iteration are;

View all claims
    ×
    ×

    Thank you for your feedback

    ×
    ×