论文部分内容阅读
针对电力线通信中的窄带干扰(NBI,Narrowband Interference),提出了一种基于循环前缀的递推最小二乘(CP-RLS,Cyclic Prefix-recursive Least Square)算法,并将该算法与干扰抑制-正交频分复用(IS-OFDM,Interference Suppressing-orthogonal Frequency Division Multiplexing)技术、循环前缀-分块最小均方算法(CP-BLMS,Cyclic Prefix-block Least Mean Square)以及线性快速分块最小均方(LFBLMS,Linear Fast Block Least Mean Square)算法进行了比较。仿真结果表明,在NBI功率较大时,CP-RLS算法的BER性能与CP-BLMS、LFBLMS算法相比提高了一个数量级,且随着NBI功率进一步增加,其BER性能几乎没有变差;CP-RLS算法更适合信道条件复杂多变的电力线通信。
In order to overcome the narrowband interference (NBI) in power line communication, a Cyclic Prefix-Recursive Least Square (CPR) algorithm based on cyclic prefix is proposed. Interference Suppression-orthogonal Frequency Division Multiplexing (IS-OFDM), Cyclic Prefix-block Least Mean Square (CP-BLMS), and Least Mean Square (LFBLMS, Linear Fast Block Least Mean Square) algorithm. The simulation results show that the BER performance of CP-RLS algorithm increases by one order of magnitude compared with that of CP-BLMS and LFBLMS algorithm when the power of NBI is high, and the BER performance of CP-RLS algorithm hardly deteriorates with the increase of NBI power. CP- RLS algorithm is more suitable for complex and changing channel conditions of power line communication.