Logo del repository
  1. Home
 
Opzioni

A sphere-packing exponent approximation

BABICH, FULVIO
2013
  • conference object

Abstract
The sphere-packing bound represents a suitable tool for assessing the limiting performance of a digital communication system. In fact, most of the modern transmission techniques, adopting capacity approaching codes, such as turbo codes, or Low Density Parity Check (LDPC) codes, may offer a performance that is within 1 dB from the bound, both for Additive White Gaussian Noise (AWGN) and for the fading channel. Unfortunately, the sphere-packing exponent may be difficult to compute, and this may prevent its adoption as a performance estimator. This paper presents and discusses the accuracy of an approximate expression of the bound, that may be used for evaluating the achievable performance of a communication system, without resorting to cumbersome simulations.
DOI
10.1109/VTCSpring.2013.6691845
WOS
WOS:000331081500034
SCOPUS
2-s2.0-84893545679
Archivio
http://hdl.handle.net/11368/2694210
Diritti
metadata only access
Soggetti
  • Sphere Packing Bound

  • performance evaluatio...

  • channel coding

  • fading channel

  • adaptive systems

Scopus© citazioni
1
Data di acquisizione
Jun 15, 2022
Vedi dettagli
Visualizzazioni
3
Data di acquisizione
Jun 8, 2022
Vedi dettagli
google-scholar
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your nstitution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Realizzato con Software DSpace-CRIS - Estensione mantenuta e ottimizzata da 4Science

  • Impostazioni dei cookie
  • Informativa sulla privacy
  • Accordo con l'utente finale
  • Invia il tuo Feedback