Filters








1,575 Hits in 4.0 sec

Easily Computed Lower Bounds on the Information Rate of Intersymbol Interference Channels [article]

Seongwook Jeong, Jaekyun Moon
2011 arXiv   pre-print
When evaluated on a number of well-known finite-ISI channels, these new bounds provide a very similar level of tightness against the SIR to the conjectured lower bound by Shamai and Laroia at all signal-to-noise  ...  It is well known that with S representing the precursor intersymbol interference (ISI) at the decision feedback equalizer (DFE) output, I(X; X+S+N) serves as a tight lower bound for the symmetric information  ...  INTRODUCTION The computation of the symmetric information rate (SIR) of the classical discrete-time intersymbol interference (ISI) channel is of great interest in digital communication.  ... 
arXiv:1110.0560v1 fatcat:sqkfry35ijbfjnnmrcfkjtzz2m

Achievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs

Jun Hu, Tolga Duman, M. Erden, Aleksandar Kavcic
2010 IEEE Transactions on Communications  
interference when i.i.d. inputs are employed while we also provide some notes on the achievable information rates when Markov inputs are used.  ...  We demonstrate that the proposed algorithm is an efficient and flexible technique to closely estimate the achievable information rates for channels with insertions and/or deletions with or without intersymbol  ...  lower bound on the i.u.d. achievable information rate given in (5) .  ... 
doi:10.1109/tcomm.2010.04.080683 fatcat:apxyws6gkvdehcuop5glotpsqq

On the information-theoretic capacity of magnetic recording systems in the presence of medium noise

D. Arnold, E. Eleftheriou
2002 IEEE transactions on magnetics  
lower bound.  ...  By noting that at the output of this model the read-back signal is cyclostationary, the average autocorrelation function and corresponding power spectral density over one period are computed.  ...  It is based on the well-known microtrack channel model [2] and the conjectured Shamai-Laroia lower bound (SLLB) on the capacity of intersymbol interference channels [3] .  ... 
doi:10.1109/tmag.2002.801889 fatcat:sqcjevnuy5d4pewkmuszirpzgq

Maximum likelihood sequence detection for intersymbol interference channels: A new upper bound on error probability

S. Verdu
1987 IEEE Transactions on Information Theory  
In addition, in the case of infinite-length intersymbol interference a locally convergent bound is shown to hold under fairly general assumptions on the signal autocorrelation.  ...  Abstruct-Maximum likelihood sequence detection of digital signaling subject to intersymbol interference and additive white Gaussian noise is considered.  ...  The lower bound analysis [2] is based on the error probability of receivers with side information that perform one-shot optimum decisions.  ... 
doi:10.1109/tit.1987.1057271 fatcat:3tdn3tkfrrhehbga3zptgpgdm4

Achievable Information Rates and Coding for MIMO Systems Over ISI Channels and Frequency-Selective Fading Channels

Z. Zhang, T.M. Duman, E.M. Kurtas
2004 IEEE Transactions on Communications  
We propose a simulation-based method to compute the achievable information rates for general multiple-input multiple-output (MIMO) intersymbol interference (ISI) channels with inputs chosen from a finite  ...  Our results show that the multitrack recording channels have significant advantages over the single-track channels, in terms of the achievable information rates when the intertrack interference is considered  ...  Instead, upper and lower bounds on the information rates are provided in [7] and 0090-6778/04$20.00 © 2004 IEEE [8] .  ... 
doi:10.1109/tcomm.2004.836449 fatcat:6kagykh6y5cdxj3wecsi2rek4u

Channel Modeling and Capacity Bounds for Two-Dimensional Magnetic Recording

A. Kavcic, Xiujie Huang, B. Vasic, W. Ryan, M.F. Erden
2010 IEEE transactions on magnetics  
Using proper information-theoretic inequalities and bounding techniques, we derive methods to bound the capacities of TDMR channels.  ...  The results reveal that information capacities in excess of 0.6 user bits per grain are possible to attain over TDMR channels.  ...  interference and additive readback noise. 2) For a very simple TDMR channel, we develop a methodology to compute bounds on the achievable information rates.  ... 
doi:10.1109/tmag.2009.2035636 fatcat:egywmrziirf6ba5jeizr2mj5fi

Achievable rates for Tomlinson-Harashima precoding

R.D. Wesel, J.M. Cioffi
1998 IEEE Transactions on Information Theory  
Information rate bounds are provided for the minimum mean-square error (MMSE) THP.  ...  An exact expression for the maximum achievable information rate of zero-forcing (ZF) THP is derived as a function of the channel impulse response, the input power constraint, and the additive white Gaussian  ...  ACKNOWLEDGMENT The authors wish to thank P. Gaal, a graduate student at the University of Southern California, for helpful discussions and a careful review of the manuscript.  ... 
doi:10.1109/18.661530 fatcat:eim33s5sofhytlgsfwtl6vpura

Polyphase codes with good nonperiodic correlation properties

R. Frank
1963 IEEE Transactions on Information Theory  
Information rate bounds are provided for the minimum mean-square error (MMSE) THP.  ...  An exact expression for the maximum achievable information rate of zero-forcing (ZF) THP is derived as a function of the channel impulse response, the input power constraint, and the additive white Gaussian  ...  ACKNOWLEDGMENT The authors wish to thank P. Gaal, a graduate student at the University of Southern California, for helpful discussions and a careful review of the manuscript.  ... 
doi:10.1109/tit.1963.1057798 fatcat:2p3jwu35vrgt7pyj3oxfvpw6je

