Article

Reduced-delay protection of DSL systems against nonstationary disturbances

Marvell Semicond. Inc., Sunnyvale, CA, USA
IEEE Transactions on Communications (Impact Factor: 1.75). 12/2004; DOI: 10.1109/TCOMM.2004.836589
Source: IEEE Xplore

ABSTRACT In addition to being designed to successfully cope with stationary noise, crosstalk, and intersymbol interference, digital subscriber loop (DSL) systems need to be shielded from nonstationary disturbances, such as impulse noise and RF interference. Currently, deployed DSL systems achieve protection against nonstationary interference using a combination of Reed-Solomon (RS) codes and interleaving. However, interleaving results in delay. Long delays are undesirable in high-rate systems that support interactive applications. In this study, it is shown that the interleaving delay of DSL systems can be significantly reduced by performing erasure decoding of the RS codewords at the receiver. Three different techniques for determining the erasures are proposed. Use of the techniques results in a reduction of the interleaving delay that is required to mitigate worst-case impulse noise by up to a factor of 2, which is verified by simulation. Moreover, the techniques do not require any changes at the transmitter and therefore guarantee compatibility with currently deployed systems.

0 Bookmarks
 · 
67 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper is concerned with the design of block turbo codes for very high bit rate applications. We first introduce an original low-complexity architecture designed for the iterative decoding of product codes. The implementation of the Chase-Pyndiah algorithm is simplified by not memorizing any of the list decoding concurrent code words. We then illustrate that such block turbo codes allow some bit rate improvement in the context of local loop transmission
    Information Theory, 2006 IEEE International Symposium on; 08/2006
  • [Show abstract] [Hide abstract]
    ABSTRACT: Reed-Solomon (RS) coding and interleaving are usually combined to protect digital subscriber line (DSL) systems against impulse noise (IN) but introducing a long delay. It is proved that interleaving delay can be significantly reduced by error and erasure decoding (EED). This paper proposes an erasure marking technique to enhance the reliability of the erasure information in order to completely exploit the capability of EED for interleaving delay reduction. Selection of proper parameters for the proposed erasure marking technique is analyzed. Simulation results show that the proposed technique can guarantee efficient erasure marking and reduce the interleaving delay by a factor of two.
    Communications (ICC), 2012 IEEE International Conference on; 01/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a novel approach to tightly estimate the ergodic Shannon and constrained capacities of an additive Bernoulli-Gaussian (BG) impulsive noise channel in Rayleigh fading environments where channel gains are known at the receiver, but not at the transmitter. We first show that the differential entropy of the BG impulsive noise can be established in closed-form using Gaussian hypergeometric function $_{2}F_{1}(1,1;cdot;cdot)$. The Shannon capacity is then calculated via upper and lower bounds. Specifically, we derive in closed-form two upper bounds on the Shannon capacity using the assumption of a Gaussian output and using full knowledge of noise state, respectively. Under the assumption of a Gaussian input, we propose a novel approach to calculate a lower bound by examining the instantaneous output entropy in two regions of channel gains. In the high-gain region, the lower bound is evaluated via the upper bound obtained under the Gaussian output assumption. In the other region, we apply the piecewise-linear curve fitting (PWLCF) method to estimate the lower bound. It is then demonstrated that the lower bound can be calculated with a predetermined accuracy. By establishing the difference between the lower bound and the two upper bounds, we show that the lower bound can be used to effectively estimate the Shannon capacity. Finally, we detail a PWLCF-based method to estimate the constrained capacity for a finite-alphabet constellation. To this end, we first propose a numerical technique to calculate the instantaneous entropy of the output using 2-dimensional (2-D) Gauss-Hermite quadrature formulas. The average output entropy is then obtained using the PWLCF method. Combined with the closed-form expression of the entropy of the BG impulsive noise, the constrained capacity can be effectively estimated.
    IEEE Transactions on Communications 01/2014; 62(6):1845-1856. · 1.75 Impact Factor