CA2122577C - Process for simultaneous transmission of signals from n signal sources - Google Patents
Process for simultaneous transmission of signals from n signal sources Download PDFInfo
- Publication number
- CA2122577C CA2122577C CA002122577A CA2122577A CA2122577C CA 2122577 C CA2122577 C CA 2122577C CA 002122577 A CA002122577 A CA 002122577A CA 2122577 A CA2122577 A CA 2122577A CA 2122577 C CA2122577 C CA 2122577C
- Authority
- CA
- Canada
- Prior art keywords
- transmission capacity
- signals
- process according
- disposal
- transmission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04S—STEREOPHONIC SYSTEMS
- H04S3/00—Systems employing more than two channels, e.g. quadraphonic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04S—STEREOPHONIC SYSTEMS
- H04S1/00—Two-channel systems
Abstract
Disclosed is a process for simultaneous transmission of signals of 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 present invention is distinguished by the blocks belonging to the individual signals being divided into sections, by the respective current sections of all signals being processed simultaneously, by the permissible interference for each section being determined utilizing a perception-specific model and a request of currently required overall transmission capacity being calculated, by the allotment of maximum transmission capacity at disposal for each individual signal being calculated from the overall transmission capacity at disposal and the currently required overall transmission capacity and each signal being coded and transmitted with the thus determined capacity.
The present invention is distinguished by the blocks belonging to the individual signals being divided into sections, by the respective current sections of all signals being processed simultaneously, by the permissible interference for each section being determined utilizing a perception-specific model and a request of currently required overall transmission capacity being calculated, by the allotment of maximum transmission capacity at disposal for each individual signal being calculated from the overall transmission capacity at disposal and the currently required overall transmission capacity and each signal being coded and transmitted with the thus determined capacity.
Description
~\
2~~'~'~~~
Process for Simultaneous _Transrnission of Signals from N Signal Sources D a s c r p t i a n Technical Field The present invention relates to a process fo simultaneous transmission of signals from N signal sources via a corresponding number of transmission channels.
State of the Art Processes in which the individual ('time) signals are divided into blocks and these blocks are transformed by transformation or filtering into spectral coefficients which for their part undergo a data reduction process or which are coded according to a data reduction re-spectively, are known. In this connection, reference is made to, by way of illustration, the overview article "Perceptual Audio coding" by Jorg FIoupert in Studio-Te-chnik or the article '°Daten-Diat, Datenreduktion bei digi-talisierten Audio-Signalen" by Stefanie Renner in Elrad, 1991. These overview articles as well as the PCT ATdo-cument W0..88/01811 is explicitly referred to with regard to the explanation of any terms and process steps nat made more apparent herein.
In a number of cases, it is necessary 'to transmit signals from several signal sources simultaneously via a corresponding number of transmission channels. The transmission of stereo signals via 'two 'transmission channels is mentioned as the most simple example 'therefor.
. y, . ',~-: ' . . ~: ', ' ~
;,:; . , :: , ', ' ~ . ~:
.' , ; . : ., ', . . '.,v : ' ,,.,..
: . ' '.. ~ ,.
. .;.,~. . ~-',... ; : ~.: : .:;
" ': '~: ,.. ~;
';::
,.. , ,. : ..
. ...:.. . . , : ~ ~ ,. _ ~ . ., . .
;.. .. ', :; .. ,, , ...
~ , ~ . ;; .. ~:. . ~'... ~. .
. ; .;v ~ _ ..
_2_ The transmission of signals from N signal sources via a corresponding number of transmission channels presents the problem of dimensioning the transmission channels:
If each individual transmission channel is dimensioned in such a manner that it transmits the "maximum incident bit flow" (German: Bit-Strom), comparatively large transmis-sion capacity remains unused "on the average".
Tn the transmission of signals from numerous signal sources via a corresponding number of transmission channels, it is known from digital telephone technology to design the transmission channels for only "average demand'° and to balance short-term increased demand on individual channels by allotment from other channels. The allotment ensues exclusively via signal statistics.
for the state of the art, reference is made to the following literary sources "Ein digitales Sprachinterpolationsverfahren mit pradiktionsgesteuerter Wortaufteilung" by Dr. H. Gerhauser (1950), "Ein digitales Sprachinterpolationsverfahren mit momentaner Prioritatszuteilung", by R. Woitowitc 0977) and "Ein digitales Sprachinterpolationsverfahren mit blockweiser Prioritatszuteilung" by G.G. Klahnenbucher (1975).
An element of the present invention is that it was understood that the usual processes in digital telephone technology for balancing fluctuating demand'in the transmission of numerous signals via a corresponding number of transmission channels does not have good results if the digital signals to be transmitted previously under-went data reduction, by way of illustration, according to the so-called OCF process.
Process for Simultaneous _Transrnission of Signals from N Signal Sources D a s c r p t i a n Technical Field The present invention relates to a process fo simultaneous transmission of signals from N signal sources via a corresponding number of transmission channels.
State of the Art Processes in which the individual ('time) signals are divided into blocks and these blocks are transformed by transformation or filtering into spectral coefficients which for their part undergo a data reduction process or which are coded according to a data reduction re-spectively, are known. In this connection, reference is made to, by way of illustration, the overview article "Perceptual Audio coding" by Jorg FIoupert in Studio-Te-chnik or the article '°Daten-Diat, Datenreduktion bei digi-talisierten Audio-Signalen" by Stefanie Renner in Elrad, 1991. These overview articles as well as the PCT ATdo-cument W0..88/01811 is explicitly referred to with regard to the explanation of any terms and process steps nat made more apparent herein.
In a number of cases, it is necessary 'to transmit signals from several signal sources simultaneously via a corresponding number of transmission channels. The transmission of stereo signals via 'two 'transmission channels is mentioned as the most simple example 'therefor.
. y, . ',~-: ' . . ~: ', ' ~
;,:; . , :: , ', ' ~ . ~:
.' , ; . : ., ', . . '.,v : ' ,,.,..
: . ' '.. ~ ,.
. .;.,~. . ~-',... ; : ~.: : .:;
" ': '~: ,.. ~;
';::
,.. , ,. : ..
. ...:.. . . , : ~ ~ ,. _ ~ . ., . .
;.. .. ', :; .. ,, , ...
~ , ~ . ;; .. ~:. . ~'... ~. .
. ; .;v ~ _ ..
_2_ The transmission of signals from N signal sources via a corresponding number of transmission channels presents the problem of dimensioning the transmission channels:
If each individual transmission channel is dimensioned in such a manner that it transmits the "maximum incident bit flow" (German: Bit-Strom), comparatively large transmis-sion capacity remains unused "on the average".
Tn the transmission of signals from numerous signal sources via a corresponding number of transmission channels, it is known from digital telephone technology to design the transmission channels for only "average demand'° and to balance short-term increased demand on individual channels by allotment from other channels. The allotment ensues exclusively via signal statistics.
for the state of the art, reference is made to the following literary sources "Ein digitales Sprachinterpolationsverfahren mit pradiktionsgesteuerter Wortaufteilung" by Dr. H. Gerhauser (1950), "Ein digitales Sprachinterpolationsverfahren mit momentaner Prioritatszuteilung", by R. Woitowitc 0977) and "Ein digitales Sprachinterpolationsverfahren mit blockweiser Prioritatszuteilung" by G.G. Klahnenbucher (1975).
An element of the present invention is that it was understood that the usual processes in digital telephone technology for balancing fluctuating demand'in the transmission of numerous signals via a corresponding number of transmission channels does not have good results if the digital signals to be transmitted previously under-went data reduction, by way of illustration, according to the so-called OCF process.
2~.2>~~~
Description of the Invention '.Che object of the present invention is to provide a pro-cess for simultaneous transmission of signals from N
signal sources via a corresponding number of transmission channels with which "data-reduced signals" can be trans-mitted via transmission channels that are only dimensioned for "average demand" without any perceptable, i..e. by way of illustration audible loss in signal capacity.
A solution to this object in accordance with the present invention is set forth in claim 1. Further improvements of the invention are the subject matter of the subclaims.
The present invention is based on the fundamental idea not to conduct the allotment to the individual signals according to statistical considerations in balancing the fluctuating requirements during simultaneous transmission of signals from N signal sources via a corresponding number of transmission channels, but rather already to balance the fluctuating demand by appropriate means in the process step in which the signals are coded for data reduction.
This inventive fundamental idea is explained in the following using a preferred embodiment with reference to the accompanying drawings, showing:
Fig. 1 a block diagram to explain the invented process, and Fig. 2a and 2b the invented signal build-up (German:
Signalaufbau) , ' ~~~~~~ ~ , In the invented process the individual signals are divided into blocks and the blocks are transformed into spectral coefficients by transformation or filtering.' To balance the fluctuating demand, the blocks belonging to the individual signals are divided into sections, and the respective current sections of all signals are processed simultaneously. This is graphically illustrated in Fig. 1 by the corresponding "function blocks".
Employing a perception-specific model which, by way of illustration, when transmitting audio-signals can be a psycho-acoustic model, the permissable interference is determined for each section and from it is calculated the request for the currently required overall transmis-sion capacity. This calculation of the overall transmis-sion capacity, d.h. the required number of bits, occurs in , all the blocks simultaneously. From all the transmission capacity at disposal and the currently required overall transmission capacity, the allotment of maximum transmis-sion capacity at disposal is calculated for each indivi- ..
dual signal. With each "number of bits" alloted to each signal, the coding of the individual signal occurs and accordingly the transmission of this individual signal. In the simplest case, balancing or equalizing can only occur in the re-spective required transmission capacity between the channels.
In the further improvement described in claim 2, there is a transmission capacity reserve, a so-called bit reservoir, from which, in the event that the required overall transmission exceeds the transmission capacity on the average at disposal, an allotment of transmission capacity accurs.
-5-.
This bit reservoir is filled whenever the requested trans-mission capacity is less than the transmission capacity at disposal (claim 3).
In any case, it is necessary, in order to pr.,event an increase in the bit reservoir beefing to great, if the transmission capacity is much smaller than the transmis-sion capacity at disposal, that there is a forced allot-ment of bits to the individual channels (claim ~). This forced allotment occurs preferably only to the channels, respectively the signal sources, that have reported a need that is greater than average demand. A substantially grew-ter demand than the average demand, noteably, means that these signals are substantially more difficult to code than usual signals.
In any event, it is preferable according to claim 9 if an averall block is formed from all the separately coded signals from the signal sources. This overall block is composed of a fixed zegion containing information frorn which the separation of signals can be determined and of several regions of more flexible length which receives the coded signals. This is diagrammatically shown in Fig. 2a.
Further saving in transmission capacity is achieved in that identical input signals are recognized and are transmitted only once by a suited transmission format (claim ~). This is diagramatically shown in Fig. 2b.
In any case, the currently required transmission capacity can be accurately determined or only estimated (claims 7 and 8 ) .
Moreover, in a great extend the invented process can be conducted parallel. To do this, it is preferable if ac-cording to claim 10 coding of the indivj.dual signals already occurs during calculation of the allotment of the trans-mission capacity for each signal.
Another preferred realization of the invented fundamental idea is set forth in claim 11:
If the required transmission capacity exceeds the transmission capacity at disposal and no allotment from the bit reservoir can occur, the value of the permissible interference for all the signals can be raised in such a manner that the required overall transmission capacity does not exceed the transmission capacity at disposal (claim 11) .
In the following a numerical example of a manner of proceeding for audio signals is given. It is explicitly pointed out that the invented fundamewtal idea is not restricted to audio signals, but rather also video signals or other signals underlying a perception-specific assessment can be treated similarly.
Example of a possible manner of proceeding for audio signals:
Assuming that y(t) are the sampling values of 'the audio signal.
1) The audio signal y is broken down or separated ire a known manner into the sampling values (y(t)), which are digitized. The digitized sampling values are broken down ar decomposed into blocks of the length 2n, which in the N
selected embodiment are overlapping blocks having an over-lapping of n:
x(k,b) - y(b*n+k) for k=o..2n (b block number).
2) Each block of length n is transformed into spectral coefficients by transformation, by way of illustration Fast ..
Fourier Transformation or a cosinus transformation:
x(j,b) - SUM(1=0..2n; x(1,b)*f(1)*cos(pi*(21+1+n) (2j+1) / (4n)) ) fox j=O..n with f(1) - sqrb(2)*sin (pi * (1+0.5) / (2n) ) 3) Each of the blocks is divided into sections and the energy density is calculated for each section:
E(i,b = ( SUM(k=a(i)+l..a(i-~1); X(k,n)2 ) ) /
(a(i+1)-a(i)) for i=1 ... c, with the coefficients a(i) being taken from the following Table 1.
Description of the Invention '.Che object of the present invention is to provide a pro-cess for simultaneous transmission of signals from N
signal sources via a corresponding number of transmission channels with which "data-reduced signals" can be trans-mitted via transmission channels that are only dimensioned for "average demand" without any perceptable, i..e. by way of illustration audible loss in signal capacity.
A solution to this object in accordance with the present invention is set forth in claim 1. Further improvements of the invention are the subject matter of the subclaims.
The present invention is based on the fundamental idea not to conduct the allotment to the individual signals according to statistical considerations in balancing the fluctuating requirements during simultaneous transmission of signals from N signal sources via a corresponding number of transmission channels, but rather already to balance the fluctuating demand by appropriate means in the process step in which the signals are coded for data reduction.
This inventive fundamental idea is explained in the following using a preferred embodiment with reference to the accompanying drawings, showing:
Fig. 1 a block diagram to explain the invented process, and Fig. 2a and 2b the invented signal build-up (German:
Signalaufbau) , ' ~~~~~~ ~ , In the invented process the individual signals are divided into blocks and the blocks are transformed into spectral coefficients by transformation or filtering.' To balance the fluctuating demand, the blocks belonging to the individual signals are divided into sections, and the respective current sections of all signals are processed simultaneously. This is graphically illustrated in Fig. 1 by the corresponding "function blocks".
Employing a perception-specific model which, by way of illustration, when transmitting audio-signals can be a psycho-acoustic model, the permissable interference is determined for each section and from it is calculated the request for the currently required overall transmis-sion capacity. This calculation of the overall transmis-sion capacity, d.h. the required number of bits, occurs in , all the blocks simultaneously. From all the transmission capacity at disposal and the currently required overall transmission capacity, the allotment of maximum transmis-sion capacity at disposal is calculated for each indivi- ..
dual signal. With each "number of bits" alloted to each signal, the coding of the individual signal occurs and accordingly the transmission of this individual signal. In the simplest case, balancing or equalizing can only occur in the re-spective required transmission capacity between the channels.
In the further improvement described in claim 2, there is a transmission capacity reserve, a so-called bit reservoir, from which, in the event that the required overall transmission exceeds the transmission capacity on the average at disposal, an allotment of transmission capacity accurs.
-5-.
This bit reservoir is filled whenever the requested trans-mission capacity is less than the transmission capacity at disposal (claim 3).
In any case, it is necessary, in order to pr.,event an increase in the bit reservoir beefing to great, if the transmission capacity is much smaller than the transmis-sion capacity at disposal, that there is a forced allot-ment of bits to the individual channels (claim ~). This forced allotment occurs preferably only to the channels, respectively the signal sources, that have reported a need that is greater than average demand. A substantially grew-ter demand than the average demand, noteably, means that these signals are substantially more difficult to code than usual signals.
In any event, it is preferable according to claim 9 if an averall block is formed from all the separately coded signals from the signal sources. This overall block is composed of a fixed zegion containing information frorn which the separation of signals can be determined and of several regions of more flexible length which receives the coded signals. This is diagrammatically shown in Fig. 2a.
Further saving in transmission capacity is achieved in that identical input signals are recognized and are transmitted only once by a suited transmission format (claim ~). This is diagramatically shown in Fig. 2b.
In any case, the currently required transmission capacity can be accurately determined or only estimated (claims 7 and 8 ) .
Moreover, in a great extend the invented process can be conducted parallel. To do this, it is preferable if ac-cording to claim 10 coding of the indivj.dual signals already occurs during calculation of the allotment of the trans-mission capacity for each signal.
Another preferred realization of the invented fundamental idea is set forth in claim 11:
If the required transmission capacity exceeds the transmission capacity at disposal and no allotment from the bit reservoir can occur, the value of the permissible interference for all the signals can be raised in such a manner that the required overall transmission capacity does not exceed the transmission capacity at disposal (claim 11) .
In the following a numerical example of a manner of proceeding for audio signals is given. It is explicitly pointed out that the invented fundamewtal idea is not restricted to audio signals, but rather also video signals or other signals underlying a perception-specific assessment can be treated similarly.
Example of a possible manner of proceeding for audio signals:
Assuming that y(t) are the sampling values of 'the audio signal.
1) The audio signal y is broken down or separated ire a known manner into the sampling values (y(t)), which are digitized. The digitized sampling values are broken down ar decomposed into blocks of the length 2n, which in the N
selected embodiment are overlapping blocks having an over-lapping of n:
x(k,b) - y(b*n+k) for k=o..2n (b block number).
2) Each block of length n is transformed into spectral coefficients by transformation, by way of illustration Fast ..
Fourier Transformation or a cosinus transformation:
x(j,b) - SUM(1=0..2n; x(1,b)*f(1)*cos(pi*(21+1+n) (2j+1) / (4n)) ) fox j=O..n with f(1) - sqrb(2)*sin (pi * (1+0.5) / (2n) ) 3) Each of the blocks is divided into sections and the energy density is calculated for each section:
E(i,b = ( SUM(k=a(i)+l..a(i-~1); X(k,n)2 ) ) /
(a(i+1)-a(i)) for i=1 ... c, with the coefficients a(i) being taken from the following Table 1.
4) The permissible interference is calculated for each section with a suited psycho-acoustical model, for which the literature is to be referred. The masking between the bands is yielded from the permitted interference T(i,b) - MAX(k=1 ... i-1; E(k,b)*z(i-k) ) the masking in the band:
s(i,b) = max ( E(i,b) * e(i) , T(i,b) ) and the masking between the blocks:
_ _ 8 _ ss(i,b) = max ( s(i,b-1)/16 , s(i,b) ) thereon follows the calculation of the required number of bits for each block.
s(i,b) = max ( E(i,b) * e(i) , T(i,b) ) and the masking between the blocks:
_ _ 8 _ ss(i,b) = max ( s(i,b-1)/16 , s(i,b) ) thereon follows the calculation of the required number of bits for each block.
5) Calculation of the required number of bits for the block:
a) for a coding like in the case of OCF (Huffman coding):
p = p0 + SUM(i=1..C; (a(i+1)-a(i) *(s(i,b)/ss(i,b) ) ) b) for PCM coding (SNR = 6dB/bit) A scaling factor and the number of bits per sampling value as additional information are transmitted for each section p = p0 + SUM(i=l..ct (a(i+1)) * 10/6 * log( E(i,b) /
ss(i,b) ) ) The pertinent values for the individual values, respec-tively for the individual constants, are given in the form of tables in the following:
n = 512 c=23 ,;,:;.
p0 = 1200 for OCF (average number of bits per block) p0 = 345 for PCM (scaling factors: 10 bit/section, coding of trze number of quantization steps: 5 bits/
section i 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 a(i) 0 4 8 12 16 20 24 28 32 36 40 46 52 60 70 82 --. _g_ i 17 18 19 20 21 22 23 24 a(i) 96 114 136 164 198 240 296 372 i 1 2 3 4 5 6 7 8 9 e(i) 1e-1 1e-2 1e-3 le--4 1e-5 1e-6 1e-7 1e-8 1e-9 a(1) 0 for i>9 i 1 2 3 4 5 6 7 e(i) 0.0004 0.0004 0.000 4 0.0004 0.0004 0.0004 0.0004 i 8 9 10 11 12 13 ~ 14 15 e(i) 0.002 0.002 0.00 2 0.004 0.01 0.015 0.025 0.04 i 16 17 18 19 20 21 22 23 e(i) 0.06 0.06 0.06 0.08 0.08 0.11 0.14 0.18 This is followed by the allotment of the number of bits to the individual signals. F'or this it is assumed that k(k)-bits are requested for c oding the K input signals while . psoll number of bits are at disposal.
psum = Sum((p)k)) Now it is necessary to d ifferenciate:
1) ~f psum=psoll Each signal receives the requested number of bits:
Z (k) _ p (k) ,., ::.::., . , ;.....:.. .,, ::.'.': , .. . -.:: _ ~.~: . ..!::~:. >.:., ,.:,:, , ~, ~ .'":: . , .:;~.~::.:'. .. ~:-:,.:; , , ,,:.;. . '~:~':' ' :.;.
~:~.::' , ,.:, , ... ~ . :~: ,.::..
:' ..:.;: '.,..,:., H , .::: , .."..... _ .:..-:.. ~. '.,: . ':... , ,:,...,..
.. ;..~., . . ;.::.. ~...n ,;..,t., . ~:......_. -. , ...
W ::.;.-n.~
..:.',.:. ,..::.: .., ~:.:' ,..:"'.,' :::'' , , . .'.. .. . . ~.,:~:~..:
.1. . v:.~. :. '::~: . :::
.
' . ,: . ~..' ..,: . '.;'.:'.":.....
.:. '....'..... "'. ...,:". .. .:'' ".,'v .. .:~
G o.. ~~.,..~i"~.~::,:~ ..::.~ _:..
1.. .: ~
! " 4 , .
y n1.
,.'.G' .,t.r ,J:
' J
/
. .7 ...,.
. .,C.. . .
:.,', :u .. , :;:,. :.: ., .. '..,: ...., . .. . . .;..,.. v ..
',, , ..... :.~: ~ . . : : ,. , t ,:-'u -i-. . ";. ' . ~ ..; S :. .v'v : ..'. ., ..
I ~ ': J. ~;':. .. ., .. , ' ' . .' ~ . :~.'. : ,... .' ~ ~': , . : ~ ~ ! .. ": .. w" : . , . '..: .
' ~:...;' . ,.;...', '...:, . . .:: ; '.. . '..:., . ,. .
. ' ' , :: ..... .:, ..,. . ~:. .
::' ::' ' . : t . ,:: , , , . ..;.:. . F . ..:
' ':
' . .
:.J:: ,.. .....:... . .
...,. .;. ' . , ':': ,:~: ',','.. .. ..:,._ '. .. :.
';.:-: 0 .':. ::. ..,.,..,';. . '..::.v>..'. :?: :.~
',',. ' .~::. ,. :...,..,,....,..,:.,,':..:.~:. ... ;:
, ::...., ' ' :~:;, ...n .~.' . ..".. . ~, f Y .. !~~'.. ",.:: .....
.. ....,., .::..':. .. ' .~,~.:'; .. ,:.J: ... :,..:.. ,:,. ':..._ : .;~: ..'.~'.. .:::~ : :'.S' . y:.~.....:.. .',~"' J, :J. ;.::~ .
. .':::':... :.. ~..,-: ,' ',"'..:;,: .;:.~.' ..::':? ,,. .;....... . v,:
~,y'. ...,, .".: .:.:... .','~. . ....
',' ., ~~:: W y ~~~'-. ..,. .'. . . .. '.~ ::'. .:; :::: .'..; : ;.
,..,. ~~ J ~.:.; . :'':~. ...:.'.:. '. .
',.., y :~: ' - .,.: . ,. . . ..
' ::.. ' '. :
~
g, ,. . . .
, ,.,. .. ,., .. .. . , .
:
'..:. , :: w.~ ' . '.. , .
.,...:
~ :''.:. ...; ..v.:~ ':'. :..
". , , , . . .
i ., ......... ,...:.'.; .
. . . .. :.: ... : ... . ..
.'. Y :na :.' . .
,.,,"... ... :.::..:: .. .
',:. ' .:~. . .".,:.: :~'..
- J-. ':'..:.:.,.Y.':.-:.~,:
. :'..:;,.. ". ..;..:" '-m:' . .:~ .w:: "_..,., ...
,. .,. ,.. , ,... . ..,:.;.
,.....~.~.., , . :,i: J ~.,...
. . : ~.:: . .. :. . :..,:
..: .,... :.':~~. :' .
~~;~c,~rlr~
~ im (~
2) Tf psum<psoll Each signal receives more than the requested number of bits:
z(k) - (psoll/psum) * p(k) e.g., K=2, psoll=1600, p(1)=540,p(2)=660 psum=1200 z(1) - 1600/1200 * 540 = '720 (180 bits more) z(2) - 1600/1200 * 660 = 880 (220 bits more) 3) If psoll>psum Each signal receives less than the requested number of bits:
a) for OCF:
z(k) - (psoll/psum) * p(k) b) for PCM:
The minimum number of bits for each signal must not be undercut:
z(k) - p0 + ( (psoll-K*p0) ) * (p(k)-p0) e.g., K=2, psoll=1600, p0=500, p(1)=600, p(2)=1200 then Psum=1800 z(1)=500+(1600-2*500)/(1800-2*500)*(600--500)=575 (25 bits less) ' z(2)=500+(1600-2*500)/(1800-2*500)*(1200-500)=1025 (175 bits less) In order to correct the permissible interference, the following differenciation is necessary if p bits are requested for each signal but z bits are alloted:
1) If the alloted number of bits equals the requested number: no correction is required.
2) If more bits were alloted than were requested:
For OCF:
no correction is required.
For PCM:
The number of bits at disposal for quantization in each section is increased by (z-p)/512.
3) 2f the number of bits being alloted is less than being requested:
For OCF:
ss(i,b) - s(i*b) + (z-p0)/(p-o0 * (ss(i,b)-s(i,b)) for p>p0 ss (i,b) - s (i,b) for p<=p0 For PCM:
The number of bits at disposal for quantization in each section are increased by (z-p)/512.
Tn the case of PCM, a rounding off bit per ATW to an integer is required: in order to do this all bits/ATW
are rounded off to the next lowest integer and the resulting bit sum is determined therefrom.
rounded off: 4 5 3 2 *Width 16 30 2~ 2~
still to be alloted: 10 bits +1 +1 Result: 5 6 3 2 The present invention has been described hereinbefore using preferred embodiments, There are, of course, very many different variations possible within the scope of the overall inventive idea:
A fixed overall block length can be employed, with filling bits being used or there is a transfer of not yet ended coders. Furthermore, a flexible block length can be employed which prescribes a maximum block length and in addition time averaging occurs.
a) for a coding like in the case of OCF (Huffman coding):
p = p0 + SUM(i=1..C; (a(i+1)-a(i) *(s(i,b)/ss(i,b) ) ) b) for PCM coding (SNR = 6dB/bit) A scaling factor and the number of bits per sampling value as additional information are transmitted for each section p = p0 + SUM(i=l..ct (a(i+1)) * 10/6 * log( E(i,b) /
ss(i,b) ) ) The pertinent values for the individual values, respec-tively for the individual constants, are given in the form of tables in the following:
n = 512 c=23 ,;,:;.
p0 = 1200 for OCF (average number of bits per block) p0 = 345 for PCM (scaling factors: 10 bit/section, coding of trze number of quantization steps: 5 bits/
section i 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 a(i) 0 4 8 12 16 20 24 28 32 36 40 46 52 60 70 82 --. _g_ i 17 18 19 20 21 22 23 24 a(i) 96 114 136 164 198 240 296 372 i 1 2 3 4 5 6 7 8 9 e(i) 1e-1 1e-2 1e-3 le--4 1e-5 1e-6 1e-7 1e-8 1e-9 a(1) 0 for i>9 i 1 2 3 4 5 6 7 e(i) 0.0004 0.0004 0.000 4 0.0004 0.0004 0.0004 0.0004 i 8 9 10 11 12 13 ~ 14 15 e(i) 0.002 0.002 0.00 2 0.004 0.01 0.015 0.025 0.04 i 16 17 18 19 20 21 22 23 e(i) 0.06 0.06 0.06 0.08 0.08 0.11 0.14 0.18 This is followed by the allotment of the number of bits to the individual signals. F'or this it is assumed that k(k)-bits are requested for c oding the K input signals while . psoll number of bits are at disposal.
psum = Sum((p)k)) Now it is necessary to d ifferenciate:
1) ~f psum=psoll Each signal receives the requested number of bits:
Z (k) _ p (k) ,., ::.::., . , ;.....:.. .,, ::.'.': , .. . -.:: _ ~.~: . ..!::~:. >.:., ,.:,:, , ~, ~ .'":: . , .:;~.~::.:'. .. ~:-:,.:; , , ,,:.;. . '~:~':' ' :.;.
~:~.::' , ,.:, , ... ~ . :~: ,.::..
:' ..:.;: '.,..,:., H , .::: , .."..... _ .:..-:.. ~. '.,: . ':... , ,:,...,..
.. ;..~., . . ;.::.. ~...n ,;..,t., . ~:......_. -. , ...
W ::.;.-n.~
..:.',.:. ,..::.: .., ~:.:' ,..:"'.,' :::'' , , . .'.. .. . . ~.,:~:~..:
.1. . v:.~. :. '::~: . :::
.
' . ,: . ~..' ..,: . '.;'.:'.":.....
.:. '....'..... "'. ...,:". .. .:'' ".,'v .. .:~
G o.. ~~.,..~i"~.~::,:~ ..::.~ _:..
1.. .: ~
! " 4 , .
y n1.
,.'.G' .,t.r ,J:
' J
/
. .7 ...,.
. .,C.. . .
:.,', :u .. , :;:,. :.: ., .. '..,: ...., . .. . . .;..,.. v ..
',, , ..... :.~: ~ . . : : ,. , t ,:-'u -i-. . ";. ' . ~ ..; S :. .v'v : ..'. ., ..
I ~ ': J. ~;':. .. ., .. , ' ' . .' ~ . :~.'. : ,... .' ~ ~': , . : ~ ~ ! .. ": .. w" : . , . '..: .
' ~:...;' . ,.;...', '...:, . . .:: ; '.. . '..:., . ,. .
. ' ' , :: ..... .:, ..,. . ~:. .
::' ::' ' . : t . ,:: , , , . ..;.:. . F . ..:
' ':
' . .
:.J:: ,.. .....:... . .
...,. .;. ' . , ':': ,:~: ',','.. .. ..:,._ '. .. :.
';.:-: 0 .':. ::. ..,.,..,';. . '..::.v>..'. :?: :.~
',',. ' .~::. ,. :...,..,,....,..,:.,,':..:.~:. ... ;:
, ::...., ' ' :~:;, ...n .~.' . ..".. . ~, f Y .. !~~'.. ",.:: .....
.. ....,., .::..':. .. ' .~,~.:'; .. ,:.J: ... :,..:.. ,:,. ':..._ : .;~: ..'.~'.. .:::~ : :'.S' . y:.~.....:.. .',~"' J, :J. ;.::~ .
. .':::':... :.. ~..,-: ,' ',"'..:;,: .;:.~.' ..::':? ,,. .;....... . v,:
~,y'. ...,, .".: .:.:... .','~. . ....
',' ., ~~:: W y ~~~'-. ..,. .'. . . .. '.~ ::'. .:; :::: .'..; : ;.
,..,. ~~ J ~.:.; . :'':~. ...:.'.:. '. .
',.., y :~: ' - .,.: . ,. . . ..
' ::.. ' '. :
~
g, ,. . . .
, ,.,. .. ,., .. .. . , .
:
'..:. , :: w.~ ' . '.. , .
.,...:
~ :''.:. ...; ..v.:~ ':'. :..
". , , , . . .
i ., ......... ,...:.'.; .
. . . .. :.: ... : ... . ..
.'. Y :na :.' . .
,.,,"... ... :.::..:: .. .
',:. ' .:~. . .".,:.: :~'..
- J-. ':'..:.:.,.Y.':.-:.~,:
. :'..:;,.. ". ..;..:" '-m:' . .:~ .w:: "_..,., ...
,. .,. ,.. , ,... . ..,:.;.
,.....~.~.., , . :,i: J ~.,...
. . : ~.:: . .. :. . :..,:
..: .,... :.':~~. :' .
~~;~c,~rlr~
~ im (~
2) Tf psum<psoll Each signal receives more than the requested number of bits:
z(k) - (psoll/psum) * p(k) e.g., K=2, psoll=1600, p(1)=540,p(2)=660 psum=1200 z(1) - 1600/1200 * 540 = '720 (180 bits more) z(2) - 1600/1200 * 660 = 880 (220 bits more) 3) If psoll>psum Each signal receives less than the requested number of bits:
a) for OCF:
z(k) - (psoll/psum) * p(k) b) for PCM:
The minimum number of bits for each signal must not be undercut:
z(k) - p0 + ( (psoll-K*p0) ) * (p(k)-p0) e.g., K=2, psoll=1600, p0=500, p(1)=600, p(2)=1200 then Psum=1800 z(1)=500+(1600-2*500)/(1800-2*500)*(600--500)=575 (25 bits less) ' z(2)=500+(1600-2*500)/(1800-2*500)*(1200-500)=1025 (175 bits less) In order to correct the permissible interference, the following differenciation is necessary if p bits are requested for each signal but z bits are alloted:
1) If the alloted number of bits equals the requested number: no correction is required.
2) If more bits were alloted than were requested:
For OCF:
no correction is required.
For PCM:
The number of bits at disposal for quantization in each section is increased by (z-p)/512.
3) 2f the number of bits being alloted is less than being requested:
For OCF:
ss(i,b) - s(i*b) + (z-p0)/(p-o0 * (ss(i,b)-s(i,b)) for p>p0 ss (i,b) - s (i,b) for p<=p0 For PCM:
The number of bits at disposal for quantization in each section are increased by (z-p)/512.
Tn the case of PCM, a rounding off bit per ATW to an integer is required: in order to do this all bits/ATW
are rounded off to the next lowest integer and the resulting bit sum is determined therefrom.
rounded off: 4 5 3 2 *Width 16 30 2~ 2~
still to be alloted: 10 bits +1 +1 Result: 5 6 3 2 The present invention has been described hereinbefore using preferred embodiments, There are, of course, very many different variations possible within the scope of the overall inventive idea:
A fixed overall block length can be employed, with filling bits being used or there is a transfer of not yet ended coders. Furthermore, a flexible block length can be employed which prescribes a maximum block length and in addition time averaging occurs.
Claims (11)
1. A process for simultaneous transmission of signals of N
signal sources via a corresponding number of transmission channels, in which the individual signals are divided into blocks and said blocks are transformed into spectral coefficients by transformation or filtering, said spectral coefficients undergoing a data reduction process, characterized by the following features:
- said blocks belonging to said 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 said individual signal is coded and transmitted with the thus determined capacity.
signal sources via a corresponding number of transmission channels, in which the individual signals are divided into blocks and said blocks are transformed into spectral coefficients by transformation or filtering, said spectral coefficients undergoing a data reduction process, characterized by the following features:
- said blocks belonging to said 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 said individual signal is coded and transmitted with the thus determined capacity.
2. Process according to claim 1, characterized by there being a reserve of transmission capacity (bit reservoir) from which an allotment occurs if the required overall transmission capacity exceeds the average transmission capacity at disposal.
3. Process according to claim 2, characterized by said bit reservoir being filled if the requested transmission capacity is smaller than the transmission capacity at disposal.
4. A process according to claim 3, characterized by a forced allotment occurring in order to prevent said bit reservoir from increasing too greatly if the requested transmission capacity is very much smaller than the transmission capacity at disposal.
5. A process according to claim 4, characterized by said forced allotment only occurring if there is a need greater than the average need.
6. A process according to one of the claims 1 to 5, characterized by identical input signals being recognized and being transmitted only once by a suited transmission format.
7. A process according to one of the claims 1 to 6, characterized by the determination of the currently required transmission capacity occuring accurately.
8. A process according to one of the claims 1 to 6, characterized by said determination of said currently required transmission capacity being only estimated.
9. A process according to one of the claims 1 to 8, characterized by an overall block being formed from all the separately coded signals from the signal sources, said overall block being composed of a fixed section containing information from which the separation of said individual signals can be determined and composed of several regions of flexible length.
10. A process according to one of the claims 1 to 9, characterized by said coding of said individual signals already occurring during the calculation of the allotment of the transmission capacity for each signal.
11. A process according to one of the claims 1 to 10, 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.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| DEP4135977.1 | 1991-10-31 | ||
| DE4135977A DE4135977C2 (en) | 1991-10-31 | 1991-10-31 | Method for the simultaneous transmission of signals from N signal sources |
| PCT/DE1992/000905 WO1993009645A1 (en) | 1991-10-31 | 1992-10-28 | Process for simultaneously transmitting signals from n-signal sources |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2122577A1 CA2122577A1 (en) | 1993-05-13 |
| CA2122577C true CA2122577C (en) | 2000-12-26 |
Family
ID=6443876
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002122577A Expired - Lifetime CA2122577C (en) | 1991-10-31 | 1992-10-28 | Process for simultaneous transmission of signals from n signal sources |
Country Status (13)
| Country | Link |
|---|---|
| EP (1) | EP0610282B1 (en) |
| JP (1) | JP3276370B2 (en) |
| KR (1) | KR100268517B1 (en) |
| AT (1) | ATE169791T1 (en) |
| AU (1) | AU666339B2 (en) |
| CA (1) | CA2122577C (en) |
| DE (2) | DE4135977C2 (en) |
| DK (1) | DK0610282T3 (en) |
| ES (1) | ES2121868T3 (en) |
| FI (1) | FI113936B (en) |
| NO (1) | NO316098B1 (en) |
| RU (1) | RU2108001C1 (en) |
| WO (1) | WO1993009645A1 (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3528260B2 (en) * | 1993-10-26 | 2004-05-17 | ソニー株式会社 | Encoding device and method, and decoding device and method |
| US5737720A (en) * | 1993-10-26 | 1998-04-07 | Sony Corporation | Low bit rate multichannel audio coding methods and apparatus using non-linear adaptive bit allocation |
| US5687095A (en) * | 1994-11-01 | 1997-11-11 | Lucent Technologies Inc. | Video transmission rate matching for multimedia communication systems |
| US5641529A (en) * | 1995-03-15 | 1997-06-24 | The Quaker Oats Company | Extrusion apparatus and method for producing three-dimensional shapes |
| JP3521596B2 (en) * | 1996-01-30 | 2004-04-19 | ソニー株式会社 | Signal encoding method |
| DE19727938B4 (en) * | 1997-07-01 | 2006-12-14 | Mayah Communications Gmbh | Method and device for coding signals |
| KR102291633B1 (en) | 2018-10-15 | 2021-08-20 | 에코플러스 주식회사 | Mixture material composition for steam curing concrete and steam curing concrete composition comprising the same |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CH589390A5 (en) * | 1975-08-19 | 1977-06-30 | Patelhold Patentverwertung | |
| DE3440613C1 (en) * | 1984-11-07 | 1986-04-10 | Institut für Rundfunktechnik GmbH, 8000 München | Method for digital transmission of a broadcast radio programme signal |
| DE3629434C2 (en) * | 1986-08-29 | 1994-07-28 | Karlheinz Dipl Ing Brandenburg | Digital coding method |
| JPH0648796B2 (en) * | 1988-02-05 | 1994-06-22 | 日本電気株式会社 | Demand assign satellite communication device |
| DE3817864A1 (en) * | 1988-05-26 | 1989-12-07 | Telefunken Fernseh & Rundfunk | Method for the transmission of an audio signal |
| US5115309A (en) * | 1990-09-10 | 1992-05-19 | At&T Bell Laboratories | Method and apparatus for dynamic channel bandwidth allocation among multiple parallel video coders |
-
1991
- 1991-10-31 DE DE4135977A patent/DE4135977C2/en not_active Expired - Lifetime
-
1992
- 1992-10-28 DK DK92921746T patent/DK0610282T3/en active
- 1992-10-28 AT AT92921746T patent/ATE169791T1/en active
- 1992-10-28 CA CA002122577A patent/CA2122577C/en not_active Expired - Lifetime
- 1992-10-28 RU RU94028106A patent/RU2108001C1/en active
- 1992-10-28 ES ES92921746T patent/ES2121868T3/en not_active Expired - Lifetime
- 1992-10-28 AU AU28069/92A patent/AU666339B2/en not_active Expired
- 1992-10-28 WO PCT/DE1992/000905 patent/WO1993009645A1/en active IP Right Grant
- 1992-10-28 JP JP50808893A patent/JP3276370B2/en not_active Expired - Lifetime
- 1992-10-28 DE DE59209456T patent/DE59209456D1/en not_active Expired - Lifetime
- 1992-10-28 EP EP92921746A patent/EP0610282B1/en not_active Expired - Lifetime
- 1992-10-28 KR KR1019940701410A patent/KR100268517B1/en not_active IP Right Cessation
-
1994
- 1994-04-29 NO NO19941595A patent/NO316098B1/en not_active IP Right Cessation
- 1994-04-29 FI FI942000A patent/FI113936B/en not_active IP Right Cessation
Also Published As
| Publication number | Publication date |
|---|---|
| RU2108001C1 (en) | 1998-03-27 |
| DE59209456D1 (en) | 1998-09-17 |
| KR100268517B1 (en) | 2000-10-16 |
| JPH07504539A (en) | 1995-05-18 |
| DE4135977C2 (en) | 1996-07-18 |
| CA2122577A1 (en) | 1993-05-13 |
| NO941595D0 (en) | 1994-04-29 |
| DK0610282T3 (en) | 1999-05-10 |
| EP0610282A1 (en) | 1994-08-17 |
| AU2806992A (en) | 1993-06-07 |
| AU666339B2 (en) | 1996-02-08 |
| FI942000A (en) | 1994-04-29 |
| WO1993009645A1 (en) | 1993-05-13 |
| FI113936B (en) | 2004-06-30 |
| NO316098B1 (en) | 2003-12-08 |
| DE4135977A1 (en) | 1993-05-06 |
| ES2121868T3 (en) | 1998-12-16 |
| FI942000A0 (en) | 1994-04-29 |
| NO941595L (en) | 1994-04-29 |
| ATE169791T1 (en) | 1998-08-15 |
| EP0610282B1 (en) | 1998-08-12 |
| JP3276370B2 (en) | 2002-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5509017A (en) | Process for simultaneous transmission of signals from N signal sources | |
| DE4401329C2 (en) | Method and arrangement and subscriber station and central station for transmitting voice information in a radio system | |
| EP0271805B1 (en) | Transmission system | |
| EP0126295B1 (en) | Pulse code modulation transmission system with data reduction, in particular for television signals | |
| EP0205200B1 (en) | Method for transmitting audio and additional information in digital form | |
| DE69534140T2 (en) | METHOD AND DEVICE FOR SIGNALING AND DECODING, RECORDING MEDIA AND SIGNAL TRANSMISSION METHOD | |
| JPH0234497B2 (en) | ||
| US4005274A (en) | Pulse-code modulation communication system | |
| CA2122577C (en) | Process for simultaneous transmission of signals from n signal sources | |
| DE69029658T3 (en) | Method and device for compressing a communication signal | |
| EP0756386A3 (en) | Method and apparatus for coding a digital, acoustic signal | |
| EP0106279B1 (en) | Digital data transmission system, especially a colour television transmission system | |
| EP1108305A1 (en) | Method and device for adapting a transmission data rate or a transmitter power to the transmission quality of a transmission channel | |
| EP0464910A2 (en) | Transmission device with a block-coded main channel and an additional channel | |
| DE2613584C2 (en) | Remote control system | |
| WO1993021694A1 (en) | Method of transmitting and/or storing digitized data-reduced audio signals | |
| EP0027233B1 (en) | Coding method for analog signals | |
| DE2434471A1 (en) | SYSTEM FOR DIGITAL TRANSMISSION OF COLOR TV SIGNALS | |
| AU703390B2 (en) | Method for coding an audio signal digitized at a low sampling rate | |
| DE2319650B2 (en) | Method and arrangement for converting a message signal from one digital code format to another | |
| DE3301351A1 (en) | METHOD FOR DIGITAL VOICE TRANSFER OVER A SINGLE RADIO CHANNEL | |
| DE2905080A1 (en) | DIGITAL TIME MULTIPLEX MESSAGE TRANSMISSION SYSTEM WITH SINGLE CHANNEL ENCODING / DECODING | |
| DE3107602A1 (en) | METHOD FOR CODING ANALOG SIGNALS | |
| WO1985003177A1 (en) | Differential coded pulse modulation system | |
| EP0133697A2 (en) | Method of transmitting digital sound signals and apparatus for receiving a sound signal transmitted according to this method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |