Results 11 to 20 of about 9,369 (286)

A Systematic Approach to Incremental Redundancy over Erasure Channels [PDF]

open access: yes2018 IEEE International Symposium on Information Theory (ISIT), 2018
As sensing and instrumentation play an increasingly important role in systems controlled over wired and wireless networks, the need to better understand delay-sensitive communication becomes a prime issue. Along these lines, this article studies the operation of data links that employ incremental redundancy as a practical means to protect information ...
Anoosheh Heidarzadeh   +3 more
openaire   +4 more sources

A Systematic Approach to Incremental Redundancy With Application to Erasure Channels [PDF]

open access: yesIEEE Transactions on Communications, 2019
This paper focuses on the design and evaluation of pragmatic schemes for delay-sensitive communication. Specifically, this contribution studies the operation of data links that employ incremental redundancy as a means to shield information bits from the degradation associated with unreliable channels. While this inquiry puts forth a general methodology,
Anoosheh Heidarzadeh   +3 more
openaire   +3 more sources

Spatially coupled protograph-based LDPC codes for incremental redundancy [PDF]

open access: yes2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2012
We investigate a family of protograph based rate-compatible LDPC convolutional codes. The code family shows improved thresholds close to the Shannon limit compared to their uncoupled versions for the binary erasure channel as well as the AWGN channel. In fact, the gap to Shannon limit is almost uniform for all members of the code family ensuring good ...
Walter Nitzold   +2 more
openaire   +3 more sources

Delayed Channel State Information: Incremental redundancy with backtrack retransmission [PDF]

open access: yes2014 IEEE International Conference on Communications (ICC), 2014
In many practical wireless systems, the Signal-to-Interference-and-Noise Ratio (SINR) that is applicable to a certain transmission, referred to as Channel State Information (CSI), can only be learned after the transmission has taken place and is thereby outdated (delayed). For example, this occurs under intermittent interference. We devise the backward
Popovski, Petar; id_orcid   +1 more
openaire   +5 more sources

Windowed Joint Detection and Decoding with IR-HARQ for Asynchronous SCMA Systems

open access: yesEntropy, 2023
To improve the decoding performance of asynchronous sparse code multiple access (SCMA) systems over additive white Gaussian noise (AWGN) channels, this paper proposes a novel windowed joint detection and decoding algorithm for a rate-compatible (RC ...
Mengsheng Guan, Min Zhu, Baoming Bai
doaj   +1 more source

Relay Switching Aided Turbo Coded Hybrid-ARQ for Correlated Fading Channel [PDF]

open access: yes, 2011
Hybrid-Automatic-Repeat-reQuest (HARQ) has become an indispensable technique in reliable communications systems. However, its performance is inevitably affected by the channel’s fading correlation. In this paper, we proposed a novel relay-switching aided
Maunder, Robert   +5 more
core   +1 more source

Design and analysis of polar coded cooperation with incremental redundancy for IoT in fading channels

open access: yesIET Communications, 2021
In this study, a coded cooperation scheme using polar codes is explored for high‐reliability and low‐user complexity applications such as Internet of Things.
Hao Liang   +4 more
doaj   +1 more source

Goodput Maximization of HARQ-IR Over Arbitrarily Correlated Rician Fading Channels

open access: yesIEEE Access, 2018
This paper investigates the optimal design of hybrid automatic repeat request with incremental redundancy (HARQ-IR) over arbitrarily correlated Rician fading channels for goodput maximization.
Zheng Shi   +4 more
doaj   +1 more source

Feedback Communication Systems with Limitations on Incremental Redundancy

open access: yesCoRR, 2013
This paper explores feedback systems using incremental redundancy (IR) with noiseless transmitter confirmation (NTC). For IR-NTC systems based on {\em finite-length} codes (with blocklength $N$) and decoding attempts only at {\em certain specified decoding times}, this paper presents the asymptotic expansion achieved by random coding, provides rate ...
Tsung-Yi Chen   +3 more
openaire   +2 more sources

Updating RDFS ABoxes and TBoxes in SPARQL [PDF]

open access: yes, 2014
Updates in RDF stores have recently been standardised in the SPARQL 1.1 Update specification. However, computing answers entailed by ontologies in triple stores is usually treated orthogonal to updates. Even the W3C's recent SPARQL 1.1 Update language
Axel Polleres   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy