| 摘要 |
The method is intended especially for video signals in which so- called coefficient blocks occur as an intermediate signal. The majority of the signal values belonging to a coefficient block - also referred to as coefficients - are 0. For this reason, an uninterrupted sub-string of zeroes is combined with the subsequent coefficient to form an event, provided that the length of the sub-string of zeroes remains below a maximum value. Once the maximum value has been reached, this maximum sub-string of zeroes, along with the subsequent coefficient, is regarded as an event and subsequent coefficients are combined to form further events. A Huffmann code word is allocated to each event for transmission purposes. To form events from the coefficient string, the coefficients are fed via an input line (e) to a comparator circuit (K) and to the address inputs of a memory (PROM). The count of a counter (Z) is supplied to further address inputs of the memory (PROM) and also to the comparator (K). If a coefficient on the input line (e) is 0, the comparator sends a counting pulse to the counter (Z), provided that a maximum count has not yet been reached. If the coefficient at the input (E1) of the comparator (K) has a non-zero value, or the maximum count has been reached, the comparator (K) sends a reset pulse to the counter (Z), with which the code word occurring at the memory (PROM) is simultaneously transferred into a flip-flop circuit (FF). <IMAGE> |
