Bit-filling algorithm for fast subcarrier-selecting in ultrasonic through-metal communication
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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2020-11-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020228/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"> <mfrac> <mn>3</mn> <mn>4</mn> </mfrac> </math></inline-formula> subcarriers,greatly reducing the amount of calculation. |
|---|---|
| ISSN: | 1000-436X |