Low-Loading-Delay Parallel Adaptive Loading for Reducing Transmit Power of OFDM System

Ming LEI; Hiroshi HARADA

doi:10.1093/ietfec/e90-a.7.1300

Low-Loading-Delay Parallel Adaptive Loading for Reducing Transmit Power of OFDM System

Ming LEI, Hiroshi HARADA

Full Text Views

0

Cite this

Summary :

The conventional successive adaptive loading algorithm, represented by Hughes-Hartogs algorithm, can be used to reduce the transmit power of orthogonal frequency division multiplexing (OFDM) system. However, two major disadvantages exist for this kind of algorithm: One is the long loading time delay caused by the bit-to-bit loading, i.e., only one bit is loaded in every iteration; the other is that there is no flexibility in freely pre-defining the candidate modulation set before the loading is finished. In order to solve these problems, we propose the low-loading-delay parallel adaptive loading algorithms aiming at reducing the transmit power under the condition that the data throughput and error rate are maintained to target values. Two improvements are achieved by the new algorithm. One is that it divides the successive adaptive loading into several independent small-scale loading (SS-Loading) procedures. "SS-Loading" can be performed in parallel mode. To support this, we propose two subband division methods (successive and sorted subband divisions). The simulation results show that for a large range of subband number (1-128), the loading time delay can be remarkably decreased (especially for the parallel adaptive loading based on sorted subband division, i.e., SRT parallel adaptive loading algorithm) with neglectable power efficiency loss, compared with Hughes-Hartogs algorithm. The second improvement is that the new algorithm allows us to pre-define the candidate modulation set, which provide flexibility for the system design, e.g. we can exclude those rarely used modulation modes. We also reveal that Hughes-Hartogs algorithm is actually a special case of the newly proposed algorithm.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.7 pp.1300-1311

Publication Date: 2007/07/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e90-a.7.1300

Type of Manuscript: Special Section PAPER (Special Section on Multi-dimensional Mobile Information Networks)

Category

Cite this

Copy

Ming LEI, Hiroshi HARADA, "Low-Loading-Delay Parallel Adaptive Loading for Reducing Transmit Power of OFDM System" in IEICE TRANSACTIONS on Fundamentals, vol. E90-A, no. 7, pp. 1300-1311, July 2007, doi: 10.1093/ietfec/e90-a.7.1300.
Abstract: The conventional successive adaptive loading algorithm, represented by Hughes-Hartogs algorithm, can be used to reduce the transmit power of orthogonal frequency division multiplexing (OFDM) system. However, two major disadvantages exist for this kind of algorithm: One is the long loading time delay caused by the bit-to-bit loading, i.e., only one bit is loaded in every iteration; the other is that there is no flexibility in freely pre-defining the candidate modulation set before the loading is finished. In order to solve these problems, we propose the low-loading-delay parallel adaptive loading algorithms aiming at reducing the transmit power under the condition that the data throughput and error rate are maintained to target values. Two improvements are achieved by the new algorithm. One is that it divides the successive adaptive loading into several independent small-scale loading (SS-Loading) procedures. "SS-Loading" can be performed in parallel mode. To support this, we propose two subband division methods (successive and sorted subband divisions). The simulation results show that for a large range of subband number (1-128), the loading time delay can be remarkably decreased (especially for the parallel adaptive loading based on sorted subband division, i.e., SRT parallel adaptive loading algorithm) with neglectable power efficiency loss, compared with Hughes-Hartogs algorithm. The second improvement is that the new algorithm allows us to pre-define the candidate modulation set, which provide flexibility for the system design, e.g. we can exclude those rarely used modulation modes. We also reveal that Hughes-Hartogs algorithm is actually a special case of the newly proposed algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.7.1300/_p

Copy

@ARTICLE{e90-a_7_1300,
author={Ming LEI, Hiroshi HARADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Low-Loading-Delay Parallel Adaptive Loading for Reducing Transmit Power of OFDM System},
year={2007},
volume={E90-A},
number={7},
pages={1300-1311},
abstract={The conventional successive adaptive loading algorithm, represented by Hughes-Hartogs algorithm, can be used to reduce the transmit power of orthogonal frequency division multiplexing (OFDM) system. However, two major disadvantages exist for this kind of algorithm: One is the long loading time delay caused by the bit-to-bit loading, i.e., only one bit is loaded in every iteration; the other is that there is no flexibility in freely pre-defining the candidate modulation set before the loading is finished. In order to solve these problems, we propose the low-loading-delay parallel adaptive loading algorithms aiming at reducing the transmit power under the condition that the data throughput and error rate are maintained to target values. Two improvements are achieved by the new algorithm. One is that it divides the successive adaptive loading into several independent small-scale loading (SS-Loading) procedures. "SS-Loading" can be performed in parallel mode. To support this, we propose two subband division methods (successive and sorted subband divisions). The simulation results show that for a large range of subband number (1-128), the loading time delay can be remarkably decreased (especially for the parallel adaptive loading based on sorted subband division, i.e., SRT parallel adaptive loading algorithm) with neglectable power efficiency loss, compared with Hughes-Hartogs algorithm. The second improvement is that the new algorithm allows us to pre-define the candidate modulation set, which provide flexibility for the system design, e.g. we can exclude those rarely used modulation modes. We also reveal that Hughes-Hartogs algorithm is actually a special case of the newly proposed algorithm.},
keywords={},
doi={10.1093/ietfec/e90-a.7.1300},
ISSN={1745-1337},
month={July},}

Copy

TY - JOUR
TI - Low-Loading-Delay Parallel Adaptive Loading for Reducing Transmit Power of OFDM System
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1300
EP - 1311
AU - Ming LEI
AU - Hiroshi HARADA
PY - 2007
DO - 10.1093/ietfec/e90-a.7.1300
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2007
AB - The conventional successive adaptive loading algorithm, represented by Hughes-Hartogs algorithm, can be used to reduce the transmit power of orthogonal frequency division multiplexing (OFDM) system. However, two major disadvantages exist for this kind of algorithm: One is the long loading time delay caused by the bit-to-bit loading, i.e., only one bit is loaded in every iteration; the other is that there is no flexibility in freely pre-defining the candidate modulation set before the loading is finished. In order to solve these problems, we propose the low-loading-delay parallel adaptive loading algorithms aiming at reducing the transmit power under the condition that the data throughput and error rate are maintained to target values. Two improvements are achieved by the new algorithm. One is that it divides the successive adaptive loading into several independent small-scale loading (SS-Loading) procedures. "SS-Loading" can be performed in parallel mode. To support this, we propose two subband division methods (successive and sorted subband divisions). The simulation results show that for a large range of subband number (1-128), the loading time delay can be remarkably decreased (especially for the parallel adaptive loading based on sorted subband division, i.e., SRT parallel adaptive loading algorithm) with neglectable power efficiency loss, compared with Hughes-Hartogs algorithm. The second improvement is that the new algorithm allows us to pre-define the candidate modulation set, which provide flexibility for the system design, e.g. we can exclude those rarely used modulation modes. We also reveal that Hughes-Hartogs algorithm is actually a special case of the newly proposed algorithm.
ER -