(d, k/T) Constrained Partial Response Maximum Likelihood Codes

A new set of constrained codes, referred to as (d, k/l) constrained partial response maximum likelihood (PRML) codes, is proposed. These new constrained codes combine the benefits of both (d, k) run length limited codes and (0, k/l) PRML codes, with seemingly promising applications in PRML read chan...

Full description

Saved in:
Bibliographic Details
Main Authors: LI, Y. X., Subrahmanyam, J., DENG, Robert H.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 1995
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/162
http://dx.doi.org/10.1080/00207219508926136
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-1161
record_format dspace
spelling sg-smu-ink.sis_research-11612010-12-23T06:56:35Z (d, k/T) Constrained Partial Response Maximum Likelihood Codes LI, Y. X. Subrahmanyam, J. DENG, Robert H. A new set of constrained codes, referred to as (d, k/l) constrained partial response maximum likelihood (PRML) codes, is proposed. These new constrained codes combine the benefits of both (d, k) run length limited codes and (0, k/l) PRML codes, with seemingly promising applications in PRML read channels for today's head/media combinations, using thin-film media and inductive read heads. The rules for generating any (d, k/l) code are presented, the Shannon capacity is tabulated for the codes of practical interest with d= 1 and 2, and the encoding finite state transition diagram and state-independent decoder are designed for a rate 1/2, (1, 7/6) code. Some differences among (d, k) codes, (0, k/l) codes, (0, k/l/M) codes and (d, k/l) codes are also addressed. 1995-01-01T08:00:00Z text https://ink.library.smu.edu.sg/sis_research/162 info:doi/10.1080/00207219508926136 http://dx.doi.org/10.1080/00207219508926136 Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University CODING theory DECODERS (Electronics) Computer Sciences Information Security
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic CODING theory
DECODERS (Electronics)
Computer Sciences
Information Security
spellingShingle CODING theory
DECODERS (Electronics)
Computer Sciences
Information Security
LI, Y. X.
Subrahmanyam, J.
DENG, Robert H.
(d, k/T) Constrained Partial Response Maximum Likelihood Codes
description A new set of constrained codes, referred to as (d, k/l) constrained partial response maximum likelihood (PRML) codes, is proposed. These new constrained codes combine the benefits of both (d, k) run length limited codes and (0, k/l) PRML codes, with seemingly promising applications in PRML read channels for today's head/media combinations, using thin-film media and inductive read heads. The rules for generating any (d, k/l) code are presented, the Shannon capacity is tabulated for the codes of practical interest with d= 1 and 2, and the encoding finite state transition diagram and state-independent decoder are designed for a rate 1/2, (1, 7/6) code. Some differences among (d, k) codes, (0, k/l) codes, (0, k/l/M) codes and (d, k/l) codes are also addressed.
format text
author LI, Y. X.
Subrahmanyam, J.
DENG, Robert H.
author_facet LI, Y. X.
Subrahmanyam, J.
DENG, Robert H.
author_sort LI, Y. X.
title (d, k/T) Constrained Partial Response Maximum Likelihood Codes
title_short (d, k/T) Constrained Partial Response Maximum Likelihood Codes
title_full (d, k/T) Constrained Partial Response Maximum Likelihood Codes
title_fullStr (d, k/T) Constrained Partial Response Maximum Likelihood Codes
title_full_unstemmed (d, k/T) Constrained Partial Response Maximum Likelihood Codes
title_sort (d, k/t) constrained partial response maximum likelihood codes
publisher Institutional Knowledge at Singapore Management University
publishDate 1995
url https://ink.library.smu.edu.sg/sis_research/162
http://dx.doi.org/10.1080/00207219508926136
_version_ 1770568907337236480