Sökning: id:"swepub:oai:research.chalmers.se:2a462646-173a-46bf-8a5f-089649126e73" >
A novel rate alloca...
A novel rate allocation method for multilevel coded modulation
-
- Beygi, Lotfollah, 1977 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Agrell, Erik, 1965 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Karlsson, Magnus, 1967 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
visa fler...
-
- Makki, Behrooz, 1980 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
visa färre...
-
(creator_code:org_t)
- ISBN 9781424469604
- 2010
- 2010
- Engelska.
-
Ingår i: IEEE International Symposium on Information Theory - Proceedings. - 2157-8095. - 9781424469604 ; , s. 1983-1987
- Relaterad länk:
-
http://publications.... (primary) (free)
-
visa fler...
-
https://research.cha...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We present a new rate allocation scheme for multilevelcoded modulation based on the minimization of the totalblock error rate (BLER). The proposed method uses affine codecomponents and hard decision multistage decoding. Exhaustivesearch for the rate allocation which minimizes the total BLERjustifies the near-optimum performance of the introduced methodin moderate to high SNRs. Compared to previous approaches thisnew rate allocation scheme can improve the performance of thesystem by 1 dB at BLER = 10−6 for 16-QAM with Ungerboeck setpartitioning. Interestingly, our results indicate that the optimumrate allocation is a function of the SNR. Finally, the performanceof some specific codes are evaluated by simulation and unionbounds to verify the theoretical results.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas