Fast adaptive optimal basis search algorithm for PAPR reduction

摘要

In wavelet packet modulation system, wavelet packet basis has a significant impact on the system's performance. To solve the defects of Best basis Selection (BBS) algorithm and Brutal Force Algorithm (BFA), this paper proposed a novel search algorithm for optimal wavelet packet basis. This algorithm decomposes the whole wavelet packet library from top to bottom by its binary branch, use Peak to Average Power Ratio (PAPR) and competitive decision to select optimal basis. Simulation results indicated that: the proposed algorithm was 15%–20% faster than BBS algorithm; 8–15 times faster than BFA algorithm, the selected optimal basis significantly reduces the PAPR without any BER degradation.