摘要
针对贪婪比特填充算法复杂度较高的问题,提出了一种用于超声波透金属通信的子载波快速筛选比特填充算法。通过BER近似公式和泰勒公式推导出子载波BER增量的近似表达式,将其作为贪婪比特填充算法中筛选子载波的依据,先筛选子载波再计算其BER,使贪婪算法不需要计算所有子载波的新BER。仿真结果表明,所提算法可达到贪婪比特填充算法的数据速率,节省了约3/4的子载波BER计算,大大降低了计算量。
Aiming at the high complexity of the greedy bit-filling algorithm,a bit-filling algorithm for fast subcarrier-selecting used in ultrasonic through-metal communication was proposed.The approximate expression for the BER increment,which was used as the basis for selecting subcarriers in the greedy bit-filling algorithm,was derived by the BER approximation formula and Taylor formula.The subcarrier was selected first and then its BER was calculated.Therefore,it was unnecessary for the greedy bit-filling algorithm to calculate new BER of all subcarriers.The simulation results show that the proposed algorithm can achieve nearly the same data rate as the greedy bit-filling algorithm and save the BER calculation of about 3/4 subcarriers,greatly reducing the amount of calculation.
作者
许琳森
杨维
田洪现
吴韬
XU Linsen;YANG Wei;TIAN Hongxian;WU Tao(School of Electronic and Information Engineering,Beijing Jiaotong University,Beijing 100044,China)
出处
《通信学报》
EI
CSCD
北大核心
2020年第11期30-39,共10页
Journal on Communications
基金
国家自然科学基金资助项目(No.51874299,No.61671050)
国家科技支撑计划基金资助项目(No.2013BAK06B03)
中央高校基本科研业务费专项资金资助项目(No.2018YJS004)。
