Runlength-limited sequences

KAS Immink - Proceedings of the IEEE, 1990 - ieeexplore.ieee.org
Runlength-limited (RLL) sequences are formally defined, and the runlength distribution and
spectral properties of ideal RLL sequences are analyzed. A detailed description is furnished …

Simulation-based computation of information rates for channels with memory

DM Arnold, HA Loeliger, PO Vontobel… - … on information theory, 2006 - ieeexplore.ieee.org
The information rate of finite-state source/channel models can be accurately estimated by
sampling both a long channel input sequence and the corresponding channel output …

[图书][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 …

[PDF][PDF] Fundamentals of bar code information theory

T Pavlidis, J Swartz, YP Wang - Computer, 1990 - scholar.archive.org
I each particular bar code scheme, while the term symbol refers to the bar code label
requires us to first look tion center receiving from and shipping to remote warehouses or …

Signal processing and coding techniques for 2-D magnetic recording: An overview

SS Garani, L Dolecek, J Barry, F Sala… - Proceedings of the …, 2018 - ieeexplore.ieee.org
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 …

[图书][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 …

[PDF][PDF] An introduction to coding for constrained systems

BH Marcus, RM Roth, PH Siegel - Lecture notes, 2001 - ronny.cswp.cs.technion.ac.il
In most data recording systems and many data communication systems, some sequences
are more prone to error than others. Thus, in order to reduce the likelihood of error, it makes …

A generalization of the Blahut–Arimoto algorithm to finite-state channels

PO Vontobel, A Kavcic, DM Arnold… - IEEE Transactions on …, 2008 - ieeexplore.ieee.org
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 …

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 …

Ultra-short-term multistep wind power prediction based on improved EMD and reconstruction method using run-length analysis

M Yang, X Chen, J Du, Y Cui - IEEE access, 2018 - ieeexplore.ieee.org
With larger scale wind farm being connected to the power grid, the high-precision wind
power prediction has become an important means which can ensure the safe operation of …