US4881224A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Framing algorithm for bit interleaved time division multiplexer
Assignee: General Datacomm Inc
•
Filing: 1988-10-19
•
Granted: 1989-11-14
•
Expires: 2008-10-19
Abstract
Abstract Methods are provided for multiplexing a plurality of channels on to a sub-aggregate of an aggregate line so as to substantially minimize total frame length. In a preferred method, channel data rates are expressed as a sum of a plurality of predetermined subchannel data rates, and the number of times each predetermined subchannel data rate is used to express a channel data rate of a channel to be multiplexed is accumulated. Given a predetermined primary frame rate (P) such as 8Khz for a DACs compatible multiplexer, and a tertiary frame rate (T) chosen as the greatest common denominator of the subchannel data rates, an optimal secondary frame rate (S) may be found by minimizing for a plurality of different secondary frame rates the sum of (P/S) F1 plus (S/T)F2, where F1 represents the number of calls of the primary frame to the secondary frame, and F2 represents the number of calls of the secondary frame to the tertiary frame. Where different primary frame rates may be used, the sum of (A/P) plus (P/S)F1 plus (S/T)F2 is minimized to find primary and secondary frame rates which will permit an optimally small total frame length, given the sub-aggregate rate A.
Inventors
- 👤 Kuldip S. Bains
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 22:37
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/16; H04J3/1605; H04J3/1623; H04J3/1629
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
201 words
A method for determining optimal frame rates so that a plurality of channels are efficiently multiplexed onto a sub-aggregate of an aggregate line, comprising: (a) obtaining data rates of said channels, and expressing each of said channel data rates as a sum of a plurality of predetermined subchannel dates rates; (b) accumulating the number of times each predetermined subchannel date rate is used to express said channel data rates over said plurality of channels, wherein a greatest common denominator of said predetermined subchannel data rates having an accumulated positive number is chosen as a tertiary frame rate (T); and (c) given a predetermined sub-aggergate rate (A) and said channel data rates expressed as a sum of a plurality of predetermined subchannel date rates, determining suitable primary (P) and secondary (S) frame rates by finding and minimizing for a plurality of primary and secondary frame rates a sum of (1) A/P, (2) (P/S)F1 where F1 represents a number of calls of a primary frame of frame rate P to a secondary frame of frame rate S, and (3) (S/T)F2 where F2 represents a number of calls of said secondary frame of frame rate S to a tertiray frame of frame rate T.
Claim 2
Independent Claim
201 words
A method for determining optimal frame rates so that a plurality of channels are efficiently multiplexed onto a sub-aggregate of an aggregate line, comprising: (a) obtaining data rates of said channels, and expressing each of said channel data rates as a sum of a plurality of predetermined subchannel dates rates; (b) accumulating the number of times each predetermined subchannel date rate is used to express said channel data rates over said plurality of channels, wherein a greatest common denominator of said predetermined subchannel data rates having an accumulated positive number is chosen as a tertiary frame rate (T); and (c) given a predetermined sub-aggergate rate (A) and said channel data rates expressed as a sum of a plurality of predetermined subchannel date rates, determining suitable primary (P) and secondary (S) frame rates by finding and minimizing for a plurality of primary and secondary frame rates a sum of (1) A/P, (2) (P/S)F1 where F1 represents a number of calls of a primary frame of frame rate P to a secondary frame of frame rate S, and (3) (S/T)F2 where F2 represents a number of calls of said secondary frame of frame rate S to a tertiray frame of frame rate T.
Claim 3
Dependent Claim
51 words
A method according to claim 1, wherein: said predetermined subchannel data rates are all chosen from a family of rates chosen from one of the families 25 times 2 to the n power Hz, 75 times 2 to the n power Hz, and 125 times 2 to the n power Hz.
Claim 4
Dependent Claim
48 words
A method according to claim 1, wherein: said predetermined subchannel data rates are chosen from at least one family of rates chosen from 25 times 2 to the n power Hz, 75 times 2 to the n power Hz, and 125 times 2 to the n power Hz.
Claim 5
Dependent Claim
56 words
A method according to claim 1, further comprising: (d) summing said data rates of said channels to provide a total rate sum; and (e) subtracting said total rate sum from said sub-aggregate rate and expressing a positive difference as unused bandwidth, wherein said unused bandwidth is thereafter treated as any other of said plurality of channels.
Claim 6
Dependent Claim
75 words
A method according to claim 1, further comprising: (d) finding an odd channel whose rate cannot be expressed as a sum of said plurality of predetermined subchannel data rates; and (e) allocating additional bandwidth to said odd channel so that said odd channel can be expressed as a sum of said plurality of predetermined subchannel data rates, wherein said odd channel with additional bandwidth is thereafter treated as any other of said plurality of channels.
Claim 7
Dependent Claim
56 words
A method according to claim 5, further comprising: (f) summing said data rates of said channels to provide a total rate sum; and (g) subtracting said total rate sum from said sub-aggregate rate and expressing a positive difference as unused bandwidth, wherein said unused bandwidth is thereafter treated as any other of said plurality of channels.
Claim 8
Dependent Claim
47 words
A method according to claim 6, wherein: said predetermined subchannel data rates are chosen from at least one family of rates chosen from 25 times 2 to the n power Hz, 75 times 2 to the n power Hz, and 125 times 2 to n power Hz.
Claim 9
Dependent Claim
68 words
A method according to claim 1, wherein: in finding and minimizing said sum of (1), (2), and (3), finding a local minimum of (2) plus (3) for each primary rate P, and comparing said local minima to provide a primary frame rate and a secondary frame rate which will require a minimum total frame length for primary, secondary, and tertiary frames required in multiplexing said plurality of channels.
Claim 10
Dependent Claim
245 words
A one pass method for determining optimal frame rates so that a plurality of channels are efficiently multiplexed onto a sub-aggregate of an arregate line comprising: (a) obtaining data rates of said channels, and expressing each of said channel data rates as a sum of a plurality of predetermined subchannel data rates; (b) accumulating the number of times each predetermined subchannel data rate is used to express said channel data rates over said plurality of channels, wherein a greatest common denominator of said predetermined subchannel data rates having an accumulated positive number is chosen as a tertiary frame rate (T); and (c) given a predetermined frame rate (P), and said channel data rates expressed as a sum of a plurality of predetermined subchannel date rates, determining an efficient secondary (S) frame rate by finding and minimizing for a plurality of secondary frame rates a sum of at least (1) ((P/S)+r)F1 where F1 represents a number of calls of a primary frame of frame rate P to a secondary frame of frame rate S and r is a variable chosen based on a method of storing framing information; and (2) ((S/T)+r)F2 where F2 represents a number of calls of said secondary frame of frame rate S to a tertiary frame of frame rate T which equals a sum of each predetermined subchannel data rate less than said secondary frame rate times respective accumulated numbers for each predetermined subchannel data rate divided by said secondary frame rate.
Claim 11
Dependent Claim
245 words
A one pass method for determining optimal frame rates so that a plurality of channels are efficiently multiplexed onto a sub-aggregate of an arregate line comprising: (a) obtaining data rates of said channels, and expressing each of said channel data rates as a sum of a plurality of predetermined subchannel data rates; (b) accumulating the number of times each predetermined subchannel data rate is used to express said channel data rates over said plurality of channels, wherein a greatest common denominator of said predetermined subchannel data rates having an accumulated positive number is chosen as a tertiary frame rate (T); and (c) given a predetermined frame rate (P), and said channel data rates expressed as a sum of a plurality of predetermined subchannel date rates, determining an efficient secondary (S) frame rate by finding and minimizing for a plurality of secondary frame rates a sum of at least (1) ((P/S)+r)F1 where F1 represents a number of calls of a primary frame of frame rate P to a secondary frame of frame rate S and r is a variable chosen based on a method of storing framing information; and (2) ((S/T)+r)F2 where F2 represents a number of calls of said secondary frame of frame rate S to a tertiary frame of frame rate T which equals a sum of each predetermined subchannel data rate less than said secondary frame rate times respective accumulated numbers for each predetermined subchannel data rate divided by said secondary frame rate.
Claim 12
Dependent Claim
19 words
A one pass method according to claim 9, wherein: said primary frame rate is chosen to be 8 Khz.
Claim 13
Dependent Claim
50 words
A one pass method according to claim 10, wherein: said predetermined subchannel data rates are chosen from at least one family of rates chosen from 25 times 2 to the n power Hz, 75 times 2 to the n power Hz, and 125 times 2 to the n power Hz.
Claim 14
Dependent Claim
56 words
A method according to claim 9, further comprising: (d) summing said data rates of said channels to provide a total rate sum; and (e) subtracting said total rate sum from said sub-aggregate rate and expressing a positive difference as unused bandwidth, wherein said unused bandwidth is thereafter treated as any other of said plurality of channels.
Claim 15
Dependent Claim
75 words
A method according to claim 9, further comprising: (d) finding an odd channel whose rate cannot be expressed as a sum of said plurality of predetermined subchannel date rates; and (e) allocating additional bandwidth to said odd channel so that said odd channel can be expressed as a sum of said plurality of predetermined subchannel date rates, wherein said odd channel with additional bandwidth is thereafter treated as any other of said plurality of channels.
Claim 16
Dependent Claim
56 words
A method according to claim 13, further comprising: (f) summing said data rates of said channels to provide a total rate sum; and (g) subtracting said total rate sum from said sub-aggregate rate and expressing a positive difference as unused bandwidth, wherein said unused bandwidth is thereafter treated as any other of said plurality of channels.
Claim 17
Dependent Claim
58 words
A method according to claim 14, wherein: said primary frame rate is chosen as 8 Khz, and said predetermined subchannel data rates are chosen from at least one family of rates chosen from 25 times 2 to the n power Hz, 75 times 2 to the n power Hz, and 125 times 2 to the n power Hz.
Claim 18
Dependent Claim
25 words
A method according to claim 9, wherein: in finding and minimizing said sum of (1) and (2), finding a local minimum of (1) plus (2).
Claim 19
Dependent Claim
12 words
A method according to claim 9, wherein: r is chosen as zero.
Claim 20
Dependent Claim
12 words
A method according to claim 9, wherein: r is chosen as one.
Claim 21
Independent Claim
261 words
A method for determining optimal frame rates so that a plurality of channels are efficiently multiplexed onto a sub-aggregate of an aggregate line, comprising: (a) obtaining data rates of said channels, and expressing each of said channel data rates as a sum of a plurality of predetermined subchannel data rates; (b) accumulating the number of times each predetermined subchannel data rate is used to express said channel data rates over said plurality of channels, wherein a greatest common denominator of said predetermined subchannel data rates having an accumulated positive number is chosen as a tertiary frame rate (T); (c) given a predetermined sub-aggregate rate (A) and said channel data rates expressed as a sum of a plurality of predetermined subchannel data rates, determining suitable primary (P) and secondary (S) frame rates by finding and minimizing for a plurality of primary and secondary frame rates a sum of (1) A/P, (2) ((P/S)+r)F1 where F1 represents a number of calls of a primary frame of frame rate P to a secondary frame of frame rate S and r is a variable based on a method of storing framing information, and (3) ((S/T)+r)F2 where F2 represents a number of calls of said secondary frame of frame rate S to a tertiary frame of frame rate T; (d) repeating steps (a)-(c) for at least one second plurality of predetermined subchannel rates including at least one different predetermined subchannel rate; and (e) comparing respective minimum sums determined at step (c) for said each plurality of predetermined subchannel rates to find a minimum of said minimum sums.
Claim 22
Independent Claim
261 words
A method for determining optimal frame rates so that a plurality of channels are efficiently multiplexed onto a sub-aggregate of an aggregate line, comprising: (a) obtaining data rates of said channels, and expressing each of said channel data rates as a sum of a plurality of predetermined subchannel data rates; (b) accumulating the number of times each predetermined subchannel data rate is used to express said channel data rates over said plurality of channels, wherein a greatest common denominator of said predetermined subchannel data rates having an accumulated positive number is chosen as a tertiary frame rate (T); (c) given a predetermined sub-aggregate rate (A) and said channel data rates expressed as a sum of a plurality of predetermined subchannel data rates, determining suitable primary (P) and secondary (S) frame rates by finding and minimizing for a plurality of primary and secondary frame rates a sum of (1) A/P, (2) ((P/S)+r)F1 where F1 represents a number of calls of a primary frame of frame rate P to a secondary frame of frame rate S and r is a variable based on a method of storing framing information, and (3) ((S/T)+r)F2 where F2 represents a number of calls of said secondary frame of frame rate S to a tertiary frame of frame rate T; (d) repeating steps (a)-(c) for at least one second plurality of predetermined subchannel rates including at least one different predetermined subchannel rate; and (e) comparing respective minimum sums determined at step (c) for said each plurality of predetermined subchannel rates to find a minimum of said minimum sums.
Claim 23
Dependent Claim
36 words
A method according to claim 19, wherein: in finding and minimizing said sum of (1) plus (2) plus (3) for each plurality of predetermined subchannel rates, finding a local minimum of (1) plus (2) plus (3).
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) | 1992-11-13 | 1993-05-15 | 1993-11-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-11-13 | 1997-05-15 | 1997-11-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-11-13 | 2001-05-15 | 2001-11-14 | $7700.00 | Window Closed / Lapsed |