US5517323A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Facsimile data transmission over a low data rate network with fill bit removal and reinsertion
Assignee: Qualcomm Inc
•
Filing: 1995-06-07
•
Granted: 1996-05-14
•
Expires: 2015-06-07
Abstract
Abstract System and method for minimizing data bottlenecks in Low Data Rate Networks (LDRNs) that communicate facsimile transmissions. An LDRN is a facsimile network having a transmission data rate less than the data rate of the FAX machines serviced by the network. The system and method can be implemented in any type of LDRN, including analog and digital wired LDRNs, as well as analog and digital wireless (e.g., cellular) LDRNs. The system and method involve processing the facsimile transmissions in order to make the data rates of the LDRN and the FAX machines compatible, thereby minimizing any potential facsimile data bottlenecks that may occur in the LDRN due to its slower data rate.
Inventors
- 👤 David S. Propach
- 👤 Matthew S. Grob
- 👤 Paul E. Jacobs
- 👤 Gadi Karmi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 20:31
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/32; H04N1/32609; H04N1/32625; H04N1/32641; H04N1/32614; H04N1/32619; H04N1/32646; H04N1/32683; H04N1/327; H04N1/32795; H04N1/333; H04N1/33307; H04N1/33323; H04N1/33376; H04N1/41; H04N1/411; H04N2201/00; H04N2201/32; H04N2201/333; H04N2201/33307; H04N2201/33342; H04N2201/33357; H04N2201/33378; H04N2201/33385
Claims Analysis
Total Claims: 3
Claim 1
Independent Claim
235 words
A method for minimizing a data bottleneck in a Low Data Rate Network (LDRN), said LDRN having a first side and a second side, said LDRN being coupled to a first facsimile (FAX) machine and a second FAX machine, said first and second FAX machines being capable of negotiating a value corresponding to a Minimum Scan Line Time (MSLT), said method comprising: scanning and encoding a data stream into a plurality of data lines using said first FAX machine; processing said scanned and encoded data stream, including inserting at least one fill bit into each of said plurality of data lines having a bit value (L line ) less than said MSLT value, whereby said bit value for each of said plurality of data lines of said processed data equals or exceeds said MSLT value; transmitting said processed data from said first FAX machine to said first side of said LDRN at a fax transmission data rate R fax ; second processing said transmitted data, including removing from each of said inserted data lines said at least one fill bit; second transmitting said second processed data from said first to said second side of said LDRN; third processing said second transmitted data, including reinserting into each of said data lines said at least one fill bit; and third transmitting said third processed data from said second side of said LDRN to said second FAX machine.
Claim 2
Independent Claim
235 words
A method for minimizing a data bottleneck in a Low Data Rate Network (LDRN), said LDRN having a first side and a second side, said LDRN being coupled to a first facsimile (FAX) machine and a second FAX machine, said first and second FAX machines being capable of negotiating a value corresponding to a Minimum Scan Line Time (MSLT), said method comprising: scanning and encoding a data stream into a plurality of data lines using said first FAX machine; processing said scanned and encoded data stream, including inserting at least one fill bit into each of said plurality of data lines having a bit value (L line ) less than said MSLT value, whereby said bit value for each of said plurality of data lines of said processed data equals or exceeds said MSLT value; transmitting said processed data from said first FAX machine to said first side of said LDRN at a fax transmission data rate R fax ; second processing said transmitted data, including removing from each of said inserted data lines said at least one fill bit; second transmitting said second processed data from said first to said second side of said LDRN; third processing said second transmitted data, including reinserting into each of said data lines said at least one fill bit; and third transmitting said third processed data from said second side of said LDRN to said second FAX machine.
Claim 3
Dependent Claim
81 words
The method recited in claim 1, further comprising determining whether to perform the third processing step, the determining step including the following subsets: calculating, for each of the second transmitted data lines, a transmit time (T line ) according to the following equation: T.sub.line =L.sub.line /R.sub.fax, wherein R fax is said fax transmission data rate; comparing, for each of the second transmitted data lines, T line to MSLT; and if T line is less than MSLT, performing the third processing step.
References Cited (Backward Citations)
US4131915A
Cited
US4386373A
Cited
US4549221A
Cited
US4549297A
Cited
US4677649A
Cited
US4586088A
Cited
US4775893A
Cited
US4841526A
Cited
EP0532130A2
Cited
US4719514A
Cited
US4691314A
Cited
US5159465A
Cited
US5077742A
Cited
EP0333159A2
Cited
US5001571A
Cited
US5105423A
Cited
EP0448405A2
Cited
US5374998A
Cited
WO1992002100A1
Cited
EP0507439A2
Cited
WO1993012608A1
Cited
EP0625841A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-05-14 | 1999-11-13 | 2000-05-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-05-14 | 2003-11-13 | 2004-05-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-05-14 | 2007-11-13 | 2008-05-14 | $7700.00 | Window Closed / Lapsed |