2006
DOI: 10.1002/wcm.286
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: SummaryThe performance of a DMT system, which transmits information over channels with varying characteristics through the frequency zones, is improved when the subchannels of the system are loaded with variable data rate. In this study, we meet the bit loading problem of the subcarriers of a DMT system. We propose two new optimumloading algorithms with low computational complexity. These algorithms assign integer number of bits successively until a target bit rate is fulfilled. We compare them with several ex… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2007
2007
2016
2016

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 16 publications
(33 reference statements)
0
3
0
Order By: Relevance
“…., and 256-QAM. Additionally, the BERs of BPSK and M-QAM in AWGN channel for a certain SNR can be calculated from the closed-form expression given in [30] and [31].…”
Section: Applying Simple Bit Loading For Dco-ofdmmentioning
confidence: 99%
“…., and 256-QAM. Additionally, the BERs of BPSK and M-QAM in AWGN channel for a certain SNR can be calculated from the closed-form expression given in [30] and [31].…”
Section: Applying Simple Bit Loading For Dco-ofdmmentioning
confidence: 99%
“…The resulted symbol duration is 33.2 µsec and 512 subcarriers are used to transmit data. Each carrier is loaded with bits adaptively in accordance with the channel signal to noise ratio, using a bit loading algorithm [15]. However, flat energy distribution over the subcarriers is used [16].…”
Section: Physical Layermentioning
confidence: 99%
“…While achieving rate optimality, the family of greedy algorithms is also known to be greedy in terms of computing requirements. Therefore, reduced complexity schemes are either water-filling-based only [ 2 ] or aim at simplifications [ 13 ]. In this paper we propose a novel suboptimal greedy algorithm, whereby the power reallocation is performed in subsets of the subchannels.…”
Section: Introductionmentioning
confidence: 99%