Patent EP0178813A2 successfully refreshed from Google Patents.
EP0178813A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method and apparatus for encoding binary data
Assignee: Panasonic Holdings Corp
•
Filing: 1985-09-30
•
Granted: —
•
Expires: 2005-09-30
Abstract
Abstract Method and apparatus for encoding binary data. This method comprises the steps of converting data words each containing N data bits to channel words each containing M data bits, and producing NRZI code data from the channel words. In the converting step, a data word is not converted in real time when the data word has a specific data bit pattern or when the data word is in a specific relation to adjacent data words. This unconverted data word is converted to an established channel word which is so determined to reduce DSV at a time when a predetermined number of data words which are convertible in real time have been inputted or when another data word which should be maintained unconverted has been inputted again. The established channel word is outputted after at least a delay time which is required to convert the unconverted data word to the established channel word.
Inventors
- 👤 Shinichi Tanaka
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-07 23:18
CPC Classifications
H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
159 words
An apparatus for encoding binary data comprising: converting means for converting binary data words each containing N data bits (N is an integer larger than 1) to binary channel words each containing M data bits (M is an integer larger than N); and NRZI modulating means for modulating said channel words into NRZI coded channel codes, wherein said converting means holds a specific data word which has a specific bit pattern or has a specific relation to adjacent data words; converts said held specific data word to an established channel word so that digital sum variation of previously encoded binary data reduces when a predetermined number of data words which are convertable to channel words in real time have been inputted or when another specific data word which should be held has been inputted; and outputs said established channel word after at least a delay time required to convert said held specific data word to said established channel word.
Claim 2
Independent Claim
159 words
An apparatus for encoding binary data comprising: converting means for converting binary data words each containing N data bits (N is an integer larger than 1) to binary channel words each containing M data bits (M is an integer larger than N); and NRZI modulating means for modulating said channel words into NRZI coded channel codes, wherein said converting means holds a specific data word which has a specific bit pattern or has a specific relation to adjacent data words; converts said held specific data word to an established channel word so that digital sum variation of previously encoded binary data reduces when a predetermined number of data words which are convertable to channel words in real time have been inputted or when another specific data word which should be held has been inputted; and outputs said established channel word after at least a delay time required to convert said held specific data word to said established channel word.
Claim 3
Dependent Claim
39 words
The apparatus according to claim 1, wherein said specific data word corresponds to two channel words which differ from each other only in a specified data bit, and said established channel word is one of said two channel words.
Claim 4
Dependent Claim
48 words
The apparatus according to claim 1, wherein said converting means has means for generating random data which circulates in synchronization with input data words, and means for scrambling said random data with said input data words, output data of said scrambling means being converted to said channel words.
Claim 5
Dependent Claim
157 words
The apparatus according to claim 1, wherein said converting means performs conversion according to the following rules: (i) two or more '0' bits exist between two '1' bits in said channel word if said channel word contain two or more '1' bits; (ii) most significant bit or least significant bit of each channel word is made normally '0' as a merging bit, and when bits adjacent to said merging bit at both sides thereof are both '1' said adjacent bits are both made '0' and said merging bit is made '1'; and (iii) said merging bit is made '0' or '1' so that the absolute value of DSV reduces when a bit preceeding by three bit to said merging bit is '1' and said merging bit is followed by two continuous '0' bits or when two continuous bits just before said merging bit are both '0' and a bit three bits after said merging bit is '1'.
Claim 6
Dependent Claim
186 words
The apparatus according claim 1, wherein said conversion means performs conversion according to the following rules: (i) two or more '0' bits exist between two '1' bits in said channel word if said channel word contains two or more '1' bits; (ii) most significant bit or least significant bit of each channel word is made normally '0' as a merging bit, and when bits adjacent to said merging bit at both sides thereof are both '1' said adjacent bits are both made '0' and said merging bit is made '1'; (iii) said merging bit is made '0' or '1' so that the absolute value of DSV reduces when a bit preceeding by three bit to said merging bit is '1' and two bits following said merging bit are both '0' or when two bits just before said merging bit are both '0' and a bit three bits after said merging bit is '1'; and (iv) said specific data word is converted to one of two channel words which differ from each other only in one specific data bit so that the absolute value of DSV reduces.
Claim 7
Dependent Claim
86 words
The apparatus according to claim 1, wherein said converting means comprises: a converter for converting said data words to said channel words; a channel word storage memory for storing said channel words; a pointer register for storing an address in which a temporary channel word corresponding to said specific data word is stored in said memory; and means for writing said established channel word into said address stored in said pointer register in place of said temporary channel word when said established channel word is determined.
Claim 8
Dependent Claim
98 words
The apparatus according to claim 1, wherein said converting means comprises: a data word storage memory for storing said data words and their attributes; means for converting said data words stored in said memory to said channel words with reference to said attributes; a pointer register for storing an address in which said specific data word and its attribute are stored in said memory; and means for changing said attribute of said specific data word stored in said address stored in said pointer register so that said specific data word can be converted to said established channel word.
Claim 9
Independent Claim
162 words
A method for encoding binary data comprising the steps of: converting binary data words each containing N data bits (N is an integer larger than 1) to binary channel words each containing M data bits (M is an integer larger than N); and NRZI modulating means for modulating said channel words into NRZI coded channel codes, wherein said converting steps comprises the steps of: holding a specific data word which has a specific bit pattern or has a specific relation to adjacent data words; converting said held specific data word to an established channel word so that digital sum variation of previously encoded binary data reduces when a predetermined number.of data words which are convertable to channel words in real time have been inputted or when another specific data word which should be held has been inputted; and outputting said established channel word after at least a delay time required to convert said held specific data word to said established channel word.
Claim 10
Independent Claim
162 words
A method for encoding binary data comprising the steps of: converting binary data words each containing N data bits (N is an integer larger than 1) to binary channel words each containing M data bits (M is an integer larger than N); and NRZI modulating means for modulating said channel words into NRZI coded channel codes, wherein said converting steps comprises the steps of: holding a specific data word which has a specific bit pattern or has a specific relation to adjacent data words; converting said held specific data word to an established channel word so that digital sum variation of previously encoded binary data reduces when a predetermined number.of data words which are convertable to channel words in real time have been inputted or when another specific data word which should be held has been inputted; and outputting said established channel word after at least a delay time required to convert said held specific data word to said established channel word.
Claim 11
Dependent Claim
39 words
The method according to claim 8, wherein said specific data word corresponds to two channel words which differ from each other only in a specified data bit, and said established channel word is one of said two channel words.
Claim 12
Dependent Claim
165 words
The method according to claim 8, wherein said step for converting said data words to said channel words is performed according to the following rules: (i) two or more '0' bits exist between two '1' bits in said channel word if said channel word contain two or more '1' bits; (ii) most significant bit or least significant bit of each channel word is made normally '0' as a merging bit, and when bits adjacent to said merging bit at both sides thereof are both '1' said adjacent bits are both made '0' and said merging bit is made '1'; and (iu) said merging bit is made '0' or '1' so that the absolute value of DSV reduces when a bit preceeding by three bit to said merging bit is '1' and said merging bit is followed by two continuous '0' bits or when two continuous bits just before said merging bit are both '0' and a bit three bits after said merging bit is '1'.
Claim 13
Dependent Claim
194 words
The method according claim 8, wherein said step for converting said data words to said channel words is performed according to the following rules: (i) two or more '0' bits exist between two '1' bits in said channel word if said channel word contains two or more '1' bits; (ii) most significant bit or least significant bit of each channel word is made normally '0' as a merging bit, and when bits adjacent to said merging bit at both sides thereof are both '1' said adjacent bits are both made '0' and said merging bit is made '1'; (iii) said merging bit is made '0' or '1' so that the absolute value of DSV reduces when a bit preceeding by three bit to said merging bit is '1' and two bits following said merging bit are both '0' or when two bits just before said merging bit are both '0' and a bit three bits after said merging bit is '1'; and (iv) said specific data word is converted to one of two channel words which differ from each other only in one specific data bit so that the absolute value of DSV reduces.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.