U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Coding/decoding method and apparatus therefor

Patent 5486828 Issued on January 23, 1996. Estimated Expiration Date: Icon_subject December 17, 2013. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Sequential encoding and decoding of variable word length, fixed rate data codes
Patent #: 4115768
Issued on: 09/19/1978
Inventor: Eggenberger ,   et al.

4-Pixel run-length code for data compression
Patent #: 4494151
Issued on: 01/15/1985
Inventor: Liao

Method and apparatus for encoding a binary data stream into a binary code stream
Patent #: 4553131
Issued on: 11/12/1985
Inventor: Endoh

Method and apparatus for encoding binary data
Patent #: 4728929
Issued on: 03/01/1988
Inventor: Tanaka

Method and apparatus for converting a run length limited code
Patent #: 4760378
Issued on: 07/26/1988
Inventor: Iketani ,   et al.

Code conversion apparatus
Patent #: 4833470
Issued on: 05/23/1989
Inventor: Iketani

Information data recovering apparatus
Patent #: 4860324
Issued on: 08/22/1989
Inventor: Satomura

Modified sliding block code for limiting error propagation
Patent #: 4882583
Issued on: 11/21/1989
Inventor: Dimitri, et al.

Mechanical scarfing apparatus Patent #: 4987700
Issued on: 01/29/1991
Inventor: Westerman, et al.

Inventor

Assignee

Application

No. 169539 filed on 12/17/1993

US Classes:

341/59, To or from run length limited codes341/95, Byte length changed360/40In specific code or form

Examiners

Primary: Hoff, Marc S.

Attorney, Agent or Firm

International Class

H03M 007/00

Foreign Application Priority Data

1989-04-06 JP

Abstract

A coding method and apparatus convert a data word of m×r bits into a code word of n×r bits (m<n) with regard to a predetermined number r. The basic data word length m is made two or three bits, basic code word length n is made five bits and the predetermined number r satisfies the relation 1ࣘrࣘ4 or 1ࣘrࣘ2 respectively, the data word of m×r bits is converted into a code word of 5r bits, and coding is performed in such a manner that the run number of "0"s is greater than four and less than 19, or greater than one and less than five respectively. Further, a decoding method and apparatus decode perform decoding in accordance with the logical expressionsY1 =X13 +X14 ⋅(X19 +X20)+X9 ⋅X10 ⋅X15 +X9 ⋅X10 ⋅X11 ⋅X12 ⋅X13 ⋅14 +(X4 +X5)⋅X10 ⋅X15Y2 =X12 +X13 +X14 +X15 +X4 ⋅(X9 ⋅X14 +X10)⋅X15where X1 -X20 represents the bit series of a code word coded in such a manner that a data word of 2×γ bits is converted into a code word of 5×γ bits, where basic data word length m of a digital signal is two bits, basic code word length n is five bits and γ is an integer, and such that a run length of "0"s between a "1" and a "1" of a binary code word pattern obtained by interconnecting the code words following conversion is greater than 4, and γ satisfies the relation 1 ࣘγࣘ3, Y1, Y2 represent a bit series of a decoded data word, and X indicates the inverted value of a bit.

PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?