US4870414A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Even mark modulation coding method
Assignee: International Business Machines Corp
•
Filing: 1988-03-18
•
Granted: 1989-09-26
•
Expires: 2008-03-18
Abstract
Abstract A method termed Even Mark Modulation (EMM) is disclosed for coding input strings for input-restricted (1+D) or (1+D) 2 partial response channels that require at least one pair of consecutive signals of one state in order to record or transmit data to a receiving device. EMM provides improved coding gains and is especially suitable for optical recording. An input string is encoded into a binary code string in which all one-state signals (e.g., "1's") are in the form of runs of at least one contiguous pair; however, signals of an opposite state (e.g., "0's") may be of any length or duration. The EMM signals are detected with a maximum likelihood detector using an algorithm based on a three-state trellis structure for (1+D) channels and a five-state trellis structure for (1+D) 2 channels adapted to the particular partial response channel. In a preferred embodiment, the coding rate is 2/3 and the coding gain is at least 3 dB unnormalized and at least 2.2 dB when normalized. A finite-state encoder and sliding block decoder are disclosed, together with logic equations for encoder and decoder circuits.
Inventors
- 👤 Razmik Karabed
- 👤 Paul H. Siegel
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 16:08
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/10009; H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908; H04L25/497
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
115 words
A method for coding input strings for a binary (1+D) or (1+D) 2 partial response channel that requires at least two consecutive signals of one state in order to record or transmit data to a receiving device, comprising the steps of: encoding an input string into a binary code string according to an even mark modulation (EMM) constraint in which all one-state signals are in pairs, and signals of an opposite state need not be in pairs; for a (1+D) partial response channel, using a maximum liklihood detection algorithm based upon a three-state trellis structure; and for a (1+D) 2 partial response channel, using a maximum likelihood detection algorithm based upon a five-state trellis structure.
Claim 2
Independent Claim
115 words
A method for coding input strings for a binary (1+D) or (1+D) 2 partial response channel that requires at least two consecutive signals of one state in order to record or transmit data to a receiving device, comprising the steps of: encoding an input string into a binary code string according to an even mark modulation (EMM) constraint in which all one-state signals are in pairs, and signals of an opposite state need not be in pairs; for a (1+D) partial response channel, using a maximum liklihood detection algorithm based upon a three-state trellis structure; and for a (1+D) 2 partial response channel, using a maximum likelihood detection algorithm based upon a five-state trellis structure.
Claim 3
Dependent Claim
19 words
The method according to claim 1, wherein said one-state signals are in runs of a plurality of contiguous pairs.
Claim 4
Dependent Claim
34 words
The method of claim 1, wherein the maximum run of consecutive one-state state signals is limited to eliminate sequences that require unbounded path memory in a maximum likelihood detection algorithm to achieve optimal detection.
Claim 5
Dependent Claim
23 words
The method of claim 1, wherein the three-state trellis structure incorporates a difference metric calculation to obviate the need for renormalization of metrics.
Claim 6
Dependent Claim
23 words
The method of claim 1, wherein the three-state trellis structure incorporates a difference metric calculation to obviate the need for renormalization of metrics.
Claim 7
Dependent Claim
33 words
The method of claim 1, wherein the signals of opposite state are in runs of limited length to improve timing and gain control by limiting the maximum run of consecutive channel output values.
Claim 8
Dependent Claim
20 words
The method of claim 1, wherein signals of said opposite state may be in runs of any length or duration.
Claim 9
Dependent Claim
25 words
The method of claim 1, wherein the binary code has an unnormalized coding gain of at least 3 dB with respect to the uncoded channel.
Claim 10
Dependent Claim
15 words
The method of claim 1, wherein the binary code has a coding rate of 2/3.
Claim 11
Dependent Claim
16 words
The method of claim 3, wherein the maximum run of one-state signals is six consecutive pairs.
Claim 12
Dependent Claim
39 words
The method of claim 1, including the further steps of: supplying to the channel the binary code string satisfying the EMM constraint; generating a channel output sequence; and detecting a most probable EMM sequence from the channel output sequence.
Claim 13
Dependent Claim
22 words
The method of claim 11, including the further step of decoding the most probable EMM sequence for generating EMM code output data.
Claim 14
Dependent Claim
23 words
The method of claim 11, wherein there are no more than eight consecutive signals of said oppsite state in the channel output sequence.
References Cited (Backward Citations)
US3995264A
Cited
US4413251A
Cited
US4502036A
Cited
US4488142A
Cited
US4609907A
Cited
US4688016A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-09-25 | 1993-03-27 | 1993-09-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-09-25 | 1997-03-27 | 1997-09-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-09-25 | 2001-03-27 | 2001-09-26 | $7700.00 | Window Closed / Lapsed |