Design guidelines of low-density parity-check codes for magnetic recording systems
As one of the most classical data-storage systems, magnetic recording (MR) systems have
attracted a significant amount of research attention in the past several decades due to the …
attracted a significant amount of research attention in the past several decades due to the …
[图书][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 …
On the application of factor graphs and the sum-product algorithm to ISI channels
G Colavolpe, G Germi - IEEE Transactions on Communications, 2005 - ieeexplore.ieee.org
In this paper, based on the application of the sum-product (SP) algorithm to factor graphs
(FGs) representing the joint a posteriori probability (APP) of the transmitted symbols, we …
(FGs) representing the joint a posteriori probability (APP) of the transmitted symbols, we …
Symbol-level synchronization and LDPC code design for insertion/deletion channels
F Wang, D Fertonani, TM Duman - IEEE transactions on …, 2011 - ieeexplore.ieee.org
We investigate a promising coding scheme over channels impaired by insertion, deletion,
and substitution errors, ie, interleaved concatenation of an outer low-density parity-check …
and substitution errors, ie, interleaved concatenation of an outer low-density parity-check …
Design of protograph LDPC codes for partial response channels
We investigate the performance of the protograph low-density parity-check (LDPC) codes,
which have been shown to possess simple structures and outstanding error performance …
which have been shown to possess simple structures and outstanding error performance …
[图书][B] On the capacity of finite state channels and the analysis of convolutional accumulate-m codes
HD Pfister - 2003 - search.proquest.com
What are the fundamental limits of communications channels and channel coding systems?
In general, these limits manifest themselves as thresholds which separate what is possible …
In general, these limits manifest themselves as thresholds which separate what is possible …
Augmented belief propagation decoding of low-density parity check codes
N Varnica, MPC Fossorier… - IEEE Transactions on …, 2007 - ieeexplore.ieee.org
We propose an augmented belief propagation (BP) decoder for low-density parity check
(LDPC) codes which can be utilized on memoryless or intersymbol interference channels …
(LDPC) codes which can be utilized on memoryless or intersymbol interference channels …
[图书][B] LDPC coded modulations
About sixty years ago, Shannon's seminal paper laid the foundations of information theory.
In particular, it characterized channel coding as a means for achieving the so-called channel …
In particular, it characterized channel coding as a means for achieving the so-called channel …
Determining and approaching achievable rates of binary intersymbol interference channels using multistage decoding
By examining the achievable rates of a multistage decoding system on stationary ergodic
channels, we derive lower bounds on the mutual information rate corresponding to …
channels, we derive lower bounds on the mutual information rate corresponding to …
Achievable rates of MIMO systems with linear precoding and iterative LMMSE detection
We establish area theorems for iterative detection and decoding (or simply, iterative
detection) over coded linear systems, including multiple-input multiple-output channels …
detection) over coded linear systems, including multiple-input multiple-output channels …