US4728929A — Method and apparatus for encoding binary data

Claim 1

Independent Claim 237 words

An apparatus for encoding binary data comprising: a converting means for converting binary data words each containing N data bits (wherein N is an integer larger than (1) to binary channel words each containing M data bits (wherein M is an integer larger than N); and an NRZI modulating means for modulating said channel words into NRZI coded channel codes, wherein said converting means holds a specific data word which satisfies at least one of a condition that the specific data word has a specific bit pattern and a condition that the specific data word has a specific relationship to adjacent data words; converts said held specific data word to an established channel word so that absolute value of digital sum variation of previously encoded binary data is reduced when another specific data word which satisfies at least one of said conditions 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, and wherein, if a predetermined number of data words which are convertible to channel words in real time have been inputted before said another specific data word is inputted, said converting means converts said held specific data to said established channel word so that absolute value of digital sum variation of previously encoded binary data is reduced when said predetermined number of data words have been inputted.

Claim 2

Independent Claim 237 words

An apparatus for encoding binary data comprising: a converting means for converting binary data words each containing N data bits (wherein N is an integer larger than (1) to binary channel words each containing M data bits (wherein M is an integer larger than N); and an NRZI modulating means for modulating said channel words into NRZI coded channel codes, wherein said converting means holds a specific data word which satisfies at least one of a condition that the specific data word has a specific bit pattern and a condition that the specific data word has a specific relationship to adjacent data words; converts said held specific data word to an established channel word so that absolute value of digital sum variation of previously encoded binary data is reduced when another specific data word which satisfies at least one of said conditions 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, and wherein, if a predetermined number of data words which are convertible to channel words in real time have been inputted before said another specific data word is inputted, said converting means converts said held specific data to said established channel word so that absolute value of digital sum variation of previously encoded binary data is reduced when said predetermined number of data words have been inputted.

Claim 3

Dependent Claim 39 words

An 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 51 words

An apparatus according to claim 1, wherein said converting means has means for generating random data which circulates in synchronism with input data words, and a means for scrambling said random data with said input data words such that output data of said scrambling means are converted to said channel words.

Claim 5

Dependent Claim 158 words

An 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) a 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 is reduced when a which is three bits before said merging bits 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 189 words

An 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) a 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 is reduced when a bit which is three bits before 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 is reduced.

Claim 7

Dependent Claim 87 words

An 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 a 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 100 words

An apparatus according to claim 1, wherein said converting means comprises: a data word storage memory for storing said data words and their attributes; a 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 a 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 244 words

A method for encoding binary data into NRZI codes comprising the steps of: converting binary data words each containing N data bits (wherein N is an integer larger than 1) into binary channel words each containing M data bits (wherein M is an integer larger than N); and NRZI modulating said channel words into NRZI coded channel codes, wherein said converting step comprises the steps of: holding a specific data word which satisfies at least one of a condition that the specific data word has a specific bit pattern and a condition that the specific data word has a specific relationship to adjacent data words; converting said held specific data word to an established channel word so that absolute value of digital sum variation of previously encoded binary data is reduced when another specific data word which satisfies at least one of said conditions 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, and wherein, if a predetermined number of data words which are convertible to channel words in real time have been inputted before said another specific data word is inputted, said step of converting said held specific data converts said held specific data to said established channel word so that absolute value of digital sum variation of previously encoded binary data is reduced when said predetermined number of data words have been inputted.

Claim 10

Independent Claim 244 words

A method for encoding binary data into NRZI codes comprising the steps of: converting binary data words each containing N data bits (wherein N is an integer larger than 1) into binary channel words each containing M data bits (wherein M is an integer larger than N); and NRZI modulating said channel words into NRZI coded channel codes, wherein said converting step comprises the steps of: holding a specific data word which satisfies at least one of a condition that the specific data word has a specific bit pattern and a condition that the specific data word has a specific relationship to adjacent data words; converting said held specific data word to an established channel word so that absolute value of digital sum variation of previously encoded binary data is reduced when another specific data word which satisfies at least one of said conditions 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, and wherein, if a predetermined number of data words which are convertible to channel words in real time have been inputted before said another specific data word is inputted, said step of converting said held specific data converts said held specific data to said established channel word so that absolute value of digital sum variation of previously encoded binary data is reduced when said predetermined number of data words have been inputted.

Claim 11

Dependent Claim 39 words

A 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 166 words

A 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) a most significant bit or least significant bit of each channel word is made normally `0` as a merging bit, and when bits adajcent 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 of DSV is reduced when a bit which is three bits before 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 186 words

A 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 contains two or more `1` bits; (ii) a 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 is reduced when a bit which is three bits before said merging bit is `1` and two bits following 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 is reduced.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1991-03-01	1991-08-31	1992-03-01	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1995-03-01	1995-08-31	1996-03-01	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	1999-03-01	1999-08-31	2000-03-01	$7700.00	Window Closed / Lapsed

Method and apparatus for encoding binary data

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag