§
Luxuse
Patent Intelligence
Sign In
← Back to Patent Explorer
US5539531A Expired / Lapsed US ⏱️ 0.0 years remaining

System and method for facsimile data transmission

Assignee: Qualcomm Inc
•
Filing: 1993-11-15
•
Granted: 1996-07-23
•
Expires: 2013-11-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

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-09 17:42
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: 9
Claim 1
Independent Claim 197 words
A method for minimizing a data bottleneck in a Low Data Rate Network(LDRN), said LDRN having an LDRN data rate (R LDRN ) and a data transmit buffer, said method comprising: transmitting a data stream from a facsimile (FAX) machine to said LDRN, said FAX machine having a FAX data rate (R fax ), said data stream being divided into a plurality of blocks, each of said plurality of blocks being divided into a plurality of frames, each of said plurality of flames having a flame data length (L frame ), and an amount of said data stream (L Bottleneck ) being stored in said data transmit buffer; and requesting said FAX machine to re-transmit at least one of said plurality of flames, a number of said plurality of frames to be retransmitted (N RETX .frames) being calculated as follows: N.sub.RETX-frames =INT[(T.sub.overhead +(L.sub.Bottleneck /R.sub.fax))/(L.sub.frame /R.sub.LDRN)], wherein T overhead =T request +T FAXsetup +T confirmation , T request being a time required to request said retransmission, T FAXsetup being a time for said FAX machine to setup for said retransmission, and T confirmation being a time to send a confirmation signal for said retransmission to the FAX machine.
Claim 2
Independent Claim 197 words
A method for minimizing a data bottleneck in a Low Data Rate Network(LDRN), said LDRN having an LDRN data rate (R LDRN ) and a data transmit buffer, said method comprising: transmitting a data stream from a facsimile (FAX) machine to said LDRN, said FAX machine having a FAX data rate (R fax ), said data stream being divided into a plurality of blocks, each of said plurality of blocks being divided into a plurality of frames, each of said plurality of flames having a flame data length (L frame ), and an amount of said data stream (L Bottleneck ) being stored in said data transmit buffer; and requesting said FAX machine to re-transmit at least one of said plurality of flames, a number of said plurality of frames to be retransmitted (N RETX .frames) being calculated as follows: N.sub.RETX-frames =INT[(T.sub.overhead +(L.sub.Bottleneck /R.sub.fax))/(L.sub.frame /R.sub.LDRN)], wherein T overhead =T request +T FAXsetup +T confirmation , T request being a time required to request said retransmission, T FAXsetup being a time for said FAX machine to setup for said retransmission, and T confirmation being a time to send a confirmation signal for said retransmission to the FAX machine.
Claim 3
Dependent Claim 115 words
The method recited in claim 1, further comprising: calculating, for each of the plurality of blocks, a frame value (N Bottleneck ) corresponding to a number of the plurality of frames that must be re-transmitted by the first Fax machine to allow L Bottleneck to equal zero, wherein N Bottleneck is calculated as follows: N.sub.Bottleneck =INT[(L.sub.Bottleneck /R.sub.fax)/(L.sub.frame /R.sub.LDRN)]; comparing, for each of the plurality of blocks, N Bottleneck to a fixed integer value (N min ); if N Bottleneck is greater than N min , performing the requesting step; and if N Bottleneck is less than or equal to N min , sending a confirmation signal to the FAX machine and bypassing the requesting step.
Claim 4
Independent Claim 129 words
A method for minimizing a data bottleneck in a Low Data Rate Network (LDRN), said LDRN having a data transmit buffer, said method comprising: transmitting a data stream from a facsimile (FAX) machine to said LDRN, said data stream being divided into a plurality of blocks, said plurality of blocks being divided into a plurality of frames, and an amount of said data stream (L Bottleneck ) being stored in said data transmit buffer; and requesting said FAX machine to re-transmit at least one of said plurality of frames, a number of said plurality of frames to be retransmitted being a function of L Bottleneck and creating a time delay sufficient to enable an amount of page data substantially equal to L Bottleneck to be sent over said LDRN.
Claim 5
Independent Claim 129 words
A method for minimizing a data bottleneck in a Low Data Rate Network (LDRN), said LDRN having a data transmit buffer, said method comprising: transmitting a data stream from a facsimile (FAX) machine to said LDRN, said data stream being divided into a plurality of blocks, said plurality of blocks being divided into a plurality of frames, and an amount of said data stream (L Bottleneck ) being stored in said data transmit buffer; and requesting said FAX machine to re-transmit at least one of said plurality of frames, a number of said plurality of frames to be retransmitted being a function of L Bottleneck and creating a time delay sufficient to enable an amount of page data substantially equal to L Bottleneck to be sent over said LDRN.
Claim 6
Dependent Claim 117 words
The method recited in claim 3 wherein each of the frames has a frame data length (L frame ), the LDRN has an LDRN data rate (R LDRN ), and the FAX machine has a FAX data rate (R fax ); wherein a number of the plurality of frames to be re-transmitted (N RETX-frames ) is determined as follows: N.sub.RETX-frames =INT[(T.sub.overhead +(L.sub.Bottleneck /R.sub.fax))/(L.sub.frame /R.sub.LDRN)]; and wherein T overhead =T request +T FAXsetup +T confirmation , T request being a time required to request said retransmission, T FAXsetup being a time for said FAX machine to setup for said retransmission, and T confirmation being a time to send a confirmation signal for said retransmission to the FAX machine.
Claim 7
Independent Claim 220 words
A method for minimizing a data bottleneck in a Low Data Rate Network (LDRN), said LDRN having an LDRN data rate (R LDRN ) and a data transmit buffer, said method comprising: transmitting a data stream from a first facsimile (FAX) machine to said LDRN, said first FAX machine having a FAX data rate (R fax ), said data stream being divided into a plurality of blocks, each of said plurality of blocks being divided into a plurality of frames, each of said plurality of frames having a framed data length (L frame ); storing an amount of said data stream (L Bottleneck ) corresponding to said data bottleneck in said data transmit buffer while said data stream is being transmitted over the LDRN to a second FAX machine; and requesting said first FAX machine to re-transmit at least one of said plurality of frames, a number of said plurality of frames to be retransmitted (N RETX ,frames) being calculated as follows: N.sub.RETX-frames =INT[(T.sub.overhead +(L.sub.Bottleneck /R.sub.fax))/(L.sub.frame /R.sub.LDRN)], wherein T overhead =T request +T FAXsetup +T confirmation , T request being a time required to request said retransmission, T FAXsetup being a time for said FAX machine to setup for said retransmission, and T confirmation being a time to send a confirmation signal for said retransmission to said first FAX machine.
Claim 8
Independent Claim 220 words
A method for minimizing a data bottleneck in a Low Data Rate Network (LDRN), said LDRN having an LDRN data rate (R LDRN ) and a data transmit buffer, said method comprising: transmitting a data stream from a first facsimile (FAX) machine to said LDRN, said first FAX machine having a FAX data rate (R fax ), said data stream being divided into a plurality of blocks, each of said plurality of blocks being divided into a plurality of frames, each of said plurality of frames having a framed data length (L frame ); storing an amount of said data stream (L Bottleneck ) corresponding to said data bottleneck in said data transmit buffer while said data stream is being transmitted over the LDRN to a second FAX machine; and requesting said first FAX machine to re-transmit at least one of said plurality of frames, a number of said plurality of frames to be retransmitted (N RETX ,frames) being calculated as follows: N.sub.RETX-frames =INT[(T.sub.overhead +(L.sub.Bottleneck /R.sub.fax))/(L.sub.frame /R.sub.LDRN)], wherein T overhead =T request +T FAXsetup +T confirmation , T request being a time required to request said retransmission, T FAXsetup being a time for said FAX machine to setup for said retransmission, and T confirmation being a time to send a confirmation signal for said retransmission to said first FAX machine.
Claim 9
Dependent Claim 40 words
The method recited in claim 5 wherein the LDRN is a digital wireless network including a first and a second modem, said first modem communicating with the first FAX machine, and said second modem communicating with the second FAX machine.

References Cited (Backward Citations)

US4549297A Cited
US4677649A Cited
US4775893A Cited
US4841526A Cited
EP0532130A2 Cited
US4719514A Cited
US4691314A Cited
US5159465A Cited
US5077742A Cited
EP0333159A2 Cited
US5001571A Cited
US5105423A Cited
EP0448405A2 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-07-23 2000-01-22 2000-07-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-07-23 2004-01-22 2004-07-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-07-23 2008-01-22 2008-07-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag