Abstract | ||
---|---|---|
In this paper, we compare the performance of the reduced complexity 2-D detection methods: Graph-based detection and Viterbi-based detection for the 2-D interference bit patterned media channels at various areal densities. In the graph-based detection, the complexity is reduced by ignoring the ITI from the cornered islands in designing the factor graph. In Viterbi-based detector, a trellis for the ISI only is considered. However, both methods improve the ITI mitigation with the help of multi-track processing and iterative processing. Between them, the graph-based detection needs higher computational complexity than the Viterbi-based detection. However, the graph-based detection method provides a significant performance gain over the Viterbi-based detect on. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/ISPACS.2011.6146116 | Intelligent Signal Processing and Communications Systems |
Keywords | Field | DocType |
Viterbi detection,graph theory,intersymbol interference,iterative methods,magnetic recording,magnetic storage,2D interference bit patterned media channels,ISI,Viterbi-based detection,computational complexity,factor graph,graph-based detection method,intersymbol interference,iterative processing,magnetic data storage media recording,multitrack processing,reduced complexity 2D detection method,Bit patterned media (BPM),Viterbi detector,graph-based detector,inter-track interference,multi-track detection | Intersymbol interference,Computer science,Theoretical computer science,Artificial intelligence,Detector,Viterbi algorithm,Factor graph,Graph theory,Computer vision,Iterative method,Soft output Viterbi algorithm,Algorithm,Computational complexity theory | Conference |
ISBN | Citations | PageRank |
978-1-4577-2165-6 | 0 | 0.34 |
References | Authors | |
2 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lin Min Min Myint | 1 | 1 | 1.42 |
Pornchai Supnithi | 2 | 12 | 6.12 |