ASYNCHRONOUS CONTROL SIGNAL GENERATING APPARATUS

Abstract: Apparatus for asynchronously generating control signals (CONTROL) is disclosed including a plurality of sources (5) of asynchronous data signals and a plurality of data processing channels (10, 14), each processing one of the data signals in response to a control signal (CONTROL). Each of a plurality of parameter determining circuits (10, 16) produces a signal (COMPLEXITY) representing a parameter of one of the data signals. A data sampler (30) samples the signals (COMPLEXITY) from all of parameter determining circuits (10, 16) substantially simultaneously at predetermined sampling time intervals. A control signal generator (30) generates control signals (CONTROL) for the data processing channels (10, 14) having values based on the sampled parameter representative signals (COMPLEXITY) and the preceding sampling time interval.

Description: ASYNCHRONOUS CONTROL SIGNAL GENERATING APPARATUS The present application relates to apparatus for provid¬ ing control signals to a plurality of cooperative signal processors operating asynchronously. BACKGROUND OF THE INVENTION It is sometimes necessary to provide control signals to each of a plurality of cooperative signal processors. If all the signal processors operate synchronously, this involves providing measuring apparatus to sample parameter values from the processors, generate the control signals having values based on the relative values of the parameter values, and supply these control signals to the processing channels, all in synchronism with the processed signals. However, in cases where the data signals are not mutually synchronized, but it is still required to cooperatively control the processing of all of the data signals based on the relative values of the respective signal parameters, it is necessary that the signal parameters be sampled substantially simultaneously in all of the data signals, and that the control signals be properly valued to compensate for the asynchronous nature of the signal processors and supplied to the signal processors at appropri¬ ate times. In an exemplary system, a plurality of video signals from respective channels, which may be television network feeds, television stations, or other video sources, are transmitted over a satellite link for broadcast to respective television receivers in consumers' homes. Each video signal may be encoded into a signal consisting of sequential groups of data, each group including data representing a fixed number of successive video pictures or frames and being designated a group of pictures (GOP) . However, the video signals being supplied by these channels are not necessarily in synchronism. For example, channels carrying standard video (in the U.S.) operate at about 30 frames per second, channels carrying film images operate at 24 frames per second, and channels carrying cartoons operate at 15 frames per second. It is also possible that different channels have different numbers of pictures or frames in a GOP. Consequently, GOPs of different channels have different time durations, i.e. they are asynchronous. In such a system, data from the different channels is combined, or multiplexed, at a head end station into a single data stream. The multiplexed data stream is then transmitted over a transmission link, such as a wire, fiber optic or radio link (such as the satellite link) , to a back end station, where the channels of data from the multiplexed data stream are then separated, or demultiplexed, and supplied to the intended recipients. An exemplary satellite link includes a digital transmission path capable of transmitting 24 megabits per second (Mbps) . In order to maximize efficiency and utili¬ zation of such a link, it is necessary for several video signals to share the link. For example, it may be desired to share the above satellite transmission link among at least six video signal channels. BRIEF SUMMARY OF THE INVENTION It has been proposed that the total bit rate in the multiplexed signal carried by the satellite link be dynamical- ly allocated to the different channels based on the current coding complexity of the images carried by those channels. The coding complexity of the images currently being transmit¬ ted for all the channels are calculated on a GOP basis, and made available, picture-by-picture, on a sliding window basis. The coding complexities from all the channels are sampled sub¬ stantially simultaneously. A proportion of the total bit rate of the transmission link is allocated to each channel for the next quota period based on the relationship of the current coding complexity of that channel to the overall coding com- plexities of all the channels. The inventors have realized that, although GOPs for the respective channels may have different time durations, it is possible to accurately allocate bit rates among the different channels by time normalizing the coding complexity of a GOP, and basing the allocations on the relative time normalized coding complexities. The inventors further realized that con¬ trol signals based on currently available time normalized coding complexities may be provided to the channels at arbi¬ trary control times, provided that no more than one control signal is issued within a single picture or frame interval for any of the channels. More specifically, control signals may be provided at constant intervals selected such that each channel receives a respective constant integral number of control signal updates in each GOP. In this case, each set of respective control signals allocates the number of bits avail¬ able during that constant interval to the respective channels. Alternatively, control signals may be provided to all the channels each time any of the channels begins a new GOP. In this case, each set of control signals allocates the number of bits made available in the (varying) time period since the last set of control signals was supplied to the channels. Control signals may also be provided to all the channels at arbitrary times in response to an external quota update sig¬ nal, provided that the arbitrary update times do not occur more than once in a single picture or frame in any of the channels. In accordance with principles of the present invention, apparatus for asynchronously generating control signals com- prises a plurality of sources of asynchronous data signals and a plurality of data processing channels, each processing one of the data signals in response to a control signal. Each of a plurality of parameter determining circuits produces a signal representing a parameter of one of the data signals. A data sampler samples the signals from all of parameter deter- mining circuits substantially simultaneously at predetermined sampling time intervals. A control signal generator generates control signals for the data processing channels having values based on the sampled parameter representative signals and the preceding sampling time interval. BRIEF DESCRIPTION OF THE DRAWING Fig. 1 is a block diagram of a multiplexer system accord- ing to the present invention; Fig. 2 is a block diagram of a channel processor which may be used in the multiplexer system illustrated in Fig. 1; Fig. 3 is a block diagram of a portion of an MPEG encoder which may be used in the channel processor illustrated in Fig. 2; Fig. 4 is a block diagram of a bit rate allocator which may be used in the multiplexer system illustrated in Fig. 1; Fig. 5 is a more detailed block diagram of a complexity analyzer which may be used in the channel processor illustrat- ed in Fig. 2; and Figs 6, 7, 8 and 9 are timing diagrams illustrating the sampling of complexity information. DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT Fig. 1 is a block diagram of a multiplexer system incor¬ porating the present invention. In Fig. 1, all signal paths are illustrated as single signal lines. However, one skilled in the art will understand that the illustrated signal paths could carry ultibit digital signals, either in parallel, in which case the signal paths would be composed of multiple signal lines, or serially, in which case the signal paths could be a single data line and/or include a data and clock signal line. Other control and clock signal paths, not ger- mane to the understanding of the present invention have been omitted from the figure to simplify it. In Fig. 1 a plurality of input terminals 5 are coupled to sources (not shown) of video signals (CHANNEL 1 - CHANNEL K) which are to be transmitted together over a data link. The plurality of input terminals 5 are coupled to respective data input terminals of a corresponding plurality of channel pro¬ cessors 10. Respective data output terminals of the plurality of channel processors 10 are coupled to corresponding data input terminals 1 - K of a multiplexer (MUX) 20. A data output terminal of multiplexer 20 is coupled to an output terminal 15 of the multiplexer system. Output terminal 15 is coupled to utilization circuitry (not shown) for transmitting the multiplexed data stream (MUX'ED DATA) over the transmis¬ sion link. Each of the plurality of channel processors 10 further includes a complexity output terminal and a control input terminal. The respective complexity output terminals of each of the plurality of channel processors are coupled to corre¬ sponding complexity input terminals of a bit rate allocator 30, and respective quota output terminals of the bit rate allocator 30 are coupled to the corresponding control input terminals of the plurality of channel processors 10. The multiplexer 20 may also include a quota update control output terminal, coupled to a corresonding quota update control input terminal of the bit rate allocator 30, shown in phantom in Fig. 1. In operation, each channel processor receives a signal at its control input terminal representing the bit rate allocated to it for the next quota period. The channel processor then encodes the signal at its data input terminal for the next quota period into a digitally encoded signal at the allocated bit rate. The encoded data signal is supplied to the corres¬ ponding input terminal of multiplexer 20. Multiplexer 20 operates in a known manner to combine the signals from all the channel processors into a multiplexed data stream. The multi- plexed data stream is then supplied to the circuitry compris¬ ing the data link for transmission, also in a known manner. During the encoding process, the channel processor 10 generates a signal at its complexity output terminal repre- senting the coding complexity of the signal being encoded. The bit rate allocator 30 receives the signals from the com¬ plexity output terminals of the channel processors 10, and, based on all of the complexity signals, dynamically adjusts the bit rate quotas for the next quota period among the plu- rality of channel processors 10. In a preferred embodiment, more complex signals are dynamically allocated a relatively higher bit rate than less complex signals. Different methods of determining the complexity of the video signal and for allocating bit rates based on the complexities are described below. Fig. 2 is a block diagram of a channel processor which may be used in the multiplexer system illustrated in Fig. 1. In Fig. 2, elements similar to those in Fig. 1 are designated by the same reference number, and are not described in detail below. In Fig. 2, a data input terminal 5 is coupled a video signal source (not shown) . Data input terminal 5 is coupled to a data input terminal of a constant bit rate encoder (CBR) 14, and a complexity analyzer 16. A data output terminal of the CBR encoder 14 is coupled to an input terminal of multi¬ plexer (MUX) 20 (of Fig. 1) . A control input terminal (CON¬ TROL) of the channel processor 10 is coupled to a quota input terminal Q of the CBR encoder 10. An output terminal of the complexity analyzer 16 is coupled to the complexity output terminal (COMPLEXITY) of the channel processor 10. In operation, the complexity analyzer 16 analyzes the complexity of the video signal at the data input terminal 5. A signal is produced at the output terminal of the complexity analyzer 16 representative of the complexity of the input signal. The complexity representative signal is supplied to the bit rate allocator 30 (of Fig. 1) . In response to this complexity signal (and those of the other channel processors 10), bit rate allocator 30 provides a signal to the control input terminal (CONTROL) of this channel processor 10 (and the other channel processors 10) representing the bit rate allo¬ cated to this channel processor 10. The CBR encoder 14 pro¬ vides a data path between its data input and data output terminals for producing an output signal encoded at a constant bit rate. The constant bit rate is set in response to the signal at the quota input terminal Q from the control input terminal (CONTROL) of the channel processor 10 from the bit rate allocator 30. It is possible that circuitry in the CBR encoder 14 can also be utilized by the complexity analyzer 16 in performing its analysis. In such a case, data is supplied from within the CBR encoder 14 directly to the complexity analyzer 16, as illustrated in phantom in Fig. 2. Such data from the CBR encoder 14 may supplement data from the input terminal 5, or replace it altogether, in which case there is no direct con¬ nection of the complexity analyzer to the data input terminal 5. In a preferred embodiment, each CBR encoder 14 is an encoder which compresses and encodes a video signal in accor¬ dance with a standard promulgated by the Moving Picture Expert Group (MPEG) , termed an MPEG encoder. Fig. 3 is a block diagram illustrating a portion of an MPEG encoder 14. The known components of the MPEG encoder 14 will not be described in detail below. MPEG encoders include other elements, not germane to an understanding of the present invention, which have been omitted from the figure to simplify it. In Fig. 3, a data input terminal 5 (DATA IN) of MPEG encoder 14 is coupled to a source (not shown) of a video signal to be compressed and encoded. Input terminal 5 is coupled to an input terminal of a frame buffer 41. Frame buffer 41 includes a plurality of frame period buffers or delay lines and a plurality of output terminals producing respective signals representing portions of different, but temporally adjacent, frames or pictures. The plurality of output terminals of the frame buffer 41 are coupled to corres¬ ponding input terminals of a motion estimator 42. An output terminal of the motion estimator is coupled to a discrete cosine transform (DCT) circuit 43. An output terminal of DCT circuit 43 is coupled to a data input terminal of a variable quantizer (Qu) circuit 46. An output terminal of variable quantizer circuit 46 is coupled to an input terminal of a variable length coder (VLC) 47. An output terminal of VLC 47 is coupled to an input terminal of an output buffer 48. A data output terminal of output buffer 48 is coupled to a data output terminal (DATA OUT) of MPEG encoder 14. Data output terminal (DATA OUT) of MPEG encoder 14 is coupled to a corre¬ sponding input terminal of multiplexer 20 (of Fig. 1) . A status output terminal of output buffer 48 is coupled to a status input terminal of a bit rate regulator 49. A control output terminal of bit rate regulator 49 is coupled to a control input terminal of variable quantizer 46. A quota input terminal Q of MPEG encoder 14 is coupled to a corre¬ sponding quota output terminal of bit rate allocator 30. The quota input terminal Q of the MPEG encoder 14 is coupled to a control input terminal of regulator 49. In operation, MPEG encoder 14 operates in a known manner to compress and encode the video signal at its input terminal for the next quota period at a bit rate determined by the signal at its Q input terminal. In the following example, an MPEG encoder encoding a video signal partitioned into groups (GOPs) consisting of twelve pictures or frames is described. However, it should be understood that the number of pictures or frames in a GOP can vary. Also in the following example, it is assumed that the bit rate allocation for each MPEG encoder is updated once each GOP, i.e. the quota period is the GOP period. However, it should also be understood that the quota period may be different, and may even vary over time, as will be described in more detail below. The frame buffer 41 receives and stores data representing the portion of the twelve frames in the exemplary GOP current¬ ly being encoded necessary to perform motion estimation, in a manner described below. This data is supplied to motion estimator 42. In the preferred embodiment, the first one of the twelve frames or pictures is used as a reference frame (I frame) , and is passed through the motion estimator to DCT circuit 43. For the remainder of the frames, a motion vector is generated in motion estimator 42 for each one of a plurali¬ ty of 16 pixel by 16 line blocks in each picture or frame, termed macroblocks in the MPEG standard document, either from preceding frames alone (P frames) , or interpolated from both preceding and succeeding frames (B frames) . As described above, frame buffer 41 holds the data necessary for the motion estimator to perform the estimation from preceding frames or the interpolation from preceding and succeeding frames. ' The generated motion vectors for a particular frame are then com¬ pared to the actual data in the frame being estimated and a motion difference signal is generated, and supplied to DCT circuit 43. In the DCT circuit 43, the 16 pixel by 16 line macro- blocks of spatial data from the I frame and motion difference signals from the P frames and B frames are divided into six 8 pixel by 8 line blocks (four luminance blocks, and two subsa - pled chrominance blocks) termed microblocks in the remainder of this application, in accordance with the MPEG standard document. A discrete cosine transform is performed on each microblock. The resulting 8 by 8 blocks of DCT coefficients are then supplied to variable quantizer 46. The 8 by 8 blocks of coefficients are quantized, scanned in a zig-zag order and supplied to VLC 47. The quantized DCT coefficients, and other side information (related to parameters of the encoded GOP) , representing the GOP are encoded using run-length coding in the VLC 47, and supplied to output buffer 48. It is known that the most direct way to control the output bit rate of VLC 47, and thus maintain the allocated constant bit rate for the MPEG encoder 14, is to control the number of quantizing levels (or, put another way, the quantiz- ing step size) to be used for quantizing each block of DCT coefficients in the variable quantizer 46. The quota update control signal Q supplied to the variable quantizer 46 from the bit rate regulator 49 performs this controlling function. Within a quota period, which is the period between successive bit rate quota update signals Q from the bit rate allocator 30 (of Fig. 1), the bit rate regulator 49, in known manner, sup¬ plies a control signal to the variable quantizer 46 which varies the number of levels into which each 16 by 16 macro- block in the GOP is being quantized in order to maintain the allocated bit rate for that quota period. The bit rate allocation for the bit rate regulator 49 in the present example is varied for each GOP period in response to the coding complexity values of the video signals in each of the plurality of channels, in a manner described below. However, bit rate regulator 49 uses a control strategy based on a constant allocated bit rate during the encoding of any single picture or frame. Thus, no more than a single quota update signal Q may be received by the bit rate regulator 49 during a single picture or frame, and any quota update signal Q received during a picture or frame takes effect at the beginning of the next picture or frame. In a preferred embodiment, bit rate allocator 30 (of Fig. 1) , is a computer system having connections coupled to various circuit components in the plurality 10 of channel processors. Fig. 4 is a block diagram of the hardware forming the bit rate allocator 30. In Fig. 4, a microprocessor (μP) 31 is coupled to a read/write memory (RAM) 32, a read-only memory (ROM) 33 and an input/output (I/O) controller 34 over a computer system bus 35. There are other components of the computer system, such as mass storage devices, and user terminals, which have not been illustrated in order to simplify the figure. The I/O controller 34 has a plurality of input terminals (COMPLEXITY) coupled to corresponding complexity output terminals of the plurality 10 of channel processors (of Fig. 1) and a plurality of output terminals (QUOTA) coupled to corresponding quota input terminals of the plurality 10 of channel processors. I/O controller 34 may also include an input terminal coupled to the multiplexer 20 (of Fig. 1) for receiving a quota update control signal, shown in phantom in Fig. 4. The microprocessor 31, RAM 32, ROM 33 and I/O controller 34 operate as a computer system in known manner to execute programs stored in the ROM 33, store and retrieve data in the RAM 32 and receive data from and transmit data to the devices attached to the I/O controller 34. The data representing the current coding complexity of the video signals being encoded in the plurality 10 of channel processors (of Fig. 1) is re- ceived from the corresponding output terminals of those chan- nel processors at the I/O controller 34 via the COMPLEXITY input terminals in a manner described below. The micropro¬ cessor 31 is notified of the receipt of this data in a known manner, e.g. polling, interrupt, etc. The microprocessor 31 retrieves those signals from the I/O controller 34 via the computer system bus 35, determines the quota of bits for the next quota period for each of the encoders, and supplies signals representing those quotas to the plurality 10 of channel processors via the QUOTA output terminals at the next quota period. The timing of sending quota update signals to the plurality 10 of channel processors may be controlled internally by the microprocessor 31, may be controlled in response to the timing of the complexity signals from the complexity analyzers 16, or may be controlled in response to a quota update signal from the multiplexer 20, as will be de¬ scribed in more detail below. A preferred method for determining the coding complexity of a video signal being encoded by an MPEG encoder 14 (of Fig. 3) utilizes the quantization scale factor (designated Q MB ) for each 16 by 16 macroblock and the number of bits (designated T KB ) used to encode that macroblock, for all the macroblocks in each picture or frame of the GOP. Fig. 5 is a block diagram of bit rate regulator 49 of the MPEG encoder 14 (of Fig. 3) and the complexity analyzer 16 (of Fig. 2) which generates a coding complexity representative signal according to this method. Various clock and control signals have been omitted from Fig 5, to simplify it. However, what signals are re¬ quired, and the necessary timing and voltage characteristics of these signals are well understood. The complexity analyzer 16 illustrated in Fig. 5 is an example of a complexity analyzer utilizing information from the CBR encoder 14 only, as illustrated in phantom in Fig. 2. In Fig. 5, bit rate regulator 49 has a status input terminal T ME coupled to the status output terminal of output buffer 48 (of Fig. 3). The control output terminal Q MB of bit rate regulator 49 is coupled to the control input terminal of variable quantizer 46 (of Fig. 3). Regulator 49 further has a control input terminal (Q) coupled to a corresponding quota output terminal of the bit rate allocator 30 (of Fig. 1). The status input terminal T MB of the bit rate regulator 49 is also coupled to a first input terminal of a first adder 92. An output terminal of the first adder 92 is coupled to an input terminal of a first latch 93. An output terminal of the first latch 93 is coupled to a first input terminal of a multiplier 94 and a second input terminal of the first adder 92. An output terminal of the multiplier 94 is coupled to an input terminal of a second latch 95. An output terminal of ' the second latch 95 is coupled to a coding complexity output terminal X pic . Complexity output terminal X pic is coupled a corresponding complexity input terminal of bit rate allocator 30 (of Fig. 1) . The control output terminal Q MB of bit rate regulator 49 is also coupled to a first input terminal of a second adder 96. An output terminal of the second adder 96 is coupled to an input terminal of a third latch 97. An output terminal of the third latch 97 is coupled to a numerator input terminal N of a divider 98 and to a second input terminal of the second adder 96. An output terminal of divider 98 is coupled to a second input terminal of the multiplier 94. A register 99 has an output terminal coupled to the denominator input terminal D of the divider 98. In operation, for each macroblock, bit rate regulator 49 generates a quantizing scale factor signal Q MB for the variable quantizer 46, in a known manner, based on the current bit rate quota and the number of bits used to encode preceding pic- tures, and then receives a signal from the output buffer 48 indicating the number of bits T MB used to encode that macro¬ block. The variable quantizer 46 (of Fig. 3) quantizes the DCT coefficients in each macroblock in accordance with the quantizing scale factor Q MB . The quantizing scale factor Q MB represents the quantizing step size, or percentage of the full dynamic range of the DCT coefficients in each quantizing level. A high value for Q MB means that there is a larger quan¬ tizing step size, and, consequently, fewer quantizing levels. Conversely, a low value for Q m means that there is a smaller quantizing step size, and, consequently, more quantizing levels. In the preferred embodiment, Q MB is a five bit integer (having values between 1 and 31) . An average quantizing scale factor for all the macro- blocks in a complete picture or frame (designated <5 pi ,) is then calculated as follows. At the beginning of each frame or picture, latches 93 and 97 are cleared to zero in response to a clear signal (not shown) . The combination of the second adder 96 and the third latch 97 operate as an accumulator to continually sum the macroblock quantizing scale factors Q MB from the bit rate regulator 49. At the same time, the combi¬ nation of the first adder 92 and the first latch 93 operate as an accumulator to continually sum the number of bits used thus far to encode the frame or picture. After all of the acroblocks in a frame or picture (a number designated N^) have been processed, latch 97 contains the sum of all of the macroblock quantizing scale factors Q MB produced by bit rate regulator 49, and latch 93 contains the sum of all the bits used to encode the picture or frame T pic . The divider 98 produces the quotient of the sum of all the macroblock quantizing scale factors Q MB in the picture or frame, divided by the number of macroblocks in the picture or frame N MB . This quotient is the average quantizing scale factor φ pic , for that frame or picture. The multiplier 94 pro¬ duces the product of ic and T pic , which is the coding complexi¬ ty for that picture (designated X pic ) , i.e. X P , C = T pic -φ pic . At the end of the picture or frame, the coding complexity signal X p , is latched into the second latch 95 in response to a clock signal (not shown) . The above described cycle then repeats for each frame or picture in the video signal being encoded. The coding complexity X pic is then supplied from latch 95 to a complexity input terminal of the I/O controller 34 of the bit rate allocator 30 (of Fig. 4) which performs the remaining processing to obtain the coding complexity for the GOP. The coding complexity for a GOP (designated X G0P ) is the sum of the X pιc 's for all of the pictures in that GOP. (See equation .OP ~ 2- t t "' ■ pic * ^ ic "* 2 m . ic (1) all pics In GOP all pics in GOP (1)) . The μP 31 acts as an accumulator by retrieving each X pi<: value from the I/O controller 34, and summing them over all of the frames or pictures in the GOP. The number of frames or pictures in a GOP (designated N) generally remains constant. While N is constant, X G0P can be calculated, on a sliding window basis, by adding the coding complexity value X pic of the latest picture, and subtracting the coding complexity value from the oldest picture in the GOP. In this case, an updated value of X G0P is available after each frame or picture. However, N can change. If N changes, then X G0P for the newly defined GOP must be calculated by summing the coding complexity values X pic from the new number of preceding pictures in the newly defined GOP, as in equation (1). As described above, it is possible that different chan¬ nels operate at different frame or picture rates, e.g. the standard video frame rate (in the U.S.) is 29.97 frames per second, for film images it is 24 frames per second, and for cartoons it is 15 frames per second. It is also possible that different channels have different numbers of pictures or frames in a GOP. Thus, it is possible that different channels have different GOP time periods. In order to accurately allocate bits to channels under such conditions, the GOP coding complexity values of the plurality of channels in such situations are time normalized in the bit rate allocator 30 by dividing the GOP complexity value from equation (1) for each channel by that channel's GOP time period (designated GOP_ ir , e ) . (See equation (2)). The normalized GOP coding complexity value (designated Xnorm co p) is then used to allocate bits among the different channels. The timing of the sampling of the complexity values, and the generation of quota values for such systems will be discussed in more detail below. Referring back to Fig. 5, as described above, for each macroblock, bit rate regulator 49 generates a quantizing scale factor signal Q MB for variable quantizer 46, and then receives a signal from the output buffer 48 indicating the number of bits T MB used to encode that macroblock. These signals may alternatively be supplied directly to the I/O controller 34 in the bit rate allocator 30 (of Fig. 4) . The μP 31 may then calculate the appropriate coding complexity measure (from equation (1) or equations (1) and (2)) internally. Furthermore, in order to simplify the transmission, the coding complexity value for each picture X pic may be scaled. In a preferred embodiment, this value is scaled, after multi¬ plier 94, into an eight bit number. This scaled value is then passed to the bit rate allocator 30 (of Fig. 4) . It may also be desirable for the computer system to maintain a file of the picture complexity values X pic , for example in a mass storage device (not shown), for other reasons, such as allowing recal¬ culation of the coding complexity value in the event N chang¬ es. Storage of an hour of 8 bit X pιc values will take 108 kilobytes (kB) for standard video and 86 kB for film. In the discussion below, X 1 will represent the currently available appropriate one of either X G0P (if all channels have the same GOP time period) or norm s op (if there are channels with different GOP time periods) from the i th channel proces- sor. The bit rate allocator 30 (of Fig. 1) generates respec¬ tive quota (Q) signals representing allocations of the avail¬ able bits in the transmission link fdr the next quota period based on the coding complexity values X 1 from all of the K channel processors forming the plurality of channel processors 10. The predetermined transmission link bit rate from the output terminal of the multiplexer 20 (of Fig. 1) (designated R) is allocated among the plurality 10 of channel processors, so that the i ch channel processor receives a bit rate alloca¬ tion designated R 1 . One method for allocating bit rates in the transmission link to the different channels is a linear allocation based on the currently available coding complexity X 1 of the preceding GOP period (on a sliding window basis, as discussed above) for all of the plurality 10 of channel processors (of Fig. 1). in this method, each processor i receives the same proportion R 1 of the total bit capacity R as the coding complexity of that encoder X 1 bears to the total coding complexity of all the encoders. (See equation (3)). However, it has been found that there is a lower bit rate allocation below which the quality of a reproduced image drops precipitously. In addi¬ tion, in the illustrated embodiment, the bit rate allocations for the next quota period depends upon the complexity measures from the preceding GOP. Thus, if there is a scene change from a simple image to a complex image, there may be insufficient bits allocated to encode the new, complex, scene because the allocation for the new scene was based on the preceding, simple, scene. An alternative method for allocating bit rates in the transmission link to different channels guarantees a minimum bit rate allocation RG 1 to each encoder i, and allocates the remaining bits linearly, as in equation (3). (See equation (4)). Each channel may have a different guaranteed minimum bit rate depending upon the anticipated overall complexity of the video transmitted through the channel and/or pricing of the channel to the providers of the video signals. Yet another alternative method for allocating bits in the transmission link to different channels provides a weighting factor P 1 for each encoder i and allocates bits proportionately according to the coding complexity values X 1 , as weighted by the weighting factors Ε > X (See equation (5)). As in the guaranteed minimum allocation method of equation (4) , the weighting factors P 1 may depend on anticipated overall complex- R 1 = κ Piχi R £rø (5) 3-1 ity of the video signal transmitted through the channel and/or pricing of the channel to the provider of the video signals. A preferred method for allocating bits in the transmis- sion link to different channels is a combination of the weigh¬ ted allocation method of equation (5) and the guaranteed minimum allocation method of equation (4) . In this method each channel is guaranteed a minimum allocation, and the remaining bits are allocated on a weighted proportion basis. (See equation (6)). As above, both the guaranteed minimum R 1 RG 1 + P^ 1 — [ i rR. -- ∑ RG £ rø 3 -1 ( 6 ) m X ~~ allocation and the weighting factors may depend upon the anticipated overall complexity of the video signal transmitted over the channel and/or pricing of the channel to the provider of the video signals. It is possible to further refine the bit allocations R 1 , in response to other parameters of the system. For example, it has been found that there is an upper bit rate allocation value above which no improvement in the quality of the repro- duced image is visible. Thus, an allocation of bits in excess of this upper allocation value is wasteful of bits in the transmission link. Also, the operator of the transmission link may impose a maximum bit rate allocation R_. ax (which can reflect the above upper bit rate allocation value) and/or a minimum bit rate allocation R mln for each channel. In addition, in order to minimize the potential for bit rate control oscillations and thus maximize bit rate control stability, there may be imposed a maximum increment of in¬ crease α and/or decrease β in the bit rate allocation from one quota period to the next for a channel. As above, the values of the upper bit rate allocation value, the maximum and mini¬ mum bit rate allocations, and maximum increments of increase and decrease, may be different for the different channels, and may depend on the anticipated overall complexity of the video signal to be transmitted through this channel and/or the pricing of the channel to the provider of the video signals. In addition, it is possible for the maximum and minimum incre¬ ments of increase and decrease to vary dynamically according to the degree of emptiness or fullness of the buffers in the channel. Furthermore, the allocated bit rates may be further refine in order to provide buffer management, e.g. to ensure that the output buffers 48 of the CBR encoders 10 (of Fig. 1) and the input buffers of the corresponding receiver decoders (not shown) do not overflow or underflow. Explicit buffer manage¬ ment is not necessary if the encoder buffer size E is con¬ trolled as illustrated in inequality (7), where D is the fixed decoder buffer size. If the encoder buffer size is selected according to inequality (7), the bit rate allocation may vary from R-^ n to R max without inducing overflow or underflow in either the encoder or decoder buffers. However, this method unduly limits the size of the encoder buffer, thus, unduly limiting the rate control flexibility. An alternative buffer management scheme is adaptive and uses the current, instantaneous bit rates for buffer manage¬ ment, rather than the fixed parameters R- ir , and R_ ax . Because the decoder buffer size was selected to be able to process data transmitted at the highest rate, R m x , the bit rate allo¬ cation can always be increased (to the system maximum, R aay ) without overflowing the decoder buffer. However, there is an instantaneous minimum bit rate which must be maintained in order to assure that the data already in the encoder buffer gets transmitted to the decoder buffer before its decode time. Thus, a minimum bit rate allocation to ensure that the decoder buffer does not underflow must be dynamically calculated. In dynamically calculating this minimum bit rate alloca- tion, when decreasing the bit rate allocation, both a newly determined encoder buffer size, and the amount of data already in the encoder buffer in some preceding amount of time must be taken into account. The newly determined encoder buffer size for frame n, designated E n , is determined in accordance with equation (8) in which Δ is the system delay time, which is a E D = L R nsw = ^- D (8) "max constant time delay between when a frame of video arrives at the encoder and when that frame is displayed at the decoder; D is the fixed decoder buffer size; and R neω is the new proposed bit rate allocation. This buffer size ensures that in steady state at the new bit rate allocation, there will be no over¬ flow or underflow in the encoder and decoder buffers. However, as described above, if the newly proposed bit rate allocation has been decreased, then there is a transition period, equal to the system delay time Δ, in which there may be too many bits already in the encoder buffer to be trans- mitted successfully to the decoder at the new lower rate. One proposed method for refining the newly proposed bit rate allocation is first to examine the number of bits, designated e, actually placed into the encoder buffer (buffer fullness) for the number of preceding frames in the system delay time Δ, designated T. Then the maximum buffer fullness number for the preceding T frames (designated e_, aX;r ) is compared to the newly determined encoder buffer size E n , from equation (8) . The minimum reduced bit rate allocation R reduced for channel i which guarantees that all the bits from the preceding T frames will be transmitted successfully to the receiver decoder, then, is given in equation (9) . ^ J?r 1 educed - e ~T--~—> ~ ( • Q '. If such limits are imposed in a multiplexer system, then after bit rate allocations have been calculated according to equations (3), (4), (5) or (6), those bit rate allocations are checked to determine whether they fall within the current upper and lower limits for that channel. First, the upper and lower limits for each channel i are determined. The upper limit bit rate allocation for any quota period k (designated Ri Per [k] ) is the minimum of: the maximum permissible increased allocation over the previous quota period k-1; and the maximum bit rate allocation limit. (See equation (10)). The lower R-i per ik] = minU^, (1 + a) R - [k - l] } (10) limit bit allocation for any quota period k, R^ cw^ .k], is the maximum of: the minimum bit rate allocation limit; the minimum permissible decreased allocation over the previous quota period k-1 and the minimum buffer management reduced bit rate allocation from equation (9). (See equation (11)). Then adjustments in the bit rate allocations for the channels are made. R ow. r C k] = max {R- in , ( 1 - β J R^ k - l ] , e_. ax# r / Δ} ( ID If the allocated bit rate for any channel exceeds either limiting value, the bit rate allocation for that channel is set to that limiting value, and the available remaining bit rate is reallocated among the other channels. For example, if the bit rate allocated to a channel i, as calculated in equa¬ tion (3), (4), (5) or (6), is greater than the upper limit for that channel, as calculated in equation (10), then the bit rate for channel i is set to that upper limit R^ pp^ . If, conversely, the bit rate is less than the lower limit calcu- lated in equation (11), then the bit rate is set to that lower limit R 1 ιower . (See equation (12)). iower .k] if R i [k] <Ri ower [k] R i [k] = Rapper . k] if R i [k] >Ri pper [k] ( 12 ) R A [k] otherwise If any of the bit rate allocations are changed by the limiting operations of equations (10), (11) and (12), then the remaining available bit rate is reallocated among the non- limited channels in accordance with equation (3), (4), (5) or (6). Then these channels are again checked against the limits in equations (10), (11) and (12). This cycle is repeated until all bit rate allocations are finalized. In the above embodiment, the coding complexity period is the GOP period, determined picture by picture on a sliding window basis, which is of sufficient duration that changes in bit rate allocations in a channel from one quota period to the next should general¬ ly be relatively small. Consequently, equations (10), (11) and (12) should only rarely be invoked. The timing of the coding complexity sampling and genera¬ tion of updated bit rate quotas based on the coding complexi¬ ties is complicated if the channels are operating with differ¬ ent GOP time periods. There are, however, approaches which yield accurate coding complexity sampling and bit rate quota allocation in this situation. In a first approach, a constant quota update period is calculated in such a manner that each channel has an equal number of quota update periods in each GOP. In this approach, the number of sample and quota update periods per GOP may vary from channel to channel, but, for any channel, the number of such sample and quota update periods within a GOP is constant. In a second approach, a sample is taken, and new allocation generated whenever any channel begins a new GOP, and the number of bits allocated in the new quota is calculated taking into account the length of the time period from the previous sample to the current sample. A third approach is a variation of the third approach in which a sample is taken and a new allocation in response to a quota update control signal. The timing of the quota update control signal, as described above, is arbitrary, provided it does not provide updates more than once per picture or frame in any of the channels. In the third approach, the number of bits allocated in the new quota is calculated taking into account the length of the time period from the previous sample to the current sample. Fig. 7 is a timing diagram illustrating the sampling and quota updates in a system using the first approach. In order to simplify the drawing, only two channels are illustrated. In Fig. 7, channel 1 is an example of a channel transmitting standard video having a frame rate of about 30 frames per second (in the U.S.). Channel 2 is an example of a channel transmitting a film having a frame rate of 24 frames per second. Each of the channels is assumed to have 12 frames per GOP. Channel 1, thus, starts a new GOP every 0.4 seconds, or 2.5 GOPs per second, while channel 2 starts a new GOP every 0,5 seconds, or 2 GOPs per second. The sampling rate selected is one sample every 0.1 seconds. Thus, in channel 1, there are four sample and quota updates in every GOP, and in channel 2 there are five sample and quota updates in every GOP. The sampling times, t s , are illustrated by vertical dashed lines. Because the time period between samples Δt is constant (0.1 seconds), the bit rate allocations R 1 from equations (3) through (12) may be expressed as the number of bits being allocated, designated C 1 , which is the product of the bit rate quota R 1 and the constant sample period Δt, i.e. C^R^t, or the bit rate quotas R 1 may be used unchanged. These bit rate allocations may be accumulated and used in the channel proces- sors 10 (of Fig. 1) according to the known scheme termed the "token and leaky bucket" scheme. Fig. 8 is a timing diagram illustrating the sampling of coding complexity values and quota updating in a system using the second approach, described above. The respective channels illustrated in Fig. 8 are carrying the same signals as in Fig. 7. In Fig. 8, samples of the current coding complexity values from all the channels are taken whenever any channel begins a new GOP. New allocations are generated based on the values of those samples, and the time period Δt since the last sample. These sample times are illustrated in Fig. 8 as vertical dashed lines tl - t8, where t2, t3, t4, t6 and t8 correspond to starts of GOPs in channel 1, and tl, t3, t5 and t7 corre¬ spond to starts of GOPs in channel 2. Although t3 illustrates a sampling time corresponding to starts of GOPs in both chan¬ nel 1 and 2, there is no requirement that such a time occur. At each sample time, the current coding complexity values (from the preceding GOP, available picture by picture on a sliding window basis) in all the channels are sampled. Equa- tions (3) through (12) may be used to calculate the next bit rate quota proportions, but in determining the actual number of bits available to be allocated, the amount of time Δt since the last sample must be taken into account. In order to properly compensate for the different sample periods, the total available bit rate R in equations (3) through (12) is replaced with the number of bits available for allocation, designated C, which is the product of the total available bit rate R and the sample period Δt, i.e. C=RΔt. The number of bits calculated by equations (3) through (12) are then allo¬ cated to the respective channel processors 10 (of Fig. 1) which, as above, use the "token and leaky bucket" scheme to accumulate and use the allocated bits. Fig. 9 is a timing diagram illustrating the sampling of coding complexity values and quota updating in a system using the third approach, described above. The respective channels illustrated in Fig. 9 are carrying the same signals as in Figs. 7 and 8. In Fig. 9, samples of the current coding com- plexity values from all the channels are taken at arbitrary times, which may be controlled, for example, by a quota update signal issued by the multiplexer 20 (of Fig. 1) . New alloca¬ tions are generated based on the values of those samples, and the time period since the last sample. These sample times are illustrated in Fig. 9 as vertical dashed lines tl - t4. Al¬ though illustrated in Fig. 9 as having a constant time period Δt this is not a requirement. The quota update time period may remain constant, or shift from one time period to another over time, or be completely arbitrary, provided that the time interval between quota update signals is longer than the shortest frame period of all the channels so that no channel receives two quota updates within a single picture or frame period (as described above) . In a preferred embodiment, however, the quota update period will remain constant over relatively long periods of time. At each sample time, the current coding complexity values (from the preceding GOP, available picture by picture on a sliding window basis) in all the channels are sampled. As above, equations (3) through (12) may be used to calculate the next bit rate quota proportions, where the amount of time Δt since the last sample is taken into account and the total available bit rate R is replaced with the number of bits available for allocation C=RΔt. The number of bits calculated by equations (3) through (12) are then allocated to the re- spective channel processors 10 (of Fig. 1) which, as above, use the "token and leaky bucket" scheme to accumulate and use the allocated bits. Any of the above approaches will accu¬ rately allocate bit rates to the respective channel processors 10 when the video signals from the different channels 5 have different GOP time periods. The timing of the sampling of coding complexity values and the generation of updated bit rate quotas for the differ¬ ent channels may be simplified if all of the channels are operating at the same frame rate, and have the same number of frames in a GOP, i.e. all the channels have the same GOP time period, GOP ci -, e . Fig. 6 is a timing diagram illustrating coding complexity sample and quota update timing in such a system. In Fig. 6, each horizontal line corresponds to a respective channel 1 - K. The short vertical lines extending upward from the horizontal lines represent the time when coding of an I frame is begun for that channel, which is considered to be the beginning of a GOP for that channel. The time period for a GOP, GOP time , is equal in all of the channels, but, as can be seen, the beginning times of the GOPs for the respective chan¬ nels are different. In fact, it has been found desirable to have different starting times for the GOPs for the respective channels so that coding of I frames do not overlap. This in¬ creases the complexity variations across the different chan- nels. It has been found that so long as the same number of I frames, P frames, and B frames are taken into account in calculating the coding complexity value, it does not matter that those frames come from different GOPs. Thus, as shown by the solid lines extending across all the channel's time axes, a coding complexity value sample may be taken simultaneously from all the channels at any time within a GOP. Updates of the bit rate quotas for all of the channels may then be gener¬ ated from that sample and transmitted back to the channel processors 10 (of Fig. 1) . The above multiplexer system has been described as a collocated system. However, the plurality 10 of channel processors could reside in remote locations from the bit rate allocator 30 and the multiplexer 20. In such a system, commu¬ nication links would be established between the encoders and the bit rate allocator. In this case, some portion of the bits transmitted between the processors 10 and the multiplexer could be dedicated to transmission of complexity information from the processors.

Claims: What is claimed is 1. Apparatus for asynchronously generating control signals, comprising: a plurality of sources (5) of asynchronous data signals; a plurality of data processing channels (10,14), each processing a respective one of the data signals (DATA IN) responsive to a respective control signal (CONTROL) ; a plurality of parameter determining circuits (10,16), each responsive to a respective one of the data signals (DATA IN) , for producing a signal (COMPLEXITY) representing a param¬ eter of the one of the data signals (DATA IN) ; a data sampler (30), coupled to said plurality of parame¬ ter determining circuits (10,16), for sampling the parameter representative signals (COMPLEXITY) from all of parameter determining circuits (10,16) substantially simultaneously at predetermined sampling time intervals; and a control signal generator (30), responsive to the sam¬ pled parameter representative signals (COMPLEXITY) , for gener¬ ating respective control signals (CONTROL) for the plurality of data processing channels (10) having values based on the sampled parameter representative signals (COMPLEXITY) and the preceding sampling time interval. 2. The control signal generating apparatus of claim 1, wherein: each data signal source (5) produces a data signal in¬ cluding successive groups of data having respective data group time intervals; the data sampler (30) samples the parameter representa¬ tive signals (COMPLEXITY) at the predetermined sampling time intervals having a constant time duration (t_) such that there are an integral number of sampling intervals in the data group time interval of each data signal (DATA IN) ; and the control signal generator (30) generates the respec¬ tive control signals (CONTROL) having values based on the constant sampling time interval duration. 3. The control signal generating apparatus of claim 1, wherein: each data signal source (5) produces a data signal (DATA IN) including successive groups of data having respective data group starting times; the data sampler (30) samples the parameter representa¬ tive signals (COMPLEXITY) at sample times (ti-t 8 ) being every data group starting time of the respective data signals; and the control signal generator (30) generates the respec¬ tive control signals (CONTROL) having values which are normal¬ ized with respect to the time interval since the preceding sample time ( i-tg) . 4. The control signal generating apparatus of claim 1, wherein: each data signal source (5) produces a data signal (DATA IN) including successive frames of data having a respective frame period; the data sampler (30) samples the parameter representa¬ tive signals (COMPLEXITY) at sample times (t 2 -t 4 ) controlled by successive quota update signal occuring at time intervals longer than a shortest one of the respective frame periods; and the control signal generator (30) generates the respec¬ tive control signals (CONTROL) having values which are normal¬ ized with respect to the time interval since the preceding sample time (ti-t 4 ) . 5. The control signal generating apparatus of claim 1, wherein each parameter determining circuit (10,16) produces the parameter representative signal (COMPLEXITY) having a value independent of the sampling time intervals. 6. Video signal multiplexing apparatus, including a multiplexer (20) for multiplexing a plurality of encoded video signals, comprising: a plurality of sources (5) of video signals including successive groups of pictures (GOP) having respective GOP time durations; a plurality of constant bit rate encoders (10,14), each encoding a respective one of the video signals at a bit rate controlled in response to a respective bit rate allocation signal (CONTROL) ; a plurality of coding complexity determining circuits (10,16), each responsive to a respective one of the video sig¬ nals, for producing a signal (COMPLEXITY) representing the coding complexity of the one of the video signals; a data sampler (30), coupled to said plurality of coding complexity determining circuits (10,16), for sampling the coding complexity representative signals (COMPLEXITY) from all of coding complexity determining circuits (10,16) substantial¬ ly simultaneously at constant quota time intervals having a fixed duration t s such that there are respective integral numbers of quota.time intervals in each of the respective GOP time durations; and a bit rate allocation signal generator (30), responsive to the sampled coding complexity representative signals (COM¬ PLEXITY) , for generating respective bit rate allocation sig¬ nals (CONTROL) for the plurality of constant bit rate encoders (10,14) based on the respective sampled coding complexity representative signals (COMPLEXITY) . 7. The multiplexing apparatus of claim 6, wherein: the multiplexer (20) produces an output signal (15) at a fixed maximum bit rate; and the bit rate allocation signal generator (30) comprises circuitry (30) for generating the respective bit rate alloca¬ tion signals (CONTROL) for allocating the fixed maximum bit rate for the constant quota time intervals among the respec¬ tive constant bit rate encoders (10,14) based on the respec¬ tive sampled coding complexities (COMPLEXITY) . 8. The multiplexing apparatus of claim 7 wherein each of the plurality of constant bit rate encoders (10,14) encode the one of the video signals in response to the bit rate allocation signal (CONTROL) using a token-and-leaky-bucket scheme. 9. The multiplexing apparatus of claim 6, wherein each coding complexity determining circuit (10,16) produces the coding complexity representative signal (COMPLEXITY) having a value independent of the quota time intervals. 10. Video signal multiplexing apparatus, including a multiplexer (20) for multiplexing a plurality of encoded video signals, comprising: a plurality of sources (5) of video signals including successive groups of pictures (GOP) having respective GOP time durations and respective GOP starting times; a plurality of constant bit rate encoders (10,14), each encoding a respective one of the video signals at a bit rate controlled in response to a respective bit rate allocation signal (CONTROL); a plurality of coding complexity determining circuits (10,16), each responsive to a respective one of the video sig¬ nals, for producing a signal (COMPLEXITY) representing the coding complexity of the one of the video signals; a data sampler (30), coupled to said plurality of coding complexity determining circuits (10,16), for sampling the coding complexity representative signals (COMPLEXITY) from all of coding complexity determining circuits (10,16) substantial¬ ly simultaneously at each respective GOP starting time of the plurality of video signals; and a bit rate allocation signal generator (30), responsive to the sampled coding complexity representative signals (COM¬ PLEXITY) , for generating respective bit rate allocation sig¬ nals (CONTROL) for the plurality of constant bit rate encod¬ ers (10,14) based on the sampled coding complexity representa¬ tive signals (COMPLEXITY) normalized to the time duration since the preceding GOP starting time. 11. The multiplexing apparatus of claim 10, wherein: the multiplexer (20) produces an output signal (15) at a fixed maximum bit rate; and the bit rate allocation signal generator (30) comprises: circuitry (30) for determining a normalized bit rate quota based upon the fixed maximum bit rate and the quota time interval, being the duration since the preceding GOP starting time; and circuitry (30) for allocating the normalized bit rate quota among the respective constant bit rate encoders based on the values of the respective coding complexity representative signals. 12. The multiplexing apparatus of claim 11 wherein each of the plurality of constant bit rate encoders (10,14) encode rt nals (CONTROL) for the plurality of constant bit rate encoders (10,14) based on the sampled coding complexity representative signals (COMPLEXITY) normalized to the time duration since the preceding quota update signal. 15. The multiplexing apparatus of claim 14, wherein: the multiplexer (20) produces an output signal (15) at a fixed maximum bit rate; and the bit rate allocation signal generator (30) comprises: circuitry (30) for determining a normalized bit rate quota based upon the fixed maximum bit rate and the time interval since the preceding quota update signal; and circuitry (30) for allocating the normalized bit rate quota among the respective constant bit rate encoders based on the values of the respective coding complexity representative signals. 16. The multiplexing apparatus of claim 15 wherein each of the plurality of constant bit rate encoders (10,14) encode the one of the video signals in response to the bit rate allocation signal (CONTROL) using a token-and-leaky-bucket scheme. 17. The multiplexing apparatus of claim 14, wherein each coding complexity determining circuit (10,16) produces the coding complexity representative signal (COMPLEXITY) having a value independent of the time duration since the preceding GOP starting time. 18. The multiplexing apparatus of claim 14, wherein the quota update signal is generated by the multiplexer (20) .

Inventors: JOSEPH KURIACOSE, OZKAN MEHMET KEMAL, REININGER DANIEL JORGE, JOSEPH, KURIACOSE, OZKAN, MEHMET, KEMAL, REININGER, DANIEL, JORGE
Applicants: JOSEPH KURIACOSE, OZKAN MEHMET KEMAL, REININGER DANIEL JORGE, THOMSON CONSUMER ELECTRONICS, JOSEPH, KURIACOSE, OZKAN, MEHMET, KEMAL, REININGER, DANIEL, JORGE, THOMSON CONSUMER ELECTRONICS, INC.
Application year: 1994
Main classification: H04J3
IPC codes: H04J3, H04N7