Multiple-access channels with point-process observations: Optimum demodulation

S. Verdu
1986 IEEE Transactions on Information Theory  
Upper and lower bounds on the minimum uncoded bit error rate achievable with arbitrary signal constellations are obtained in terms of the error probability of binary hypothesis testing problems.  ...  A particular case of these results, namely, the single-user finite-length intersymbol interference problem, solves the error rate analysis of optimum direct-detection systems for dispersive optical fibers  ...  In the particular case of intersymbol interference, the additive-rate channel has been used extensively in modeling direct-detection dispersive optical fiber systems [9], [lo] .  ... 
doi:10.1109/tit.1986.1057224 fatcat:fwtwsgx7k5aqtkqn23uip4gr3y

Viterbi Algorithm [chapter]

Michail G. Lagoudakis, Thomas Zeugmann, Claude Sammut
2011 Encyclopedia of Machine Learning  
Increasing use of the algorithm in a widening variety of areas is foreseen.  ...  Abstrucf-The Viterbi algorithm (VA) is a recursive optimal solution to the problem of estimating the state sequence of a discretetime finite-state Markov process observed in memoryless noise.  ...  (trellis) code, but with a lower rate for the block code of course [7] .  ... 
doi:10.1007/978-0-387-30164-8_878 fatcat:kkrlxd2o65bgnhjnf6n5chn3ry

Resonant Frequencies of an Electromagnetic Cavity in an Accelerated System of Reference

C. V. Heer
1964 Physical Review  
Mo, "Theory of electrodynamics in media in noninertial frames and applications," Abstrucf-The Viterbi algorithm (VA) is a recursive optimal solution to the problem of estimating the state sequence of a  ...  Increasing use of the algorithm in a widening variety of areas is foreseen.  ...  On Gaussian channels where & / N O is the signal-to-noise ratio per information bit. The tightness of this bound is confirmed by simulations [8], [9], [22].  ... 
doi:10.1103/physrev.134.a799 fatcat:whzb3ljpnbdvxfuyw3mlogbewm

On computing the minimum distance for faster than Nyquist signaling

D. Hajela
1990 IEEE Transactions on Information Theory  
Absfract -The degradation suffered when pulses satisfying the Nyquist criterion are used to transmit binary data at a rate faster than the Nyquist rate over the ideal band-limited (brick-wall) channel  ...  The mathematical formulation of the problem is to find the smallest value of 6, 0 < 6 < 0.5, for which the best L , approximation to the constant 1 on the interval ( -6.6) is 1, when using a linear combination  ...  , the computation of the minimum distance is fundamental in obtaining lower bounds on the bit error rate.  ... 
doi:10.1109/18.52475 fatcat:omdzlags4nb6po3npgldxr4lyu

Monte Carlo Algorithms for the Partition Function and Information Rates of Two-Dimensional Channels

Mehdi Molkaraie, Hans-Andrea Loeliger
2013 IEEE Transactions on Information Theory  
The paper proposes Monte Carlo algorithms for the computation of the information rate of two-dimensional source / channel models.  ...  The problem of numerically computing the information rate, and even the noiseless capacity, of such channels has so far remained largely unsolved.  ...  ACKNOWLEDGEMENT The authors wish to thank Radford Neal for helpful discussions and advice on annealed importance sampling.  ... 
doi:10.1109/tit.2012.2212413 fatcat:eb5kvbcrinhg5ies5abhknt5zy

Monte Carlo Algorithms for the Partition Function and Information Rates of Two-Dimensional Channels [article]

Mehdi Molkaraie, Hans-Andrea Loeliger
2012 arXiv   pre-print
The paper proposes Monte Carlo algorithms for the computation of the information rate of two-dimensional source/channel models.  ...  The problem of numerically computing the information rate, and even the noiseless capacity, of such channels has so far remained largely unsolved.  ...  ACKNOWLEDGEMENT The authors wish to thank Radford Neal for helpful discussions and advice on annealed importance sampling.  ... 
arXiv:1105.5542v2 fatcat:qzacmvbf3jfdja6bcxccvl6wse

Computing Lower Bounds on the Information Rate of Intersymbol Interference Channels [article]

Seongwook Jeong, Jaekyun Moon
2011 arXiv   pre-print
The information rate I(X; X+S+N) serves as a tight lower bound for capacity of intersymbol interference (ISI) channels corrupted by Gaussian noise.  ...  Provable lower bounds are presented for the information rate I(X; X+S+N) where X is the symbol drawn from a fixed, finite-size alphabet, S a discrete-valued random variable (RV) and N a Gaussian RV.  ...  Finding the information rate I(X; Y ), which itself acts as a close lower bound for the symmetric information rate (SIR) of the intersymbol interference (ISI) channel [1] , [2] , is of great interest  ... 
arXiv:1001.3911v2 fatcat:eyz7xk6hx5f6hhb3nqpjxfnuwu
« Previous Showing results 1 — 15 out of 1,575 results