The paper proposes an implementation of the message passing algorithm adapted to iterative channel detection. The algorithm uses soft messages associated to non binary symbols in order to cancel cycles in the equivalent Tanner graphs, achieving optimal performance after a low number of iterations. This architecture, suited to very fast channel detectors, is applied to magnetic recording channels and adapted to the non stationary nature of the magnetic media noise.
Non-Binary Message-Passing Algorithms for Magnetic Channels with Data-Dependent Noise
TOMASONI, ALESSANDRO;REGGIANI, LUCA
2008-01-01
Abstract
The paper proposes an implementation of the message passing algorithm adapted to iterative channel detection. The algorithm uses soft messages associated to non binary symbols in order to cancel cycles in the equivalent Tanner graphs, achieving optimal performance after a low number of iterations. This architecture, suited to very fast channel detectors, is applied to magnetic recording channels and adapted to the non stationary nature of the magnetic media noise.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
GTTI_tomasoni.pdf
Accesso riservato
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
198.97 kB
Formato
Adobe PDF
|
198.97 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
