SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Jerkovits Thomas) "

Sökning: WFRF:(Jerkovits Thomas)

  • Resultat 1-2 av 2
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Coskun, Mustafa C., et al. (författare)
  • Efficient error-correcting codes in the short blocklength regime
  • 2019
  • Ingår i: Physical Communication. - : Elsevier BV. - 1874-4907. ; 34, s. 66-79
  • Tidskriftsartikel (refereegranskat)abstract
    • The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applications in wireless communication networks. In this paper, we review some of the most promising code constructions targeting the short block regime, and we compare them with both finite-length performance bounds and classical error-correction coding schemes. The work addresses the use of both binary and high-order modulations over the additive white Gaussian noise channel. We will illustrate how to effectively approach the theoretical bounds with various performance versus decoding complexity tradeoffs.
  •  
2.
  • Jerkovits, Thomas, et al. (författare)
  • Improving the Decoding Threshold of Tailbiting Spatially Coupled LDPC Codes by Energy Shaping
  • 2018
  • Ingår i: IEEE Communications Letters. - 1558-2558 .- 1089-7798. ; 22:4, s. 660-663
  • Tidskriftsartikel (refereegranskat)abstract
    • We show how the iterative decoding threshold of tailbiting spatially coupled (SC) low-density parity-check (LDPC) code ensembles can be improved over the binary input additive white Gaussian noise channel by allowing the use of different transmission energies for the codeword bits. We refer to the proposed approach as energy shaping. We focus on the special case where the transmission energy of a bit is selected among two values, and where a contiguous portion of the codeword is transmitted with the largest one. Given these constraints, an optimal energy boosting policy is derived by means of protograph extrinsic information transfer analysis. We show that the threshold of tailbiting SC-LDPC code ensembles can be made close to that of terminated code ensembles while avoiding the rate loss (due to termination). The analysis is complemented by Monte Carlo simulations, which confirm the viability of the approach.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-2 av 2

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 Stäng

Kopiera och spara länken för att återkomma till aktuell vy