US4101934A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Coding system
Assignee: Olympus Corp
•
Filing: 1976-11-15
•
Granted: 1978-07-18
•
Expires: 1996-11-15
Abstract
Abstract A coding system for effecting band compression transmission of a binary signal such as a facsimile picture signal is disclosed. The coding system is characterized by converting each block of that binary coded m-ary digit which is associated with a length composed of a train of "0" of a binary signal into a code word having that order which corresponds to an original order of the m-ary digit which means the block in one of two groups and converting each block of that binary coded digit which is associated with a length composed of a train of "1" of said binary signal into a code word having that order which corresponds to the original order of the m-ary digit which means the block in another group.
Inventors
- 👤 Kenji Fukuoka
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 03:26
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/419
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
264 words
A coding method comprising forming an assembly of code words prepared by converting a length composed of a train of "0" and a length composed of a train of "1" into a binary coded m-ary digit composed of m original elements each represented by a binary code including n bits, said "0" and "1" being a binary signal of facsimile to be coded, dividing said binary coded m-ary digit code into blocks each including n bits, said blocks each including an original unit, selecting 2m code words without permitting any overlap thereof from an original set of binary code words having a given length of at least n+1 bits, dividing said 2m code words into two groups each including m code words, bringing the number of "0" constituting all of the code words belonging to each group into agreement with the number of "1" thereof, and arranging in order each of the code words belonging to each group, said coding method further comprising converting each block of that binary coded m-ary digit which is associated with said length composed of a train of "0" of said binary signal into a code word having that order which corresponds to the original order of the m-ary digit which means said block in one of said groups and converting each block of that binary coded m-ary digit which is associated with said length composed of a train of "1" of said binary signal into a code word having that order which corresponds to said original order of the m-ary digit which means said block in another group.
Claim 2
Dependent Claim
264 words
A coding method comprising forming an assembly of code words prepared by converting a length composed of a train of "0" and a length composed of a train of "1" into a binary coded m-ary digit composed of m original elements each represented by a binary code including n bits, said "0" and "1" being a binary signal of facsimile to be coded, dividing said binary coded m-ary digit code into blocks each including n bits, said blocks each including an original unit, selecting 2m code words without permitting any overlap thereof from an original set of binary code words having a given length of at least n+1 bits, dividing said 2m code words into two groups each including m code words, bringing the number of "0" constituting all of the code words belonging to each group into agreement with the number of "1" thereof, and arranging in order each of the code words belonging to each group, said coding method further comprising converting each block of that binary coded m-ary digit which is associated with said length composed of a train of "0" of said binary signal into a code word having that order which corresponds to the original order of the m-ary digit which means said block in one of said groups and converting each block of that binary coded m-ary digit which is associated with said length composed of a train of "1" of said binary signal into a code word having that order which corresponds to said original order of the m-ary digit which means said block in another group.
Claim 3
Dependent Claim
27 words
A coding method as claimed in claim 1, wherein those code words which are in the same order in said two groups are complementary with each other.
Claim 4
Dependent Claim
135 words
A coding method as claimed in claim 1, wherein a coded binary signal is decoded by converting inversely each code word of said binary signal to obtain a block composed of information representing a group to which belongs said code word and said binary coded m-ary digit which corresponds to the order of said code word, making continuous each block thus obtained for the same group on the basis of that information which represents said group thus converting into a binary coded m-ary digit code which represents a length composed of a train of "0" or a length composed of a train of "1" and converting that numerical value which represents said binary coded m-ary digit code into said length composed of a train of "0" or said length composed of a train of "1".
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1981-07-17 | 1982-01-16 | 1982-07-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-07-17 | 1986-01-16 | 1986-07-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-07-17 | 1990-01-16 | 1990-07-18 | $7700.00 | Window Closed / Lapsed |