[图书][B] Codes for mass data storage systems
KAS Immink - 2004 - books.google.com
Since the early 1980s we have witnessed the digital audio and video revolution: the
Compact Disc (CD) has become a commodity audio system. CD-ROM and DVD-ROM have …
Compact Disc (CD) has become a commodity audio system. CD-ROM and DVD-ROM have …
[PDF][PDF] Fifty years of Shannon theory
S Verdu - IEEE Transactions on information theory, 1998 - academia.edu
Fifty Years of Shannon Theory Page 1 IEEE TRANSACTIONS ON INFORMATION THEORY,
VOL. 44, NO. 6, OCTOBER 1998 2057 Fifty Years of Shannon Theory Sergio Verdú, Fellow …
VOL. 44, NO. 6, OCTOBER 1998 2057 Fifty Years of Shannon Theory Sergio Verdú, Fellow …
Survey for a Decade of Coding for DNA Storage
Advancements in DNA synthesis and sequencing technologies have enabled the storage of
data on synthetic DNA strands. However, realizing its potential relies on the design of …
data on synthetic DNA strands. However, realizing its potential relies on the design of …
Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds
We study the limits of performance of Gallager codes (low-density parity-check (LDPC)
codes) over binary linear intersymbol interference (ISI) channels with additive white …
codes) over binary linear intersymbol interference (ISI) channels with additive white …
Signal processing and coding techniques for 2-D magnetic recording: An overview
Two-dimensional magnetic recording (TDMR) is an emerging storage technology that aims
to achieve areal densities on the order of 10 Tb/in 2, mainly driven by innovative channels …
to achieve areal densities on the order of 10 Tb/in 2, mainly driven by innovative channels …
[图书][B] Coding and signal processing for magnetic recording systems
B Vasic, EM Kurtas - 2004 - taylorfrancis.com
Rapid advances in recording materials, read/write heads, and mechanical designs over the
last 15 years have led to the need for more complicated signal processing, coding, and …
last 15 years have led to the need for more complicated signal processing, coding, and …
A generalization of the Blahut–Arimoto algorithm to finite-state channels
The classical Blahut-Arimoto algorithm (BAA) is a well-known algorithm that optimizes a
discrete memoryless source (DMS) at the input of a discrete memoryless channel (DMC) in …
discrete memoryless source (DMS) at the input of a discrete memoryless channel (DMC) in …
Feedback capacity of finite-state machine channels
S Yang, A Kavcic, S Tatikonda - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
We consider a finite-state machine channel with a finite memory length (eg, finite length
intersymbol interference channels with finite input alphabets-also known as partial response …
intersymbol interference channels with finite input alphabets-also known as partial response …
On the capacity of Markov sources over noisy channels
A Kavcic - GLOBECOM'01. IEEE Global Telecommunications …, 2001 - ieeexplore.ieee.org
We present an expectation-maximization method for optimizing Markov process transition
probabilities to increase the mutual information rate achievable when the Markov process is …
probabilities to increase the mutual information rate achievable when the Markov process is …
Optimal information storage in noisy synapses under resource constraints
Experimental investigations have revealed that synapses possess interesting and, in some
cases, unexpected properties. We propose a theoretical framework that accounts for three of …
cases, unexpected properties. We propose a theoretical framework that accounts for three of …