DocumentCode
811061
Title
A new computationally efficient discrete bit-loading algorithm for DMT applications
Author
Papandreou, Nikolaos ; Antonakopoulos, Theodore
Author_Institution
Dept. of Electr. Eng. & Comput. Technol., Univ. of Patras, Rio-Patras, Greece
Volume
53
Issue
5
fYear
2005
fDate
5/1/2005 12:00:00 AM
Firstpage
785
Lastpage
789
Abstract
This letter presents a new bit-loading algorithm for discrete multitone systems that converges faster to the same bit allocation as the optimal discrete bit-filling and bit-removal methods. The algorithm exploits the differences between the subchannel gain-to-noise ratios in order to determine an initial bit allocation and then performs a multiple-bits loading procedure for achieving the requested target rate. Numerical results using asymmetric digital subscriber test loops demonstrate the computational efficiency of the proposed algorithm.
Keywords
digital subscriber lines; greedy algorithms; optimisation; telecommunication channels; DMT application; asymmetric digital subscriber test loop; bit allocation; bit-removal method; computationally efficient discrete bit-loading algorithm; discrete multitone system; multiple-bits loading procedure; optimal discrete bit-filling; subchannel gain-to-noise ratio; Bit error rate; Bit rate; Computational efficiency; Constraint optimization; DSL; Digital modulation; Modems; OFDM modulation; Quadrature amplitude modulation; Testing; Bit loading; digital subscriber line (DSL); discrete multitone (DMT); multicarrier communications;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2005.847141
Filename
1431122
Link To Document