Non-Binary Message-Passing Algorithms for Magnetic Channels with Data-Dependent Noise

@inproceedings{Tomasoni2008NonBinaryMA,
  title={Non-Binary Message-Passing Algorithms for Magnetic Channels with Data-Dependent Noise},
  author={Alessandro Tomasoni and Luca Reggiani},
  year={2008}
}
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. 

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

Pattern-dependent noise prediction in signal-dependent noise

  • IEEE Journal on Selected Areas in Communications
  • 2001
VIEW 1 EXCERPT

Low density parity check codes over GF(q)

  • 1998 Information Theory Workshop (Cat. No.98EX131)
  • 1998
VIEW 1 EXCERPT

Signal-dependent correlation-sensitive branch metrics for Viterbi-like sequence detectors

  • ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)
  • 1998
VIEW 1 EXCERPT

A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain

P. Robertson, P. Hoeher, E. Villebrun
  • Proc. IEEE Int. Conf. Communications, 1995, pp. 1009-1013.
  • 1995
VIEW 1 EXCERPT