Patent US5099237A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5099237A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for providing maximum rate modulation or compression encoding and decoding

Assignee: Research Corp Technologies Inc
•
Filing: 1990-07-10
•
Granted: 1992-03-24
•
Expires: 2010-07-10
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for providing maximum rate modulation or compression encoding and decoding for use with magnetic and optical recording and optical fiber communications is disclosed in which primarily two algorithms are utilized which satisfy the conditions that encoding and decoding require only a small constant number of elementary operations, without multiplications or divisions and that only a small amount of memory space for a small number of integers is required. Thus, the present invention operates with only linear time complexity and only linear memory complexity. The invention utilizes a direct enumeration algorithm to accomplish a mapping and an inverse enumeration algorithm to accomplish an inverse mapping back to enumeration.

Inventors

  • 👤 Boris Fitingof

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 21:44
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005; H; H03; H03M; H03M7/00; H03M7/30; H03M7/46

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 188 words
Apparatus for providing modulation decoding of a modulation encoded codeword having an L plurality of bits comprising: means for receiving each of said bits of said modulated encoded codeword for producing a signal representative of the state of each bit of at least one codeword; storage means connected to receive said signal representative of the state of each bit of said at least one codeword, as well as a signal representative of a number of such bits that have been processed, said storage means producing a signal representative of an element in a predetermined array of accumulated numbers held in said storage means; first adding means connected to receive said signal representative of an element in said predetermined array as well as each of the bits of said modulation encoded codeword; means for storing an output of said first adding means; means connecting an output of said means for storing to inputs of said first adding means; and means for receiving the output of said first adding means and said signal representative of the number of bits that have been processed, and outputting the desired modulation decoded codeword.
Claim 2
Dependent Claim 188 words
Apparatus for providing modulation decoding of a modulation encoded codeword having an L plurality of bits comprising: means for receiving each of said bits of said modulated encoded codeword for producing a signal representative of the state of each bit of at least one codeword; storage means connected to receive said signal representative of the state of each bit of said at least one codeword, as well as a signal representative of a number of such bits that have been processed, said storage means producing a signal representative of an element in a predetermined array of accumulated numbers held in said storage means; first adding means connected to receive said signal representative of an element in said predetermined array as well as each of the bits of said modulation encoded codeword; means for storing an output of said first adding means; means connecting an output of said means for storing to inputs of said first adding means; and means for receiving the output of said first adding means and said signal representative of the number of bits that have been processed, and outputting the desired modulation decoded codeword.
Claim 3
Dependent Claim 54 words
The apparatus of claim 1, further including second adding means adding said signal representative of an element in said predetermined array to a signal representative of the bit to which said signal representative of an element in said predetermined array corresponds and having an output connected to the inputs of said first adding means.
Claim 4
Dependent Claim 31 words
The apparatus of claim 2, wherein the output of said second adding means and the output of said means for storing are connected to adjacent inputs of said first adding means.
Claim 5
Dependent Claim 14 words
The apparatus of claim 1, wherein said first adding means comprises a parallel adder.
Claim 6
Dependent Claim 24 words
The apparatus cf claim 1, wherein said means for storing the output of said first adding means comprises a parallel load and clear register.
Claim 7
Dependent Claim 13 words
The apparatus of claim 1, wherein said storage means comprises a read-only memory.
Claim 8
Dependent Claim 249 words
Apparatus for providing encoding of a block of user data of length N, which block of user data is formed by a plurality of codewords each of length L, comprising: means for receiving bits of each of said codewords of said block of user data for producing a signal representative of the state of each bit of at least one codeword; storage means connected to receive said signal representative of the state of each bit of said at least one codeword, as well as a signal representative of the number of such bits that have been processed, said storage means producing a signal representative of an element in a predetermined array of accumulated numbers held in said storage means; first adding means connected to receive said signal representative of an element in said predetermined array; first means for storing connected to the output of said first adding means for storing and then outputting to said first adding means said stored output of said first adding means; second means for storing connected to receive each of said plurality of codewords which form said block of user data, as well as said signal representative of the number of bits that have been processed; and comparator means connected to receive the output from said first adding means and said second means for comparing said outputs and providing an encoded codeword whenever said output of said first adding means is less than or equal to the output of said second means for storing.
Claim 9
Dependent Claim 249 words
Apparatus for providing encoding of a block of user data of length N, which block of user data is formed by a plurality of codewords each of length L, comprising: means for receiving bits of each of said codewords of said block of user data for producing a signal representative of the state of each bit of at least one codeword; storage means connected to receive said signal representative of the state of each bit of said at least one codeword, as well as a signal representative of the number of such bits that have been processed, said storage means producing a signal representative of an element in a predetermined array of accumulated numbers held in said storage means; first adding means connected to receive said signal representative of an element in said predetermined array; first means for storing connected to the output of said first adding means for storing and then outputting to said first adding means said stored output of said first adding means; second means for storing connected to receive each of said plurality of codewords which form said block of user data, as well as said signal representative of the number of bits that have been processed; and comparator means connected to receive the output from said first adding means and said second means for comparing said outputs and providing an encoded codeword whenever said output of said first adding means is less than or equal to the output of said second means for storing.
Claim 10
Dependent Claim 14 words
The apparatus of claim 7, wherein said first adding means comprises a parallel adder.
Claim 11
Dependent Claim 18 words
The apparatus of claim 7, wherein said first and second storage means comprise parallel load and clear registers.
Claim 12
Dependent Claim 13 words
The apparatus of claim 7, wherein said storage means comprises a read-only memory.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-03-24 1995-09-23 1996-03-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-03-24 1999-09-23 2000-03-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-03-24 2003-09-23 2004-03-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag