Sökning: id:"swepub:oai:research.chalmers.se:1078c34d-590f-4b39-951a-b1c30b2d55b5" >
On the design of ra...
On the design of rate-compatible serially concatenated convolutional codes
-
- Graell i Amat, Alexandre, 1976 (författare)
- Telecom Bretagne, France
-
- Brännström, Fredrik, 1974 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Rasmussen, Lars Kildehöj (författare)
- University of South Australia,Institute for Telecommunications Research
-
(creator_code:org_t)
- 2007
- 2007
- Engelska.
-
Ingår i: European Transactions on Telecommunications. - : Wiley. - 1541-8251 .- 1124-318X .- 2161-3915. ; 18:5, s. 519-527
- Relaterad länk:
-
http://arxiv.org/pdf...
-
visa fler...
-
https://research.cha...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- A powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimising analytical upper bounds on the eff or probability in the error floor region. In this paper, this class of codes is further investigated by combining analytical upper bounds with extrinsic information transfer chart analysis to improve performance in the waterfall region. Following this approach, we construct a family of rate-compatible SCCCs with low complexity and good performance in both the error floor and the waterfall regions over a broad range of code rates. The proposed codes outperform standard SCCCs and have a similar performance as more complex parallel concatenated convolutional codes (PCCCs). The proposed codes perform particularly well for high code rates. Copyright (C) 2007 John Wiley & Sons, Ltd.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
Nyckelord
- TURBO-CODES
- PARITY-CHECK CODES
Publikations- och innehållstyp
- art (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas