Journal on Communications ›› 2020, Vol. 41 ›› Issue (11): 30-39.doi: 10.11959/j.issn.1000-436x.2020228

• Papers • Previous Articles     Next Articles

Bit-filling algorithm for fast subcarrier-selecting in ultrasonic through-metal communication

Linsen XU,Wei YANG,Hongxian TIAN,Tao WU   

  1. School of Electronic and Information Engineering,Beijing Jiaotong University,Beijing 100044,China
  • Revised:2020-08-29 Online:2020-11-25 Published:2020-12-19
  • Supported by:
    The National Natural Science Foundation of China(51874299);The National Science and Technology Infrastructure Program of China(2013BAK06B03);The Fundamental Research Funds for the Central Universities(2018YJS004)

Abstract:

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.

Key words: ultrasound, through-metal communication, bit-filling algorithm, OFDM

CLC Number: 

No Suggested Reading articles found!