An efficient bit-loading algorithm for DMT applications

New bit loading algorithms for DMT systems based on the greedy approach

“…In Table I we summarize the complexity analysis of our proposals and some of the existing algorithms [3,[5][6][7][8][9]14,16,17]. The following diagrams present the complexity comparison of our systems and the existing algorithms for different data loads and constant R m , N. Figure 5 presents the number of comparisons for a system with N ¼ 256 subcarriers, maximum QAM mode R m ¼ 8 bits per subcarrier and different data loads per DMT symbol.…”

“…We have simulated some important algorithms known in the References [3,[5][6][7][8][9]14,16,17] and our proposals. The algorithms simulated worked on a target data rate mode and we have plotted all of them on Figure 4.…”

“…However, there is a category of loading algorithms that minimize the power or maximize the rate for a fixed error rate assigning to channels an integer number of bits in every step of the algorithm, avoiding the final rounding of the bit distribution [5][6][7][8][9]. These algorithms work based on the so-called greedy approach of the problem i.e.…”

Efficient Multi-User Parallel Greedy Bit-Loading Algorithm with Fairness Control For DMT Systems

“…Many algorithms have been studied in the past for DMT systems such as (Akujuobi, C. M. & Shen, J. 2006), , (Hughes-Hartogs, 1987-1989, (Sonalker & Shively, 1998), , (Tu & Ciofi, 1990), (Leke & Cioffi, 1997) and (Campello, 1999). They are the foundations for the work discussed in this chapter.…”

A Video Transmission System for Severely Degraded Channels

“…Barreto and Furrer [7] use different coding rates as well as different constellation sizes to achieve this goal. Also, Sonalkar and Shively [93] use an additional MC-SS modulated signal where the channel quality is not good enough to support normal QAM constellations.…”