DocumentCode
3351900
Title
PEG Algorithm Based Interleavers Design for IDMA System
Author
Bie, Zhisong ; Wu, Weiling
Author_Institution
Beijing Univ. of Posts & Telecommun., Beijing
fYear
2007
fDate
14-16 March 2007
Firstpage
480
Lastpage
483
Abstract
Based on factor graph representation of IDMA (interleave division multiple-access) systems, an interleaver design criterion is proposed. The progressive edge growth (PEG) algorithm proposed for LDPC codes is adapted to multi-user interleavers pattern design. Simulation results show that the designed interleavers perform over random interleavers especially when the number of users is relative large.
Keywords
graph theory; interleaved codes; multi-access systems; parity check codes; IDMA system; LDPC codes; factor graph representation; interleave division multiple-access systems; interleaver design; multiuser interleavers pattern design; progressive edge growth algorithm; random interleavers; Algorithm design and analysis; Base stations; Code division multiplexing; Design engineering; Design methodology; Detection algorithms; Iterative algorithms; Parity check codes; Random number generation; System testing; Factor graph; IDMA; PEG algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Sciences and Systems, 2007. CISS '07. 41st Annual Conference on
Conference_Location
Baltimore, MD
Print_ISBN
1-4244-1063-3
Electronic_ISBN
1-4244-1037-1
Type
conf
DOI
10.1109/CISS.2007.4298353
Filename
4298353
Link To Document