SwePub
Sök i LIBRIS databas

  Extended search

id:"swepub:oai:DiVA.org:kth-62605"
 

Search: id:"swepub:oai:DiVA.org:kth-62605" > Unifying Analysis a...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Unifying Analysis and Design of Rate-Compatible Concatenated Codes

Graell i Amat, Alexandre, 1976 (author)
Telecom Bretagne, France,Chalmers tekniska högskola,Chalmers University of Technology
Rasmussen, Lars Kildehöj (author)
KTH,Kommunikationsteori,ACCESS Linnaeus Centre,Kungliga Tekniska Högskolan (KTH),Royal Institute of Technology (KTH)
Brännström, Fredrik, 1974 (author)
Chalmers University of Technology,Chalmers tekniska högskola
 (creator_code:org_t)
2011
2011
English.
In: IEEE Transactions on Communications. - 0090-6778 .- 1558-0857. ; 59:2, s. 343-351
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • An improved concatenated code structure, which generalizes parallel and serially concatenated convolutional codes is presented and investigated. The structure is ideal for designing low-complexity rate-compatible code families with good performance in both the waterfall and error floor regions. As an additional feature, the structure provides a unified analysis and design framework, which includes both parallel and serially concatenated codes as particular cases. We derive design criteria for the generalized class of concatenated convolutional codes based on union bounds for the error probability and extrinsic information transfer (EXIT) charts for the decoding threshold.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)

Keyword

Turbo codes
concatenated codes
rate-compatible codes
union bounds
EXIT chart analysis
puncturing

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view