US5509017A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Process for simultaneous transmission of signals from N signal sources
Assignee: Fraunhofer-Gesellschaft zur Förderung der Angewandten Forschung eV
•
Filing: 1992-10-28
•
Granted: 1996-04-16
•
Expires: 2012-10-28
Abstract
Abstract A process for simultaneous transmission of signals from N signal sources via a corresponding number of transmission channels, in which the individual signals are divided into blocks and the blocks are transformed into spectral coefficients by transformation or filtering, the spectral coefficients undergoing a data reduction process. The blocks belonging to the individual signals are divided into sections. The respective current sections of all signals are processed simultaneously. The permissible interference for each section is determined utilizing a perception-specific model, and a request of currently required overall transmission capacity is calculated. The allotment of maximum transmission capacity at disposal for each individual signal is calculated from the overall transmission capacity at disposal and the currently required overall transmission capacity. Each signal is coded and transmitted with the thus determined capacity.
Inventors
- 👤 Karl-Heinz Brandenburg
- 👤 Heinz Gerhauser
- 👤 Dieter Seitzer
- 👤 Thomas Sporer
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 20:14
CPC Classifications
H; H04; H04S; H04S1/00; H04S3/00
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
132 words
A process for simultaneous transmission of signals from N signal sources via a corresponding number of transmission channels, in which the individual signals are divided into blocks and the blocks are transformed into spectral coefficients, the spectral coefficients undergoing a data reduction process, characterized by: the blocks belonging to respective individual signals are divided into sections, the respective current sections of all signals are processed simultaneously, the permissible interference for each section is determined utilizing a perception-specific model and a request of currently required overall transmission capacity is calculated, the allotment of maximum transmission capacity at disposal for each individual signal is calculated from the overall transmission capacity at disposal and the currently required overall transmission capacity, and each of the individual signals is coded and transmitted with the thus determined capacity.
Claim 2
Dependent Claim
132 words
A process for simultaneous transmission of signals from N signal sources via a corresponding number of transmission channels, in which the individual signals are divided into blocks and the blocks are transformed into spectral coefficients, the spectral coefficients undergoing a data reduction process, characterized by: the blocks belonging to respective individual signals are divided into sections, the respective current sections of all signals are processed simultaneously, the permissible interference for each section is determined utilizing a perception-specific model and a request of currently required overall transmission capacity is calculated, the allotment of maximum transmission capacity at disposal for each individual signal is calculated from the overall transmission capacity at disposal and the currently required overall transmission capacity, and each of the individual signals is coded and transmitted with the thus determined capacity.
Claim 3
Dependent Claim
33 words
A process according to claim 1, characterized by there being a reserve of transmission capacity from which an allotment occurs if the required overall transmission capacity exceeds the average transmission capacity at disposal.
Claim 4
Dependent Claim
26 words
A process according to claim 2, characterized by the bit reservoir being filled if the requested transmission capacity is smaller than the transmission capacity at disposal.
Claim 5
Dependent Claim
38 words
A process according to claim 3, characterized by a forced allotment occurring in order to prevent the bit reservoir from increasing too greatly if the requested transmission capacity is very much smaller than the transmission capacity at disposal.
Claim 6
Dependent Claim
23 words
A process according to claim 4, characterized by the forced allotment only occurring if there is a need greater than the average need.
Claim 7
Dependent Claim
27 words
A process according to one of claims 1 to 5, characterized by identical input signals being recognized and being transmitted only once by a suited transmission format.
Claim 8
Dependent Claim
18 words
A process according to claim 1, characterized by the determination of the currently required transmission capacity occuring accurately.
Claim 9
Dependent Claim
18 words
A process according to claim 1, characterized by the determination of the currently required transmission capacity being estimated.
Claim 10
Dependent Claim
53 words
A process according to claim 1, characterized by an overall block being formed from all the separately coded signals from the signal sources, the overall block being composed of a fixed section containing information from which the separation of the individual signals can be determined and composed of several regions of flexible length.
Claim 11
Dependent Claim
29 words
A process according to claim 1, characterized by the coding of the individual signals already occurring during the calculation of the allotment of the transmission capacity for each signal.
Claim 12
Dependent Claim
40 words
A process according to claim 1, characterized by, if the requested number of bits exceeds the overall number of bits at disposal, the permissable interference for all the signal sources being increased so that a reduced bit request is yielded.
Claim 13
Dependent Claim
16 words
A process according to claim 1, wherein the blocks are transformed into spectral coefficients by transformation.
Claim 14
Dependent Claim
16 words
A process according to claim 1, wherein the blocks are transformed into spectral coefficients by filtering.
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) | 1999-04-16 | 1999-10-16 | 2000-04-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-04-16 | 2003-10-16 | 2004-04-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-04-16 | 2007-10-16 | 2008-04-16 | $7700.00 | Window Closed / Lapsed |