.png){kind=icon}
返回
Reduced Complexity Path Selection Networks for M-Algorithm Read Channel Detectors
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSI.2008.920110.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The M-algorithm is a reduced complexity, breadth-first, trellis search alternative to the Viterbi algorithm. It is particularly useful when the number of trellis states is so large as to render Viterbi detection impractical. When dealing with complex or long target responses, values of M >= 16 may be required in order to approach MLD performance. Performing path selection for M >= 16 using previously reported methods can be computationally complex and prohibitive to practical hardware implementation. This paper details reduced complexity path selection networks for use with large values of M. A strategy for the construction of reduced complexity networks is presented and can be used to create networks for a variety of values of M and for other applications where M-algorithm detection can be employed. The use of these networks will allow for practical realisable hardware implementations of M-algorithm detectors for M >= 16.
Keyword:
Magnetic storage
M-algorithm
read channel detectors
sorting networks
Viterbi detection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.2
论文数:
9.8K
被引数:
2.2W
机构
引用论文
.png){kind=icon}
FPGA design and implementation of a low-power Systolic array-based adaptive viterbi decoder低功耗脉动阵列自适应viterbi译码器的FPGA设计与实现
PREAI
分享收藏
查看更多内容