SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Liva Gianluigi) "

Sökning: WFRF:(Liva Gianluigi)

  • Resultat 1-10 av 25
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Ben Yacoub, Emna, et al. (författare)
  • Quaternary Message Passing Decoding of LDPC Codes: Stability Analysis and Error Floor
  • 2021
  • Ingår i: 2021 11th International Symposium on Topics in Coding, ISTC 2021. - 9781665409438
  • Konferensbidrag (refereegranskat)abstract
    • We revisit a coarsely quantized message passing decoding algorithm for low-density parity-check (LDPC) code ensembles, named quaternary message passing (QMP). Particularly, we analyze the performance of unstructured LDPC codes under QMP decoding by means of density evolution. The impact of degree-2 and degree-3 variable nodes on the error floor performance is also discussed. We design a code for QMP that performs within 0.55 dB of the 5G LDPC code at a block error rate of 10−4 .
  •  
2.
  • Coskun, Mustafa Cemil, et al. (författare)
  • Low-Complexity Joint Channel Estimation and List Decoding of Short Codes
  • 2019
  • Ingår i: SCC 2019 - 12th International ITG Conference on Systems, Communications and Coding. - 9783800748624
  • Konferensbidrag (refereegranskat)abstract
    • A pilot-assisted transmission (PAT) scheme is proposed for short blocklengths, where the pilots are used only to derive an initial channel estimate for the list construction step. The final decision of the message is obtained by applying a non-coherent decoding metric to the codewords composing the list. This allows one to use very few pilots, thus reducing the channel estimation overhead. The method is applied to anordered statistics decoder for communication over a Rayleigh block-fading channel. Gains of up to 1.2 dB as compared to traditional PAT schemes are demonstrated for short codes with QPSK signaling. The approach can be generalized to other list decoders, e.g., to list decoding of polar codes.
  •  
3.
  • Coskun, Mustafa Cemil, et al. (författare)
  • Successive cancellation decoding of single parity-check product codes
  • 2017
  • Ingår i: IEEE International Symposium on Information Theory - Proceedings. - 2157-8095. - 9781509040964 ; , s. 1763-1767
  • Konferensbidrag (refereegranskat)abstract
    • Abstract:We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (SPC) component codes. Recursive formulas are derived, which resemble the SC decoding algorithm of polar codes. We analyze the error probability of SPC-PCs over the binary erasure channel under SC decoding. A bridge with the analysis of PCs introduced by Elias in 1954 is also established. Furthermore, bounds on the block error probability under SC decoding are provided, and compared to the bounds under the original decoding algorithm proposed by Elias. It is shown that SC decoding of SPC-PCs achieves a lower block error probability than Elias' decoding.
  •  
4.
  • Durisi, Giuseppe, 1977, et al. (författare)
  • Short-packet transmission
  • 2021
  • Ingår i: Information Theoretic Perspectives on 5G Systems and Beyond. - 9781108416474
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
    • 5G, a new generation of cellular technology under deployment worldwide, can provide about 100 times faster communications than current 4G technology. But a higher speed is not the sole differentiating factor: 5G is also more reliable, secure, and capable of ubiquitously connecting a massively large number of devices. Ultra-reliable, low-delay, omni-present 5G networks hold the promise of enabling a range of new applications, including self-driving cars, highly automatized industrial tasks, virtual reality gaming, as well as of providing the connectivity platform for the Internet of Things (IoT). Since its introduction in 1948, information theory has underpinned the mathematical foundations of communication systems, including 5G networks, and it will impact the design of cellular systems beyond 5G. The theoretical insights obtained by information theory point to the optimal system performance under a given model, offering strong guidelines and benchmarks for the design and validation of modern communication technologies. Information Theoretic Perspectives on 5G Systems and Beyond provides a comprehensive overview of the state-of-art information-theoretic approaches that led to realization of 5G. Three main areas are discussed, namely network architecture, coding and modulation, and network protocols. Examples of covered topics include cloud/fog radio access networks (a central component in future 6G (beyond 5G) cell-less structure), device-to-device communications, caching, energy harvesting, polar coding, Massive MIMO, short-packet transmission, NOMA,  5G protocols, interference management, content delivery, and cooperative and confidential communications. Information Theoretic Perspectives on 5G Systems and Beyond is the result of a grand effort by more than 40 experts in the field of information theory. It includes 19 chapters, offering a detailed introduction to advanced topics in information theory, and it took several years in making. We are extremely excited that the book is now available. We hope that it can serve as a tool for researchers and graduate students in the fields of information theory and wireless communications, as well as for practitioners in the telecommunications industry.
  •  
5.
  • Fougstedt, Christoffer, 1990, et al. (författare)
  • Energy-Efficient Soft-Assisted Product Decoders
  • 2019
  • Ingår i: 2019 Optical Fiber Communications Conference and Exhibition, OFC 2019 - Proceedings. - 9781943580538
  • Konferensbidrag (refereegranskat)abstract
    • We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder uses one bit of soft information to improve its net coding gain by 0.2 dB, reaching 10.3-10.4 dB, which is similar to that of more complex hard-decision staircase decoders.
  •  
6.
  •  
7.
  • Graell i Amat, Alexandre, 1976, et al. (författare)
  • Finite Length Analysis of Irregular Repetition Slotted ALOHA in the Waterfall Region
  • 2018
  • Ingår i: IEEE Communications Letters. - 1558-2558 .- 1089-7798. ; 22:5, s. 886-889
  • Tidskriftsartikel (refereegranskat)abstract
    • A finite length analysis is introduced for irregular repetition slotted ALOHA (IRSA) that enables to accurately estimate its performance in the moderate-to-high packet loss probability regime, i.e., in the so-called waterfall region. The analysis is tailored to the collision channel model, which enables mapping the description of the successive interference cancella- tion process onto the iterative erasure decoding of low-density parity-check codes. The analysis provides accurate estimates of the packet loss probability of IRSA in the waterfall region as demonstrated by Monte Carlo simulations.
  •  
8.
  • 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.
  •  
9.
  • Lázaro, F., et al. (författare)
  • Symbol Message Passing Decoding of Nonbinary Low-Density Parity-Check Codes
  • 2019
  • Ingår i: 2019 IEEE Global Communications Conference, GLOBECOM 2019 - Proceedings.
  • Konferensbidrag (refereegranskat)abstract
    • We present a novel decoding algorithm for q-ary low-density parity-check codes, termed symbol message passing. The proposed algorithm can be seen as a generalization of Gallager B and the binary message passing algorithm by Lechner et al. to q-ary codes. We derive density evolution equations for the q-ary symmetric channel, compute thresholds for a number of regular low-density parity-check code ensembles, and verify those by Monte Carlo simulations of long channel codes. The proposed algorithm shows performance advantages with respect to an algorithm of comparable complexity from the literature.
  •  
10.
  • Liva, Gianluigi, et al. (författare)
  • Coded Slotted Aloha over the On-Off Fading Channel: Performance Bounds
  • 2019
  • Ingår i: Conference Record - Asilomar Conference on Signals, Systems and Computers. - 1058-6393. - 9781728143002 ; 2019-November, s. 31-35
  • Konferensbidrag (refereegranskat)abstract
    • The on-off fading channel is used as a proxy to gain insights on the performance of coded slotted Aloha (CSA) access protocols on the block flat fading channel. Bounds on the performance of CSA are developed, which include both the on-off fading effect and multi-packet reception capabilities at the receiver. The bounds apply to the case where a non-vanishing packet loss probability can be tolerated. A comparison of simulation results for actual CSA schemes with the developed bounds is provided.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 25

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