Simplified signal space detector for optical recording

Han Gyu Cho; Choong Chae Woo; Dae Sik Hong

doi:10.1109/TMAG.2002.802703

Simplified signal space detector for optical recording

Han Gyu Cho, Choong Chae Woo, Dae Sik Hong

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

A signal space detector is a low-complexity approximation of fixed-delay tree search with decision feedback (FDTS/DF). This paper proposes the simplest version possible of a τ = 2 FDTS/DF for a minimum run-length constraint of d = 2. The hardware needs only two multiplications and additions, facilitating high data-rate/low-complexity implementations. Simulation results show that the performance of the proposed detector equals that of the τ = 2 FDTS/DF even when jitter noise is present. It is shown that for d = 2, a partial response maximum-likelihood detector with the target response ∑_k=0³ D^k outperforms one with (1 + D)³ because of good spectral matching at normalized density S ≥ 4.6.

Original language	English
Pages (from-to)	3566-3569
Number of pages	4
Journal	IEEE Transactions on Magnetics
Volume	38
Issue number	5 II
DOIs	https://doi.org/10.1109/TMAG.2002.802703
Publication status	Published - 2002 Sept

Bibliographical note

Funding Information:
Manuscript received December 3, 2001; revised May 1, 2002. This work was supported by the Korea Science and Engineering Foundation. The authors are with the Information and Telecommunication Lab, Department of Electrical and Electronic Engineering, Yonsei University, 120-749 Seoul, Korea. Digital Object Identifier 10.1109/TMAG.2002.802703.

All Science Journal Classification (ASJC) codes

Electronic, Optical and Magnetic Materials
Electrical and Electronic Engineering

Access to Document

10.1109/TMAG.2002.802703

Cite this

@article{6f9917e5baf14b78a6442903551f4eff,

title = "Simplified signal space detector for optical recording",

abstract = "A signal space detector is a low-complexity approximation of fixed-delay tree search with decision feedback (FDTS/DF). This paper proposes the simplest version possible of a τ = 2 FDTS/DF for a minimum run-length constraint of d = 2. The hardware needs only two multiplications and additions, facilitating high data-rate/low-complexity implementations. Simulation results show that the performance of the proposed detector equals that of the τ = 2 FDTS/DF even when jitter noise is present. It is shown that for d = 2, a partial response maximum-likelihood detector with the target response ∑k=03 Dk outperforms one with (1 + D)3 because of good spectral matching at normalized density S ≥ 4.6.",

author = "Cho, {Han Gyu} and Woo, {Choong Chae} and Hong, {Dae Sik}",

note = "Funding Information: Manuscript received December 3, 2001; revised May 1, 2002. This work was supported by the Korea Science and Engineering Foundation. The authors are with the Information and Telecommunication Lab, Department of Electrical and Electronic Engineering, Yonsei University, 120-749 Seoul, Korea. Digital Object Identifier 10.1109/TMAG.2002.802703.",

year = "2002",

month = sep,

doi = "10.1109/TMAG.2002.802703",

language = "English",

volume = "38",

pages = "3566--3569",

journal = "IEEE Transactions on Magnetics",

issn = "0018-9464",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5 II",

}

TY - JOUR

T1 - Simplified signal space detector for optical recording

AU - Cho, Han Gyu

AU - Woo, Choong Chae

AU - Hong, Dae Sik

N1 - Funding Information: Manuscript received December 3, 2001; revised May 1, 2002. This work was supported by the Korea Science and Engineering Foundation. The authors are with the Information and Telecommunication Lab, Department of Electrical and Electronic Engineering, Yonsei University, 120-749 Seoul, Korea. Digital Object Identifier 10.1109/TMAG.2002.802703.

PY - 2002/9

Y1 - 2002/9

N2 - A signal space detector is a low-complexity approximation of fixed-delay tree search with decision feedback (FDTS/DF). This paper proposes the simplest version possible of a τ = 2 FDTS/DF for a minimum run-length constraint of d = 2. The hardware needs only two multiplications and additions, facilitating high data-rate/low-complexity implementations. Simulation results show that the performance of the proposed detector equals that of the τ = 2 FDTS/DF even when jitter noise is present. It is shown that for d = 2, a partial response maximum-likelihood detector with the target response ∑k=03 Dk outperforms one with (1 + D)3 because of good spectral matching at normalized density S ≥ 4.6.

AB - A signal space detector is a low-complexity approximation of fixed-delay tree search with decision feedback (FDTS/DF). This paper proposes the simplest version possible of a τ = 2 FDTS/DF for a minimum run-length constraint of d = 2. The hardware needs only two multiplications and additions, facilitating high data-rate/low-complexity implementations. Simulation results show that the performance of the proposed detector equals that of the τ = 2 FDTS/DF even when jitter noise is present. It is shown that for d = 2, a partial response maximum-likelihood detector with the target response ∑k=03 Dk outperforms one with (1 + D)3 because of good spectral matching at normalized density S ≥ 4.6.

UR - http://www.scopus.com/inward/record.url?scp=0036756957&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036756957&partnerID=8YFLogxK

U2 - 10.1109/TMAG.2002.802703

DO - 10.1109/TMAG.2002.802703

M3 - Article

AN - SCOPUS:0036756957

SN - 0018-9464

VL - 38

SP - 3566

EP - 3569

JO - IEEE Transactions on Magnetics

JF - IEEE Transactions on Magnetics

IS - 5 II

ER -

Simplified signal space detector for optical recording

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this