The design of a bandwidth-efficient physical layer for wireless access has always been a challenging task, due to the harsh environment, characterized by impairing phenomena such as radio interference, fading, and shadowing. With circuit switching, a bit-error rate suitable for real-time applications such as voice and video is guaranteed by adopting robust forward error correction (FEC) codes and proper power-budget margins to face fading problems. With this approach, automatic repeat request (ARQ) is used only for applications that require a much lower error rate and can tolerate high delays. The introduction of the packet technique allows the use of ARQ even for real-time traffic. In this paper, we compare the efficiency of three error-recovering techniques in the presence of traffic with delay constraints, when the memory property of the wireless segment is represented by the Gilbert–Elliot channel. The techniques compared are FEC with interleaving, real-time ARQ, and erasure coding (EC). The comparisons are performed by using both analytical and simulation tools. Two new analytical models are introduced to evaluate the performance of FEC and EC. Simulation is used to validate the analytical results and to derive the performance of real-time ARQ. The numerical results show that when the channel memory increases well beyond the packet-transmission time, the performance of FEC impairs due to the limited interleaving depth, while ARQ and EC remain effective.

Efficiency of Error Control Schemes for Real-time Wireless Applications on the Gilbert Channel

BORGONOVO, FLAMINIO;CAPONE, ANTONIO
2005-01-01

Abstract

The design of a bandwidth-efficient physical layer for wireless access has always been a challenging task, due to the harsh environment, characterized by impairing phenomena such as radio interference, fading, and shadowing. With circuit switching, a bit-error rate suitable for real-time applications such as voice and video is guaranteed by adopting robust forward error correction (FEC) codes and proper power-budget margins to face fading problems. With this approach, automatic repeat request (ARQ) is used only for applications that require a much lower error rate and can tolerate high delays. The introduction of the packet technique allows the use of ARQ even for real-time traffic. In this paper, we compare the efficiency of three error-recovering techniques in the presence of traffic with delay constraints, when the memory property of the wireless segment is represented by the Gilbert–Elliot channel. The techniques compared are FEC with interleaving, real-time ARQ, and erasure coding (EC). The comparisons are performed by using both analytical and simulation tools. Two new analytical models are introduced to evaluate the performance of FEC and EC. Simulation is used to validate the analytical results and to derive the performance of real-time ARQ. The numerical results show that when the channel memory increases well beyond the packet-transmission time, the performance of FEC impairs due to the limited interleaving depth, while ARQ and EC remain effective.
File in questo prodotto:
File Dimensione Formato  
borgonovo1.pdf

Accesso riservato

: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 842.43 kB
Formato Adobe PDF
842.43 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/554733
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 11
social impact