Low-complexity Detection Techniques for High-Density DVD Systems 


Vol. 27,  No. 10, pp. 1000-1010, Oct.  2002


PDF
  Abstract

Partial response maximum-likelihood (PRML) and fixed-delay tree search with decision feedback (FDTS/DF)yield a sub-optimum performance in storage systems. However, they suffer from the inevitable complexity problems. This paper focuses on detection schemes to overcome the drawbacks of the sequence detections by exploiting minimum run-length d=2. It is expected that the proposed systems yield substantial reductions of both processing speed and receiver complexity. When combined with a decision feedback equalization (DFE), they prove to keep pace with the FDTS/DF with τ=2 and even outperform the PR(1111)ML at normalized density S>5.6.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Cho, C. Woo, M. Joo, C. Kang, D. Hong, "Low-complexity Detection Techniques for High-Density DVD Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 10, pp. 1000-1010, 2002. DOI: .

[ACM Style]

Han-gyu Cho, Choong-chae Woo, Man-sic Joo, Chang-eon Kang, and Dae-sik Hong. 2002. Low-complexity Detection Techniques for High-Density DVD Systems. The Journal of Korean Institute of Communications and Information Sciences, 27, 10, (2002), 1000-1010. DOI: .

[KICS Style]

Han-gyu Cho, Choong-chae Woo, Man-sic Joo, Chang-eon Kang, Dae-sik Hong, "Low-complexity Detection Techniques for High-Density DVD Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 10, pp. 1000-1010, 10. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880