271 research outputs found
Delay-Exponent of Bilayer Anytime Code
In this paper, we study the design and the delay-exponent of anytime codes
over a three terminal relay network. We propose a bilayer anytime code based on
anytime spatially coupled low-density parity-check (LDPC) codes and investigate
the anytime characteristics through density evolution analysis. By using
mathematical induction technique, we find analytical expressions of the
delay-exponent for the proposed code. Through comparison, we show that the
analytical delay-exponent has a close match with the delay-exponent obtained
from numerical results.Comment: Accepted for presentation in ITW-2014. 5 Pages, 3 Figure
Finite Length Analysis of LDPC Codes
In this paper, we study the performance of finite-length LDPC codes in the
waterfall region. We propose an algorithm to predict the error performance of
finite-length LDPC codes over various binary memoryless channels. Through
numerical results, we find that our technique gives better performance
prediction compared to existing techniques.Comment: Submitted to WCNC 201
A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels
In this correspondence, we propose a tight lower bound to the outage
probability of discrete-input Nakagami-m block-fading channels. The approach
permits an efficient method for numerical evaluation of the bound, providing an
additional tool for system design. The optimal rate-diversity trade-off for the
Nakagami-m block-fading channel is also derived and a tight upper bound is
obtained for the optimal coding gain constant.Comment: 22 pages, 4 figures. This work has been accepted for IEEE
Transactions on Information Theory and has been presented in part at the 2007
IEEE International Symposium on Information Theory, Nice, France, June 200
- …