EP0891094A2

Video decompression

Abstract

A parallel Huffman decoder, comprising : an input, accepting a mixed data stream comprising Huffman coded variable length codes, fixed length codes, and data tokens, wherein all complete Huffman codes are received in a single cycle of operation ;a selector operative on said data stream, wherein in a first mode of operation variable length codes are provided to said address lines of a Huffman Code ROM, and in a second mode of operation data tokens and a signal representative of a length of fixed length codes is output by the decoder without reference to said ROM ;a pair of input registers for receiving Huffman coded data, both of said registers directing input in parallel to said selector ; and a Huffman Code ROM for receiving input from said selector and another ROM table select input; said ROM providing a first decoded data output, said selector being responsive to a second output of said ROM.

EP0891094A2, drawing sheet 1 — Sheet 1 of 365

Term

Term ended

Projected expiry passed 28 July 2015, 11.2 years ago.

24 claims: 3 independent, 21 dependent

1
A parallel Huffman decoder, comprising :an input, accepting a mixed data stream comprising Huffman coded variable length codes, fixed length codes, and data tokens, wherein all complete Huffman codes are received in a single cycle of operation ;a selector operative on said data stream, wherein in a first mode of operation variable length codes are provided to said address lines of a Huffman Code ROM, and in a second mode of operation data tokens and a signal representative of a length of fixed length codes is output by the decoder without reference to said ROM ;a pair of input registers for receiving Huffman coded data, both of said registers directing input in parallel to said selector ;anda Human Code ROM for receiving input from said selector and another ROM table select input;said ROM providing a first decoded data output, said selector being responsive to a second output of said ROM.
5
A Huffman decoder, as recited in my one of claims 1 to 4, wherein one of said pair of input registers handles most significant data ad the other of said pair of registers handles least significant data.
20
A method of decoding a mixed data stream comprising Huffman coded variable length codes, fixed length codes, and data tokens, the stream including a first code having a first length, and a second code having a second length, comprising the steps of :memorizing data in a plurality of locations of a memory, wherein said memory has a plurality of address lines for addressing said locations, a first set of said address lines and a second set of said address lines being defined to correspond with a pattern of bits of said first code and a pattern of bits of said second code respectively ;identifying variable length codes in the data stream ;respectively associating each bit of a said variable length code with a said address line ;activating said address lines responsive to the bits associated therewith ;coupling a first wordline driver to said first set of address lines ;coupling a second wordline driver to said second set of address lines ;activating a selected one of said first wordline driver and said second wordline driver in response to signals on all of their respectively coupled address lines ;obtaining data from a location in said memory that is driven by said activated wordline driver ;from said obtained data determining the length of the variable length code ;according to said determined length, aligning bits of a succeeding variable length code with said address lines for association therewith ;identifying fixed length codes in the data stream ;and outputting a decoded value thereof without accessing said memory.

Independent claims3

718 paragraphs in 6 sections, as filed

This application claims priority under British Application Serial No. 9415413.5 filed July 29, 1994.

The present invention relates generally to a new and improved system for decoding a plurality of audio and video signals and, more particularly, to a new and improved system for decoding a plurality of MPEG audio and video signals.

A serial pipeline processing system of the present invention comprises a single two-wire bus used for carrying unique and specialized interactive interfacing tokens, in the form of control tokens and data tokens, to a plurality of adaptive decompression circuits and the like positioned as a reconfigurable pipeline processor.

United States Patent 5,111,292 discloses an apparatus for encoding/decoding a HDTV signal for e.g. terrestrial transmission includes a priority selection processor for parsing compressed video codewords between high and low priority channels for transmission. A compression circuit responsive to high definition video source signals provides hierarchically layered codewords CW representing compressed video data and associated codewords T, defining the types of data represented by codewords CW. The priority selection processor, responsive to the codewords CW and T, counts the number of bits in predetermined blocks of data and determines the number of bits in each block to be allocated to the respective channels. Thereafter the processor parses the codewords CW into high and low priority codeword sequences wherein the high and low priority codeword sequences correspond to compressed video data of relatively greater and lesser importance to image reproduction respectively.

United States Patent No. 5,122,875 discloses an apparatus for encoding/decoding an HDTV signal. The apparatus includes a compression circuit responsive to high definition video source signals for providing hierarchically layered codewords CW representing compressed video data and associated codewords T, defining the types of data represented by the codewords CW. A priority selection circuit, responsive to the codewords CW and T, parses the codewords CW into high and low priority codeword sequences wherein the high and low priority codeword sequences correspond to compressed video data of relatively greater and lesser importance to image reproduction respectively. A transport processor, responsive to the high and low priority codeword sequences, forms high and low priority transport blocks of high and low priority codewords, respectively. Each transport block includes a header, codewords CW and error detection check bits. The respective transport blocks are applied to a forward error check circuit for applying additional error check data. Thereafter, the high and low priority data are applied to a modem wherein quadrature amplitude modulates respective carriers for transmission.

Accordingly, those skilled in the art have recognized a long felt need for a new and improved video decompression system obviating the deficiencies of the prior art systems. The present invention clearly fulfills this need. <ul id="ul0001" list-style="none" compact="compact"><li>Figure 1 illustrates data flow through a preferred embodiment in the present invention;</li><li>Figure 2 shows an example of a 13 bit word used to address 8 bit data in a 64 X 32 RAM;</li><li>Figure 3 is a functional block diagram of a Register file in the present invention;</li><li>Figure 4 illustrates data flow in a register file as shown in Figure 3;</li><li>Figure 5 is a block diagram illustrating register file address decoding, in accordance with the present invention;</li><li>Figure 6 is a block diagram of a Microcodable State Machine, in accordance with the present invention;</li><li>Figure 7 shows a fixed width word, in accordance with the present invention, used for addressing and having an address field, a substitution field and a substitution header;</li><li>Figure 8 is a block diagram of one example of an Arithmetic Core in accordance with the present invention;</li><li>Figure 9 illustrates the basis steps in a method, in accordance with the present invention, for performing an IDCT on input data;</li><li>Figure 10 is a block diagram illustrating the combined, simplified, two-stage architecture of an IDCT system, in accordance with the present invention;</li><li>Figure 11 is a simplified block diagram of an integrated circuit that comprises the main system components of the IDCT shown in Figure 10;</li><li>Figure 12a and Figure 12b taken, together are a block diagram of a pre-processing circuit corresponding to one of the main system component; for ease of explanation, these figures are referred collectively as Figure 12;</li><li>Figure 13a, Figure 13b and Figure 13c depict timing diagrams which illustrate the relationships between timing and control signals in the IDCT system of a preferred embodiment;</li><li>Figure 14a and Figure 14b taken together are a block diagram of a common processing circuit in the IDCT system;for ease of explanation, these figures are referred to collectively as Figure 14;</li><li>Figure 15a, Figure 15b, Figure 15c and Figure 15d taken together are a block diagram of a post-processing circuit which corresponds to another main component of the system and are referred collectively as Figure 15;</li><li>Figure 16 is a block diagram, in accordance with the present invention illustrating an IDCT having a twin data stream, a transpose RAM and an improved buffer;</li><li>Figure 17 is a block diagram showing in further detail the 1-D IDCT system shown in Figure 16;</li><li>Figure 18 is a block diagram showing greater detail of the transform system as shown in Figure 17;</li><li>Figure 19 is a block diagram showing in greater detail the input buffer shown in Figure 18;</li><li>Figure 20 is a simplified block diagram of a pre-processing circuit "PREC", in accordance with the present invention;</li><li>Figure 21 is a block diagram illustrating a common processing circuit "CBLK" found in the IDCT;</li><li>Figure 22 is a block diagram of a post-processing circuit "POSTC";</li><li>Figure 23 is another illustration of the post-processing circuit shown in Figure 22;</li><li>Figure 24 is a block diagram depicting a round and saturate block, in accordance with the present invention;</li><li>Figure 25 is a block diagram of an output buffer in the present invention;</li><li>Figure 26 is a block diagram of a control shift register, in accordance with the present invention;</li><li>Figure 27 is a block diagram of a control shift register decode in the present invention;</li><li>Figure 28 depicts a control shift register and an input control buffer;</li><li>Figure 29 illustrates a control circuit for a T2 data stream;</li><li>Figure 30 shows data in a counter for a T1 data stream;</li><li>Figure 31 depicts data in a counter for a T2 data stream in the present invention;</li><li>Figure 32 is a timing diagram showing the initialization of the IDCT and associated circuitry</li><li>Figure 33 is a timing diagram showing the interleaving of T1 and T2 data;</li><li>Figure 34 is a timing diagram illustrating slippage and recovery of T2 data;</li><li>Figure 35 is a timing diagram depicting a flushing operation of the IDCT and associated circuitry in the present invention;</li><li>Figure 36 illustrates start-up of the system, in accordance with the present invention;</li><li>Figure 37 depicts slippage and recovery in the early stages of interleaving T1 and T2 data;</li><li>Figure 38 illustrates another preferred embodiment of the IDCT system shown in Figures 16 through 37;</li><li>Figure 39 shows MPEG information streams being demultiplexed, in accordance with the present invention, into elementary streams containing data and timestamp information;</li><li>Figure 40 depicts a first embodiment of an elementary stream timestamp error determination and time synchronization system, in accordance with the present invention;</li><li>Figure 41 illustrates a second embodiment of an elementary stream timestamp error determination and time synchronization system, in accordance with the present invention;</li><li>Figure 42 shows a third embodiment of an elementary stream timestamp error determination and time synchronization system, in accordance with the present invention;</li><li>Figure 43 depicts a first embodiment of a video timestamp error determination and time synchronization system, in accordance with the present invention;</li><li>Figure 44 illustrates a second embodiment of a video timestamp error determination and time synchronization system, in accordance with the present invention;</li><li>Figure 45 shows the second embodiment of a video timestamp error determination and time synchronization system as shown in Figure 44 and operating at 30Hz;</li><li>Figure 46 shows timestamp information flow through the system of the present invention;</li><li>Figure 47 is a block diagram illustrating synchronization time information being processed by a microprogrammable state machine;</li><li>Figure 48 is a block diagram illustrating a first preferred embodiment of the present invention;</li><li>Figure 49 is another block diagram illustrating the first preferred embodiment of the present invention;</li><li>Figure 50 depicts a second preferred embodiment of the present invention;</li><li>Figure 51 illustrates a detailed method of addressing used by the second preferred embodiment, in accordance with the present invention;</li><li>Figure 52 is a block diagram showing an apparatus for decoding Huffman VLCs, in accordance with the present invention;</li><li>Figure 53 is a schematic diagram showing the overall structure of the parallel huffman decoder of the present invention;</li><li>Figure 54 is a schematic diagram illustrating a ROM adapted for decoding parallel huffman codes;</li><li>Figure 55 illustrates a first embodiment of a ROM adapted for decoding parallel huffman codes;</li><li>Figure 56 illustrates a second embodiment of a ROM adapted for decoding parallel huffman codes;</li><li>Figure 57 depicts a third embodiment of a ROM adapted for decoding parallel huffman codes;</li><li>Figure 58 is a block diagram illustrating the primary system component of one embodiment of the present invention;</li><li>Figure 59 is a block diagram depicting the start code detector of the present invention;</li><li>Figure 60 is a block diagram showing the parser of the present invention;</li><li>Figure 61 is a block diagram depicting the primary components of the spatial processing circuitry of the present invention;</li><li>Figure 62 is a block diagram illustrating the display circuitry, in accordance with the present invention;</li><li>Figure 63 illustrates one embodiment of timestamp management, in accordance with the present invention;</li><li>Figure 64 shows another embodiment of timestamp management in the present invention;</li><li>Figure 65 is a block diagram depicting the hardware components of the system of the present invention;</li><li>Figure 66 is a block diagram providing an overview of the system components of the microcontroller of the present invention;</li><li>Figure 67 is a simplified diagram illustrating the Arithmetic core of the present invention;</li><li>Figure 68 illustrates the ALU of the present invention;</li><li>Figure 69 depicts a register file, in accordance with the present invention;</li><li>Figure 70 illustrates the writing to independent bus registers in the present invention;</li><li>Figure 71 illustrates frame-based prediction wherein vector[1] = 0 and vector[0] = 0;</li><li>Figure 72 depicts frame-based prediction wherein vector[1] = 0 and vector[0] = 1;</li><li>Figure 73 shows frame-based prediction wherein vector[1] = 1 and vector[0] = 0;</li><li>Figure 74 illustrates frame-based prediction wherein vector[1] = 1 and vector[0] = 1;</li><li>Figure 75 depicts field-based prediction wherein motion_vertical_field_select = 0 and vector[0] = 0;</li><li>Figure 76 illustrates field-based prediction wherein motion_vertical_field_select = 0 and vector[0] = 1;</li><li>Figure 77 similarly illustrates field-based prediction wherein motion_vertical_field_select = 1 and vector[0] = 0;</li><li>Figure 78 shows field-based prediction wherein motion_vertical_field_select = 1 and vector[0] = 1;</li><li>Figure 79 shows field-based prediction in frame pictures wherein motion_vertical_field_select = 0 and vector[0] = 0;</li><li>Figure 80 illustrates the prediction of Figure 79 wherein motion_vertical_field_select = 0 and vector[0] = 1;</li><li>Figure 81 shows the prediction mode of Figure 79 wherein motion_vertical_field_select = 1 and vector[0] = 0;</li><li>Figure 82 shows the prediction mode of Figure 79 wherein both motion_vertical_field_select and vector[0] = 1;</li><li>Figure 83 illustrates an additional mode of prediction filtering;</li><li>Figure 84 shows still another prediction mode;</li><li>Figure 85 illustrates yet another prediction mode, in accordance with the present invention;</li><li>Figure 86 shows another prediction mode of the present invention;</li><li>Figure 87 is a block diagram illustrating the organization of the various system components of the display system of the present invention;</li><li>Figure 88 depicts a 4:3 filtering operation;</li><li>Figure 89 depicts a 3:2 filtering operation;</li><li>Figure 90 illustrates a 2:1 filtering operation of the present invention;</li><li>Figure 91 shows a three tap filter used in the present invention;</li><li>Figure 92 illustrates the repetition of erroneous pels;</li><li>Figure 93 depicts the filed_id signal of the present invention;</li><li>Figure 94 shows the horizontal timing points (cycles), in accordance with the present invention;</li><li>Figure 95 illustrates the PAL vertical timing at 625 lines per field, in accordance with the present invention;</li><li>Figure 96 illustrates the NTSCV vertical timing at 525 lines per field, in accordance with the present invention;</li><li>Figure 97 shows a horizontal counting machine, in accordance with the present invention;</li><li>Figure 98 illustrates border generation in the present invention;</li><li>Figure 99 depicts picture cropping, in accordance with the present invention;</li><li>Figure 100 is a block diagram illustrating the present invention as a chip;</li><li>Figure 101 illustrates the sysclock requirements of the present invention;</li><li>Figure 102 depicts the two-wire protocol on a coded data interface, in accordance with the present invention;</li><li>Figure 103 shows a DATA token of the present invention;</li><li>Figure 104 shows a FLUSH token of the present invention;</li><li>Figure 105 illustrates the timing of the coded data interface;</li><li>Figure 106 depicts using non-even mark-space ratio CDCLOCK, in accordance with the present invention;</li><li>Figure 107 shows output timing in 16 bit mode in the present invention;</li><li>Figure 108 illustrates output timing in 8 bit mode in the present invention;</li><li>Figure 109 shows the timing of the video output interface in the present invention;</li><li>Figure 110 depicts video output mode signals, in accordance with the present invention;</li><li>Figure 111 shows horizontal timing in the present invention;</li><li>Figure 112 shows the vertical timing for a 525 line system;</li><li>Figure 113 depicts the vertical timing for a 625 line system;</li><li>Figure 114 illustrates the sync and blanking signals for a 525 line system, in accordance with the present invention;</li><li>Figure 115 shows the sync and blanking signals for a 625 line system, in accordance with the present invention;</li><li>Figure 116 illustrates a zero SDRAM connection configuration in the present invention;</li><li>Figure 117 shows one SDRAM connection configuration in the present invention;</li><li>Figure 118 depicts a two SDRAM connection configuration, in accordance with the present invention;</li><li>Figure 119 illustrates a three SDRAM connection configuration</li><li>Figure 120 is a flow chart depicting the flag_picture_end operation, in accordance with the present invention;</li><li>Figure 121 is a flow chart showing the start_code_search operation, in accordance with the present invention;</li><li>Figure 122 shows timestamp modification, in accordance with the present invention</li><li>Figure 123 illustrates the read timing for the microprocessor interface; and</li><li>Figure 124 shows the write timing for the microprocessor interface. In the ensuing description of the practice of the invention, the following terms are frequently used and are generally defined by the following glossary:</li></ul>

GLOSSARY

BLOCK: An 8-row by 8-column matrix of pels, or 64 DCT coefficients (source, quantized or dequantized). CHROMINANCE (COMPONENT): A matrix, block or single pel representing one of the two color difference signals related to the primary colors in the manner defined in the bit stream. The symbols used for the color difference signals are Cr and Cb. CODED REPRESENTATION: A data element as represented in its encoded form. CODED VIDEO BIT STREAM: A coded representation of a series of one or more pictures as defined in this specification. CODED ORDER: The order in which the pictures are transmitted and decoded. This order is not necessarily the same as the display order. COMPONENT: A matrix, block or single pel from one of the three matrices (luminance and two chrominance) that make up a picture. COMPRESSION: Reduction in the number of bits used to represent an item of data. DECODER: An embodiment of a decoding process. DECODING (PROCESS): The process defined in this specification that reads an input coded bitstream and produces decoded pictures or audio samples. DISPLAY ORDER: The order in which the decoded pictures are displayed. Typically, this is the same order in which they were presented at the input of the encoder. ENCODING (PROCESS): A process, not specified in this specification, that reads a stream of input pictures or audio samples and produces a valid coded bitstream as defined in this specification. INTRA CODING: Coding of a macroblock or picture that uses information only from that macroblock or picture. LUMINANCE (COMPONENT): A matrix, block or single pel representing a monochrome representation of the signal and related to the primary colors in the manner defined in the bit stream. The symbol used for luminance is Y. MACROBLOCK: The four 8 by 8 blocks of luminance data and the two (for 4:2:0 chroma format) four (for 4:2:2 chroma format) or eight (for 4:4:4 chroma format) corresponding 8 by 8 blocks of chrominance data coming from a 16 by 16 section of the luminance component of the picture. Macroblock is sometimes used to refer to the pel data and sometimes to the coded representation of the pel values and other data elements defined in the macroblock header of the syntax defined in this part of this specification. To one of ordinary skill in the art, the usage is clear from the context. MOTION COMPENSATION: The use of motion vectors to improve the efficiency of the prediction of pel values. The prediction uses motion vectors to provide offsets into the past and/or future reference pictures containing previously decoded pel values that are used to form the prediction error signal. MOTION VECTOR: A two-dimensional vector used for motion compensation that provides an offset from the coordinate position in the current picture to the coordinates in a reference picture. NON-INTRA CODING: Coding of a macroblock or picture that uses information both from itself and from macroblocks and pictures occurring at other times. PEL: Picture element. PICTURE: Source, coded or reconstructed image data. A source or reconstructed picture consists of three rectangular matrices of 8-bit numbers representing the luminance and two chrominance signals. For progressive video, a picture is identical to a frame, while for interlaced video, a picture can refer to a frame, or the top field or the bottom field of the frame depending on the context. PREDICTION: The use of a predictor to provide an estimate of the pel value or data element currently being decoded. RECONFIGURABLE PROCESS STAGE (RPS): A stage, which in response to a recognized token, reconfigures itself to perform various operations. SLICE: A series of macroblocks. TOKEN: A universal adaptation unit in the form of an interactive interfacing messenger package for control and/or data functions. START CODES [SYSTEM AND VIDEO]: 32-bit codes embedded in a coded bitstream that are unique. They are used for several purposes including identifying some of the structures in the coding syntax. VARIABLE LENGTH CODING; VLC: A reversible procedure for coding that assigns shorter code-words to frequent events and longer code-words to less frequent events. VIDEO SEQUENCE: A series of one or more pictures.

Briefly, and in general terms, the present invention provides a new and improved method and apparatus particularly adapted for use in a two-wire pipeline system having various control and DATA tokens. The major elements of the system may include a Start Code Detector, a Video Parser incorporating a Huffman Decoder and a Microprogrammable State Machine (MSM), an Inverse Discrete Cosine Transform (IDCT), a synchronous DRAM controller with an associated address generation unit, appropriate prediction circuitry and display circuitry which includes upsampling and video timing generation.

More importantly, various embodiments of the invention may include an MPEG video decompression method and apparatus utilizing a plurality of stages interconnected by a two-wire interface arranged as a pipeline processing machine. Control tokens and DATA Tokens pass over the single two-wire interface for carrying both control and data in token format. A token decoder circuit is positioned in certain of the stages for recognizing certain of the tokens as control tokens pertinent to that stage and for passing unrecognized control tokens along the pipeline. Reconfiguration processing circuits are positioned in selected stages and are responsive to a recognized control token for reconfiguring such stage to handle an identified DATA Token. A wide variety of unique supporting subsystem circuitry and processing techniques are disclosed for implementing the system, including memory addressing, transforming data using a common processing block, time synchronization, asynchronous swing buffering, storing of video information, a parallel Huffman decoder, and the like.

By way of example, and not necessarily by way of limitation, the present invention may include among its various features an apparatus for synchronizing time having, a time stamp for determining presentation time, a clock reference for initializing system time in a first circuit, a first time counter in communication with the clock reference for keeping system time in a first circuit and a second time counter initialized by the clock reference in a second circuit synchronized with the first time counter, for keeping a local copy of the system time and for determining the presentation timing error between the local copy of system time and system time by comparing the time stamp to the second time counter. It further includes an apparatus for synchronizing a system decoder and a video decoder using a time stamp for determining display time, a clock reference for initializing system time in the system decoder, a first time counter in communication with the clock reference for keeping system time in the system decoder and a second time counter initialized by the clock reference in the video decoder synchronized with the first time counter, for keeping a local copy of system time and for determining the display timing error between the local copy of system time and system time by comparing the time stamp to the second time counter.

Still another embodiment of the invention includes an apparatus for synchronizing a first circuit and a second circuit using a clock reference for initializing system time in the first circuit, a first circuit having a time counter in communication with the clock reference for keeping system time, a first elementary stream time counter in the first circuit for providing elementary stream time. The first circuit is adapted to receive a time stamp, and the first circuit generates synchronization time by adding elementary stream time to the time stamp and subtracting system time. The second circuit is adapted to receive synchronization time from the first circuit and has a second elementary stream time counter in synchronization with the first elementary stream time counter for providing a local copy of the elementary stream time and for determining a timing error between the system time and the time stamp by comparing synchronization time to the local copy of elementary stream time. In this way, the clock reference signal does not have to be passed directly to the second circuit in order to determine the timing error.

In another embodiment of the invention, an apparatus for synchronizing a first circuit and a second circuit has a clock reference for initializing system time in the first circuit. The first circuit has a time counter in communication with the clock reference for keeping system time, and a first video time counter for providing video decoding time. The first circuit is adapted to receive a video time stamp and subtracting system time. The second circuit is adapted to receive synchronization time from the first circuit and has a second video time counter in synchronization with the first video time counter for providing a local copy of video decoding time and for determining a timing error between system time and the video time stamp by comparing synchronization time to the local copy of video decoding time. Accordingly, the clock reference signal does not have to be passed directly to the second circuit in order to determine the timing error.

The present invention also includes a method for providing timing information by providing a video data stream having a time stamp carried in packet header wherein the time stamp refers to the first picture in the packet of data. In the next step a register is provided having a flag used to indicate valid time stamp information which is taken from the packet header and placed into the register. Next, the time stamp is removed from the video data stream and placed in the register. Next, the method encounters a picture start and subsequently examines the status of the register to determine if valid time stamp information is contained in the register by checking the flag status. A time stamp is generated in response to the picture start if the flag indicates valid time stamp information is contained in the register and then the time stamp is inserted back into the data stream. Another embodiment of the invention includes an apparatus described above wherein the elementary stream time counters are restricted to 16 bits. Likewise, there is an apparatus as described above, wherein the second elementary stream time counter located in the elementary stream decoder is restricted to 16 bits. Furthermore, there is an apparatus as described above wherein the synchronization time is restricted to 16 bits for controlling the elementary stream decoder.

The present invention also has a process for decoding video and for determining display time errors against a threshold value. It then parses video data into tokens for further processing, determining if a time stamp token is indicated, comparing the time stamp token to a video time, and generates a compared value to determine an indicative of timing error. Next, it determines whether the compared value, when compared against a threshold value, is within acceptable parameters when a timing error is indicated and indicates when the compared value is outside acceptable parameters.

An alternative embodiment of the invention includes an apparatus for using a system decoder and a video decoder. The system decoder is adapted to accept MPEG system streams and demultiplexing video data and the video time stamp from the stream. The system decoder has a first time counter representative of system time. The video decoder accepts the video data and the video time stamp, and has a second time counter in synchronization with the first time counter. The video decoder also has a decoder buffer for accepting the video data at a substantially constant rate and outputting the video data at a varying rate and for passing a video time stamp. The video decoder while decoding a picture from the video data also compares the video time stamp for the decoded picture with the second time counter to determine the appropriate display time. There is also a method for determining a timing error between a first circuit and a second circuit by providing the first circuit with a system dime (SY), a time stamp (TS), and an elementary stream time (ET), obtaining synchronization time (X) by using the elementary stream time (ET), the time stamp (TS), and the system time (SY), in accordance with the equation <maths id="math0001" num=""><math display="inline"><mrow><mtext>X=ET + TS-SY</mtext></mrow></math><img file="EP0891094A2_D0001.tif" /></maths>, providing synchronization time (X) to the second circuit and generating a synchronized elementary stream time (ET2) and obtaining a timing error by using synchronized time (X) and in accordance with the equation ET2-X. Hence, the first circuit can be time synchronized with the second circuit without passing system time to the second circuit.

Another method for determining a timing error between a first circuit and a second circuit has the following steps: providing the first circuit with a time stamp (TS), and an initial time (IT), obtaining a synchronization time (X) by using the time stamp (TS) and the initial time (IT), in accordance with the equation <maths id="math0002" num=""><math display="inline"><mrow><mtext>X=TS-1</mtext></mrow></math><img file="EP0891094A2_D0002.tif" /></maths>, providing synchronization time (X) to the second circuit and generating a synchronized elementary stream time (ET) and obtaining a timing error by using synchronized time (X) and in accordance with the equation ET-X. In this way, the first circuit can be time synchronized with the second circuit without passing system time to the second circuit.

Still another method for determining a timing error between a first circuit and a second circuit includes the following steps: providing the first circuit with a system time (SY), a video time stamp (VTS), and a video decoding time (VT), obtaining synchronization time (X) by using the video decoding time (VT), the video time stamp (VTS) and the system time (SY), in accordance with the equation <maths id="math0003" num=""><math display="inline"><mrow><mtext>X=VT+VTS-SY</mtext></mrow></math><img file="EP0891094A2_D0003.tif" /></maths>, providing synchronization time (X) to the second circuit and generating a video decoding time (VT2) in the second circuit which is synchronized to the video decoding time (VT) in the first circuit, and obtaining a time error by using synchronized time (X) and in accordance with the equation VT2-X. Accordingly, the first circuit can be time synchronized with the second circuit without passing system time to the second circuit.

In accordance with the present invention, the parallel Huffman decoder block will decode MPEG Huffman coded Variable Length Codes (VLCs) and Fixed Length Codes (FLCs), and pass through tokens under the control of the parser microprogrammable state Machine (MSM), and can sustain a high throughput.

In one embodiment of the invention a code lookup technique is employed to decode Huffman codes to achieve performance requirements and to handle the second MPEG-2 transform coefficient table which is irregular or non-canonical in nature. Practice of the invention also facilitates decoding certain more complex components from the stream in a single cycle without the assistance of an external controller. Examples of such complex components are Escape-coded coefficients, Intra-DC values and Motion Vector deltas, all of which are present in the stream as combined VLC/FLC components.

To decode a VLC, input is first loaded into the two input data registers handling most significant and least significant data. A selector is used to align the beginning of the next VLC with the ROM input. Hence, for a very first VLC, the selector outputs the top 28 bits of its 59-bit input and the top 16 bits of these are passed to a Huffman Code ROM. For subsequent VLCs, the selector effectively shifts the input according to the total count of bits decoded thus far, the count is maintained by adding the size of each VLC, as it is decoded, to a running total. The various word widths are a result of the maximum coded size which can be decoded, which is the 28-bit MPEG-1 Escape Coded Coefficient, and the maximum VLC size which is 16 bits (DCT coefficient tables).

The "table select" input is used to select between the various different Huffman code tables required by MPEG.

The ROM has addresses which are controlled with a selector/shifter. The ROM performs a VLC table index calculation, followed by the index-to-data operation that yields decoded data.

The index calculation is a content addressable memory (CAM) operation with "don't care" matching implemented to handle the Huffman codes which form the presented data. Since the index generation is performed in a look-up manner (rather than algorithmically) there is no restriction to handling tables which are canonical.

The ROM address of the present invention is in two fields. The larger field is the bit-pattern to be decoded, and the smaller field selects which Huffman code table is to be examined. In addition to the complete MPEG code tables, the ROM also has entries to identify illegal VLC patterns, which exist for some code tables.

In another embodiment of the invention, a procedure is used for providing a word with fixed width, having a fixed number of bits to be used for addressing variable width data, and having a width defining field and address field. There is also a procedure for addressing memory with a fixed width word, having a fixed number of bits, to be used for addressing data and having a substitution field and an address field, and an apparatus for addressing memory, including a state machine and an arithmetic core.

The procedure for addressing memory is characterized by providing a fixed width word having a predetermined fixed number of bits to be used for addressing variable width data, defining the fixed width word with a width defining field and an address field, providing the width defining field with at least one bit to serve as the termination marker, defining the address field with a plurality of bits defining the address of data, varying the size of bits in the address field in inverse relation to the size of the variable width data, varying the number of bits in the width defining field in direct relation to the size of the variable width data, and maintaining a fixed width word for addressing variable width data while varying the width of the width defining field and the address field.

The procedure for addressing memory may also include defining the address field with a plurality of bits defining the address of the data, defining a variable width substitution field with a least one substitution bit, the substitution field having at least one bit to serve as a termination marker between the address field and the substitution field, using the substitution field to indicate substituted bits from a separate addressing source, and maintaining a fixed width word for addressing variable width data while inversely varying the width of the address field and the width of the substitution field.

In accordance with the invention, a process for addressing variable width data in a memory may be characterized by providing a memory having words of predetermined width and composed of partial words, rotating the partial word to be accessed to a least significant bit justification, extending the remaining part of the word so that the accessed word will be recognized as a partial word, restoring the remaining part of the word, and rotating the word until the partial word is restored to its original position.

The invention may also include a method and apparatus for addressing memory wherein a word is provided with fixed width, having a fixed number of bits to be used for addressing variable width data, and having a width defining field and address field. In addition, a procedure for addressing memory with a fixed width word, having a fixed number of bits, to be used for addressing data and having a substitution field and an address field, may be used.

The invention may also include a method of accessing from RAM a number M of words that is less than the predetermined fixed burst length N of the RAM, the RAM including an enable line that selectably enables and disables reading from and writing to the RAM, the method comprising the steps of: ordering N words to be read from or written to the RAM; determining when M words have been read from or written to the RAM, M being less than N; and disabling the RAM upon determining M words had been read from or written to the RAM.

The invention may also include a method of accessing Dynamic Random Access Memory (DRAM) to store and retrieve data words associated with a two dimensional image, the DRAM including two separate banks, each bank being capable of operating a page mode to read and write the data words, the two dimensional image being organized in a two dimensional grid pattern of cells, each cell containing an M by N matrix of pixels, and the words associated with each cell occupying one page or less of a bank, the method comprising the steps of: <ul id="ul0002" list-style="none" compact="compact"><li>(a) assigning each cell a particular one of the two banks so that all data words associated with that particular cell are read from and written to one particular page of that particular bank, the assignment of banks to cells being done such that each cell is associated with a different bank than any bordering cell which is also either in the same row or in the same column;</li><li>(b) reading the data words associated with a cell that is composed of a matrix of pixels, and that is not aligned with the two dimensional grid pattern, but that is aligned with pixels in cells in the two dimensional grid pattern.</li><li>(c) identifying which cells in the two dimensional grid pattern contain data words associated with the unaligned cell;</li><li>(d) reading, from the first bank of DRAM, the data words associated with one of the cells in the grid pattern identified as containing data words associated with the unaligned cell;</li><li>(e) reading, from the second bank of DRAM, the data words associated with another of the cells in the grid pattern identified as containing data words associated with the unaligned cell;</li><li>(f) repeating steps (d) and (e) until all the data words associated with the unaligned cell have been read.</li></ul>

The invention may also provide a RAM interface for connecting a bus to RAM wherein a separate address generator generates the addresses the RAM interface needs to address the RAM. The address generator communicates with the RAM interface via a two-wire interface.

The invention may also include a method to control the buffering of encoded video data organized as frames or fields. This method involves determining the picture number of each incoming decoded frame, determining the expected presentation number at any time and marking any buffer as ready when its picture number is on or after the presentation number.

Accordingly, those concerned with the design, development, and utilization of systems for decoding video data have long recognized the need for enhanced performance as accomplished by the various features of the present invention. Other objects and advantages of the present invention will become apparent from the following more detailed description taken in conjunction with the accompanying drawings.

DETAILED DESCRIPTIONS

The forthcoming "Detailed Description of the Invention" contains the following Sections: <ul id="ul0003" list-style="none" compact="compact"><li>1) Detailed Description of the Invention for Memory Addressing Variable Length Fields Within a Fixed Width Word Using Fixed Width Word with Variable Length Fields to Perform Address Substitution Addressing Variable Width Data with a Fixed Width Word Microcodable State Machine Structure Arithmetic Core</li><li>2) Detailed Description of the Invention for Transforming Data using a Common Processing Block Theoretical Background of the invention</li><li>3) Detailed Description of Invention for Time Synchronization</li><li>4) Detailed Description of the Invention for Asynchronous Swing Buffering</li><li>5) Detailed Description of the Invention for Storing Video Information</li><li>6) Detailed Description of the Invention for a Parallel Huffman Decoder The Huffman Code ROM Maximizing Throughput FLCs and Tokens Implementation</li><li>7) MORE DETAILED DESCRIPTION</li></ul>

DETAILED DESCRIPTION OF THE INVENTION

As an introduction to the illustrative embodiment(s) of the most general features of the invention, and referring more particularly to Figure 1 of the drawings, the data flow through the preferred embodiment 200 of the invention is shown. The embodiment of the present invention is preferably implemented using a two-wire pipeline system having various control and DATA tokens. The major elements of the system are a Start Code Detector 201, a Video Parser 202 incorporating a Huffman Decoder 203 and a Microprogrammable State Machine (MSM) 204, an Inverse Discrete Cosine Transform (IDCT) 205, a synchronous DRAM controller 206 with an associated address generation unit 207, appropriate prediction circuitry 208 and display circuitry 209 which includes upsampling 210 and 211 and video timing generation 212.

This application relates to similar subject matter disclosed in British Patent Application number 9405914.4 entitled "Video Decompression" filed on March 24, 1994, by Discovision Associates, and the latter application is specifically incorporated by reference in this application.

In accordance with the above, specific aspects, features and subsystem areas of the present invention will be referred to in greater detail below. In the drawings, like reference numerals denote like or corresponding parts throughout the various drawings and figures.

Detailed Description of the Invention for Memory Addressing

In accordance with the present invention, a method and apparatus for addressing memory is described herein. In particular, the present invention provides for deferring variable width bit fields with fixed width words. More particularly, the present invention provides a method of addressing variable width data with a fixed width word. In various forms of the embodiment, variable bit field is used to specify bits to be substituted into the word or to specify an unused portion of the word in addressing variable width data with a fixed width word. In addition, the system of the present invention includes a microcodable state machine having an arithmetic core.

The microcodable state machine is intended to be used for solving design problems where there is a need for versatile and/or complicated calculations. Examples of such designs include address generation, stream parsing and decoding, and filter tap coefficient calculations. In this regard, the addressing must cope with two different features: (1) variable length addresses to access varying width portions of words and (2) address substitution. In the present invention, a RAM having a 64 x 32 bit configuration can be addressed in partial words having 64 x 32 bit, 128 x 16 bit, 256 x 8 bit, 512 x 4 bit, 1024 x 2 bit, or 2048 x 1 bit formats.

Variable Length Fields Within a Fixed Width Word

In many applications, it is useful to define variable portions of a word (to be known as fields) for actions such as substitution, variable width data addressing, or the constriction of other parts of the word. The conventional method for defining variable portions of words is to have an additional word (or words) which specify the width of the field (or fields) within the word. In accordance with the present invention, a method for encoding this information within the word itself is described. The present method has the advantages of savings bits in the overall definition of the word, simplifying decoding of the encoded word and providing a more intuitive view of what has been encoded. Furthermore, this encoding method is applicable if the variable width fields are most or least significant bit justified within the word.

Accordingly, Table 1 shows two examples of variable width fields (marked "F") that are least significant bit justified defined within an eight bit word. A "w" marks other potential fields of these words. <tables id="tabl0001" num="0001"><table frame="all"><title>Table 1</title><tgroup cols="9" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="17.50mm" /><colspec colnum="2" colname="col2" colwidth="17.50mm" /><colspec colnum="3" colname="col3" colwidth="17.50mm" /><colspec colnum="4" colname="col4" colwidth="17.50mm" /><colspec colnum="5" colname="col5" colwidth="17.50mm" /><colspec colnum="6" colname="col6" colwidth="17.50mm" /><colspec colnum="7" colname="col7" colwidth="17.50mm" /><colspec colnum="8" colname="col8" colwidth="17.50mm" /><colspec colnum="9" colname="col9" colwidth="17.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">Bit number (hex)</entry><entry namest="col2" nameend="col2" align="center">7</entry><entry namest="col3" nameend="col3" align="center">6</entry><entry namest="col4" nameend="col4" align="center">5</entry><entry namest="col5" nameend="col5" align="center">4</entry><entry namest="col6" nameend="col6" align="center">3</entry><entry namest="col7" nameend="col7" align="center">2</entry><entry namest="col8" nameend="col8" align="center">1</entry><entry namest="col9" nameend="col9" align="center">0</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" morerows="1" align="left">Fixed word</entry><entry namest="col2" nameend="col2" align="left">w</entry><entry namest="col3" nameend="col3" align="left">w</entry><entry namest="col4" nameend="col4" align="left">w</entry><entry namest="col5" nameend="col5" align="left">F</entry><entry namest="col6" nameend="col6" align="left">F</entry><entry namest="col7" nameend="col7" align="left">F</entry><entry namest="col8" nameend="col8" align="left">F</entry><entry namest="col9" nameend="col9" align="left">F</entry></row><row rowsep="1"><entry namest="col2" nameend="col2" align="left">w</entry><entry namest="col3" nameend="col3" align="left">w</entry><entry namest="col4" nameend="col4" align="left">w</entry><entry namest="col5" nameend="col5" align="left">w</entry><entry namest="col6" nameend="col6" align="left">w</entry><entry namest="col7" nameend="col7" align="left">w</entry><entry namest="col8" nameend="col8" align="left">F</entry><entry namest="col9" nameend="col9" align="left">F</entry></row></tbody></tgroup></table></tables> Table 2 shows the conventional method of encoding the fields shown in Table 1 using sufficient additional bits to specify the maximum width of the field in binary. (Bits marked "x" are "don't care", i.e., their value is of no consequence. This method is clearly inefficient in its use of bits and, furthermore, provides a less intuitive form than that described in the present invention. <tables id="tabl0002" num="0002"><table frame="all"><title>Table 2</title><tgroup cols="12" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="13.12mm" /><colspec colnum="2" colname="col2" colwidth="13.12mm" /><colspec colnum="3" colname="col3" colwidth="13.12mm" /><colspec colnum="4" colname="col4" colwidth="13.12mm" /><colspec colnum="5" colname="col5" colwidth="13.12mm" /><colspec colnum="6" colname="col6" colwidth="13.12mm" /><colspec colnum="7" colname="col7" colwidth="13.12mm" /><colspec colnum="8" colname="col8" colwidth="13.12mm" /><colspec colnum="9" colname="col9" colwidth="13.12mm" /><colspec colnum="10" colname="col10" colwidth="13.12mm" /><colspec colnum="11" colname="col11" colwidth="13.12mm" /><colspec colnum="12" colname="col12" colwidth="13.12mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">Bit number (hex)</entry><entry namest="col2" nameend="col2" align="center">7</entry><entry namest="col3" nameend="col3" align="center">6</entry><entry namest="col4" nameend="col4" align="center">5</entry><entry namest="col5" nameend="col5" align="center">4</entry><entry namest="col6" nameend="col6" align="center">3</entry><entry namest="col7" nameend="col7" align="center">2</entry><entry namest="col8" nameend="col8" align="center">1</entry><entry namest="col9" nameend="col9" align="center">0</entry><entry namest="col10" nameend="col12" align="center">Field Define</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" morerows="1" align="left">Fixed word</entry><entry namest="col2" nameend="col2" align="left">w</entry><entry namest="col3" nameend="col3" align="left">w</entry><entry namest="col4" nameend="col4" align="left">w</entry><entry namest="col5" nameend="col5" align="left">x</entry><entry namest="col6" nameend="col6" align="left">x</entry><entry namest="col7" nameend="col7" align="left">x</entry><entry namest="col8" nameend="col8" align="left">x</entry><entry namest="col9" nameend="col9" align="left">x</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">0</entry><entry namest="col12" nameend="col12" align="right">1</entry></row><row rowsep="1"><entry namest="col2" nameend="col2" align="left">w</entry><entry namest="col3" nameend="col3" align="left">w</entry><entry namest="col4" nameend="col4" align="left">w</entry><entry namest="col5" nameend="col5" align="left">w</entry><entry namest="col6" nameend="col6" align="left">w</entry><entry namest="col7" nameend="col7" align="left">w</entry><entry namest="col8" nameend="col8" align="left">x</entry><entry namest="col9" nameend="col9" align="left">x</entry><entry namest="col10" nameend="col10" align="right">0</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">0</entry></row></tbody></tgroup></table></tables> The new method, in accordance with the present invention, defines the field within the word. This method defines the field by using a continuation marker and a termination marker. The field is specified, from one end of the field, as a series of continuation markers followed by a termination marker. In the case of a zero length field, however, only a termination marker is provided at the end of the word. Both the continuation marker and the termination marker are single bits, and they must be complementary. In addition, the field must be justified to either end of the word. Accordingly, the method of the present invention for encoding fields requires a width of only one bit extra over the original word width.

As shown in Table 3, the encoding of the fields shown in the Table 1, in accordance with the new method, is depicted. In this example, the continuation marker is "1" and the termination marker is "0". The field in this example is least significant bit justified. <tables id="tabl0003" num="0003"><table frame="all"><title>Table 3</title><tgroup cols="10" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="15.75mm" /><colspec colnum="2" colname="col2" colwidth="15.75mm" /><colspec colnum="3" colname="col3" colwidth="15.75mm" /><colspec colnum="4" colname="col4" colwidth="15.75mm" /><colspec colnum="5" colname="col5" colwidth="15.75mm" /><colspec colnum="6" colname="col6" colwidth="15.75mm" /><colspec colnum="7" colname="col7" colwidth="15.75mm" /><colspec colnum="8" colname="col8" colwidth="15.75mm" /><colspec colnum="9" colname="col9" colwidth="15.75mm" /><colspec colnum="10" colname="col10" colwidth="15.75mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="left">Bit number (hex)</entry><entry namest="col2" nameend="col2" align="center">7</entry><entry namest="col3" nameend="col3" align="center">6</entry><entry namest="col4" nameend="col4" align="center">5</entry><entry namest="col5" nameend="col5" align="center">4</entry><entry namest="col6" nameend="col6" align="center">3</entry><entry namest="col7" nameend="col7" align="center">2</entry><entry namest="col8" nameend="col8" align="center">1</entry><entry namest="col9" nameend="col9" align="center">0</entry><entry namest="col10" nameend="col10" /></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" morerows="1" align="left">Fixed word Continuation marker = 1; Termination marker = 0.</entry><entry namest="col2" nameend="col2" align="left">w</entry><entry namest="col3" nameend="col3" align="left">w</entry><entry namest="col4" nameend="col4" align="left">w</entry><entry namest="col5" nameend="col5" align="right">0</entry><entry namest="col6" nameend="col6" align="right">1</entry><entry namest="col7" nameend="col7" align="right">1</entry><entry namest="col8" nameend="col8" align="right">1</entry><entry namest="col9" nameend="col9" align="right">1</entry><entry namest="col10" nameend="col10" align="right">1</entry></row><row rowsep="1"><entry namest="col2" nameend="col2" align="left">w</entry><entry namest="col3" nameend="col3" align="left">w</entry><entry namest="col4" nameend="col4" align="left">w</entry><entry namest="col5" nameend="col5" align="right">w</entry><entry namest="col6" nameend="col6" align="right">w</entry><entry namest="col7" nameend="col7" align="right">w</entry><entry namest="col8" nameend="col8" align="right">0</entry><entry namest="col9" nameend="col9" align="right">1</entry><entry namest="col10" nameend="col10" align="right">1</entry></row></tbody></tgroup></table></tables> Therefore, the advantages of the encoding method, in accordance with the present invention, are: <ul id="ul0004" list-style="none" compact="compact"><li>1. A reduction in the number of bits needed in the encoding.</li><li>2. A simplification in the decoding process is required since the need for a "x to 1 of "decode of the "field define" shown in Table 1-2 that would normally be required is inherent in the encoding which is already in the form of 1 of 2x; and</li><li>3. The encoding is in a more intuitive form allowing the field defined to be more easily identified.</li></ul> Furthermore, the use of this encoding method of the present invention can also be used such that the termination marker and the continuation marker are inverted to provide that the encoding of Table 3 resembles that of Table 4. Hence, the use of "1" or "0" is used interchangeably throughout this application. <tables id="tabl0004" num="0004"><table frame="all"><title>Table 4</title><tgroup cols="10" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="15.75mm" /><colspec colnum="2" colname="col2" colwidth="15.75mm" /><colspec colnum="3" colname="col3" colwidth="15.75mm" /><colspec colnum="4" colname="col4" colwidth="15.75mm" /><colspec colnum="5" colname="col5" colwidth="15.75mm" /><colspec colnum="6" colname="col6" colwidth="15.75mm" /><colspec colnum="7" colname="col7" colwidth="15.75mm" /><colspec colnum="8" colname="col8" colwidth="15.75mm" /><colspec colnum="9" colname="col9" colwidth="15.75mm" /><colspec colnum="10" colname="col10" colwidth="15.75mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="left">Bit number (hex)</entry><entry namest="col2" nameend="col2" align="center">7</entry><entry namest="col3" nameend="col3" align="center">6</entry><entry namest="col4" nameend="col4" align="center">5</entry><entry namest="col5" nameend="col5" align="center">4</entry><entry namest="col6" nameend="col6" align="center">3</entry><entry namest="col7" nameend="col7" align="center">2</entry><entry namest="col8" nameend="col8" align="center">1</entry><entry namest="col9" nameend="col9" align="center">0</entry><entry namest="col10" nameend="col10" /></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" morerows="1" align="left">Fixed word Continuation marker = 1; Termination marker = 0.</entry><entry namest="col2" nameend="col2" align="left">w</entry><entry namest="col3" nameend="col3" align="left">w</entry><entry namest="col4" nameend="col4" align="left">w</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="right">0</entry><entry namest="col7" nameend="col7" align="right">0</entry><entry namest="col8" nameend="col8" align="right">0</entry><entry namest="col9" nameend="col9" align="right">0</entry><entry namest="col10" nameend="col10" align="right">0</entry></row><row rowsep="1"><entry namest="col2" nameend="col2" align="left">w</entry><entry namest="col3" nameend="col3" align="left">w</entry><entry namest="col4" nameend="col4" align="left">w</entry><entry namest="col5" nameend="col5" align="right">w</entry><entry namest="col6" nameend="col6" align="right">w</entry><entry namest="col7" nameend="col7" align="right">w</entry><entry namest="col8" nameend="col8" align="right">1</entry><entry namest="col9" nameend="col9" align="right">0</entry><entry namest="col10" nameend="col10" align="right">0</entry></row></tbody></tgroup></table></tables> As previously identified, the field encoded must be justified to either end of the word. Table 5 illustrates most significant justified fields, i.e., these are encoded in a similar way to least significant bit justified fields except that the field reaches from the most significant bit (hereinafter MSB) towards the least significant bit (hereinafter "LSB") up to and including the first termination marker. The encoding of the fields shown in Table 5 are shown in Table 6. <tables id="tabl0005" num="0005"><table frame="all"><title>Table 5</title><tgroup cols="9" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="17.50mm" /><colspec colnum="2" colname="col2" colwidth="17.50mm" /><colspec colnum="3" colname="col3" colwidth="17.50mm" /><colspec colnum="4" colname="col4" colwidth="17.50mm" /><colspec colnum="5" colname="col5" colwidth="17.50mm" /><colspec colnum="6" colname="col6" colwidth="17.50mm" /><colspec colnum="7" colname="col7" colwidth="17.50mm" /><colspec colnum="8" colname="col8" colwidth="17.50mm" /><colspec colnum="9" colname="col9" colwidth="17.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">Bit number (hex)</entry><entry namest="col2" nameend="col2" align="center">7</entry><entry namest="col3" nameend="col3" align="center">6</entry><entry namest="col4" nameend="col4" align="center">5</entry><entry namest="col5" nameend="col5" align="center">4</entry><entry namest="col6" nameend="col6" align="center">3</entry><entry namest="col7" nameend="col7" align="center">2</entry><entry namest="col8" nameend="col8" align="center">1</entry><entry namest="col9" nameend="col9" align="center">0</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" morerows="1" align="left">Fixed word</entry><entry namest="col2" nameend="col2" align="left">F</entry><entry namest="col3" nameend="col3" align="left">F</entry><entry namest="col4" nameend="col4" align="left">F</entry><entry namest="col5" nameend="col5" align="left">F</entry><entry namest="col6" nameend="col6" align="left">F</entry><entry namest="col7" nameend="col7" align="left">w</entry><entry namest="col8" nameend="col8" align="left">w</entry><entry namest="col9" nameend="col9" align="left">w</entry></row><row rowsep="1"><entry namest="col2" nameend="col2" align="left">F</entry><entry namest="col3" nameend="col3" align="left">F</entry><entry namest="col4" nameend="col4" align="left">w</entry><entry namest="col5" nameend="col5" align="left">w</entry><entry namest="col6" nameend="col6" align="left">w</entry><entry namest="col7" nameend="col7" align="left">w</entry><entry namest="col8" nameend="col8" align="left">w</entry><entry namest="col9" nameend="col9" align="left">w</entry></row></tbody></tgroup></table></tables><tables id="tabl0006" num="0006"><table frame="all"><title>Table 6</title><tgroup cols="10" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="15.75mm" /><colspec colnum="2" colname="col2" colwidth="15.75mm" /><colspec colnum="3" colname="col3" colwidth="15.75mm" /><colspec colnum="4" colname="col4" colwidth="15.75mm" /><colspec colnum="5" colname="col5" colwidth="15.75mm" /><colspec colnum="6" colname="col6" colwidth="15.75mm" /><colspec colnum="7" colname="col7" colwidth="15.75mm" /><colspec colnum="8" colname="col8" colwidth="15.75mm" /><colspec colnum="9" colname="col9" colwidth="15.75mm" /><colspec colnum="10" colname="col10" colwidth="15.75mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="left">Bit number (hex)</entry><entry namest="col2" nameend="col2" align="center">7</entry><entry namest="col3" nameend="col3" align="center">6</entry><entry namest="col4" nameend="col4" align="center">5</entry><entry namest="col5" nameend="col5" align="center">4</entry><entry namest="col6" nameend="col6" align="center">3</entry><entry namest="col7" nameend="col7" align="center">2</entry><entry namest="col8" nameend="col8" align="center">1</entry><entry namest="col9" nameend="col9" align="center">0</entry><entry namest="col10" nameend="col10" /></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" morerows="1" align="left">Fixed word Continuation marker = 1; Termination marker = 0.</entry><entry namest="col2" nameend="col2" align="right">1</entry><entry namest="col3" nameend="col3" align="right">1</entry><entry namest="col4" nameend="col4" align="right">1</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="right">1</entry><entry namest="col7" nameend="col7" align="right">0</entry><entry namest="col8" nameend="col8" align="left">w</entry><entry namest="col9" nameend="col9" align="left">w</entry><entry namest="col10" nameend="col10" align="left">w</entry></row><row rowsep="1"><entry namest="col2" nameend="col2" align="right">1</entry><entry namest="col3" nameend="col3" align="right">1</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">w</entry><entry namest="col6" nameend="col6" align="right">w</entry><entry namest="col7" nameend="col7" align="right">w</entry><entry namest="col8" nameend="col8" align="left">w</entry><entry namest="col9" nameend="col9" align="left">w</entry><entry namest="col10" nameend="col10" align="left">w</entry></row></tbody></tgroup></table></tables> Moreover, fields may be encoded from the least significant and most significant ends of the word simultaneously. For example, the two fields shown in Table 7 may be encoded as in Table 8, with the addition of just one bit for each field as described previously. <tables id="tabl0007" num="0007"><table frame="all"><title>Table 7</title><tgroup cols="9" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="17.50mm" /><colspec colnum="2" colname="col2" colwidth="17.50mm" /><colspec colnum="3" colname="col3" colwidth="17.50mm" /><colspec colnum="4" colname="col4" colwidth="17.50mm" /><colspec colnum="5" colname="col5" colwidth="17.50mm" /><colspec colnum="6" colname="col6" colwidth="17.50mm" /><colspec colnum="7" colname="col7" colwidth="17.50mm" /><colspec colnum="8" colname="col8" colwidth="17.50mm" /><colspec colnum="9" colname="col9" colwidth="17.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">Bit number (hex)</entry><entry namest="col2" nameend="col2" align="center">7</entry><entry namest="col3" nameend="col3" align="center">6</entry><entry namest="col4" nameend="col4" align="center">5</entry><entry namest="col5" nameend="col5" align="center">4</entry><entry namest="col6" nameend="col6" align="center">3</entry><entry namest="col7" nameend="col7" align="center">2</entry><entry namest="col8" nameend="col8" align="center">1</entry><entry namest="col9" nameend="col9" align="center">0</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" morerows="1" align="left">Fixed word</entry><entry namest="col2" nameend="col2" align="left">F</entry><entry namest="col3" nameend="col3" align="left">F</entry><entry namest="col4" nameend="col4" align="left">F</entry><entry namest="col5" nameend="col5" align="left">F</entry><entry namest="col6" nameend="col6" align="left">w</entry><entry namest="col7" nameend="col7" align="left">w</entry><entry namest="col8" nameend="col8" align="left">F</entry><entry namest="col9" nameend="col9" align="left">F</entry></row><row rowsep="1"><entry namest="col2" nameend="col2" align="left">w</entry><entry namest="col3" nameend="col3" align="left">w</entry><entry namest="col4" nameend="col4" align="left">w</entry><entry namest="col5" nameend="col5" align="left">w</entry><entry namest="col6" nameend="col6" align="left">F</entry><entry namest="col7" nameend="col7" align="left">F</entry><entry namest="col8" nameend="col8" align="left">F</entry><entry namest="col9" nameend="col9" align="left">F</entry></row></tbody></tgroup></table></tables><tables id="tabl0008" num="0008"><table frame="all"><title>Table 8</title><tgroup cols="11" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="14.31mm" /><colspec colnum="2" colname="col2" colwidth="14.31mm" /><colspec colnum="3" colname="col3" colwidth="14.31mm" /><colspec colnum="4" colname="col4" colwidth="14.31mm" /><colspec colnum="5" colname="col5" colwidth="14.31mm" /><colspec colnum="6" colname="col6" colwidth="14.31mm" /><colspec colnum="7" colname="col7" colwidth="14.31mm" /><colspec colnum="8" colname="col8" colwidth="14.31mm" /><colspec colnum="9" colname="col9" colwidth="14.31mm" /><colspec colnum="10" colname="col10" colwidth="14.31mm" /><colspec colnum="11" colname="col11" colwidth="14.31mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="left">Bit number (hex)</entry><entry namest="col2" nameend="col2" /><entry namest="col3" nameend="col3" align="center">7</entry><entry namest="col4" nameend="col4" align="center">6</entry><entry namest="col5" nameend="col5" align="center">5</entry><entry namest="col6" nameend="col6" align="center">4</entry><entry namest="col7" nameend="col7" align="center">3</entry><entry namest="col8" nameend="col8" align="center">2</entry><entry namest="col9" nameend="col9" align="center">1</entry><entry namest="col10" nameend="col10" align="center">0</entry><entry namest="col11" nameend="col11" /></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" morerows="1" align="left">Fixed word Continuation marker = 1; Termination marker = 0.</entry><entry namest="col2" nameend="col2" align="right">1</entry><entry namest="col3" nameend="col3" align="right">1</entry><entry namest="col4" nameend="col4" align="right">1</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="right">0</entry><entry namest="col7" nameend="col7" align="right">w</entry><entry namest="col8" nameend="col8" align="right">w</entry><entry namest="col9" nameend="col9" align="right">0</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry></row><row rowsep="1"><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">w</entry><entry namest="col4" nameend="col4" align="right">w</entry><entry namest="col5" nameend="col5" align="right">w</entry><entry namest="col6" nameend="col6" align="right">w</entry><entry namest="col7" nameend="col7" align="right">0</entry><entry namest="col8" nameend="col8" align="right">1</entry><entry namest="col9" nameend="col9" align="right">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry></row></tbody></tgroup></table></tables>

Using a Fixed Width Word with Variable Length Fields to Perform Address Substitution

There are situations in which it is useful to substitute part of a memory address by another value. In this way it is possible to construct a data dependent address. The encoding method of the present invention can be applied to the addresses of a memory to specify what portion of the address is to be substituted. If a least significant bit justified variable length field is used in the address, a substitution field can be defined. For example, a 12 bit address 0baaaaaaaaaaaa encoded to have its five least significant bit substituted by the 12 bit value 0bcccccccccccc would be 0baaaaaaa011111 and produce the address 0baaaaaaaccccc. Table 9 shows the encoding for substitution into a 12 bit address. <tables id="tabl0009" num="0009"><table frame="all"><title>Table 9</title><tgroup cols="14" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="11.25mm" /><colspec colnum="2" colname="col2" colwidth="11.25mm" /><colspec colnum="3" colname="col3" colwidth="11.25mm" /><colspec colnum="4" colname="col4" colwidth="11.25mm" /><colspec colnum="5" colname="col5" colwidth="11.25mm" /><colspec colnum="6" colname="col6" colwidth="11.25mm" /><colspec colnum="7" colname="col7" colwidth="11.25mm" /><colspec colnum="8" colname="col8" colwidth="11.25mm" /><colspec colnum="9" colname="col9" colwidth="11.25mm" /><colspec colnum="10" colname="col10" colwidth="11.25mm" /><colspec colnum="11" colname="col11" colwidth="11.25mm" /><colspec colnum="12" colname="col12" colwidth="11.25mm" /><colspec colnum="13" colname="col13" colwidth="11.25mm" /><colspec colnum="14" colname="col14" colwidth="11.25mm" /><thead valign="top"><row><entry namest="col1" nameend="col14" align="center">Address substitution</entry></row><row><entry namest="col1" nameend="col1" align="center">No. Bits substituted</entry><entry namest="col2" nameend="col2" align="center">B</entry><entry namest="col3" nameend="col3" align="center">A</entry><entry namest="col4" nameend="col4" align="center">9</entry><entry namest="col5" nameend="col5" align="center">8</entry><entry namest="col6" nameend="col6" align="center">7</entry><entry namest="col7" nameend="col7" align="center">6</entry><entry namest="col8" nameend="col8" align="center">5</entry><entry namest="col9" nameend="col9" align="center">4</entry><entry namest="col10" nameend="col10" align="center">3</entry><entry namest="col11" nameend="col11" align="center">2</entry><entry namest="col12" nameend="col12" align="center">1</entry><entry namest="col13" nameend="col13" align="center">0</entry><entry namest="col14" nameend="col14" /></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left">0</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">a</entry><entry namest="col5" nameend="col5" align="left">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="right">a</entry><entry namest="col9" nameend="col9" align="right">a</entry><entry namest="col10" nameend="col10" align="right">a</entry><entry namest="col11" nameend="col11" align="right">a</entry><entry namest="col12" nameend="col12" align="right">a</entry><entry namest="col13" nameend="col13" align="right">a</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">1</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">a</entry><entry namest="col5" nameend="col5" align="left">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="right">a</entry><entry namest="col9" nameend="col9" align="right">a</entry><entry namest="col10" nameend="col10" align="right">a</entry><entry namest="col11" nameend="col11" align="right">a</entry><entry namest="col12" nameend="col12" align="right">a</entry><entry namest="col13" nameend="col13" align="right">0</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">2</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">a</entry><entry namest="col5" nameend="col5" align="left">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="right">a</entry><entry namest="col9" nameend="col9" align="right">a</entry><entry namest="col10" nameend="col10" align="right">a</entry><entry namest="col11" nameend="col11" align="right">a</entry><entry namest="col12" nameend="col12" align="right">0</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">3</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">a</entry><entry namest="col5" nameend="col5" align="left">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="right">a</entry><entry namest="col9" nameend="col9" align="right">a</entry><entry namest="col10" nameend="col10" align="right">a</entry><entry namest="col11" nameend="col11" align="right">0</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">4</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">a</entry><entry namest="col5" nameend="col5" align="left">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="right">a</entry><entry namest="col9" nameend="col9" align="right">a</entry><entry namest="col10" nameend="col10" align="right">0</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">5</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">a</entry><entry namest="col5" nameend="col5" align="left">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="right">a</entry><entry namest="col9" nameend="col9" align="right">0</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">6</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">a</entry><entry namest="col5" nameend="col5" align="left">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="right">0</entry><entry namest="col9" nameend="col9" align="right">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">7</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">a</entry><entry namest="col5" nameend="col5" align="left">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">0</entry><entry namest="col8" nameend="col8" align="right">1</entry><entry namest="col9" nameend="col9" align="right">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">8</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">a</entry><entry namest="col5" nameend="col5" align="left">a</entry><entry namest="col6" nameend="col6" align="left">0</entry><entry namest="col7" nameend="col7" align="left">1</entry><entry namest="col8" nameend="col8" align="right">1</entry><entry namest="col9" nameend="col9" align="right">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">9</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">a</entry><entry namest="col5" nameend="col5" align="left">0</entry><entry namest="col6" nameend="col6" align="left">1</entry><entry namest="col7" nameend="col7" align="left">1</entry><entry namest="col8" nameend="col8" align="right">1</entry><entry namest="col9" nameend="col9" align="right">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">10</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">a</entry><entry namest="col4" nameend="col4" align="left">0</entry><entry namest="col5" nameend="col5" align="left">1</entry><entry namest="col6" nameend="col6" align="left">1</entry><entry namest="col7" nameend="col7" align="left">1</entry><entry namest="col8" nameend="col8" align="right">1</entry><entry namest="col9" nameend="col9" align="right">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="left">11</entry><entry namest="col2" nameend="col2" align="left">a</entry><entry namest="col3" nameend="col3" align="left">0</entry><entry namest="col4" nameend="col4" align="left">1</entry><entry namest="col5" nameend="col5" align="left">1</entry><entry namest="col6" nameend="col6" align="left">1</entry><entry namest="col7" nameend="col7" align="left">1</entry><entry namest="col8" nameend="col8" align="right">1</entry><entry namest="col9" nameend="col9" align="right">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">12</entry><entry namest="col2" nameend="col2" align="left">0</entry><entry namest="col3" nameend="col3" align="left">1</entry><entry namest="col4" nameend="col4" align="left">1</entry><entry namest="col5" nameend="col5" align="left">1</entry><entry namest="col6" nameend="col6" align="left">1</entry><entry namest="col7" nameend="col7" align="left">1</entry><entry namest="col8" nameend="col8" align="right">1</entry><entry namest="col9" nameend="col9" align="right">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row></tbody></tgroup></table></tables>

Addressing Variable Width Data with a Fixed Width Word

One embodiment of the present invention is for addressing a memory which can be accessed at its full width or in 2n widths up to its full width (these smaller words are called partial words). Hence, it will be shown how the variable field encoding of the present invention can be used to address this memory and to index those addresses into the memory.

To access a 64 x 32 bit Register file in widths of 32, 16, 8, 4, 2 and 1 bit requires different lengths of address, i.e., the implementation of this embodiment is a 64 x 32 bit memory which can be accessed as 64 x 32 bits, 128 x 16 bits, 256 x 8 bits, 512 x 4 bits, 1024 x 2 bits, or 2048 x 1 bit. It is seen that 5 bits are required to address one of the 64 x 32 bit locations, while 12 bits are required to address one of the 2048 x 1 bit locations. Hence, the addresses can be of variable length and, in fact, the width of the address specifies the address format of the memory. Accordingly, the address can be defined within a fixed word width by using a most significant justified variable width field which constricts the address and defines its width. This is illustrated in Table 10. <tables id="tabl0010" num="0010"><table frame="all"><title>Table 10</title><tgroup cols="13" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="12.11mm" /><colspec colnum="2" colname="col2" colwidth="12.11mm" /><colspec colnum="3" colname="col3" colwidth="12.11mm" /><colspec colnum="4" colname="col4" colwidth="12.11mm" /><colspec colnum="5" colname="col5" colwidth="12.11mm" /><colspec colnum="6" colname="col6" colwidth="12.11mm" /><colspec colnum="7" colname="col7" colwidth="12.11mm" /><colspec colnum="8" colname="col8" colwidth="12.11mm" /><colspec colnum="9" colname="col9" colwidth="12.11mm" /><colspec colnum="10" colname="col10" colwidth="12.11mm" /><colspec colnum="11" colname="col11" colwidth="12.11mm" /><colspec colnum="12" colname="col12" colwidth="12.11mm" /><colspec colnum="13" colname="col13" colwidth="12.11mm" /><thead valign="top"><row><entry namest="col1" nameend="col13" align="center">Variable width addressing</entry></row><row><entry namest="col1" nameend="col1" align="center">Data Width</entry><entry namest="col2" nameend="col2" /><entry namest="col3" nameend="col3" align="center">A</entry><entry namest="col4" nameend="col4" align="center">9</entry><entry namest="col5" nameend="col5" align="center">8</entry><entry namest="col6" nameend="col6" align="center">7</entry><entry namest="col7" nameend="col7" align="center">6</entry><entry namest="col8" nameend="col8" align="center">5</entry><entry namest="col9" nameend="col9" align="center">4</entry><entry namest="col10" nameend="col10" align="center">3</entry><entry namest="col11" nameend="col11" align="center">2</entry><entry namest="col12" nameend="col12" align="center">1</entry><entry namest="col13" nameend="col13" align="center">0</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="right">1</entry><entry namest="col2" nameend="col2" align="right">1</entry><entry namest="col3" nameend="col3" align="right">a</entry><entry namest="col4" nameend="col4" align="right">a</entry><entry namest="col5" nameend="col5" align="right">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="left">a</entry><entry namest="col11" nameend="col11" align="left">a</entry><entry namest="col12" nameend="col12" align="left">a</entry><entry namest="col13" nameend="col13" align="left">a</entry></row><row><entry namest="col1" nameend="col1" align="right">2</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">1</entry><entry namest="col4" nameend="col4" align="right">a</entry><entry namest="col5" nameend="col5" align="right">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="left">a</entry><entry namest="col11" nameend="col11" align="left">a</entry><entry namest="col12" nameend="col12" align="left">a</entry><entry namest="col13" nameend="col13" align="left">a</entry></row><row><entry namest="col1" nameend="col1" align="right">4</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">1</entry><entry namest="col5" nameend="col5" align="right">a</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="left">a</entry><entry namest="col11" nameend="col11" align="left">a</entry><entry namest="col12" nameend="col12" align="left">a</entry><entry namest="col13" nameend="col13" align="left">a</entry></row><row><entry namest="col1" nameend="col1" align="right">8</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="left">a</entry><entry namest="col11" nameend="col11" align="left">a</entry><entry namest="col12" nameend="col12" align="left">a</entry><entry namest="col13" nameend="col13" align="left">a</entry></row><row><entry namest="col1" nameend="col1" align="right">16</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">0</entry><entry namest="col6" nameend="col6" align="left">1</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="left">a</entry><entry namest="col11" nameend="col11" align="left">a</entry><entry namest="col12" nameend="col12" align="left">a</entry><entry namest="col13" nameend="col13" align="left">a</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="right">32</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">0</entry><entry namest="col6" nameend="col6" align="left">0</entry><entry namest="col7" nameend="col7" align="left">1</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="left">a</entry><entry namest="col11" nameend="col11" align="left">a</entry><entry namest="col12" nameend="col12" align="left">a</entry><entry namest="col13" nameend="col13" align="left">a</entry></row></tbody></tgroup></table></tables> To allow indexing of the address, a portion of it can be substituted using the same method described previously for address substitution. The substitution portion (or field) of the address can be defined by a least significant bit justified variable length field (The continuation marker "1"; termination marker "0") that is superimposed on top of those shown in Table 10. Using an address of an eight bit word, as an example, Table 11 shows how to define the number of the least significant bits to be substituted. The least significant bit added is the substitution indicator (marked "w"). The general case of a Fixed width word for substitution is shown in Figure 2. <tables id="tabl0011" num="0011"><table frame="all"><title>Table 11</title><tgroup cols="14" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="11.25mm" /><colspec colnum="2" colname="col2" colwidth="11.25mm" /><colspec colnum="3" colname="col3" colwidth="11.25mm" /><colspec colnum="4" colname="col4" colwidth="11.25mm" /><colspec colnum="5" colname="col5" colwidth="11.25mm" /><colspec colnum="6" colname="col6" colwidth="11.25mm" /><colspec colnum="7" colname="col7" colwidth="11.25mm" /><colspec colnum="8" colname="col8" colwidth="11.25mm" /><colspec colnum="9" colname="col9" colwidth="11.25mm" /><colspec colnum="10" colname="col10" colwidth="11.25mm" /><colspec colnum="11" colname="col11" colwidth="11.25mm" /><colspec colnum="12" colname="col12" colwidth="11.25mm" /><colspec colnum="13" colname="col13" colwidth="11.25mm" /><colspec colnum="14" colname="col14" colwidth="11.25mm" /><thead valign="top"><row><entry namest="col1" nameend="col14" align="center">Address substitution</entry></row><row><entry namest="col1" nameend="col1" align="center">Bits to be substituted</entry><entry namest="col2" nameend="col2" /><entry namest="col3" nameend="col3" align="center">A</entry><entry namest="col4" nameend="col4" align="center">9</entry><entry namest="col5" nameend="col5" align="center">8</entry><entry namest="col6" nameend="col6" align="center">7</entry><entry namest="col7" nameend="col7" align="center">6</entry><entry namest="col8" nameend="col8" align="center">5</entry><entry namest="col9" nameend="col9" align="center">4</entry><entry namest="col10" nameend="col10" align="center">3</entry><entry namest="col11" nameend="col11" align="center">2</entry><entry namest="col12" nameend="col12" align="center">1</entry><entry namest="col13" nameend="col13" align="center">0</entry><entry namest="col14" nameend="col14" align="center">w</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="right">0</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="right">a</entry><entry namest="col11" nameend="col11" align="right">a</entry><entry namest="col12" nameend="col12" align="right">a</entry><entry namest="col13" nameend="col13" align="right">a</entry><entry namest="col14" nameend="col14" align="right">0</entry></row><row><entry namest="col1" nameend="col1" align="right">1</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="right">a</entry><entry namest="col11" nameend="col11" align="right">a</entry><entry namest="col12" nameend="col12" align="right">a</entry><entry namest="col13" nameend="col13" align="right">0</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="right">2</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="right">a</entry><entry namest="col11" nameend="col11" align="right">a</entry><entry namest="col12" nameend="col12" align="right">0</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="right">3</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="right">a</entry><entry namest="col11" nameend="col11" align="right">0</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="right">4</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">a</entry><entry namest="col10" nameend="col10" align="right">0</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="right">5</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">a</entry><entry namest="col9" nameend="col9" align="left">0</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="right">6</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">a</entry><entry namest="col8" nameend="col8" align="left">0</entry><entry namest="col9" nameend="col9" align="left">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="right">7</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="left">a</entry><entry namest="col7" nameend="col7" align="left">0</entry><entry namest="col8" nameend="col8" align="left">1</entry><entry namest="col9" nameend="col9" align="left">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="right">8</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="left">0</entry><entry namest="col7" nameend="col7" align="left">1</entry><entry namest="col8" nameend="col8" align="left">1</entry><entry namest="col9" nameend="col9" align="left">1</entry><entry namest="col10" nameend="col10" align="right">1</entry><entry namest="col11" nameend="col11" align="right">1</entry><entry namest="col12" nameend="col12" align="right">1</entry><entry namest="col13" nameend="col13" align="right">1</entry><entry namest="col14" nameend="col14" align="right">1</entry></row></tbody></tgroup></table></tables> In effect the substitute code is superimposed on top of the address that is already coded. From this coding, it can be seen that there are illegal addresses, most obviously 0x0000 and 0x3fff. In this case, a "0" must be in the bottom 9 bits to prevent substituting more than 8 bits and a "1" in the top 6 bits specifies an allowable access width. If one of these errors is detected, the access is undefined, but the Register file contents will not be affected.

In accordance with the present invention, the system for addressing and for accessing partial words in a register file is discussed below.

The conventional memory circuitry dictates that the memory must always be accessed at it full width. To achieve variable width accesses, a full (32 bit) width word is read. This full word is rotated until the partial word accessed is justified in the LSB. The upper parts of the word are extended to the full width and then output. Extending may encompass padding with zeros or ones, sign extending, using the sign bit of a sign-magnitude number as the new MSB or any similar conventional method. Extending is dependent on the mode of operation. When the partial word is input to and written back into the memory, it is multiplexed back into the rotated full word, which is then rotated back and written into the array. Figure 3 shows these steps for the access of a 4 bit partial word in the fourth four bit word of the 32 bit word.

To access or read partial words, such as the highlighted four bit word shown in row "1" 213 of Figure 3, the full width word must be rotated to place the partial word at the LSB, as shown in row "2" 214. As shown in row "3" 215, the four bit word is extended to create a full 32 bit word. This word can now be accessed.

As shown in figure 3, a full width word that has been selected to be written back is truncated to the width of the original partial word which is multiplexed into the word shown in row "2" 214. At the LSB position, this is shown in row "4" 216. The resulting word is rotated back in its original significance in the read word, this is shown in row "5" 217. This full word can now be written back into the register file.

The following list, therefore, summarizes the steps numbered in Figure 3: <ul id="ul0005" list-style="none" compact="compact"><li>1. Full word read from memory;</li><li>2. 12 bit rotated right puts partial word into the LSB;</li><li>3. Extended to full word, then passed to output;</li><li>4. The inputted partial word is multiplexed into rotated full word from (2); and</li><li>5. 12 bit rotated left puts full word back to original state to be written. The above accesses suggests the data flow structure of the memory that is shown in Figure 4. The numbers in the structure refer to the above text and to Figure 3.</li></ul>

The memory address must be decoded to control the above structure. It should be recognized that the MSB of any width of address is at the same significance with reference to the memory. The top six bits of a decoded address are a 32 bit word address, whereas the remainder is a bit address. Therefore, the stage of decoding (in parallel with the substitution) is to decode the address width defining variable field by detecting the position of the most significant termination marker. This allows the address to be MSB justified (shifting in zeros at the LSB). The top six bits can be used directly as a 32 bit word row address of the memory. The bottom five bits can be used to directly control both barrel shifters (as seen in Figure 4), because, for example, an original 32 bit address will always have a shift of 0b00000 (these having been shifted when the address was MSB justified). Similarly, a 16 bit address can have a shift of 0bx0000, i.e., 0 or 16 bit shift and a 1 bit address can have a shift of 0bxxxxx, i.e., 0 to 31 bit shifts. The extender and input multiplexer are controlled by the access width decode to mask out the output words and multiplex the input words to an appropriate significance, respectively. The block diagram of the decode is shown in Figure 5. It can be seen that the decode of the two variable width fields for width and substitution can be done in parallel and independently.

Figure 2 illustrates an example of a fixed width word 13 bits long for addressing variable width data and substitution as shown in the bottom two rows. For these examples, an eight bit word would have been addressed at location 0b110lssss, where "ssss" is substituted from another address source.

Microcodable State Machine Structure

In accordance with the present invention, the substitution into a memory address and the variable width accessing of a memory have been brought together in the implementation of a microcodable state machine the structure of which is shown in Figure 6. The structure is one of a state machine 218 providing control of an arithmetic core 219 by way of a wide word of control signals called a microcode instruction. The arithmetic core 219, in turn, passes status flags and some data to the state machine 218.

The state machine 218, in accordance with the present invention, includes a memory containing a list of the microcode instructions. As with conventional microcodable state machines, it is capable of either proceeding through the list of microcode instructions contiguously or a jump can occur from one instruction to another. The jump address is in the form shown in Figure 7. The substituted value comes from the Arithmetic core 219 as shown in Figures 6 and 8. This allows the construction of "jump tables" within the microcode programs. Thus, if a jump is made with 3 bits substituted, for example, there are eight possible contiguous locations that may be jumped to, each dependent on the value from the arithmetic core, i.e., it has so become a programmable jump.

Arithmetic Core

The arithmetic core 219, as shown in Figure 8, includes a memory called a register file 221, an Arithmetic and Logic unit (ALU) 222, an input port 223 and an output port 224. These components are connected via buses and multiplexers. As previously stated, these components, and the multiplexers defining their connections, are entirely controlled by the microcode instruction issued by the state machine 218. The ALU 222 and the ports 223 and 224 are conventional, however, the register file 221 is a memory which allows variable width indexed accesses. The addresses to the register file 221 is coded directly into the microcode instruction.

There are many advantages of using this method of addressing to the register file. First, many locations in an application do not need to be the full width of the memory (32 bits in this case). Whilst it will cause no effect on the operation of the device to use a full width location, it is very wasteful of memory locations. Minimizing the number of memory locations will minimize the amount of space used by the memory and, therefore, minimize the capacitive loading in the register file. This maximizes the speed of the register file. Second, the indexing combined with the variable width of memory accessing allows the stepping through of locations of variable width. In the one bit case this allows an elegant implementation of long division and multiplication.

In summary, therefore, there is described a procedure for addressing memory having the following steps: (1) providing a fixed width word having a predetermined fixed number of bits to be used for addressing variable width data; (2) defining the fixed width word with a width defining field and an address field providing the width defining field with at least one bit to serve as a termination marker; (3) defining the address field with a plurality of bits defining the address of the data; and (4) varying the size of bits in the address field in inverse relation to the size of the variable width data varying the number of bits in the width defining field in direct relation to the size of the variable width data and maintaining a fixed width word for addressing variable width data while varying the width of the width defining field and the address field. In addition, a procedure for addressing memory having the following steps is described: (1) providing a fixed width word having a predetermined fixed number of bits to be used for addressing data; (2) defining the fixed width word with an address field and a substitution field; (3) defining the address field with a plurality of bits defining the address of the data; (4) defining a variable width substitution field with at least one substitution bit; (5) the substitution field has at least one bit to serve as a termination marker between the address field and the substitution field; and (6) using the substitution field to indicate substituted bits from a separate addressing source and maintaining a fixed width word for addressing variable width data while inversely varying the width of the address field and the width of the substitution field. In addition, a process for addressing variable width data in a memory is described as having the following steps: (1) providing a memory having words of predetermined width and composed of partial words; (2) rotating the partial word to be accessed to a least significant bit justification; (3) extending the remaining part of the word so that the accessed word will be recognized as the partial word; and (4) restoring the remaining part of the word and rotating the word until the partial word is restored to its original position.

Detailed Description of the Invention for Transforming Data Using a Common Processing Block

This present embodiment, in accordance with the present invention, relates to a method for the transformation of signals from a frequency to a time representation, as well as a digital circuit arrangement for implementing the transformation.

It is a common goal in the area of telecommunications to increase both information content and transmission speed. Each communications medium, however, imposes a limitation on transmission speed, as does the hardware at the transmitting and receiving end that must process the transmitted signals. A telegraph wire is, for example, typically a much faster medium for transmitting information than the mail is, even though it might be faster to type and read a mailed document than to tap out a telegraph key.

The method of encoding transmitted information also limits the speed at which information can be conveyed. A long-winded telegraph message will, for example, take longer to convey than a succinct message with the same information content. The greatest transmission and reception speed can therefore be obtained by compressing the data to be transmitted as much as possible, and then, using a high-speed transmission medium, to process the data at both ends as fast as possible, which often means the reduction or elimination of 'bottlenecks' in the system.

One application in which it is essential to provide high-speed transmission of large amounts of data is in the field of digital television. Whereas conventional television systems use analog radio and electrical signals to control the luminance and color of picture elements ('pixels') in lines displayed on a television screen, a digital television transmission system generates a digital representation of an image by conveying analog signals into binary 'numbers' corresponding to luminance and color values for the pixels. Modern digital encoding schemes and hardware structures typically enable much higher information transmission rates than do conventional analog transmission systems. As such, digital televisions are able to achieve much higher resolution and much more life-like images than their conventional analog counterparts. It is anticipated that digital television systems including so-called High-Definition TV (HDTV) systems, will replace conventional analog television technology within the next decade in much of in the industrialized world. The conversion from analog to digital imaging, for both transmission and storage will, thus, be similar to the change-over from analog audio records to the now ubiquitous compact discs (CD's).

In order to increase the general usefulness of digital image technology, standardized schemes for encoding digital images have been adopted. Once such standardized scheme is known as the JPEG standard and is used for still pictures. For moving pictures, there are at present two standards, MPEG and H.261, both of which carry out JPEG-like procedures on each of the sequential frames of the moving picture. To gain advantage over using JPEG repeatedly, MPEG and H.261 operate on the differences between subsequent frames, taking advantage of the well-known fact that the difference, that is, the movement between frames, is small. It, therefore, takes less time or space to transmit or store the information corresponding to the changes rather than to transmit or store equivalent still-picture information as if each frame in the sequence were completely unlike the frames closest to it in the sequence.

For convenience, all the current standards operate by breaking an image or picture into tiles or blocks, each block consisting of a piece of the picture eight pixels wide by eight pixels high. Each pixel is then represented by three (or more) digital numbers known as 'components' of that pixel. There are many different ways of breaking a colored pixel into components, for example, using standard notation, e.g., YUV, YCr, Cb, RGB, etc. All the conventional JPEG-like methods operate on each component separately.

It is well known that the eye is insensitive to high-frequency components (or edges) in a picture. Information concerning the highest frequencies can usually be omitted altogether without the human viewer noticing any significant reduction in image quality. In order to achieve this ability to reduce the information content in a picture by eliminating high-frequency information without the eye detecting any loss of information, the 8-by-8 pixel block containing spatial information (for example, the actual values for luminance) must be transformed in some manner to obtain frequency information. The JPEG, MPEG and H.261 standards all use the known Discrete Cosine Transform to operate on the 8-by-8 spatial matrix to obtain an 8-by-8 frequency matrix.

As described above, the input data represents a square area of the picture. In transforming the input data into the frequency representation, the transform that is applied must be two-dimensional, but such two-dimensional transforms are difficult to compute efficiently. The known, two-dimensional Discrete Cosine Transform (DCT) and the associated inverse DCT (IDCT), however, have the property of being "'separable". This means that rather than having to operate on all 64 pixels in the eight-by-eight pixel block at one time, the block can first be transformed row-by-row into intermediate values, which are then transformed column-by-column into the final transformed frequency values.

A one-dimensional DCT of order N is mathematically equivalent to multiplying two N-by-N matrices. In order to perform the necessary matrix multiplication for an eight-by-eight pixel block, 512 multiplications and 448 additions are required, so that 1,024 multiplications and 896 additions are needed to perform the full 2 dimensional DCT on the 8-by-8 pixel block. These arithmetic operations, and especially multiplication, are complex and slow and, therefore, limit the achievable transmission rate. They also require considerable space on the silicon chip used to implement the DCT.

The DCT procedure can be rearranged to reduce the amount of computation required. There are, at present, two main methods used for reducing the computation required for the DCT, both of which use "'binary decimation". The term "binary decimation" means than an N-by-N transform can be computed by using two N2-by-N2 transformations, plus some computational overhead whilst arranging this. Whereas the eight-by-eight transform requires 512 multiplications and 448 additions, a four-by-four transform requires only 64 multiplications and 48 additions. Binary decimation, thus, saves 284 multiplications and 352 additions and the overhead incurred in performing the decimation is typically insignificant compared to the reduction in computation.

At present, the two main methods for binary decimation were developed by Eong Gi Lee ('A New Algorithm to Compute the DCT') IEEE Transactions on Acoustics, Speech and Signal Processing, Vol. Assp 32, No 6, p 1243 December 1984) and Wen-Hsiung Chen ('A Fast Computational Algorithm for the DCT', Wen-Hsiung Chen, C. Harrison Smith, S C Pralick, IEEE Transactions on Communications, Col. Com 25, No. 9 1004, September 1977). Lee's method makes use of the symmetry inherent in the definition of the inverse DCT and, by using simple cosine identities, it defines a method for recursive binary decimation. The Lee approach is only suitable for the IDCT.

The Chen method uses a recursive matrix identity that reduces the matrices into diagonals only. This method provides easy binary decimation of the DCT using known identities for diagonal matrices.

A serious disadvantage of the Lee and Chen methods is that they are unbalanced in respect of when multiplications and additions must be performed. Essentially, both of these methods require that many additions be followed by many multiplications, or vice versa. When implementing the Lee or Chen methods in hardware, it is, therefore, not possible to have parallel operation of adders and multipliers. This reduces their speed and efficiency since the best utilization of hardware is when all adders and multipliers are used all the time.

An additional disadvantage of such known methods and devises for performing DCT and IDCT operations is that it is usually difficult to handle the so-called normalization coefficient, and known architectures require adding an additional multiplication time when all the multipliers are being used.

Certain known methods for applying the forward and inverse DCT to video data are very simple and highly efficient for a software designer who need not be concerned with the layout of the semiconductor devices which perform the calculations. Such methods, however, often are far too slow or are too complex in semiconductor architecture and hardware interconnections to perform satisfactorily at the transmission rate desired for digital video.

Yet another shortcoming of existing methods and hardware structures for performing DCT and IDCT operations on video data is that they require floating-point internal representation of numerical values. To illustrate this disadvantage, assume that one has a calculator that is only able to deal with three - digit numbers, including digits to the right of the decimal point (if any). Assume further that the calculator is to add the numbers 12.3 and 4.56 (Notice that the decimal point is not fixed relative to the position of the digits in these two numbers. In other words, the decimal point is allowed to 'float'). Since the calculator is not able to store the four digits required to fully represent the answer 16.86, the calculator must reduce the answer to three digits either by truncating the answer by dropping the right-most '6', yielding an answer of 16.8, or it must have the necessary hardware to round the answer up to the closest three-digit approximation 16.9.

As this very simple example illustrates, if floating-point arithmetic is required, one must either accept a loss of precision or include highly complicated and space-wasting circuitry to minimize rounding error. Even with efficient rounding circuitry, however, the accumulation and propagation of rounding or truncation errors may lead to unacceptable distortion in the video signals. This problem is even greater when the methods for processing the video signals require several multiplications, since floating point rounding and truncation errors are typically greater for multiplication than for addition.

A much more efficient DCT/IDCT method and hardware structure would ensure that the numbers used in the method could be represented with a fixed decimal point, but in such a way that the full dynamic range of each number could be used. In such a system, truncation and rounding errors would either be eliminated or, at least, greatly reduced.

In the above example, if the hardware can handle four digits, no number greater than 99.99 were ever needed, and every number had the decimal point between the second and third places, then the presence of the decimal point would not affect calculations at all. Accordingly, the arithmetic could be carried out just as if every number were an integer, e.g., the answer 1230+0456=1686 would be just as clear as 12.30+4.56=16.86, since one would always know that the '1686' should have a decimal point between the middle '6' and '8'. Alternatively, if numbers (constant or otherwise) are selectively scaled or adjusted so that they all fall within the same range, each number in the range couldls ao be accurately and unambiguously represented as a set of integers.

One way of reducing the number of multipliers needed is simply to have a single multiplier that is able to accept input data from different sources. In other words, certain architectures use a single multiplier to perform the multiplications required in different steps of the DCT or IDCT calculations. Although such "crossbar switching" may reduce the number of multipliers required, it means that large complicated multiplexer structures must be included instead to select the inputs to the multiplier, to isolate others from the multiplier, and to switch the appropriate signals from the selected sources to the inputs of the multiplier. Additional large-scale multiplexers are also required to switch the large number of outputs from the shared multipliers to the appropriate subsequent circuitry. Crossbar switching or multiplexing is, therefore, complex, is generally slow (because of the extra storage needed) and costs are significant in a final semiconductor implementation.

Still another drawback of existing architectures, including the "crossbar switching" is that they require general purpose multipliers. In other words, existing systems require multipliers for which both inputs are variable. As is well known, implementations of digital multipliers typically include rows of adders and shifters such that, if the current bit of a multiplier word is a 'one' the value of the multiplicand is added into the partial result, but not if the current bit is a 'zero'. Since a general purpose multiplier must be able to deal with the case in which every bit is a '1', a row of adders must be provided for every bit of the multiplier word.

By way of example, assume that data words are 8 bits wide and that one wishes to multiply single inputs by 5. An 9-bit representation of the number 5 is 00000101. In other words, digital multiplication by 5 requires only that the input value be shifted to the left two places (corresponding to multiplication by 4) and then added to its up-shifted value. The other six positions of the coefficients have bit values of '0', so they would not require any shifting or additional steps.

A fixed-coefficient multiplier, that is, in this case, a multiplier capable of multiplying only by five, would require only a single shifter and a single adder in order to perform the multiplication (disregarding circuitry needed to handle carry bits). A general purpose multiplier, in contrast, would require shifters and adders for each of the eight positions, even though six of them would never need to be used. As the example illustrates, fixed coefficients can simplify the multipliers since they allow the designer to eliminate rows of adders that correspond to zeros in the coefficient, thus saving silicon area.

In an IDCT method, in accordance with the present invention, a one-dimensional IDCT for each N-row and N-column of N-by-N pixel blocks is decimated and a 1-D IDCT is performed separately on the N-2 even-numbered pixel input words and the N-2 odd-numbered pixel input words.

In a preferred embodiment, N=8 according to the JPEG standard. The two-dimensional IDCT result is then obtained by performing two one-dimensional IDCT operations in sequence (with an intermediate reordering-transposition-of data).

In a common processing step, for N=8, a first pair of input values is passed without need for multiplication to output adders and subtractors. Each of a second pair of input values is multiplied by each of two constant-coefficient values corresponding to two scaled cosine values. No other multiplications and only one subtraction and one addition are required in the common processing step. The second pair is then added or differenced pairwise with the first pair of input values to form even or odd resultant values.

In a pre-common processing stage, the lowest order odd input word is pre-multiplied by the square root of two and the odd input words are summed pairwise before processing in the common processing block. In a post-common processing stage, intermediate values corresponding to the processed odd input words are multiplied by predetermined constant coefficients to form odd resultant values.

After calculation of the even and odd resultant values, the N/2 high-order outputs are formed by simple subtraction of the odd resultant values from the even resultant values, and the N/2 low-order outputs are formed by simple addition of the odd resultant values and the even resultant values.

For both the DCT (at the transmission end of a video processing system) and the IDCT (at the receiving end, which incorporates one or more of the various aspects of the present invention), the values are preferably and deliberately scaled downward by a factor of two by a simple binary right shift. This deliberate, balanced, upward scaling eliminates several multiplication steps that are required according to conventional methods.

According to another aspect of the method, in accordance with the present invention, selected bits of constant coefficient or intermediate resulting data words are rounded or adjusted by predetermined setting of selected bits to either '1' or '0'.

Two-dimensional transformation of pixel data is carried out by a second, identical 1-D operation on the output values from the first 1-D IDCT processing steps.

An IDCT system, according to yet another aspect of the present invention, includes a pre-common processing circuit, and a common processing circuit, in which the pre-common, common, and post-common processing calculations are performed on input data words. A supervisory controller generates control signals to control the loading of various system latches; preferably, to serially time-multiplex the application of the N/2 even and N/2 odd-numbered input words to input latches of the pre-common block to direct addition of the even and odd resultant values to form and latch low order output signals and to direct subtraction of the odd resultant values from the even resultant values to form and latch the high-order output signals and to sequentially control internal multiplexers.

In the present invention, even and odd input words are preferably processed in separate passes through the same processing blocks. Input data words are preferably (but not necessarily) latched, not in strictly ascending or descending order, but rather in an order enabling an efficient 'butterfly' structure for the data path.

Furthermore, at least the common processing circuit may be configured as a pre-logic circuit, with no clock or control signals required for its proper operation, as may be other processing blocks, depending on the particular application.

No general-purpose multipliers (with two variable inputs) are required. Rather, constant coefficient multipliers are included throughout the preferred embodiment. Furthermore, fixed-point integer arithmetic devices are included in the preferred embodiment of the invention and can be so designed as to provide a method and system for performing IDCT transformation of video data with one or more of the following features: <ul id="ul0006" list-style="none" compact="compact"><li>1. Constant use of all costly arithmetic operations;</li><li>2. In order to reduce the silicon area needed to implement the IDCT, there are a small number of storage elements (such as latches), preferably no more than required for efficient pipelining of the architecture, coupled with a small number of constant coefficient multipliers rather than general purpose multipliers that require extra storage elements;</li><li>3. Operations are arranged so that each arithmetic operation does not need to use sophisticated designs, for example, if known 'ripple adders' are used, these would allow sufficient time to 'resolve' (see below) or produce their answers; if operations are arranged in such a way that other devises precede the rearranging operations so as to avoid delay and to allow greater throughput and efficiency;</li><li>4. One is able to generate results in a natural order;</li><li>5. No costly, complex, crossbar switching is required;</li><li>6. The architecture is able to support much faster operations; and</li><li>7. The circuitry used to control the flow of data through the transform hardware can be small in area.</li></ul>

Theoretical Background of the Invention

In order to understand the purpose and function of the various components and the advantages of the signal processing method used in the IDCT system according to the present invention, it is helpful to understand the system's theoretical basis.

Separability of a Two-Dimensional IDCT

The mathematical definition of a two-dimensional forward discrete cosine transforms (DCT) for an N x N block of pixels is as follows, where U(j,k) are the pixel frequency values corresponding to the pixel absolute values X(m,n)<maths id="math0004" num="Equation 1"><math display="block"><mrow><mtext mathvariant="italic">y</mtext><mtext>(</mtext><mtext mathvariant="italic">j</mtext><mtext>,</mtext><mtext mathvariant="italic">k</mtext><mtext>)=</mtext><mfrac><mrow><mtext>2</mtext></mrow><mrow><msup><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext mathvariant="italic">c</mtext></mrow></msup></mrow></mfrac><mtext>(</mtext><mtext mathvariant="italic">j</mtext><mtext>)</mtext><mtext mathvariant="italic">c</mtext><mtext>(</mtext><mtext mathvariant="italic">k</mtext><mtext>)</mtext><apply><sum /><lowlimit><mtext mathvariant="italic">n</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><apply><sum /><lowlimit><mtext mathvariant="italic">n</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><mtext mathvariant="italic">X</mtext><mtext>(</mtext><mtext mathvariant="italic">m</mtext><mtext>,</mtext><mtext mathvariant="italic">n</mtext><mtext>)cos</mtext><mfenced open="[" close="]"><mrow><mfrac><mrow><mtext>(2</mtext><mtext mathvariant="italic">m</mtext><mtext>+1)</mtext><mtext mathvariant="italic">j</mtext><mtext>π</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></mfenced><mtext>cos</mtext><mfenced open="[" close="]"><mrow><mfrac><mrow><mtext>(2</mtext><mtext mathvariant="italic">n</mtext><mtext>+1)</mtext><mtext mathvariant="italic">k</mtext><mtext>π</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></mfenced></mrow></apply></mrow></apply></mrow></math><img file="EP0891094A2_D0004.tif" /></maths> where <maths id="math0005" num=""><math display="inline"><mrow><mtext>j,k=0,1...,N-1</mtext></mrow></math><img file="EP0891094A2_D0005.tif" /></maths> and <maths id="math0006" num=""><math display="inline"><mrow><mtext> </mtext><mtext mathvariant="italic">c</mtext><mtext> (</mtext><mtext mathvariant="italic">j</mtext><mtext>) , </mtext><mtext mathvariant="italic">c</mtext><mtext> (</mtext><mtext mathvariant="italic">k</mtext><mtext>) = 1/√2</mtext></mrow></math><img file="EP0891094A2_D0006.tif" /></maths>for j,k=0; otherwise 1 The terms 2N govern the dc level of the transform, and the coefficients c(j), c(k) are known normalization factors.

The expression for the corresponding inverse discrete cosine transform, that is for the IDCT, is as follows:<maths id="math0007" num="Equation 2"><math display="block"><mrow><mtext mathvariant="italic">x</mtext><mtext>(</mtext><mtext mathvariant="italic">m</mtext><mtext>,</mtext><mtext mathvariant="italic">n</mtext><mtext>)=</mtext><mfrac><mrow><mtext>2</mtext></mrow><mrow><mtext mathvariant="italic">n</mtext></mrow></mfrac><apply><sum /><lowlimit><mtext mathvariant="italic">j</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-</mtext></uplimit><mrow><apply><sum /><lowlimit><mtext mathvariant="italic">k</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><mtext mathvariant="italic">c</mtext><mtext>(</mtext><mtext mathvariant="italic">j</mtext><mtext>)</mtext><mtext mathvariant="italic">C</mtext><mtext>(</mtext><mtext mathvariant="italic">k</mtext><mtext>)</mtext><mtext mathvariant="italic">Y</mtext><mtext>(</mtext><mtext mathvariant="italic">j</mtext><mtext>,</mtext><mtext mathvariant="italic">k</mtext><mtext>)cos</mtext><mfenced open="[" close="]"><mrow><mfrac><mrow><mtext>(2</mtext><mtext mathvariant="italic">m</mtext><mtext>+1)</mtext><mtext mathvariant="italic">j</mtext><mtext>π</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></mfenced><mtext>cos</mtext><mfenced open="[" close="]"><mrow><mfrac><mrow><mtext>(2</mtext><mtext mathvariant="italic">N</mtext><mtext>+1)</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></mfenced></mrow></apply></mrow></apply></mrow></math><img file="EP0891094A2_D0007.tif" /></maths> where <maths id="math0008" num=""><math display="inline"><mrow><mtext>j,k=0,...,N-1</mtext></mrow></math><img file="EP0891094A2_D0008.tif" /></maths> and <maths id="math0009" num=""><math display="inline"><mrow><mtext mathvariant="italic">c</mtext><mtext>(</mtext><mtext mathvariant="italic">j</mtext><mtext>),</mtext><mtext mathvariant="italic">c</mtext><mtext>(</mtext><mtext mathvariant="italic">k</mtext><mtext>)=1/√2</mtext></mrow></math><img file="EP0891094A2_D0009.tif" /></maths>) for j,k = 0; otherwise 1 The forward DCT is used to transform spatial values (whether representing characteristics such as luminance directly, or representing differences, such as in the MPEG standard) into their frequency representation. The inverse DCT, as its name implies, operates the other 'direction', that is, the IDCT transforms the frequency values back into spatial values.

In the expression, Equation 2, (E2), note that the cosine functions each depend on only one of the summation indices.

The expression E2 can therefore be rewritten as:<maths id="math0010" num="Equation 3"><math display="block"><mrow><mtext mathvariant="italic">x</mtext><mtext>(</mtext><mtext mathvariant="italic">m</mtext><mtext>,</mtext><mtext mathvariant="italic">n</mtext><mtext>) = </mtext><mfrac><mrow><mtext>2</mtext></mrow><mrow><mtext mathvariant="italic">N</mtext></mrow></mfrac><apply><sum /><lowlimit><mtext mathvariant="italic">j</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><mtext mathvariant="italic">c</mtext><mtext> (</mtext><mtext mathvariant="italic">j</mtext><mtext>) cos</mtext><mfenced open="[" close="]"><mrow><mfrac><mrow><mtext>(2</mtext><mtext mathvariant="italic">m</mtext><mtext>+1)</mtext><mtext mathvariant="italic">j</mtext><mtext>π</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></mfenced></mrow></apply><apply><sum /><lowlimit><mtext mathvariant="italic">k</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><mtext mathvariant="italic">c</mtext><mtext>(</mtext><mtext mathvariant="italic">k</mtext><mtext>) </mtext><mtext mathvariant="italic">Y</mtext><mtext> (</mtext><mtext mathvariant="italic">j</mtext><mtext>,</mtext><mtext mathvariant="italic">k</mtext><mtext>) cos</mtext><mfenced open="[" close="]"><mrow><mfrac><mrow><mtext>(2</mtext><mtext mathvariant="italic">n</mtext><mtext>+1)</mtext><mtext mathvariant="italic">k</mtext><mtext>π</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></mfenced></mrow></apply></mrow></math><img file="EP0891094A2_D0010.tif" /></maths> This is the equivalent of a first one-dimensional IDCT performed on the product of all terms that depend on k and n, followed, after a straightforward standard data transposition by a second one-dimensional IDCT using as inputs the outputs of the first IDCT operation.

Definition of the 1-D IDCT

A 1-dimensional N-point IDCT (where n is an even number) is defined by the following expression.<maths id="math0011" num="Equation 4"><math display="block"><mrow><mtext mathvariant="italic">X</mtext><mtext> (</mtext><mtext mathvariant="italic">k</mtext><mtext>) = </mtext><apply><sum /><lowlimit><mtext mathvariant="italic">n</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><mtext></mtext><mtext mathvariant="italic">c</mtext><mtext> (</mtext><mtext mathvariant="italic">n</mtext><mtext>) · </mtext><mtext mathvariant="italic">y</mtext><mtext> (</mtext><mtext mathvariant="italic">n</mtext><mtext>) cos</mtext><mfenced open="[" close="]"><mrow><mfrac><mrow><mtext>π(2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1) </mtext><mtext mathvariant="italic">n</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></mfenced></mrow></apply><mtext> </mtext><mtext mathvariant="italic">k</mtext><mtext> = {0,1,...,</mtext><mtext mathvariant="italic">N</mtext><mtext>-1} </mtext></mrow></math><img file="EP0891094A2_D0011.tif" /></maths><maths id="math0012" num=""><math display="inline"><mrow><mtext> </mtext><mtext mathvariant="italic">c</mtext><mtext> (</mtext><mtext mathvariant="italic">n</mtext><mtext>) = 1/(√2)</mtext></mrow></math><img file="EP0891094A2_D0012.tif" /></maths>for n=0; otherwise 1 and where y(n) are the N inputs to the inverse transformation function and x(k) are its N outputs. As in the 2-D case, the formula for the DCT has the same structure under the summation sign, but with the normalization constant outside the summation sign and with the x and y vectors switching places in the equation.

Resolution of a 1-D IDCT

As is shown above, the 2-D IDCT can be calculated using a sequence of 1-D IDCT operations separated by a transpose. In accordance to one embodiment, each of these 1-D operations is in turn, broken down into sub-procedures that are then exploited to reduce even further the required size and complexity of the semiconductor implementation.

Normalization of Coefficients

As is discussed above, an important design goal for IDCT hardware is the reduction of the required number of multipliers that must be included in the circuitry. Most methods for calculating the DCT of IDCT, therefore, attempt to reduce the number of multiplications needed. According to this embodiment, however, all the input values are deliberately scaled upward by a factor of the square root of two. In other words, using the method according to this embodiment of the present invention, the right-hand side of the IDCT expression (E) is deliberately multiplied by the square root of two.

According to this embodiment, two 1-D IDCT operations are performed in series (with an intermediate transpose) to yield the final 2-D IDCT result. Each of these 1-D operations includes a multiplication by the same square root of two factor. Since the intermediate transposition involves no scaling, the result of two multiplications by the square root of two in series is that the final 2-D results will be scaled upward by a factor two. To obtain the unscaled value, the circuitry need then only divide by two. Since the values are all represented digitally, this can be accomplished easily by a simple right shift of the data. As is made clearer below, the upward scaling by the square root of two in each 1-D IDCT stage and final down-scaling by 2 is accomplished by adders, multipliers and shifters all within the system's hardware, so that the system places no requirements for scaled inputs on the other devises to which the system may be connected. Because of this, the system is compatible with other conventional devises that operate according to the JPEG or MPEG standards. Normalization according to this embodiment of the present invention, therefore, eliminates the need for hardware multipliers within the IDCT semiconductor architecture for at least two square root of two multiplication operations. As is explained below in greater detail, the single additional multiplication step (upward scaling by the square root of two) of the input data in each 1-D operation leads to the elimination of still other multiplication steps that are required when using conventional methods.

Separation of the 1-D IDCT into High and Low-Order Outputs

Expression E can now be evaluated separately for the N/2 low-order outputs (<maths id="math0013" num=""><math display="inline"><mrow><mtext>k=0, 1,...,N/2-1</mtext></mrow></math><img file="EP0891094A2_D0013.tif" /></maths>) and the N/2 high order outputs (<maths id="math0014" num=""><math display="inline"><mrow><mtext>k=N/2</mtext></mrow></math><img file="EP0891094A2_D0014.tif" /></maths>, <maths id="math0015" num=""><math display="inline"><mrow><mtext>k=N/2 + 1,...N</mtext></mrow></math><img file="EP0891094A2_D0015.tif" /></maths>). For N=8, this means that one can first transform the inputs to calculate y(0), y(1), y(2) and y(3), and then transform the inputs to calculate y(4), y(5), y(6) and y(7).

Introduce the variable <maths id="math0016" num=""><math display="inline"><mrow><mtext>k'=(N-1-k)</mtext></mrow></math><img file="EP0891094A2_D0016.tif" /></maths> for the high-order outputs (<maths id="math0017" num=""><math display="inline"><mrow><mtext>k=N/2+1,..., N</mtext></mrow></math><img file="EP0891094A2_D0017.tif" /></maths>), so that k' varies from (N/2-1) to N as k varies fm ro(N/2+1) to N. For N=8, this means that k'=(3,2,1,0) for k=(4,5,6,7). It can then be shown that expression E can be divided into the following two subexpressions E5 (which is the same as E except for the interval of summation) and E6:

Low order outputs:

<maths id="math0018" num="Equation 5"><math display="block"><mrow><mtext mathvariant="italic">X</mtext><mtext> (</mtext><mtext mathvariant="italic">k</mtext><mtext>) = </mtext><apply><sum /><lowlimit><mtext mathvariant="italic">n</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><mtext></mtext><mtext mathvariant="italic">c</mtext><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>) · </mtext><mtext mathvariant="italic">y</mtext><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>) · cos </mtext><mfenced open="[" close="]"><mrow><mfrac><mrow><mtext>π(2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1)</mtext><mtext mathvariant="italic">n</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></mfenced></mrow></apply></mrow></math><img file="EP0891094A2_D0018.tif" /></maths> where <maths id="math0019" num=""><math display="inline"><mrow><mtext>k={0,1...,(N/2-1)}</mtext></mrow></math><img file="EP0891094A2_D0019.tif" /></maths>; and <maths id="math0020" num=""><math display="inline"><mrow><mtext> </mtext><mtext mathvariant="italic">c</mtext><mtext> (</mtext><mtext mathvariant="italic">n</mtext><mtext>) =1/√2</mtext></mrow></math><img file="EP0891094A2_D0020.tif" /></maths>for n =0; otherwise 1

High-order outputs:

<maths id="math0021" num="Equation 6"><math display="block"><mrow><mtext mathvariant="italic">x</mtext><mtext> (</mtext><mtext mathvariant="italic">k</mtext><mtext>) = </mtext><mtext mathvariant="italic">x</mtext><mtext> (</mtext><mtext mathvariant="italic">N</mtext><mtext>-1-</mtext><mtext mathvariant="italic">k</mtext><mtext>'''') = </mtext><apply><sum /><lowlimit><mtext mathvariant="italic">n</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><mtext></mtext><mtext mathvariant="italic">y</mtext><mtext> (</mtext><mtext mathvariant="italic">n</mtext><msup><mrow><mtext>) (-1)</mtext></mrow><mrow><mtext mathvariant="italic">n</mtext></mrow></msup><mtext> cos </mtext><mfenced open="[" close="]"><mrow><mfrac><mrow><mtext>π (2</mtext><mtext mathvariant="italic">k</mtext><mtext>'+1)</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></mfenced></mrow></apply></mrow></math><img file="EP0891094A2_D0021.tif" /></maths> where <maths id="math0022" num=""><math display="inline"><mrow><mtext>k={N,...,(N/2+1)}-->k'={0,1,...,(N/2-1)}</mtext></mrow></math><img file="EP0891094A2_D0022.tif" /></maths> (Since c(n)=1 for all high-order terms, c(n) is not included in this expression)

Note that both E5 and E6 have the same structure under the summation sign except that the term (-1)n changes the sign of the product under the summation sign for the odd-numbered inputs (n odd) for the upper N2 output values and except that the y term will be multiplied by <maths id="math0023" num=""><math display="inline"><mrow><mtext>c (O) = 1/√2</mtext></mrow></math><img file="EP0891094A2_D0023.tif" /></maths>.

Separation of the 1-D IDCT into Even and Odd Inputs

Observe that the single sum in the 1-D IDCT expression E4 can also be separated into two sums: one for the even-numbered inputs (for N=8 y(O), y(2), y(4),and y(6) and one for the odd-numbered inputs (for n=8, y(1), y(3), y(5), and y(7). Let g(k) represent the partial sum for the even-numbered inputs and h(k) represent the partial sum for the odd-numbered inputs. Thus:<maths id="math0024" num="Equation 7."><math display="block"><mrow><mtext mathvariant="italic">g</mtext><mtext> (</mtext><mtext mathvariant="italic">k</mtext><mtext>) = </mtext><apply><sum /><lowlimit><mtext mathvariant="italic">n</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext>(</mtext><mfrac><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext>)-1</mtext></uplimit><mrow><mtext></mtext><mtext mathvariant="italic">c</mtext><mtext> (2</mtext><mtext mathvariant="italic">n</mtext><mtext>) </mtext><mtext mathvariant="italic">y</mtext><mtext> (2</mtext><mtext mathvariant="italic">n</mtext><mtext>) cos [</mtext><mfrac><mrow><mtext>π(2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1) 2</mtext><mtext mathvariant="italic">n</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac><mtext>]</mtext></mrow></apply><mtext> = </mtext><apply><sum /><lowlimit><mtext mathvariant="italic">n</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext>(</mtext><mfrac><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext>)-1</mtext></uplimit><mrow><mtext></mtext><mtext mathvariant="italic">c</mtext><mtext> (2</mtext><mtext mathvariant="italic">n</mtext><mtext>) </mtext><mtext mathvariant="italic">y</mtext><mtext> (2</mtext><mtext mathvariant="italic">n</mtext><mtext>) cos [</mtext><mfrac><mrow><mtext>π(2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1)</mtext><mtext mathvariant="italic">n</mtext></mrow><mrow><mtext>2 (</mtext><mfrac><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext>)</mtext></mrow></mfrac><mtext>]</mtext></mrow></apply></mrow></math><img file="EP0891094A2_D0024.tif" /></maths> Where <maths id="math0025" num=""><math display="inline"><mrow><mtext>k={0,1,...,(N/2-1)}</mtext></mrow></math><img file="EP0891094A2_D0025.tif" /></maths>; and<maths id="math0026" num="Equation 8."><math display="block"><mrow><mtext mathvariant="italic">h</mtext><mtext> (</mtext><mtext mathvariant="italic">k</mtext><mtext>) = </mtext><apply><sum /><lowlimit><mtext mathvariant="italic">n</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext>(</mtext><mfrac><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext>)-1</mtext></uplimit><mrow><mtext></mtext><mtext mathvariant="italic">y</mtext><mtext> (2</mtext><mtext mathvariant="italic">n</mtext><mtext>+1) cos[</mtext><mfrac><mrow><mtext>π(2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1) (2</mtext><mtext mathvariant="italic">n</mtext><mtext>+1)</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac><mtext>]</mtext></mrow></apply></mrow></math><img file="EP0891094A2_D0026.tif" /></maths> where <maths id="math0027" num=""><math display="inline"><mrow><mtext>k=(0,1,...,(N/2-1)</mtext></mrow></math><img file="EP0891094A2_D0027.tif" /></maths>}.

For N=8, observe that the sums in E7 and E8 both are taken over n={0,1,2,3}. Now recall the known cosine identity:<maths id="math0028" num=""><math display="block"><mrow><mtext>2.cosA.cosB=cos(A+B)+cos(A-B),</mtext></mrow></math><img file="EP0891094A2_D0028.tif" /></maths> and set<maths id="math0029" num=""><math display="inline"><mrow><mtext mathvariant="italic">A</mtext><mtext> = π (2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1)/2</mtext><mtext mathvariant="italic">N</mtext><mtext> and </mtext><mtext mathvariant="italic">B</mtext><mtext> = π (2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1)(2</mtext><mtext mathvariant="italic">N</mtext><mtext>+1)/2</mtext><mtext mathvariant="italic">N</mtext></mrow></math><img file="EP0891094A2_D0029.tif" /></maths>. One can then multiply both sides of the expression E8 by:<maths id="math0030" num=""><math display="block"><mrow><mtext>2. cos </mtext><mtext mathvariant="italic">A</mtext><mtext> = 1/ {2 cos[ π (2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1)/2</mtext><mtext mathvariant="italic">N</mtext><mtext>] } =Ck.</mtext></mrow></math><img file="EP0891094A2_D0030.tif" /></maths> Note that, since Ck does not depend on the summation index n, it can be moved within the summation sign. Assume then by definition that y(-1)=0, and note that the cosine function for the input y(7) is equal to zero. The expression for h(k) can then be rewritten in the following form:<maths id="math0031" num="Equation 9."><math display="block"><mrow><mtext mathvariant="italic">h</mtext><mtext> (</mtext><mtext mathvariant="italic">k</mtext><mtext> ) = </mtext><mfrac><mrow><mtext>1</mtext></mrow><mrow><mtext>2 cos </mtext><mfenced open="(" close=")"><mrow><mfrac><mrow><mtext>π (2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1)</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></mfenced></mrow></mfrac><apply><sum /><lowlimit><mtext mathvariant="italic">n</mtext><mtext>=0</mtext></lowlimit><uplimit><mfrac><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext>-1</mtext></uplimit><mrow><mtext> [</mtext><mtext mathvariant="italic">y</mtext><mtext> (2</mtext><mtext mathvariant="italic">n</mtext><mtext>+1 )+ </mtext><mtext mathvariant="italic">y</mtext><mtext> (2</mtext><mtext mathvariant="italic">n</mtext><mtext>-1)]cos[</mtext><mfrac><mrow><mtext>π(2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1)</mtext><mtext mathvariant="italic">n</mtext></mrow><mrow><mtext>2 (</mtext><mfrac><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext>)</mtext></mrow></mfrac><mtext>]</mtext></mrow></apply></mrow></math><img file="EP0891094A2_D0031.tif" /></maths> Where <maths id="math0032" num=""><math display="inline"><mrow><mtext>k=(0,1,...,(N/2-1)</mtext></mrow></math><img file="EP0891094A2_D0032.tif" /></maths>}.

Note that the inputs [<maths id="math0033" num=""><math display="inline"><mrow><mtext>y(2n+1)=y(2n-1)</mtext></mrow></math><img file="EP0891094A2_D0033.tif" /></maths>] imply that in calculating h(k), the odd input terms are paired to form N/2 paired inputs <maths id="math0034" num=""><math display="inline"><mrow><mtext>p(n)=[y(2n+1)=y(2n-1)]</mtext></mrow></math><img file="EP0891094A2_D0034.tif" /></maths>.

For N=8 the values of p(n) are as follows: <tables id="tabl0012" num="0012"><table frame="all"><tgroup cols="2" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="78.75mm" /><colspec colnum="2" colname="col2" colwidth="78.75mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">n</entry><entry namest="col2" nameend="col2" align="left">p(n)</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="right">0</entry><entry namest="col2" nameend="col2" align="left">y(-1) + Y(1) = Y(1) Y(-1) = 0 by definition</entry></row><row><entry namest="col1" nameend="col1" align="right">1</entry><entry namest="col2" nameend="col2" align="left">y(1) + y(3)</entry></row><row><entry namest="col1" nameend="col1" align="right">2</entry><entry namest="col2" nameend="col2" align="left">y(3) + y(5)</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="right">3</entry><entry namest="col2" nameend="col2" align="left">y(5) + y(7)</entry></row></tbody></tgroup></table></tables> Expression E9 for h(k) can then be represented by the following:<maths id="math0035" num="Equation 10."><math display="block"><mrow><mtext mathvariant="italic">h</mtext><mtext> (</mtext><mtext mathvariant="italic">k</mtext><mtext>) = </mtext><msub><mrow><mtext mathvariant="italic">C</mtext></mrow><mrow><mtext mathvariant="italic">k</mtext></mrow></msub><mtext></mtext><apply><sum /><lowlimit><mtext mathvariant="italic">n</mtext><mtext>=0</mtext></lowlimit><uplimit><mfrac><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext> -1</mtext></uplimit><mrow><mtext></mtext><mtext mathvariant="italic">p</mtext><mtext> (</mtext><mtext mathvariant="italic">n</mtext><mtext>) cos[</mtext><mfrac><mrow><mtext>π(2</mtext><mtext mathvariant="italic">k</mtext><mtext>-1)</mtext><mtext mathvariant="italic">n</mtext></mrow><mrow><mtext>2 (</mtext><mfrac><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext>)</mtext></mrow></mfrac><mtext>]</mtext></mrow></apply></mrow></math><img file="EP0891094A2_D0035.tif" /></maths> Where <maths id="math0036" num=""><math display="inline"><mrow><mtext>k=(0,1,...,(N/2-1)</mtext></mrow></math><img file="EP0891094A2_D0036.tif" /></maths>}.

Observe now that the cosine term under the summation sign is the same for both g(k) and h(k) and that both have the structure of a 1-D IDCT (compared with expression E5). The result of the IDCT for the odd k terms, that is, for h(k), however is multiplied by the factor<maths id="math0037" num=""><math display="block"><mrow><mtext>Ck=1/{2.cos [ π (2</mtext><mtext mathvariant="italic">k</mtext><mtext>+1)/2</mtext><mtext mathvariant="italic">N</mtext><mtext>.</mtext></mrow></math><img file="EP0891094A2_D0037.tif" /></maths>

In other words, g(k) is an n/2-point IDCT operating on even inputs y(2n) and h(k) is an n/2-point IDCT operating on [<maths id="math0038" num=""><math display="inline"><mrow><mtext>y(2n+1)=y(2n-1)</mtext></mrow></math><img file="EP0891094A2_D0038.tif" /></maths>] where y(-1)=0 by definition.

Now introduce the following identities:<maths id="math0039" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtext mathvariant="italic">yn</mtext><mtext>=</mtext><mtext mathvariant="italic">y</mtext><mtext>(</mtext><mtext mathvariant="italic">n</mtext><mtext>);</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">c1</mtext><mtext>=cos(π8);</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">c2</mtext><mtext>=cos(2π8)=cos(π4)=1.√2;</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">c3</mtext><mtext>=cos(3π8);</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">d1</mtext><mtext>=1[2.cos(π1610)];</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">d3</mtext><mtext>=1[2.cos(3π/16)];</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">d5</mtext><mtext>=1[2.cos(5π/16)]; and</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">d7</mtext><mtext>=1/[2.cos(97π/16)].</mtext></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0891094A2_D0039.tif" /></maths>

Further introduce scaled cosine coeefficients as follows:<maths id="math0040" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtext mathvariant="italic">c1s</mtext><mtext>=√2.cos(π/8);</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">c3s</mtext><mtext>=√2.cos(3π8);</mtext></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0891094A2_D0040.tif" /></maths> Using the evenness (<maths id="math0041" num=""><math display="inline"><mrow><mtext>cos(-φ)=cos(φ)</mtext></mrow></math><img file="EP0891094A2_D0041.tif" /></maths>) and periodicity <maths id="math0042" num=""><math display="inline"><mrow><mtext>(cos ( -φ ))π ( - φ) = - cos (φ)</mtext></mrow></math><img file="EP0891094A2_D0042.tif" /></maths> of the cosine function, expressions E7 and E8 can then be expanded for N=8 to yield (recall also (O) is 1/√2);<maths id="math0043" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtext mathvariant="italic">g</mtext><mtext>(0)=1/√2.</mtext><mtext mathvariant="italic">y</mtext><mtext> 0 + </mtext><mtext mathvariant="italic">y2c1</mtext><mtext> + </mtext><mtext mathvariant="italic">y4c2</mtext><mtext> + </mtext><mtext mathvariant="italic">y6c3</mtext><mtext> = 1/√2.(</mtext><mtext mathvariant="italic">y</mtext><mtext> + </mtext><mtext mathvariant="italic">y2</mtext><mtext>.</mtext><mtext mathvariant="italic">cls</mtext><mtext> + </mtext><mtext mathvariant="italic">y4</mtext><mtext> + </mtext><mtext mathvariant="italic">y6</mtext><mtext>.</mtext><mtext mathvariant="italic">c3s</mtext><mtext>)</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">g</mtext><mtext>(1)=1/√2.</mtext><mtext mathvariant="italic">y0</mtext><mtext> + </mtext><mtext mathvariant="italic">y2c3</mtext><mtext> - </mtext><mtext mathvariant="italic">y4c2</mtext><mtext> - </mtext><mtext mathvariant="italic">y6c1</mtext><mtext> = 1/√2. (</mtext><mtext mathvariant="italic">y0</mtext><mtext> + </mtext><mtext mathvariant="italic">y2</mtext><mtext>.</mtext><mtext mathvariant="italic">c3s</mtext><mtext> - </mtext><mtext mathvariant="italic">y4</mtext><mtext> - </mtext><mtext mathvariant="italic">y6</mtext><mtext>.</mtext><mtext mathvariant="italic">cls</mtext><mtext>) + </mtext><mtext mathvariant="italic">y6</mtext><mtext>.</mtext><mtext mathvariant="italic">cls</mtext><mtext>)</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">g</mtext><mtext>(3) = 1/√2 .</mtext><mtext mathvariant="italic">y0</mtext><mtext> - </mtext><mtext mathvariant="italic">y2c1</mtext><mtext> + </mtext><mtext mathvariant="italic">y4c2</mtext><mtext> - </mtext><mtext mathvariant="italic">y6c3</mtext><mtext> = 1/√2. (</mtext><mtext mathvariant="italic">y0</mtext><mtext> - </mtext><mtext mathvariant="italic">y2</mtext><mtext>.</mtext><mtext mathvariant="italic">cls</mtext><mtext> + </mtext><mtext mathvariant="italic">y4</mtext><mtext> - </mtext><mtext mathvariant="italic">y6</mtext><mtext>.</mtext><mtext mathvariant="italic">c3s</mtext><mtext>)</mtext></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0891094A2_D0043.tif" /></maths> and<maths id="math0044" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtext mathvariant="italic">h</mtext><mtext>(0) = </mtext><mtext mathvariant="italic">d1</mtext><mtext>. {</mtext><mtext mathvariant="italic">y1</mtext><mtext> + (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>) </mtext><mtext mathvariant="italic">c1</mtext><mtext> +(</mtext><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) </mtext><mtext mathvariant="italic">c2</mtext><mtext> + (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>)</mtext><mtext mathvariant="italic">c3</mtext><mtext>} = </mtext><mtext mathvariant="italic">d1</mtext><mtext>/√2.{√2.</mtext><mtext mathvariant="italic">y1</mtext><mtext> + (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>). </mtext><mtext mathvariant="italic">cls</mtext><mtext> + (</mtext><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) + (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>).</mtext><mtext mathvariant="italic">c3s</mtext><mtext>}</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">h</mtext><mtext>(1) = </mtext><mtext mathvariant="italic">d3</mtext><mtext>.{</mtext><mtext mathvariant="italic">y1</mtext><mtext> + (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>) </mtext><mtext mathvariant="italic">c3</mtext><mtext> - (</mtext><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) </mtext><mtext mathvariant="italic">c2</mtext><mtext> + (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>) </mtext><mtext mathvariant="italic">c1</mtext><mtext>} = </mtext><mtext mathvariant="italic">d3</mtext><mtext>/√2. {√2.</mtext><mtext mathvariant="italic">y1</mtext><mtext> + (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>) </mtext><mtext mathvariant="italic">c3s</mtext><mtext> - (</mtext><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) - (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>) </mtext><mtext mathvariant="italic">c1s</mtext><mtext>}</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">h</mtext><mtext>(2) = </mtext><mtext mathvariant="italic">d5</mtext><mtext>.{</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>) </mtext><mtext mathvariant="italic">c3</mtext><mtext> - (</mtext><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) </mtext><mtext mathvariant="italic">c2</mtext><mtext> + (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>) </mtext><mtext mathvariant="italic">c1</mtext><mtext>} = </mtext><mtext mathvariant="italic">d5</mtext><mtext>/√2. {√2.</mtext><mtext mathvariant="italic">y1</mtext><mtext> - (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>). </mtext><mtext mathvariant="italic">c3ys</mtext><mtext> - (</mtext><mtext mathvariant="italic">y3</mtext><mtext>+ + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) - (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>) </mtext><mtext mathvariant="italic">c1s</mtext><mtext>}</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">h</mtext><mtext>(3) = </mtext><mtext mathvariant="italic">d7</mtext><mtext>. { </mtext><mtext mathvariant="italic">y1</mtext><mtext> - (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>) </mtext><mtext mathvariant="italic">c1</mtext><mtext> + (</mtext><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) </mtext><mtext mathvariant="italic">c2</mtext><mtext> - (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>) </mtext><mtext mathvariant="italic">c3</mtext><mtext> } = </mtext><mtext mathvariant="italic">d7</mtext><mtext>/√2.</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext>{√2.</mtext><mtext mathvariant="italic">y1</mtext><mtext> - (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>). </mtext><mtext mathvariant="italic">c1s</mtext><mtext> + (</mtext><mtext mathvariant="italic">y3</mtext><mtext>+ </mtext><mtext mathvariant="italic">y5</mtext><mtext>) - (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>). </mtext><mtext mathvariant="italic">c3s</mtext><mtext> }</mtext></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0891094A2_D0044.tif" /></maths> Now, recall that according to this embodiment of the present invention, all values are scaled upward by a factor of 2 for both the DCT and IDCT operations. In other words, according to the embodiment, both h(k) and g(k) are multiplied by this scaling factor. The g(k) and h(k) expressions, therefore, become:<maths id="math0045" num="Equation 11."><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtext mathvariant="italic">g</mtext><mtext>(0) = </mtext><mtext mathvariant="italic">y0</mtext><mtext> + </mtext><mtext mathvariant="italic">y2</mtext><mtext> * </mtext><mtext mathvariant="italic">cls</mtext><mtext> + </mtext><mtext mathvariant="italic">y4</mtext><mtext> + </mtext><mtext mathvariant="italic">y6</mtext><mtext> * </mtext><mtext mathvariant="italic">c3s</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">g</mtext><mtext>(1) = </mtext><mtext mathvariant="italic">y0</mtext><mtext> + </mtext><mtext mathvariant="italic">y2</mtext><mtext> * </mtext><mtext mathvariant="italic">c3s</mtext><mtext> - </mtext><mtext mathvariant="italic">y4</mtext><mtext> - </mtext><mtext mathvariant="italic">y6</mtext><mtext> * </mtext><mtext mathvariant="italic">c3s</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">g</mtext><mtext>(2) = </mtext><mtext mathvariant="italic">y0</mtext><mtext> - </mtext><mtext mathvariant="italic">y2</mtext><mtext> * </mtext><mtext mathvariant="italic">c3s</mtext><mtext> - </mtext><mtext mathvariant="italic">y4</mtext><mtext> + </mtext><mtext mathvariant="italic">y6</mtext><mtext> * </mtext><mtext mathvariant="italic">cls</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext>and </mtext><mtext mathvariant="italic">g</mtext><mtext>(3) = </mtext><mtext mathvariant="italic">y0</mtext><mtext> - </mtext><mtext mathvariant="italic">y2</mtext><mtext> * </mtext><mtext mathvariant="italic">cls</mtext><mtext> + </mtext><mtext mathvariant="italic">y4</mtext><mtext> - </mtext><mtext mathvariant="italic">y6</mtext><mtext> * </mtext><mtext mathvariant="italic">c3s</mtext></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0891094A2_D0045.tif" /></maths><maths id="math0046" num="Equation 12."><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtext mathvariant="italic">h</mtext><mtext>(0) = </mtext><mtext mathvariant="italic">d1</mtext><mtext> [√2 * </mtext><mtext mathvariant="italic">y1</mtext><mtext> + (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>) * </mtext><mtext mathvariant="italic">c1s</mtext><mtext> + (</mtext><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) + (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>) * </mtext><mtext mathvariant="italic">c3s</mtext><mtext>]</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">h</mtext><mtext>(1) = </mtext><mtext mathvariant="italic">d3</mtext><mtext> [√2 * </mtext><mtext mathvariant="italic">y1</mtext><mtext> + (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>) * </mtext><mtext mathvariant="italic">c3s</mtext><mtext> - (</mtext><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) - (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>) * </mtext><mtext mathvariant="italic">c1s</mtext><mtext>]</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">h</mtext><mtext>(2) = </mtext><mtext mathvariant="italic">d5</mtext><mtext> [√2 * </mtext><mtext mathvariant="italic">y1</mtext><mtext> - (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>) * </mtext><mtext mathvariant="italic">c3s</mtext><mtext> - (</mtext><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) + (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>) * </mtext><mtext mathvariant="italic">c1s</mtext><mtext>]</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext mathvariant="italic">h</mtext><mtext>(3) = </mtext><mtext mathvariant="italic">d7</mtext><mtext> [√2 * </mtext><mtext mathvariant="italic">y1</mtext><mtext> - (</mtext><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext><mtext>) * </mtext><mtext mathvariant="italic">c1s</mtext><mtext> + (</mtext><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext><mtext>) - (</mtext><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext><mtext>) * </mtext><mtext mathvariant="italic">c3s</mtext><mtext>]</mtext></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0891094A2_D0046.tif" /></maths> Notice that since <maths id="math0047" num=""><math display="inline"><mrow><mtext>c2 = cos (π /4) = 1 /√2</mtext></mrow></math><img file="EP0891094A2_D0047.tif" /></maths>, multiplication by √2 gives a scaled c2 value=1. By scaling the expressions (corresponding to upward scaling of the values of the video absolute and frequency values) according to this embodiment, it is, therefore, possible to eliminate the need to multiply and c3s, both of which are constant coefficients so that general utility multipliers are not needed. This, in turn, eliminates the need for the corresponding hardware multiplier in the semiconductor implementation of the IDCT operations.

The similarity in structure of g(k) and h(k) can be illustrated by expressing these sets of equations in matrix form. Let C be the 4 x 4 cosine coefficient matrix defined as follows:<maths id="math0048" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtable><mlabeledtr><mtext>Equation 13.</mtext><mtd><mrow><munder accentunder="true"><mrow><mtext mathvariant="italic">C</mtext></mrow><mo>̲</mo></munder><mtext> = </mtext><mfenced open="|" close="|"><mrow><mtable><mtr><mtd><mtext>1</mtext></mtd><mtd><mtext mathvariant="italic">c1s</mtext></mtd><mtd><mtext>1</mtext></mtd><mtd><mtext mathvariant="italic">c3s</mtext></mtd></mtr><mtr><mtd><mtext>1</mtext></mtd><mtd><mtext mathvariant="italic">c3s</mtext></mtd><mtd><mtext>-1</mtext></mtd><mtd><mtext mathvariant="italic">-c1s</mtext></mtd></mtr><mtr><mtd><mtext>1</mtext></mtd><mtd><mtext mathvariant="italic">-c3s</mtext></mtd><mtd><mtext>-1</mtext></mtd><mtd><mtext mathvariant="italic">c1s</mtext></mtd></mtr><mtr><mtd><mtext>1</mtext></mtd><mtd><mtext mathvariant="italic">-c1s</mtext></mtd><mtd><mtext>1</mtext></mtd><mtd><mtext mathvariant="italic">-c3s</mtext></mtd></mtr></mtable></mrow></mfenced></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>Equation 14</mtext><mtd><mrow><mfenced open="|" close="|"><mrow><mtable><mtr><mtd><mtext mathvariant="italic">g</mtext><mtext>(0)</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">f</mtext><mtext>(1)</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">g</mtext><mtext>(2)</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">g</mtext><mtext>(3)</mtext></mtd></mtr></mtable></mrow></mfenced><mtext> = </mtext><munder accentunder="true"><mrow><mtext mathvariant="italic">c</mtext></mrow><mo>̲</mo></munder><mtext> * </mtext><mfenced open="|" close="|"><mrow><mtable><mtr><mtd><mtext mathvariant="italic">y0</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">y2</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">y4</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">y6</mtext></mtd></mtr></mtable></mrow></mfenced></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>Equation 15.</mtext><mtd><mrow><mfenced open="|" close="|"><mrow><mtable><mtr><mtd><mtext mathvariant="italic">h</mtext><mtext>(0)</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">h</mtext><mtext>(1)</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">h</mtext><mtext>(2)</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">h</mtext><mtext>(3)</mtext></mtd></mtr></mtable></mrow></mfenced><mtext> = </mtext><munder accentunder="true"><mrow><mtext mathvariant="italic">D</mtext></mrow><mo>̲</mo></munder><mtext> * </mtext><munder accentunder="true"><mrow><mtext mathvariant="italic">C</mtext></mrow><mo>̲</mo></munder><mtext> * </mtext><mfenced open="|" close="|"><mrow><mtable><mtr><mtd><mtext>√2 * </mtext><mtext mathvariant="italic">y1</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">y1</mtext><mtext> + </mtext><mtext mathvariant="italic">y3</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">y3</mtext><mtext> + </mtext><mtext mathvariant="italic">y5</mtext></mtd></mtr><mtr><mtd><mtext mathvariant="italic">y5</mtext><mtext> + </mtext><mtext mathvariant="italic">y7</mtext></mtd></mtr></mtable></mrow></mfenced></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0891094A2_D0048.tif" /></maths> where <maths id="math0049" num=""><math display="inline"><mrow><mtext>D= diag[d1, d3, d5, d7]=the 4 x 4 matrix</mtext></mrow></math><img file="EP0891094A2_D0049.tif" /></maths> with d1, d3, d5, and d7 along the diagonal and with other elements equal to zero. As E14 and E15 show, the procedures for operating on even-numbered inputs to get g(k) and for operating on the odd-numbered inputs to get h(k) both have the common step of multiplication by the cosine coefficient matrix C. To get h(k), however, the inputs must first be pairwise summed (recalling that y(-1)=0 by definition), y(1) must be premultiplied by 2, and the result of the multiplication by C must be multiplied by D.

As the expressions above also indicate, the N-point, 1-D IDCT (see E4) can also be split into the two N/2-point, I-D IDCT's each involving common core operations (under the summation sign) on the N/2 odd (grouped) and the N/2 even input values. The expressions above yield the following simple structure for the IDCT as implemented in this embodiment:

Low-order outputs for (N=8, outputs k={0,1,2,3}):

High-order outputs (for N=8, outputs k={4,5,6,7}):

<maths id="math0051" num="Equation 17."><math display="block"><mrow><mtext>y(k)=y(N-1-k')=g(k')-h(k')</mtext></mrow></math><img file="EP0891094A2_D0051.tif" /></maths> Note that g(k) operates directly on even input values to yield output values directly, whereas h(k') involves grouping of input values, as well as multiplication by the values d1, d3, d5 and d7.

As always, thdee signer of an IDCT circuit is faced with a number of trade-offs, such as size versus speed and greater number of implemented devices versus reduced interconnection complexity. For example, it is often possible to improve the speed of computation by including additional, or more complicated devices on the silicon chip, but this obviously makes the implementation bigger or more complex. Also, what is available or desired on the IDCT chip may limit or preclude the use of sophisticated, complicated, designs such as "look-ahead" adders.

Standards of Accuracy

Assuming infinite precision and accuracy of all calculations, and, thus, unlimited storage space and calculation time, the image recreated by performing the IDCT and DCT-transformed image data would reproduce the original image perfectly. Of course, such perfection is not to be had using existing technology.

In order to achieve some standardization, however, IDCT systems are at present measured according to a standardized method put forth by the Comite Consultatif International Telegraphique et Telephonique ('CCIT') in 'Annex 1 of CCITT Recommendations H.261 - Inverse Transform Accuracy Specification.' This test specifies that sets of 10,000 8-by-8 Blocks containing random integers be generated. These blocks are then DCT and IDCT transformed (preceded or followed by predefined rounding, clipping and arithmetic operations) using predefined precision to produce 10,000 sets of 8-by-8 'reference' IDCT output data.

When testing an IDCT implementation, the CCITT test blocks are used as inputs. The actual IDCT transformed outputs are then compared statistically with the known 'reference' IDCT output data. Maximum values are specified for the IDCT in terms of peak, mean, mean square, and mean mean error of blocks as a whole and as individual elements. Furthermore, the IDCT must produce all zeros output if the corresponding input block contains all zeros, and the IDCT must meet the same standards when the sign of all input data is changed. Implementations of the IDCT are said to have acceptable accuracy only if their maximum errors do not exceed the specified maximum values when these tests are run.

Other known standards are those of the Institute of Electrical and Electronic Engineers ('IEEE'), in 'IEEE Draft Standard Specification for the Implementation of 8 by 8 Discrete Cosine Transform', P1180/D2, July 18, 1990; and Annex A of '8 by 8 Inverse Discrete Cosine Transform',. ISO committee Draft CD 11172-2. These standards are essentially identical to the CCITT standard described above.

Hardware Implementation

FIG 9 is a simplified block diagram illustrating the data flow of the IDCT method according to one embodiment of the present invention (although the hardware structure, as is illustrated and explained below, is made more compact and efficient). In FIG 9, the inputs to the system such as Y[0] and Y[4], and the outputs from the system, such as X[3] and X[6], are shown as being conveyed on single lines. It is to be understood that each of the single-drawn lines in FIG 9 represents several conductors in the form of data buses to convey, preferably in parallel, the several-bit wide data words to which each input and output corresponds.

In FIG 9, the large open circles 225 and 226 represent two-input adders, whereby a small circle 227 at the connection point of an input with the adder indicates that the complement of the corresponding input word is used. Adders with such a complementing input, thus, subtract the complemented input from the non complemented input. For example, although the output T0 from the upper left adder will be equal to Y[0] + Y[4] that its, <maths id="math0052" num=""><math display="inline"><mrow><mtext>T0 = Y0 + Y4</mtext></mrow></math><img file="EP0891094A2_D0052.tif" /></maths>, the adder with the output T1 forms the value <maths id="math0053" num=""><math display="inline"><mrow><mtext>Y0 + (-1),* Y4=Y0 - Y4</mtext></mrow></math><img file="EP0891094A2_D0053.tif" /></maths>. Adders with a single complementing input can, therefore, be said to be differencing components.

Also in FIG 9, constant-coefficient multipliers are represented by solid triangles 230 in the data path. For example, the input Y1 passes through a square root of two multiplier before entering the adder to form B0. Consequently, the intermediate value <maths id="math0054" num=""><math display="inline"><mrow><mtext>T3=Y2.T3=Y2.c1S + Y6.c3s</mtext></mrow></math><img file="EP0891094A2_D0054.tif" /></maths>, and the intermediate value <maths id="math0055" num=""><math display="inline"><mrow><mtext>B2 = pl.c3s-p3.c1s=(Y1+Y3).c3s - (Y5+Y7).c1s</mtext></mrow></math><img file="EP0891094A2_D0055.tif" /></maths>. By performing the indicated additions, subtractions, and multiplications, one will see that the illustrated structure implements the expressions E11 and E12 for g(0) to g(3) and h(0) to h(3).

FIG 9 illustrates an important advantage of the embodiment, in accordance with the present invention. As FIG 9 shows, the structure is divided into four main regions: a pre-common block, PREC 231, that forms the paired inputs p(k) and multiplies the input y(1) by the square root of two; a first post-common block, POSTC1 233, that includes four multipliers for the constants d1, d3, d5, d7 (see expression E12); a second post-common block, POSTC2 235, that sums the g0 to g3 terms and the h0 to h3 terms for the low order outputs, and forms the difference of the g0 to g3 terms and the h0 to h3 terms for the high-order outputs (See expressions E17 and E17); and a common block, CBLK 232, is included in both the even and odd data paths. In the processing circuitry according to the embodiment of the present invention, the common operations performed on the odd and even numbered inputs are carried out by a single structure, rather than duplicated structure as illustrated in FIG 9.

To understand the method of operation and the advantages of certain digital structures used in the embodiment, it is helpful to understand what "carry bits". As a simple example, note that the addition of two binary numbers is such that 1 + 1 = 0, with a carry of "1", which must be added into the next higher order bit to produce the correct result '"10"' (the binary representation of the decimal number "2"). In other words, 01 + 01 = 00 (the "sum" without carry) + 10 (the carry word); adding the "sum" to the "carry word"' one gets the correct answer 00 + 10 = 10.

As a decimal example, assume that one needs to add the numbers '436' and '825'. The common procedure for adding two numbers by hand typically proceeds as follows: <ul id="ul0007" list-style="none" compact="compact"><li>1. Units '6' plus '5' is '1' with a carry of '1' into the 'tens' position - Sum: 1, Carry-in: 0, Carry-Out: 0.</li><li>2. Tens: '3' plus '2' is '5', plus the '1' carried from the preceding step, gives '6' with no carry - Sum: 5, Carry-In: 0, Carry-Out:0.</li><li>3. Hundreds: '4' plus'8' is '2' with a carry of 1 into the thousands, but with no carry to be added in from the previous step; Sum: 2, Carry-In:), Carry-Out:1</li><li>4. Thousands: '0' plus '0', plus the '1' carried from the hundreds gives, '1' Sum: 0, Carry-In: 1, Carry-Out: 0.</li></ul>

The answer, '1261', is, thus, formed by adding the carry-in sum for each position to the sum for the same position, with the carry-in to each position being the carry-out of the adjacent lower-order position. (Note that this implies that the carry-in to the lowest order position is always a '0'). The problem, of course, is that one must wait to add the '4' and '8' in the hundreds place until one knows whether there will be a carry-in from the tens place. This illustrates a "ripple adder", which operates essentially in this way. A ripple adder, thus, achieves a 'final' answer without needing extra storage elements, but it is slower than some other designs.

One such alternative design is known as 'carry-save', in which the sum of two numbers for each position is formed by storing a partial sum or result word (in this example, 0251) and the carry values in a different word (here, 1010). The full answer is then obtained by 'resolving' the sum and carry words in a following addition step, thus, 0251 + 1010 = 1261. Note that one can perform the addition for every position at the same time, without having to wait to determine whether a carry word can be added to the partial result at any time as long as it is saved.

Since the resolving operations typically require the largest proportion of the time required in each calculation stage, speeding up these operations has a significant effect on the overall operating speed while requiring only a relatively small increase in the size of the transform. Carry-save multipliers, therefore, are usually faster than those that use ripple adders in each row. However, this gain in time comes at the cost of greater complexity, since the carry word for each addition in the multiplier must be either stored or passed down to the next addition. Furthermore, in order to obtain the final product of a multiplication, the final partial sum and final carry word will have to be resolved, normally by addition in a ripple adder. Note, however, that only one ripple adder will be needed, so that the time savings are normally proportional to the size of the multiplication that must be performed. Furthermore, note that a carry word may be treated as any other number to be added in and as long as it is added in at some time before the final multiplication answer is needed, the actual addition can be delayed.

In this embodiment of the present invention, this possibility of delaying resolution is used to simplify the design and to increase the throughout of the IDCT circuitry. Also, certain bits of preselected carry words are, optionally and deliberately forced to predetermined values before resolution in order to provide greater expected accuracy of the IDCT result based on a statistical analysis of test runs of the invention on standard test data sets.

FIG 10 is a block diagram that illustrates a preferred structure, in accordance with the present invention. In this preferred embodiment of the present invention, the even and odd numbered inputs are time-multiplexed and are processed separately in the common block CBLK 232. The inputs may be processed in either order.

In FIG 10, the notation Y[1,0], Y[5,4], Y[3,2] and Y[7,6] is used to indicate that the odd numbered inputs Y1, Y3, Y5, Y7 preferably pass through the calculation circuitry first, followed by the even numbered inputs Y0, Y2, Y4, Y6. This order is not essential to the present embodiment; nonetheless, as is explained below, certain downstream arithmetic operations are performed only on the odd numbered inputs, and by entering the odd numbered input values first, these downstream operations can be processing at the same time that arithmetic operations common to all inputs are performed upstream on the even numbered inputs. This reduces the time that several arithmetic devices would otherwise remain idle.

Similarly, the notation X[0,7], X[1,6], X[3,4], X[2,5] is used to indicate that the low order outputs X0, X1, X2, X3 are output first, followed by the high order outputs X4, X5, X6, X7. As FIGS. 9 and 10 illustrate, the inputs are preferably initially not grouped in ascending order, although this is not necessary since to odd numbered inputs are Y1, Y5, Y3, and Y7. Arranging the input signals in this order makes possible the simple 'butterfly' data path structure shown in FIGS. 9 and 10 and greatly increases the interconnection efficiency of the implementation of the present invention in silicon semiconductor devices.

As shown in FIG 10, adders and subtractors are inditecad by circles either a '+' (adder) 235, '-' (subtractor) 236 which is an adder with one complementing input or '±' (resolving adder/subtractor, which is able to switch between addition and subtraction 237). The left most adders and subtractors in the common block 232 of the two m-bit input words is the m-bit partial resulting parallel with the m-bit or (m-1) bit word containing the carry bits of the addition/subtraction. In other words, the first additions and subtractions in the common block CBLK 232 are preferably unresolved, meaning that the addition of the carry bits is delayed until a subsequent processing stage. The advantage of this step is that such carry-save adder/subtractors since they do not need to perform the final addition of the carry-bit word to the result. Resolving adders may, however, also be used in order to reduce the bus width at the outputs of the adders.

FIG 10 also illustrates the use of one and two input latches in the preferred embodiment of the present invention. In FIG 10, latches are illustrated as rectangles 238 and are used in both the pre-common block PREC 231 and the post-common block POSTC 233. Single-input latches are used at the inputs of the multipliers D1, D3, D5 and D7, as well as to latch the inputs to the resolving adders/subtractors which are the computed g(k) and h(k) values corresponding to the respective outputs from latches g[0,7], g[1,6], g[3,4] and g[2,5] and h[0,7], h[1,6], h[3,4] and h[2,5]. As such, the resolving adders/ subtractors perform the addition or subtraction indicated in expressions E16 and E17 above.

As described previously, the even-numbered inputs Y0, Y2, Y4 and Y6 do not need to be paired before being processed in the common block CBLK 232. However, not only do the odd-numbered inputs require such pairing, but the input Y12 must also be multiplied by the square root of two in order to ensure that proper input values are presented to the common block CBLK 232. The precommon block PREC 231, therefore, includes a 2-input multiplexing ('mux') latch C10, C54, C32 and C76 for each input value. One input to the 2-input mux latch is consequently tied directly to the unprocessed input values, whereas the other input is received from the resolving adders and, for the input Y1, the resolving square root of two multiplier. The correct paired or unpaired inputs can, therefore, be easily presented to the common block CBLK 232 easily by simple switching of the multiplexing latches between their two inputs.

As FIG 10 illustrates, the square root of two multipliers D1, D3, D5, D7 preferably resolve their outputs, that is, they generate results in which the carry bits have been added in to generate a complete sum. This ensures that the outputs from the multipliers have the same bus width as the un-multiplied inputs in the corresponding parallel data paths.

The preferred embodiment of the common block 232, in accordance with the present invention, also includes one 'dummy' subtractor 240 in the forward data path for Y[1,0] and Y[5,4], respectively. These devices act to combine the two inputs (in the case of the dummy subtractor, after 2's-complementing the one input) in such a way that they are passed as parallel outputs. In each case, the one input is manipulated as if it contained carry bits, which are added on in the subsequent processing stage. The corresponding addition and subtraction is, thus, performed, although it is delayed.

This technique reduces the resources required in the upper two data paths since a full-scale adder/subtractor need not be implemented for these devices. Therefore, the 'combiners' act as adders and subtractors and can be implemented for these devices and can be implemented either as simple conductors to the next device (for addition), or as a row of inverters (for subtraction), either of which requires little or no additional circuitry.

The use of such combiners also means that the outputs from the initial adders and subtractors in the common block CBLK 232 will all have the same width and will be compatible with the outputs of the carry-save adder/subtractor found in the bottom two data paths, with which they form inputs to the subsequent resolving adders and subtractors in the common block CBLK.

As described previously, the even-numbered inputs are processed separately from the odd-numbered inputs in this preferred embodiment of the present invention. Assume, further, that the odd-numbered inputs are to be processed first. Supervisory control circuitry (not shown in FIG 10) applies the odd-numbered input words to the pre-common block PREC, and selects the lower inputs (viewed as in FIG 10) of the multiplexing latches C10, C54, C32, C76 which then stores the paired values p0 to p3 (see FIG 9 and the definition of p(n) above). The latches 1h0, 1h1, 1h3 and 1h2 are then activated to latch the values H0, H1, H3 and H2, respectively.

The supervisory control circuitry latches and then selects the upper inputs of the two-input multiplexing latches C10, C54, C32 and C76 in the precommon block PREC 231 and applies the even numbered input words to these latches. Since the even-numbered inputs are used to form the values of g0 to g3, the supervisory control circuitry also opens the latches Lg0 to Lg3 in the post-common block POSTC 233, to store the g(k) values.

Once the g(k) and h(k) values are latched, the post-common block POSTC 233 outputs the high-order signals X7, X6, X5 and X4 by switching the resolving adder subtractors to the subtraction mode. The low order output signals X3, X2, X1 and X0 are then generated by switching the resolving adders/subtractors to the addition mode. Note that the output data can be presented in an arbitrary order, including natural order.

The preferred multiplexed implementation, in accordance with the present invention, is illustrated in greatly simplified, schematic form in FIG 10, performs the same calculations as the non-multiplexed structure illustrated in FIG 9. The number of adders, subtractors and multipliers in the common block CBLK 232 is, however, cut in half and the use of dummy adder/subtractors 240 further reduces the complexity of the costly arithmetic circuitry.

FIG 11 illustrates the main components and data lines of an actual implementation of the IDCT circuit according to the embodiment of the present invention. The main components include the precommon block circuit PREC 231, the common block circuit CBLK 232, and the post-common block POSTC 233. The system also includes a controller CNTL 241 that either directly or indirectly applies input, timing and control signals to the precommon block PREC 231 and post-common block POSTC 233.

In the preferred embodiment of the present invention, the input and output signals (Y0 to Y7 and X0 to X7, respectively) are 22 bits wide. Tests have indicated that this is the minimum width that is possible which still yields acceptable accuracy as measured by existing industry standards. As is explained in greater detail below, this minimum width in achieved in part by deliberately forcing certain carry words in selected arithmetic devices to be either a '1' or a '0'. This bit manipulation, corresponding to an adjustment of certain data words, is carried out as the result of a statistical analysis of the results of the IDCT system, in accordance with the present invention, to the after using the IDCT transformation of known input test data. By forcing certain bits to predetermined values, it was discovered that the effects of rounding and truncation errors could be reduced, so that the spatial output data from the IDCT system could be made to deviate less from the known 'correct' spatial data. The present invention is equally applicable, however, to other data word lengths since the components used in the circuit according to the present embodiment can all be adapted to different bus widths using known methods.

Although all four inputs that are processed together could be input simultaneously to the pre-common block PREC along 88 parallel conductors (4 x 22), pixel words are typically converted one at a time from the transmission data. According to the present embodiment, input data words are, therefore, preferably all conveyed serially over a single 22 bit input bus and each input word is sequentially latched at the proper input point in the data path. As shown in FIG 11, the 22 bit input data bus is labelled T_IN[21:0] 242.

In the Figures and in the discussion below, the widths of multiple-bit signals are indicated in brackets with the high-order bit to the left of a colon':' and the least significant bit (LSB) to the right of the colon. For example, the input signal T IN[21:0] 242 is 22 bits wide, with the bits being numbered from 0 to 21. A single bit is identified as a single number within square brackets, thus, T_IN[1] indicates the next to least significant bit of the signal T_IN.

The following control signals are used to control the operation of the precommon block PREC 231 in the preferred embodiment of the present invention.

IN_CLK, OUT_CLK: The system, in accordance with the present invention, preferably uses a non-overlapping two phase clock. The signals IN_CLK and OUT_CLK are accordingly columns of latches that hold the values of input, intermediate, and output signals.

LATCH10, LATCH54, LATCH32, LATCH76: Preferably, one 22-bit word is input to the system at a time. On the other hand, four input signals are processed at a time. Each input signal must, therefore, be latched at its appropriate place in the architecture before being processed with three other input words. These latch signals are used to enable the respective input latches. The signal LATCH54, for example, is first used to latch input signal Y5 and later to latch input signal Y4, which enters the pre-common block PREC 231 at the same point as the input signal Y5 (see FIG 10) but during a subsequent processing stage.

LATCH: Once the four even or odd-numbered input signals are latched into the pre-common block PREC 231, they are preferably shifted at the same time to a subsequent column of latches. The signal LATCH is used to enable a second column of input latches that hold the four input values to be operated on by the arithmetic devices in the pre-common block PREC 231.

SEL_BYP SEL_P: As FIG 10 illustrates, the even-numbered input signals that are latched into the latches C10, C54, C32 and C76 should be those that bypass the adders and the square root of two resolving multiplier. The odd-numbered input signals, however, must first be paired to form the paired inputs p(n), and the signal Y1 must be multiplied by the square root of two. The control signal SEL_P is activated in order to select the paired input signals. Hence, these signals are used to control gates that act as multiplexers to let the correct signals pass to the output latches of the precommon block PREC 231.

As discussed previously, not having to arrange the inputs in strictly ascending order leads to a simplified 'butterfly' bus structure with high interconnection efficiency. As also described, the odd inputs are preferably applied as a group to the pre-common block first, followed by the even-numbered inputs, but any order may be used within each odd or even group, i.e., any order of inputs may be used, however, suitable latch arrangements as separately provided to process the odd-numbered inputs, or at least are provided in separate regions of the circuit.

The supervisory control circuitry also generates timing and control signals for the post-common block POSTC 233. These control signals are as follows: EN_BH, EN_GH: Referring again to FIG 9, the outputs from the common block CBLK 232, after processing of the odd-numbered inputs, are shown as H0, H1, H3, and H2. These signals are then sent to the coefficient multipliers, d1, d3, d7, d5, respectively, in the first post common block POSTC 1 233. The signal EN_BH is used to enable latches that hold the g0 to g3 values, as well as to enable the latches that hold the h0 to h3 values after they have been multiplied in the coefficient multipliers.

ADD, SUB: As FIG 10 illustrates, the embodiment includes a bank of resolving adders/subtractors that sum and difference(k) and h(k) values in order to form the low-order outputs, respectively. The signals ADD, SUB are used to set the resolving adders/subtractors in the addition and subtraction modes, respectively.

EN_O: This signal is used to enable output latches that latch the results from the resolving adders/subtractors.

MUX_OUT70, MUX_OUT61, MUX_OUT43, MUX_OUT52: In accordance with the present invention, the output data from the system is preferably transmitted over a single 22-bit output bus, so that only one output value (X0 to X7) is transferred at a time. These signals are activated sequentially to select which of the four latched output values is to be latched into a final output latch. Accordingly, these signals thus act as the control signals for a 4-to-1 multiplexer.

T_OUT[21:0]: This label indicates the 22-bit output signal from the post-common block POSTC 233.

The output signals from the pre-common block PREC 231 are latched to form the input signals to the common block CBLK 232. As shown in FIG 11, the output signals from the pre-common block PREC 231 are presented as the four 22-bit data words CI10[21:0], CI54[21:0], CI32[21:0], CI76[21:0], which become the input signals IN[0], IN[1], IN[3], IN[2], respectively, to the common block CBLK 232.

As FIG 11 shows, the four 22-bit results from the common block CBLK 232 are transferred in parallel as output signals OUT0[21:0], OUT1[21:0], OUT3[21:0], OUT2[21:0], which are then latched as the input signals of the post-common block POSTC 233 as CO70[20:1], CO61[21:0], CO43[21:0], CO52[21:0].

One should take particular note that no control signals are required for the common block CBLK. Because of the unique structure of the IDCT system in this example, the common block of the system's operations can be performed as pure logic operations, with no need for clock, timing or control signals. This further reduces the complexity of the device. One should also note that in certain applications (particularly those in which there is plenty of time to perform all needed arithmetic operations) the pre-common and post-common blocks PREC 231, POSTC 233 may also be arranged to operate without clock timing or control signals.

FIG 12 is a block diagram of the pre-common block PREC 231 of the present invention. In this and following Figures, the notation 'S1[a], S2[b],...,SM[Z]', where S is an arbitrary signal label and a,b,..., z are integers within the range of the signal's bus width, indicates that the selected bits a, b, ..., z from the signals S1, S2, ..., SM are transferred in parallel over the same bus, with the most significant bits (MSBs) being the selected bits 'a' of the signal S1, and the least significant bits (LSBs) being the selected 'z' of signal SM. The selected bits do not have to be individual bits, but rather, entire or partial multi-bit words may also be transmitted along with other single bits or complete or partial multi-bit words. In the Figures, the symbol S will be replaced by the corresponding signal label.

For example, in FIG 12, a square root of two multiplier is shown as R2MUL. The 'save'; or 'unresolved sum' output from this non-resolving multiplier is indicated as the 21-bit word M5S[20:0], similarly, the 'carry' output from the multiplier R2MUL is shown as the 22-bit word M5C[20:0], which is transferred over the bus to the 'b' input of a carry-save resolving adder M5A. (Recall that a '0' is inserted as an MSB to the least significant 21 bits of the save output, however, this is accomplished before being applied to the 'a' input of the resolving adder M5A. This is indicated in FIG 12 by the notation GND.M5S[20:0]). In other words the conductor corresponding to the MSB input to the adder M5A is forced to be a '0' by tying it to ground GND.

In order to understand why a '0' is inserted as the 22'nd bit of the 'sum', observe that if the partial sum of a multiplication is n places wide, the carry word is shifted one place to the left relative to the partial sum. The carry word, therefore, extends to n + 1 places with a valid data bit in the n + 1'th position with an '0' in the least significant position (since there is nothing before this position to produce a carry bit into the units position). If these two words are used as inputs to a resolving binary adder, care must be taken to ensure that the bits (digits) of the carry word are properly aligned with the corresponding bits of the partial sum. This also ensures that the decimal point (even if only implied, as in integer arithmetic) is kept 'aligned' in both words. Assuming the inputs to the adder are n + 1 bits wide, a '0' can then be inserted into the highest-order bit of all n-bit positive partial sum words to provide an n+ 1 bit input that is aligned with the carry word at the other input.

As is described above previously, the four inputs that are processed at a given time in the pre-common block PREC 231 are transferred over the input bus T-IN(21:0). This input bus is connected to the inputs of four input latches IN10L, IN54L, IN32L, AND IN76L. Each respective latch is enabled only when the input clock signal IN_CLK and the corresponding latch selection signal LATCH10, LATCH54, LATCH32, LATCH76 are high. The four inputs can, therefore, be latched into their respective input latches in four periods of the IN_CLK signal by sequential activation of the latch enabling signals LATCH10, LATCH54, LATCH32, and LATCH76. During this time, the LATCH signal should be low (or on a different phase) to enable the input latches IN10L, IN54L, IN32L, and IN76L to stabilize and latch the four input values.

An example of the timing of the latches, in accordance with the present invention, is illustrated in FIG 13. Once the four input signals are latched in the preferred order, they are passed to a second bank of latches L10L, L54L, L32L, L76L. These second bank of latches are enabled when the signals OUT_CLK and LATCH are high. This signal timing is also illustrated in FIG 13.

Note that the system of the present invention does not have to delay receipt of all eight input words. Once all the even or odd input words are received and latched in IN10L, IN54L, IN32L and L76L, this frees the In latches, which can then begin to receive the other four input signals without delay at the next rising edge of IN_CLK.

The 2-digit suffix notation [10, 54, 32, 76] used for the various components illustrated in the Figures indicates that odd-numbered signals are processed first followed by the even-numbered signals on a subsequent pass through the structure. As is mentioned above, this order is not required by the present invention, and it will be appreciated by one of ordinary skill in the art that additional orders may be used.

Once the four input signals are latched in proper order in the second set of latches L10L, L54L, L32L, L76L, the corresponding values are either passed as inputs to output latches C10L, C54L, C32L and C76L on activation of the selected bypass signal SEL_BYP, or they are passed as paired and multiplied inputs to the same output latches upon activation of the 'select p' signal SEL_P. In other words, all signals are passed, both directly and indirectly, via arithmetic devices, to the output latches C10L, C54L, C32L, C76L of the pre-common block PREC 231. The proper values, however, are loaded into these latches by activation of the 'select bypass' signal SEL_BYP (for even-numbered inputs Y0, Y2, Y4, and Y6) or the "select p" signal SEL-P (for the odd-numbered inputs Y1, Y3, Y5 and Y7). As will be appreciated by one of ordinary skill in the art, the desired timing and order of these and other control signals is easily accomplished in a known manner by proper configuration and/or [micro-] programming of the controller CNTL 241.

The uppermost input value at the output of latch L10L is passed first to the square root of two-multiplier R2MUL and then to the resolving adder M5A as indicated. The output from the resolving adder M5A is shown as an equivalent of the resolved multiplication of the output from the latch L10L by the square root of two. The outputs from the other three latches L54L, L32L, L76L are also transferred to corresponding output latches C54L, C32L and C76L, respectively, both directly via 22-bit latch buses LCH54[21:0], LCH32[21:0] LCH76[21:0] and indirectly to the output latches via resolving adders P2A, P1A and P3A, respectively.

In the present invention, each resolving adder P2A, P1A, P3A has two inputs "a" and "b". For adder, P2A, the one input is received from the latch L32L, and the other input is received from the latch L54L. For input values Y5 (latched in L54L) and Y3 (latched in L32L), the output from the adder P2A will, therefore, be equal to Y5 + Y3, which, as is shown above, is equal to p(2). Hence, the adders "pair" the odd-numbered inputs to form the paired input values p(1), p(2) and p(3). Of course, the even-numbered input signals latched in L54L, L32L, and L76L will also pass through the resolving adders P2A, P1A and P3A, respectively, however, the resulting p "values" will not be passed to the output latches C54L, C32L and C76L because the "select p" signal SEL_P will not be activated for even-numbered inputs.

The values that are latched in the output latches C10L, C54L, C32L and C76L upon activation of the input clock signal IN_CLK will therefore be equal to either the even-numbered inputs Y0, Y2, Y4, Y6 or the paired input values P0, P1, P2, P3 for the odd-numbered inputs. One should recall that the input Y(1) is "paired" with the value U(-1), which is assumed to be zero. As illustrated in FIG 12, this assumption is implemented by not adding anything to the value Y1. Instead, Y1 is only multiplied by the square root of two as is shown in FIGS. 9 and 10.

FIG 14 illustrates the preferred architecture of the common block CBLK 232, in accordance with the present invention. Because of the various multiplications and additions in the different system blocks, it is necessary or advantageous to scale down the input values to the common block before performing the various calculations. This ensures a uniform position for the decimal point (which is implied for integer arithmetic) for corresponding inputs to the various arithmetic devices in the system.

Accordingly, the input values IN0[21:0] AND IN1[21:0] are accordingly scaled down by a factor of four, which corresponds in digital arithmetic to a right shift of two bits. In order to preserve the sign of the number (keep positive values positive and negative values negative) in binary representation, the most significant bit (MSB) must then be replicated in the two most significant bits of the resulting right-shifted word; this process is known as "sign extension". Hence, the input value IN0 is downshifted by two bits with sign extension to form the shifted input value indicated as IN[21], IN0[21], IN0[21:2]. The input value IN1[21:0] is similarly sign-extended two places. The input IN2 is also shifted and extended to form IN2[21], IN2[21:1]. These one-position shifts correspond to truncated division by a factor of two.

As shown in FIG 10, the input IN2, IN3 are those which must be multiplied by the scaled coefficients c1s and c3s. Each input IN3 and IN2 must be multiplied by each of the scaled coefficients. As FIG 14 illustrates, this is implemented by the four constant-coefficient carry-save multipliers MULC 1S, MULNC1S, MULC3S3, and MULC2S2. One should note that the bottom multiplier for IN2 is an inverting multiplier MULCIS, that is, its output corresponds to the negative of the value of the input multiplied by the constant C1S. Therefore, the value latched in C76 is subtracted from the value latched in C32 (after multiplication by C3S). By providing the inverting multiplier MULNC1S, subtraction is implemented by adding the negative of the corresponding value, which is equivalent to forming a difference. This allows the use of identical circuitry for the subsequent adders, while allowing a non-inverting multiplier may be used with a following subtractor.

In the illustrated embodiment of the present invention, four cosine coefficient multipliers MULC1S, MULNC1S, MULC2S3, and MULC3S2 are included. If arrangements are made for signals to pass separately through the multipliers, however, the necessary multiplications can be implemented using only two multipliers, one for the c1s coefficient and one for the c3s coefficient.

In accordance with the present invention, the multipliers for MULC1S, MULNC1S, MUL3S3 and MULC3S2 are preferably of the carry-save type, which means that they produce two output words, one corresponding to the result of the various rows of additions performed within a hardware multiplier, and another corresponding to the carry bits generated. The outputs from the multipliers are then connected as inputs to either of two 4-input resolving adders BT2, BT3.

For ease of illustration only, five of the output buses from the multipliers are not drawn connected to the corresponding input buses of the adders, as will be appreciated by one of ordinary skill in the art, these connections are to be understood, and are illustrated by each respective output and input having the same label. Hence, the save output M1S[20:0] of the multiplier MULC1S is connected to the lower 21 bits of the "save-a" of the adder BT3.

As shown in FIG 14, five of the inputs to the adders BT2 and BT3 are shown as being "split". For example, the "ca" input of the adder BT2 is shown as having IN3[21] over M3C[20:0] being input as the least significant 21 bits. Similarly, the "sa" (the "save-a" input) of the same adder is shown as being GND, GND over M3S[19:0]. This means that two zeros are appended as the two most significant bits of this input word. Such appended bits ensure that the proper 22-bit wide input words are formed with the proper sign.

The carry-save adders BT2 and BT3 add the carry and save words of two different 22-bit inputs to form a 22-bit output save word T3S[21:0] and a 21-bit output carry word T3C[21:1]. Accordingly, the input to each adder is thus 88 bits wide and the output from each adder is 43 bits wide. As FIG 10 illustrates, the output from the latch C10 is combined with the output from the latch C54 in the upper-most data path before addition with the output from the carry-save adder BT3. The "combination" is not, however, necessary until reaching the following adder in the upper data path. Consequently, as FIG 14 shows, the shifted and sign-extended input value IN0 is connected to the upper carry input.

The upper carry input of adder CS0 is connected to the shifted and sign-extended input value IN0, and the shifted and sign-extended input IN1 is connected as the upper save input of the same adder. In other words, IN0 and IN1 are added later in the adder CS0.

The designation "dummy" adder/subtractor 240 used in FIG. 10, therefore, indicates which operation must be performed, although it does not necessarily have to be performed at the point indicated in FIG. 10. Similarly, the lower dummy subtractor 240 shown in FIG. 10 requires that the output from latch C54 be subtracted from the output from latch C10. This is the same as adding the output from C10 to the complement of the output of C54.

Referring once again to FIG. 14, the complement of the input IN1 (corresponding to the output of latch C54 in FIG 10) is performed by a 22-bit input inverter IN1[21:0] (which generates the logical inverse of each bit of its input, bit-for-bit). The complement of IN1 value-NIN1[21:0]--is passed to the upper "save" input of the adder CS1, with the corresponding upper "carry" input being the shifted and sign-extended IN0. The upper portion of the adder CS1, therefore, performs the subtraction corresponding to IN0 minus IN1.

In the lower two data paths shown in FIG. 10, resolving subtractors are used instead of the resolving adders shown in the upper two data paths at the output of the common block CBLK 232. Each resolving adder or subtractor is equivalent to a carry-save adder or subtractor followed by a resolving adder. This is shown in FIG. 14. Subtractors CS2 and CS3 have as their inputs the processed values of IN0 to IN3 according to the connection structure shown in FIG. 10.

The 22-bit carry and save outputs from each of the adders/subtractors C20-CS3 are resolved in the resolving adders RES0-RES3. As will be appreciated by one of ordinary skill in the art, resolution of carry and save outputs is well understood in the art of digital design and is, therefore, not described in greater detail here. As FIG. 14 illustrates, the save outputs the carry-save adders/subtractors CS0-CS3 are passed directly as 22-bit inputs to the "a"-input of the corresponding resolving adders RES0-RES3

As is also well known in the art, the 2's-complement of a binary number is formed by inverting each of its bits (changing all "1's" to "0's" and vice versa) and then adding "1". Note that the "1" can be added immediately after the bit inversion, or later. The LSB of a carry word will always be a "0" which is implemented in the illustrated embodiment of the present invention by tying the LSB of the carry words O0C and 01C to ground GND as they are input to the resolving adders RES0 and RES1, respectively. The addition of "1" to the carry outputs of the subtractors CS2 and CS3 to form 2'S-complemented values, however, is implemented by tying the LSB of these data words O2C and O3C to supply voltage VDD, thus "replacing" the "0" LSB of the carry word by a "1", which is equivalent to addition by "1".

For the reasons provided above, a "0" is appended as the LSB to the 21-bit carry words from the carry-save adders Cs0 and CS1 (by tying the LSB to ground GND) and the LSB of the carry words from the carry-save subtractors CS2 and CS3 is set equal to "one" by tying the corresponding data line to the supply voltage VDD. The resolving adders RES0-RES3, therefore, resolve the outputs from the adder/subtractors CS0-CS3 to form the 22-bit output signals OUT0[21:0] - OUT3[21:0].

Two advantages of the IDCT circuitry according to the embodiment of the present invention can be seen in FIG 14. First, no control or timing signals are required for the common block CBLK 232. Rather, the input signals to the common block are already processed in such a way they can be applied immediately to the pure-logic arithmetic devise in the common block 232. Second, by proper scaling of the data words, integer arithmetic can be used throughout (or, at least, decimal point for all values will be fixed). This avoids the complexity and slowness of floating-point devices, with no unacceptable sacrifice of precision.

Yet another advantage of the embodiment of the present invention is that, by ordering the inputs as shown, and by using the balanced decimated method in accordance with the present invention, similar design structures can be used at several points in the silicon implementation. For example, as shown in FIG. 14, the constant coefficient multipliers MULC1S, MULC3S3, MULC3S2 and MULNC1S all have similar structures and receive data at the same point in the data path, so that all four multipliers can be working at the same time. This eliminates "bottlenecks" and the semiconductor implementation is, therefore, able to take full advantage of the duplicative, parallel structure. The carry-save adders BT2 and BT3 similarly will be able to work simultaneously, as will the following carry-save adders and subtractors. This symmetry of design and efficient simultaneous utilization of several devices is common throughout the structure according to the embodiment of the present invention.

FIG 15 shows the preferred arrangement of the post-common block POSTC 233 in accordance with the present invention. As FIG. 10 shows, the primary functions of the post-common POSTC 233 are to form the h0 to h3 values by multiplying the outputs of the common block by the coefficients d1, d3, d5 and d7; to add the g(k) and h(k) values to form the low order outputs; and to subtract the h(k) values from the corresponding g(k) values to form the high-order outputs. Referring now to both FIG. 10 and FIG. 15, the post-common block POSTC 233 latches the corresponding outputs from the common block CBLK 232 into latches BH0L, BH1L, BH3L and BH2L when the Bh latches are enabled, the control circuitry sets the EN_BH signal high, and the output clock signal OUTC_CLK signal goes high. The g(k), g0 to g3 values are latched into corresponding latches G0L, G1L, G3L and G2L when the control circuitry enables these latches via the signal EN_GH and input clock signal IN_CLK goes high.

The processed odd-numbered inputs, that is, the values h0 to h3, are latched into latches H0L, H1L, H3L and H2L when the EN_GH and IN_CLK signals are high, via the constant coefficient multipliers D1MUL, D3MUL, D5MUL and D7MUL. These multipliers multiply, respectively by d1, d3, d5 and d7. In the preferred embodiment, these constant-coefficient multipliers are preferably carry-save multipliers in order to simplify the design and to increase calculation speed. As FIG 15 illustrates, the "carry" ("c") outputs from the constant coefficient multipliers are connected, with certain changes described below, to the a inputs of resolving adders H0A, H1A, H3A and H2A. The "save" ("s") outputs from the coefficient multipliers are similarly, with certain forced changes described below, connected to other input of the corresponding resolving adder.

As FIG 15 further illustrates, the LSB of the H0 signal is preferably forced to be a "1" by tying the corresponding "save" output for H0 is set to 0 (tied to ground GND), and the second bit (corresponding to H0S[1]) is set to "1". The data words from the carry and save outputs of the constant-coefficient multiplier D3MUL are similarly manipulated an input to the resolving adder H1A. The advantage of these manipulations and their input to the resolving adder H1A.

In accordance with the present invention, all 22-bits of the carry output from the coefficient multipliers D7MUL and D5MUL are connected directly to the "a" input of corresponding resolving adders H3A and H2A. The MSB of each multiplier's "save" output, however, is forced to "0" by tying the corresponding data line to ground GND.

The IDCT system described was tested against the CCITT specification described above. Because of the scaling and other well-known properties of digital adders and multipliers, some precision is typically lost in the 10,000 sample, but run that forcing the various bits described above to either "0" or "1" reduced the expected error of the digital transformation. As a result of the bit manipulation of the data words, the embodiment of the present invention achieved acceptable accuracy under the CCITT standard using only 22-bit wide data words, whereas 24 bits would normally be required to produce equivalent accuracy.

Because of limited precision, and truncation and rounding errors, there is typically some inaccuracy in every data word in an IDCT system. However, forcing selected bits of a data word it was discovered that the error thereby systematically introduced into a particular data word at a particular point in the hardware yielded statistically better overall results. Bit-forcing may also be applied "within" a multiplication, for example, by selectively forcing one or more carry bits to predetermined values.

In the present invention, the bit-forcing scheme need not be static, with certain bits always forced to take specified values, but rather a dynamic scheme may also be used. For example, selected bits of a data word may be forced to "1" or "0" depending on whether the word (or even some other data) is even or odd, positive or negative, or above or below a predetermined threshold, and the like.

Normally, only small systematic changes will be needed to improve overall statistical performance. Consequently, according to this embodiment of the present invention, the LSB's of selected data words (preferably one bit and one data word at a time, although this is not necessary) are forced to be a "1" or a "0". The CCITT test is run, and the CCITT statistics for the run are compiled. The bit is then forced to the other of "1" or "0", and the test is rerun. Then the LSB (or LSBs) of other data words are forced to "1" or "0", and similar statistics are compiled. By examining the statistics for various combinations of forced bits in various forced words, a best statistical performance can be determined.

If this statistically based improvement is not required, however, the outputs from the constant-coefficient multipliers D1MUL, D3MUL, D5MUL and D7MUL may be resolved in the conventional manner in the resolving adders H0A-H3A. The lower 21-bits of the input of the corresponding latches H0L-H3L, with the LSB of these inputs tied to ground.

The outputs from the H-latches (H0L-H3L) and the G-latches (G0L-G3L) pairwise form the respective a and b inputs to resolving adder-subtractors S70A, S61A, S43A and S52A. As was indicated above, these devise add their inputs when the ADD signal is high, and subtract the "b" input from the "a" input when the subtraction enable signal SUB is high. The second bits of the upper two latch pairs H0L, G0L,H1L and G1L are manipulated by multiplexing arrangements in a manner described below.

The outputs from the resolving adder-subtractors S70A, S61A, S43A and S52A are latched into result latched R70L, R61L, R43L, R52L.

As depicted in FIG 15b, the input words to the adder/subtractor S70A and dS61A, in accordance with the present invention, have the second bits of each input word manipulated. For example, the second bit of the input word to the "a"-input of the adder subtractor S70A is G0[1M], G0[1M], G0[0]. In other words, the second bit is set to have the value G01M. The second bits of the other inputs to the adder/subtractors S70A and S61A are similarly manipulated. This bit manipulation is accomplished by four 2:1-bit multiplexers H01MUX, G01MUX, H11MUX and G11MUX (shown to the right in FIG 15b). In the present invention, these multiplexers are controlled by the ADD and SUB signals such that the second bit (H01M, G01M, H11M, and G11M) is set to one if the respective adder subtractor S70A, S61A is set to (ADD is high), and the second bit is set to its actual latch output value if the SUB signal is set too high. Setting of individual bits in this manner is an easily implemented high-speed operation. The preferred embodiment, therefore, includes this bit-forcing arrangement since, as is described above, statistical analysis of a large number of tests pixel words has indicated that more accurate results are thereby obtained. It is not necessary, however, to manipulate the second bits in this manner, although it gives the advantage of smaller word width.

The four high or low-order results are latched in the output latches R70L, R61L, R43L and R52L. The results are sequentially latched into the final output latched OUTF under the control of the multiplexing signals MUX_OUT70, MUX_OUT61, MUX_OUT43, MUX_OUT52. Hence, the order in which resulting signals are output can therefore be controlled simply by changing the sequence with which they are latched into the latch.

The relationship between the clock and control signals in the post-common block POSTC 233 is shown in FIGS. 13b and 13c.

As was discussed previously, two 1-dimensional IDCT operations may be performed in series, with an intervening transposition of data, in order to perform a 2-D IDCT. The output signals from the post-common block POSTC 233, are therefore, according to this embodiment of the present invention, first sorted in a known manner column-wise (or row-wise) in a conventional storage unit, such as a RAM memory circuit (not shown), and are then read from the storage unit row-wise (column-wise) so as to be passed as inputs to a subsequent pre-common block and for processing as described above in this block, and in a common block CBLK 232, and a post-common block POSTC 233.

Storing by row (column) and reading out by column (row) performs the required operation of transposing the data before the second 1-D IDCT. The output from the second POSTC 233 will be the desire, 2-D IDCT results and can be scaled in a conventional manner by shifting to offset the scaling shifts carried out in the various processing blocks. In particular, a right shift by one position will perform the division by 2 necessary to offset the two square root of two multiplications performed in the 1-D IDCT operations.

Depending on the applications, this second IDCT structure (which is preferably identical to that shown FIG 11) is preferably a separate semiconductor implementation. This avoids the decrease in speed that would arise if the same circuits were used for both transforms, although separate 1-D transform implementations are not necessary if the pixel-clock rate is now sufficient such that a single implementation of the circuit will be able to handle two passes in real time.

As shown in FIGS 16 through 38, a second preferred embodiment, in accordance with the present invention, uses a single one-dimensional transform. This embodiment does not require a lowering of the pixel-clock rate as discussed previously.

The existing "resolving-adders" in the first preferred embodiment have been changed to "fast-resolving-adders". As seen in FIG 38, these have been titled, "Fast Resolving Adders". This change has the effect of allowing more time for each datapath arithmetic block to act on its data inputs. The existing "latches" in the first preferred embodiment have been changed to 2-phase "flip-flops" or "registers".

The latching memory elements located on the front and end of the existing 1D IDCT datapath pipelines have been combined into single blocks, as shown particularly in particular in FIG 18. Additionally, the amount of memory elements present at the input and the output of the second preferred embodiment has been increased to allow variable amounts of T2 data to be buffered.

As shown in FIGS. 16 and 17, the two data streams, stream "T1" (raw unoperated upon data) and stream "T2" (data which has been through the ID IDCT once and has been transposed in the TRAM), are introduced into the datapath pipeline in a time multiplexed fashion.

In the present invention, each stream takes its turn to introduce a group of data items into the datapath pipeline. The data streams are "interleaved" as they pass sequentially down the datapath pipeline and are "de-interleaved" at the datapath output, as shown in FIGs. 17, 18 and 33. A group can vary in number, but in this example, they are eight bits.

In accordance with the present invention, T1 must not be stalled. If T2 arrives at the point of interleaving with T1, but the input buffer should not introduce its data into the pipeline because this would clash with the T1 stream, then stream T2 provides an extra buffering so that T2 does not stall the data stream, but instead will buffer up data from its input stream until such a time as it may safely interleave with stream T1. This is shown in FIGs. 19 and 33 where the data from stream T1 is being loaded into the first transform in latches 0-7, using signals, "Latch 1(0) 'through' Latch 1(7)". Additionally, data from T2 is being loaded in "Latch 2(0) 'through' Latch 2(15)", as shown in FIG. 19, using signals shown in FIG. 33.

The interleaving is controlled by "T1 OK2 insert" and "T2 OK2 insert" signals. Under normal operation, the interleaving will occur when the signals go high. However, if the appropriate amount of data in the latch for T2 has not yet been reached when "T2 OK insert" goes high, then the latch will miss its opportunity and must continue buffering data until the next opportunity to insert data occurs.

In summary, if the above described buffering, in accordance with the present invention, is to occur, comparable "slippage" has to occur at the output of T2. T2 slips when it misses its data insertion point and has to continue buffering in the latches shown in FIG. 19. If T2 slipped and did not introduce data into the pipeline there will be a corresponding gap in the T2 stream output at the datapath output. This gap may be removed or "swallowed up" by use of the extra buffering at the T2 output. This process may be thought of as having a "fixed" T1 - 1D IDCT transform with a variable T2 - 1D IDCT, where the data streams are interleaved in a time multiplex fashion such that they may use the same piece of arithmetic datapath pipeline.

In the present invention, "Recovery" takes place when non-data enters T1. It is an opportunity for the T2 buffer to catch up to T1 and the datastream. Non-data is a data type that bypasses the IDCT and is shown as a data spike in "Latch 2 [ φ ]" of FIG. 34. This eventually makes its way to T2 input, which allows the T2 buffering to fill up at the output. Recovery is shown in FIG. 33 and FIG. 25 when the "T2 dout" signal and the "out" signal are gapped by a number of cycles. The gap is used as a reference to fix the data stream. It should be noted that the gap in cycles between these two signals is the same as the gap of buffering when the latch for T2 was waiting to insert its data.

Following the TRANSFORM in POSTC 233 part B, the interleaved stream is de-interleaved into "T2 out", as shown in FIGs. 18 and 23. The "T2 out" data stream has slip gaps in the data as described above. The T2 out [143: φ], shown in FIG. 17, enters a 16 to 1 multiplexor block, shown as block "IDDPMUX" in FIG. 17. This multiplexor block will select data from one of 16 positions in the output buffer block, as shown in FIG. 25. This position is selected by the control logic, shown in FIG. 29, which uses the gap by which T2 "buffered-up" at its input. This gap is used as a reference. The output stream, T2DOUT, from the multiplexer block is the "fixed" data stream.

In range tests carried out on an embodiment of the present invention for the IDCT arrangement described above, it was found that all intermediate and final values were kept well within a known range at each point while still meeting the CCITT standards. Because of this, it was possible to "adjust" selected values as described above by small amounts (for example, by forcing certain bits of selected data words to desired values) without any fear of overflow or underflow in the arithmetic calculations.

The method and system, in accordance with the present invention, can be varied in numerous ways. For example, the structures used to resolve additions or multiplications may be altered using any known technology. Thus, it is possible to use resolving adders of subtractors where the preferred embodiment uses carry-save devices with separate resolving adders. Also, the preferred embodiment of the present invention uses down-scaling at various points to ensure that all values remain within their acceptable ranges. Down-scaling is not necessary, however, because other precautions may be taken to avoid overflow or underflow.

In one embodiment of the present invention, certain bits of various data words were manipulated to reduce the required word width within the system. However, the various intermediate values may, of course, be passed without bit manipulation. Furthermore, although only data words were bit-manipulated in the illustrated example of the present invention, it is also possible to manipulate the bits of constant coefficients as well and evaluate the results under the CCITT standard. If a comparison of the results showed that it would be advantageous to force a particular bit to a given value, in some cases, on might then be able to increase the number of "zeros" in the binary representation of these coefficients in order to decrease further the silicon area required to implement the corresponding multiplier. Once again, bit manipulation is not necessary.

In summary of the above aspects of the present invention, the following is disclosed: an apparatus for transforming data having a first latch defining a first data stream source and a second latch defining a second data stream source. The first and second latches are in communication with a single arithmetic unit. The arithmetic unit communicates data to a transpose RAM, the transpose RAM transposes the data and communicates it to the second latch. The second latch is adjustable and can be varied in size to accommodate variable rates of data being received and transmitted. The second latch and first latch communicate 1st and 2nd data stream to the arithmetic unit sequentially, however, the sequential communication of the second latch does not interrupt the communication from the first latch. In this manner, common arithmetic unit is used for a first and second data stream. Furthermore, a process for transforming data using a common arithmetic unit having the following steps is described. First, loading the data into a first latch and, upon reaching a predefined number of cycles transmitting the data to an arithmetic unit and loading a first marker bit into a control shift register. Next, loading data into a second latch, the second latch is adjustable and can be varied in size to accommodate variable rate of data being received and transmitted at different rates. The next step is to transmit the data in the second latch to the arithmetic unit when the first control shift register reaches a predetermined state and the second latch is filled with a predetermined amount of data. Next, preventing transmission of data from the second latch, if the second latch is not filled with a predetermined amount of data and then recovering the second latch when the first latch is receiving non data.

Detailed Description of Invention for Time Synchronization

In MPEG-2, video and audio data is synchronized using information carried in the MPEG-2 systems stream. In this regard, there are essentially two types of information that deal with synchronization; clock references and time stamps. Clock references are used to inform the decoder what number is used to represent the time "now". This is used to initialize a counter that is incremented at regular intervals so that the decoder always knows what the current time is.

Time stamps are carried in some of the streams of data that are used to make up the programme (typically video and audio). In the case of video, a time stamp is associated with a picture and tells the decoder at what "time" (defined by the counter that was initialized by the clock reference) a picture should be displayed.

In MPEG, multiplexed into the system stream are a series of clock references. These clock references define the "system time". There are two types of clock reference; Program Clock References (PCRs) and System Clock References (SCRs). In the present invention, the distinction between PCRs and SCRs is not relevant since each of the clock references are used in the same manner by the decoder. PCRs and SCRs have timing information to a resolution of 90 kHz with a further field extending the resolution to 27 MHz (or 1/27 X 10e6 in seconds). Clock references are included in the data stream fairly often in order that "system time" may be reinitialized after a random access or channel change. Accordingly, it is important to appreciate that timestamps refer to a hypothetical model of a decoder that can decode pictures instantly. As will be appreciated by one of ordinary skill in the art, any real decoder cannot do this and must take steps to modify the theoretical time in which pictures should be displayed. Furthermore, time stamps and the clock references are used to determine display time and errors in display time. This modification depends upon the details of the architecture of the particular decoder. Clearly any delay introduced by the video decoder must be matched by an equivalent delay in the audio decoder.

When decoding MPEG, discontinuities in the concept of "system time" may occur. For instance in an edited bitstream, each edit point will have discontinuous time. A similar situation occurs at channel change. It will be appreciated that care must be taken when using time stamps, because using a time stamp that was encoded in one time regime with respect to a "system time" defined by a clock reference from another regime will clearly lead to incorrect results.

Figure 39 shows the demultiplexing of the MPEG systems stream into elementary streams 250. Each elementary stream will typically carries either video or audio data although, in general, any form of data may be transported. Each elementary stream is divided into a series of access units. In the case of video, the access unit is a picture. In the case of audio, it is a fixed number of samples of audio data.

Also multiplexed into the systems stream are a series of clock references. These clock references define the "system time".

In accordance with the present invention, associated with each elementary stream is a series of time stamps 251. The time stamps specify the "system time" at which the next access unit for the respective elementary stream is to be presented. These time stamps are referred to as presentation time stamps, "PTS".

In the case of video data, a second type of time stamp is also defined is referred to as a decode time stamp, "DTS". Since the DTS is only present when a PTS is also present and there is a simple relationship between them, the detailed differences between these two types of timestamps can be ignored since PTS/DTS differences have no bearing on the present invention.

The decode time stamps (DTS) define the time at which an access unit (picture in the case of video) is to be decoded. The presentation time stamps (PTS) define the time at which an access unit is to be presented (displayed). However, the timing model used is a hypothetical model in which the decoder is infinitely fast. In this case, the DTS and PTS would be identical to one another.

However, in MPEG video decoding, some of the pictures are reordered. Therefore, after decoding, the pictures are held in storage for a time period, e.g., several frame times, before they are displayed. During this time period, other pictures that are decoded subsequent to the picture in question are displayed. Consequently, for these reordered pictures there is a difference between the DTS and PTS.

In accordance with the present invention, it will be appreciated that to properly synchronize time, it is necessary to be consistent in the use of time stamps. In one preferred embodiment, the time synchronizing circuitry is placed at a point in the decoding piipeline when the pictures occur in their decoded order. Accordingly, this embodiment uses the DTS.

Nevertheless, the circuitry could equally be moved to a point in the decoding pipeline that occurs after the pictures are reordered and, therefore, the pictures would reach the synchronizing circuitry in their display order. Hence, as will be appreciated by one of ordinary skill in the art, PTS would be used in this embodiment.

In the preferred embodiments of the present invention, the information derived from the timestamps is transported through the various circuits by means of tokens. Tokens consist of a series of one or more words of information. The first word of the token contains a code which identifies the type of token and, hence, the type of information carried by that token. Associated with each word of the token is an extension bit which is set to one to indicate that there are more words in the current token. Therefore, the last word of a token is indicated by the extension bit being zero. In the present invention, the code in the first word indicating the type of token may be of a variable number of bits so that some codes use a small number of bits (allowing the remainder of the bits in the first word to be used to represent other information) while other codes use a larger number of bits.

Tokens may be characterized as being either control or DATA tokens. For example, at the interface between the system decoder and the video decoder, there are two types of information: (1) the coded video data and (2) the synchronization time derived from the time stamp information. The coded video data is viewed as data and is carried in a DATA token (e.g., the token called DATA) while the synchronization time is viewed as control information and is carried in a control token (called SYNC_TIME). Additional control tokens may also be used from time to time in the present invention. For example, a FLUSH token that behaves in a manner similar to a reset signal may be required to initialize the video decoding circuitry before attempting to restart decoding because of an error.

In accordance with the present invention, it is an object of one preferred embodiment to time synchronize two circuits and, more particularly, to time synchronize two circuits without directly communicating system time from the first to the second circuit. In accordance with the invention, time synchronization of two circuits is accomplished without passing system time directly to the second circuit by providing synchronized time counters in each circuit.

The present invention also enables the system to time synchronize two circuits without communicating system time from the first to the second circuit by providing an elementary stream time counter in each circuit.

Accordingly, another object of the present invention is to time synchronize two circuits and to determine the presentation time error, if any, of the object being presented by using time stamp information, system time, and elementary stream time from the first circuit to generate synchronization time passed to the second circuit and compared to a copy of elementary stream time in the second circuit which is synchronized with the elementary stream time in the first circuit. The system of the present invention can time synchronize a system decoder and a video decoder without directly communicating system time from the system decoder to the video decoder, without passing system time directly to the video decoder by providing synchronized time counters in each circuit and without communicating system time from the system decoder to the video decoder by providing a video counter in each circuit.

The invention also enables the system to time synchronize a system decoder and a video decoder and to determine the display time error, if any, of the picture being displayed by using video time stamp information, system time, and video decoding time from the system decoder to generate synchronization time which is then passed to the video decoder and compared to a copy of video decoding time in the video decoder which is synchronized with the video decoding time in the system decoder.

In accordance with the present invention, information derived from the timestamps can be transported through the system using a control token as previously described.

Figure 40 shows a first preferred embodiment implementing elementary stream timestamp management, in accordance with the present invention. The clock references 253, which represent system time, are decoded by the system demultiplexer 254 and placed initially, and then as needed, into a time counter 255 within the system decoder 256, and are incremented at 90 kHz. A second copy of the clock reference 253 is simultaneously loaded into the time counter 255 that is inside the elementary stream decoder 257, incremented also at 90 kHz, and synchronized to the time counter 255 in the system decoder 256.

The time stamps 251, in accordance with the present invention, flow from the system demux 254 through the elementary stream buffer 260 so that they are delayed by the same amount as the incoming data. The time stamps 251 may also have a correction added to compensate for the non-zero decode time of the elementary stream decoder 257. The corrected time stamps 251 are then compared with the copy of the time stored the time counter 258 inside the elementary stream decoder 257 to determine whether the decoded information is presented too early or too late.

The above embodiment is better than merely passing system time directly to the elementary stream decoder 257 from the time counter 255 in the system decoder 256 because the counter in the system decoder changes 90,000 times a second. Therefore, system time would, in all essence, need to be continually passed to the elementary stream decoder 257. Passing system time continually would require dedicated pins or the like. By using a time counter 255 located in the system decoder 256 and a time counter 256 located in the elementary stream decoder 252, system time can be passed in the form of clock references 253 a few times a second.

Another embodiment is shown in Figure 41. The embodiment shown in Figure 41 avoids the need for the clock references 253 to be passed to the elementary stream decoder 257. This is achieved by using a second counter" es_time" 262, containing information on elementary stream time, which is maintained in both the system decoder 256and the elementary stream decoder 257. The two es_time counters 262 and 263 are reset at power on, and at other times such as channel change, and then they free run from there on. Since this embodiment depends on the two es_time counters 262 and 263 staying in step, it will be appreciated that it is necessary to take measures to ensure the es_time counters do not get out of step. One way to ensure the es_time counters 262 and 263 stay in step is to use carry out of the es_time counter in the system decoder to reset the es_time counter in the elementary stream decoder 257 as shown in Figure 41.

As further shown in Figure 41, the clock references 253, which represent system time, are decoded by the system demultiplexer 254 and placed into a time counter 255 within the system decoder 256 and incremented at 90 kHz. The es_time counter 262 in the system decoder 256 of the present invention and the es_time counter 263 in the elementary stream decoder 257 of the present invention are synchronized with each other and incremented at 90 kHz. Elementary stream time stamps are also decoded by the system demultiplexer 254. Accordingly, a synchronization value X is computed using the elementary stream timestamp, the system time contained in the time counter and the elementary stream time contained in the es_time counter 262 contained in the system decoder 256 according to the equations 3-1.

The following set of equations 3-1 (a - d) is illustrative of one method in accordance with the present invention, for time synchronization which avoids passing the clock references 253 to the elementary stream decoder 257. Equation 3-1(a) is the equation required for time synchronization. Since it is undesirable to pass system time directly to the elementary stream decoder circuit 257, as shown in Figure 41, a synchronization time representation X is generated, using Equation 3-1 (b-d), by the system decoder 256 and this value is passed to the elementary stream decoder. Synchronization time X is then compared to the elementary stream time contained within the es_time counter 263 located within the elementary stream decoder 257. Hence, the compared result is used to determine whether the decoded information is presented too early or too late and then is further used in time synchronizing the system.

Equations 3-1:

<ul id="ul0008" list-style="none" compact="compact"><li>a) <maths id="math0056" num=""><math display="inline"><mrow><mtext>Time Synchronization = (Elementary stream timestamp - system time)</mtext></mrow></math><img file="EP0891094A2_D0056.tif" /></maths></li><li>b) <maths id="math0057" num=""><math display="inline"><mrow><mtext>Time Synchronization = (X - elementary stream time)</mtext></mrow></math><img file="EP0891094A2_D0057.tif" /></maths></li><li>c) <maths id="math0058" num=""><math display="inline"><mrow><mtext>(X - elementary stream time) = (elementary stream timestamp - system time)</mtext></mrow></math><img file="EP0891094A2_D0058.tif" /></maths></li><li>d) <maths id="math0059" num=""><math display="inline"><mrow><mtext>X = (elementary stream timestamp - system time + elementary stream time)</mtext></mrow></math><img file="EP0891094A2_D0059.tif" /></maths></li></ul> In the present invention, the synchronization time, X, may have a correction added to compensate for the non-zero decode time of the elementary stream decoder 257. The corrected synchronization time is then compared with the elementary stream time contained in the es_time counter 263 located inside the elementary stream decoder 257 to determine whether the decoded information is presented too early or too late and is further used to time synchronize the system. Note, the time correction could be subtracted from elementary stream time contained in the es_time counter 263 located inside the elementary stream decoder 257 instead of added to synchronization time X for the same result. The above embodiment is an example of a solution for generating synchronization time X and determining whether the information is presented early or late. It will be apparent to those skilled in the art that there are many other equivalent solutions for accomplishing the above.

For example, Figure 42 shows an alternative method for determining the synchronization time, X, in accordance with the present invention. In this arrangement, the system decoder 256 does not maintain an elementary stream time. Instead it records, in the register initial_time 265, the value of system time at the instant that the elementary stream time counter, es_time 263, located in the elementary stream decoder 257 is reset to zero. The value in es_time 263 can be computed by the system decoder 256 because it will be the difference between the current system time and the value recorded in initial_time.

The following equations 3-2 (a-c) is illustrative of this alternative method for time synchronization. Equation 3-2 (a) is the equation representing the value of the elementary stream time stored in es_time 263 located in the elementary stream decoder 257. This is substituted into equation 3-1 (d) to give equation 3-2 (b) which is simplified to derive equation 3-2 (c) providing the synchronization time, X, as a function of the system time and the value stored in the initial_time register 265.

Equations 3-2:

<ul id="ul0009" list-style="none" compact="compact"><li>a) <maths id="math0060" num=""><math display="inline"><mrow><mtext>elementary stream time = system time - initial_time</mtext></mrow></math><img file="EP0891094A2_D0060.tif" /></maths></li><li>b) <maths id="math0061" num=""><math display="inline"><mrow><mtext>X = (elementary stream timestamp - system time + [system time - initial_time])</mtext></mrow></math><img file="EP0891094A2_D0061.tif" /></maths></li><li>c) <maths id="math0062" num=""><math display="inline"><mrow><mtext>X = (elementary stream timestamp - initial_time)</mtext></mrow></math><img file="EP0891094A2_D0062.tif" /></maths></li></ul> Two solutions for deriving the synchronization time, X, in accordance with the present invention have been illustrated. However, it will be apparent to those skilled in the art that there are many other equivalent solutions.

Figure 43 shows another embodiment of the present invention implementing video timestamp management. The clock references 253, which represent system time, are decoded by the system demultiplexer 254 and placed initially, and then as needed, into a time counter 255 within the system decoder 256 and are incremented at 90 kHz. A second copy of the clock references 253 are simultaneously loaded into the time counter 258 that is inside the video decoder 270 and incremented at 90 kHz, and synchronized to the time counter 255 in the system decoder 256.

The video time stamps flow from the system demux 254 through the video decoding buffer 271 so that they are delayed by the same amount as the incoming video data. The video time stamps may have a correction added to compensate for the non-zero decode time of the video decoder 270. The corrected video time stamps are than compared with the copy of the time in the time counter 258 inside the video decoder 270 to determine whether the decoded picture is displayed too early or too late.

The embodiment shown in Figure 43 is an improvement over the process of merely passing system time directly to the video decoder from the time counter in the system decoder because the counter in the system decoder changes 90,000 times a second. Therefore, system time would in all essence need to be continually passed to the video decoder. Passing system time continually would require dedicated pins or the like. By using a time counter located in the system decoder and a time counter located in the video decoder system time can be passed in the form of clock references a few times a second.

Referring now to Figure 44, the clock references, which represent system time, are decoded by the system demultiplexer 254 and placed into a time counter 255 within the system decoder 256 and incremented at 90 kHz. The vid_time counter 272 in the system decoder 256 and the vid_time counter 273 in the video decoder 270 are synchronized with each other and incremented at 90 kHz. Video time stamps are also decoded by the system demultiplexer 254. Accordingly, a synchronization value X is computed using a video timestamp, the system time contained in the time counter 273 and the video decoding time contained in the vid_time counter 272 contained in the system decoder 256 according to the equations 3-3.

The following set of equations 3-3 (a - d) is illustrative of one method in accordance with the present invention, for time synchronization which avoids passing the clock reference 253 to the video decoder 270. Equation 3-3(a) is the equation required for time synchronization. Since it is undesirable to pass system time directly to the video decoder circuit 270 as shown in Figure 44, a synchronization time representation X is generated, using Equation 3-3 (b - d), by the system decoder 256 and passed to the video decoder 270. Synchronization time, X, is then compared to the video decoding time contained within the vid_time counter 273 located within the video decoder 270. The compared result is used to determine whether the decoded picture is displayed too early or too late and then further used in time synchronizing the system.

Equations 3-3:

<ul id="ul0010" list-style="none" compact="compact"><li>a) <maths id="math0063" num=""><math display="inline"><mrow><mtext>Time Synchronization = (Video timestamp - system time)</mtext></mrow></math><img file="EP0891094A2_D0063.tif" /></maths></li><li>b) <maths id="math0064" num=""><math display="inline"><mrow><mtext>Time Synchronization = (X - video decoding time)</mtext></mrow></math><img file="EP0891094A2_D0064.tif" /></maths></li><li>c) <maths id="math0065" num=""><math display="inline"><mrow><mtext>(X - video decoding time) = (video timestamp - system time)</mtext></mrow></math><img file="EP0891094A2_D0065.tif" /></maths></li><li>d) <maths id="math0066" num=""><math display="inline"><mrow><mtext>X = (video timestamp - system time + video decoding time)</mtext></mrow></math><img file="EP0891094A2_D0066.tif" /></maths></li></ul> In the present invention, the synchronization time, X, may have a correction added to compensate for the non-zero decode time of the video decoder. The corrected synchronization time is then compared with the video decoding time contained in the vid_time counter 273 located inside the video decoder 270 to determine whether the decoded picture is displayed too early or too late and is also used to time synchronize the system. Note, the time correction can be subtracted from the video decoding time contained in the vid_time counter 273 located inside the video decoder 270 instead of added to synchronization time X for the same result. The above embodiment of the present invention is another example of a solution for generating synchronization time X and determining whether the picture is displayed early or late. However, it will be apparent to those skilled in the art that there are many other equivalent solutions for accomplishing the above.

Another nice feature, in accordance with the present invention, is that there is no need to deal with the full 33 bit time stamp number or 42 bit clock reference number. The present invention restricts the counters to 16 bits to allow 16 bit handling on the video decoder 270. At first glance, it would appear that 16 bits cannot represent a sufficient number range at a resolution of 90 kHz (only 2/3 second to be used). However, there is no need for such high precision because the time control on the video decoder 270 is only accurate to a field time (since the video timing generator VTG free-runs or is gen-locked to something that has nothing to do with the MPEG stream being decoded) and, therefore, it is not related to timestamps or presentation time in any way.

As shown in Figure 44 and Figure 45, the synchronization time X and the vid_time counter 273 within the video decoder 270 use only sixteen bits. This is made possible by two factors. First, the difference between system time and the timestamp (used to derive the synchronization time; see Equation 3-3) should always be small, thus allowing the more significant bits to be discarded. Second, it is only possible to control the presentation of video to the nearest frametime. Therefore, the less significant bits are not required and are discarded by shifting right by four bits.

Thus, the sixteen bits of time information used in the present invention are able to deal with timing errors of up to about 11.5 seconds with an accuracy of about 180 µs (about 1% of a field time). A PAL or SECAM European 625 line TV system is, thus, 112.5 ticks of the 5625 Hz clock; a NTSC 525 line TV system is 93.84 ticks. Hence, using 16 bits allows timing calculations with an accuracy of about 1% of a field time.

Figure 46 shows the preferred process, in accordance with the present invention, of the moving the time stamp through the hardware. The preferred method for communicating information in this hardware is Tokens, but it will be appreciated that alternative methods may also be employed. The hardware is divided into two modules. The first module is added just after the Start Code Detector 201. This module is responsible for generating a token, SYNC_TIME containing the synchronization time X, as discussed above, and this occurs just before an associated PICTURE_START token. In the MPEG systems stream, the time stamp is carried in a packet header and refers to the first picture in the packet of data. Since the packets do not line up with the video data, there will, in general, be the end of the previous picture before the start of the picture to which the time stamp refers.

The synchronization time information may be supplied to the present invention either via a microprocessor interface or by using a Token. In either case, the synchronization time date (16 bits) is stored in the synchronization time register (divided into two parts to allow access to each byte individually), as further detailed in Table 12. <tables id="tabl0013" num="0013"><img file="EP0891094A2_D0067.tif" /></tables><tables id="tabl0014" num="0014"><img file="EP0891094A2_D0068.tif" /></tables> In the present invention, a flag, ts_waiting, is set to indicate the fact that valid synchronization time information is in the timestamp register. If the data was supplied using the SYNC_TIME token, then that token is removed from the stream of tokens.

When a PICTURE_START token is encountered, the flag that indicates the status of the synchronization time register is examined. If the flag is not set, then no action is taken and the PICTURE_START token and all subsequent data is unaffected. If, however, the flag is set, indicating that valid synchronization time information is available in the register, then a SYNC_TIME token is generated and placed in the data stream before the PICTURE_START token. The flag is then cleared and the synchronization time register is made available for the next time-stamp that occurs.

The second module as shown in Figure 46, consists of a prescaler clocked at 27 MHz and a vid_time counter clocked by the prescaler 278 which are associated with the microprogrammable state machine, (MSM) 218.

There is a prescaler 278 that divides the clock by 4800, as shown in Figure 44 and Figure 46. In other words, 4800 is 300 (27 MHz / 90 kHz) times 16. The 4804.8 option shown in Figure 45 and Figure 46 is discussed below.

In the NTSC color television, the frame rate is not 30 Hz but is, in fact, approximately 29.94 Hz (precisely 30000/1001 Hz). [Before the advent of color television 30 Hz precisely was used.] There are precisely 1716, 27 MHz clock periods per NTSC line time (line time is 1/525 of frame time).

The American television standards body has expressed an interest in returning to 30 Hz in the future (or more probably 60 Hz for HDTV). As a result MPEG supports a frame rate of 30 Hz precisely. However, since it is not possible to generate a stable 30 Hz television signal from a 27 MHz clock (there being 1714.29...cycles per line) it is difficult to generate a 30 Hz raster in the MPEG framework.

One possible solution is to "bend" the clock rate at the decoder so that instead of producing a 27 MHz clock, a 27.027 MHz clock is generated. This clock is generated using the MPEG clock references with a divider of 300.3 (rather than 300) to yield the 90 kHz clock. This 27.027 MHz clock when clocking the identical video timing circuitry that provides a 29.94 Hz frame rate from 27 MHz will give a precise 30 Hz rate.

In the framework of the present invention, the 90 kHz is prescaled by a further factor of 16. Accordingly, division of the 27.027 MHz clock by 300.3x16=4804.8.

The Vid_time counter 273 (discussed above) contains the video decoding time and is incremented each time that the prescaler reaches its terminal count. The vid_time counter 273 is reset by the reset-time pin.

The prescaler and vid_time counter of the present invention can be implemented with fully clocked feed-back flip-flops which are much more resistant to α-particle corruption than the resistive-feedback or weak-feedback latches used elsewhere. Using clocked feedback flip-flops for time counters will help ensure that the time counter in the video decoder stays in step with the time counter in the system decoder.

Figure 47 illustrates the process the MSM 218 performs when it receives the SYNC_TIME token. The MSM 218 is able to read the current time indicated by the video time counter and to then compare it with the value supplied by the video SYNC_TIME token. It can, therefore, determine whether it is early or late, as compared to the time at which it should be decoding the pictures.

In the present invention, a 16 bit signed timestamp correction is added to the synchronization time X (discussed above) that was carried by the video SYNC_TIME token. This correction is reset to zero by the MSM 218 at chip-reset, and if no action is taken, the synchronization time remains be unaltered. The controlling microprocessor can always write value into ts_correction to modify the synchronization time and, therefore, compensate for differential delays through the video and audio decoders.

The current video decoding time contained in the vid_time counter 273 is subtracted from the corrected synchronization time. The sign of value gives the direction of the error (and determines the error code, if any, generated by the MSM 218). The absolute value of the difference is then taken and the result is compared to a threshold value to determine whether the timing error is within acceptable limits. Since, at present, the video timing can only be controlled to an accuracy of plus or minus a frame time from the nominal time (because the VTG 333 free-runs) this threshold is set at one frame time.

If the error exceeds a frame-time, then some correction must be made. The MSM 218 of the present invention can correct the situation itself if the decoding is too early since the MSM can simply delay the decoding until the appropriate time. However, if the decoding is later than the intended time, then time correction is more difficult because it is not possible to discard pictures reliably at the output of the coded data buffer. Essentially, the decoding of the sequence is broken and the most reliable way to correct the situation is to restart the decoding process in a manner similar to random-access or channel change. In order to facilitate this process, the control register of the MSM 218 may be programmed to discard all data until a suitable start code or FLUSH token is encountered. In addition, the error "ERR_TOO_EARLY" is not generated during start-up, irrespective of the setting of disable_too_early, because at start up, the first picture is expected to be early.

Table 13 is illustrative of how the MSM 218 registers work and details some of the actions and error messages information placed in the registers can generate. <tables id="tabl0015" num="0015"><img file="EP0891094A2_D0069.tif" /></tables><tables id="tabl0016" num="0016"><img file="EP0891094A2_D0070.tif" /></tables><tables id="tabl0017" num="0017"><img file="EP0891094A2_D0071.tif" /></tables>

As a result of the synchronization time handling of the present invention, it is possible that one of two errors will be generated.

ERR_TOO_EARLY is generated if the decoding is taking place earlier than the time indicated by the time-stamp. ERR_TOO_EARLY may be suppressed, but ERR_TOO_LATE will always be generated unless all errors are masked out.

In summary, the present invention includes: an apparatus for synchronizing time having, a timestamp for determining presentation time, a clock reference for initializing system time in a first circuit, a first time counter in communication with the clock reference for keeping system time in a first circuit and a second time counter initialized by the clock reference in a second circuit synchronized with the first time counter, for keeping a local copy of the system time and for determining the presentation timing error between the local copy of system time and system time by comparing the timestamp to the second time counter. It further includes an apparatus for synchronizing a system decoder and a video decoder using a timestamp for determining display time, a clock reference for initializing system time in the system decoder, a first time counter in communication with the clock reference for keeping system time in the system decoder and a second time counter initialized by the clock reference in the video decoder synchronized with the first time counter, for keeping a local copy of system time and for determining the display timing error between the local copy of system time and system time by comparing the timestamp to the second time counter. A still another embodiment includes an apparatus for synchronizing a first circuit and a second circuit using a clock reference for initializing system time in the first circuit, a first circuit having a time counter in communication with the clock reference for keeping system time, a first elementary stream time counter in the first circuit for providing elementary stream time. The first circuit is adapted to receive a time stamp, and the first circuit generates synchronization time by adding elementary stream time to the time stamp and subtracting system time. The second circuit is adapted to receive synchronization time from the first circuit and has a second elementary stream time counter in synchronization with the first elementary stream time counter for providing a local copy of the elementary stream time and for determining a timing error between the system time and the time stamp by comparing synchronization time to the local copy of elementary stream time. In this way, the clock reference signal does not have to be passed directly to the second circuit in order to determine the timing error. In another embodiment, an apparatus for synchronizing a first circuit and a second circuit has a clock reference for initializing system time in the first circuit. The first circuit has a time counter in communication with the clock reference for keeping system time, and a first video time counter for providing video decoding time. The first circuit is adapted to receive a video time stamp and generates synchronization time by adding video decoding time to the video time stamp and subtracting system time. The second circuit is adapted to receive synchronization time from the first circuit and has a second video time counter in synchronization with the first video time counter for providing a local copy of video decoding time and for determining a timing error between system time and the video time stamp by comparing synchronization time to the local copy of video decoding time. Accordingly, the clock reference signal does not have to be passed directly to the second circuit in order to determine the timing error. The present invention also includes a method for providing timing information by providing a video data stream having a time stamp carried in packet header wherein the time stamp refers to the first picture in the packet of data. In the next step a register is provided having a flag used to indicate valid time stamp information which is taken from the packet header and placed into the register. Next, the timestamp is removed from the video data stream and placed in the register. Next, the method encounters a picture start and subsequently examines the status of the register to determine if valid time stamp information is contained in the register by checking the flag status. A time stamp is generated in response to the picture start if the flag indicates valid time stamp information is contained in the register and then the timestamp is inserted back into the data stream. Another embodiment includes an apparatus described above wherein the elementary stream time counters are restricted to 16 bits. Likewise, there is an apparatus as described above, wherein the second elementary stream time counter located in the elementary stream decoder is restricted to 16 bits. Furthermore, there is an apparatus as described above wherein the synchronization time is restricted to 16 bits for controlling the elementary stream decode. The present invention also has a process for decoding video and for determining display time errors against a threshold value. It then parses video data into tokens for further processing, determining if a time stamp token is indicated, comparing the time stamp token to a video time, and generates a compared value to determine an indicative of timing error. Next, it determines whether the compared value, when compared against a threshold value, is within acceptable parameters when a timing error is indicated and indicates when the compared value is outside acceptable parameters. An alternative embodiment includes an apparatus for using a system decoder and a video decoder. The system decoder is adapted to accept MPEG system streams and demultiplexing video data and the video time stamp from the stream. The system decoder has a first time counter representative of system time. The video decoder accepts the video data and the video time stamp, and has a second time counter in synchronization with the first time counter. The video decoder also has a video decoder buffer for accepting the video data at a substantially constant rate and outputting the video data at a varying rate and for passing a video time stamp. The video decoder while decoding a picture from the video data also compares the video time stamp for the decoded picture with the second time counter to determine the appropriate display time. There is also a method for determining a time error between a first circuit and a second circuit by providing the first circuit with a system time (SY), a time stamp (TS), and an elementary stream time (ET), obtaining synchronization time (X) by using the elementary stream time(ET), the time stamp (TS) and the system time (SY), in accordance with the equation; <maths id="math0067" num=""><math display="inline"><mrow><mtext>X=ET + TS-SY</mtext></mrow></math><img file="EP0891094A2_D0072.tif" /></maths>, providing synchronization time (X) to the second circuit and generating a synchronized elementary stream time (ET2) and obtaining a time error by using synchronized time (X) and in accordance with the equation ET2-X; hence, the first circuit can be time synchronized with the second circuit without passing system time to the second circuit. Another method for determining a time error between a first circuit and a second circuit has the following steps: providing the first circuit with a time stamp (TS), and an initial time(IT), obtaining synchronization time (X) by using the time stamp (TS) and the initial time (IT), in accordance with the equation <maths id="math0068" num=""><math display="inline"><mrow><mtext>X=TS-I</mtext></mrow></math><img file="EP0891094A2_D0073.tif" /></maths>, providing synchronization time (X) to the second circuit and generating a synchronized elementary stream time (ET) and obtaining a time error by using synchronized time (X) and in accordance with the equation ET-X. In this way, the first circuit can be time synchronized with the second circuit without passing system time to the second circuit. Still another method for determining a time error between a first circuit and a second circuit includes the following steps: providing the first circuit with a system time (SY), a video time stamp (VTS), and a video decoding time (VT), obtaining synchronization time (X) by using the video decoding time (VT), the video time stamp (VTS) and the system time (SY), in accordance with the equation; <maths id="math0069" num=""><math display="inline"><mrow><mtext>X=VT+VTS-SY</mtext></mrow></math><img file="EP0891094A2_D0074.tif" /></maths>, providing synchronization time (X) to the second circuit and generating a video decoding time (VT2) in the second circuit which is synchronized to the video decoding time (VT) in the first circuit, and obtaining a time error by using synchronized time (X) and in accordance with the equation VT2-X. Accordingly, the first circuit can be time synchronized with the second circuit without passing system time to the second circuit.

Detailed Description of the Invention for Asynchronous Swing Buffering

For asynchronous swing buffering, in accordance with the present invention, two buffers are operated asynchronously; one is written while the other is read. Accordingly, this allows for a data stream having a first rate of through-put to be resynchronized to another rate, while still maintaining a desired rate. In the invention, the write control and read control both have state indicators for communicating which buffer they are using and whether the controls are waiting for access or are, in fact, accessing that buffer. Each side communicates to the other side a single bit to indicate which buffer it is using. This is the only signal that must be synchronized between the two sides of asynchronous circuitry.

When one control circuit (read or write) finishes accessing a buffer, then the invention will allow control to pass to the other circuit. If, after the control has swung, and two control circuits are trying to use the same buffer, then the later control circuit will begin waiting. The control circuit will wait until each side is using alternate buffers, i.e., the other side has swung. If, after it has swung, it finds that it is now using the alternate buffer to the other side, it will not wait, but immediately commence accessing. This system of arbitration between the buffers is started up by both buffers using the same buffer, buffer 0, in this case. The read side starts up by waiting, while the write side is accessing, since there is nothing valid to read out of either buffer.

In one embodiment, in accordance with the present invention, the swing buffers are two discrete RAMS having all signals, such as enabling strobes, addresses and data multiplexed from either the read or write side, dependent on which buffer is being accessed by each side. This structure has been shown to use a lot of area in the busing of a large number of signals between the two buffers.

Combining the two RAMs into a single structure saves much of the busing area while still maintaining performance to the same standard. This structure contains twice as many rows of cells as one of the discrete RAMs found in the first embodiment of the present invention. However, the second embodiment must have two pairs of bit lines since the read and write to the discrete buffers is happening simultaneously and asynchronously. Each row will be of its original width (i.e., have the same number of cells) since accesses are the same width as for the discrete RAMS. Each pair of rows are accessed as if at the same address, but from different buffers, so they connect to a different pair of bitlines. Using the same address, these pair of rows can be readily accessed by one row decoder connected to the read address and one row decoder connected to the write address. Again, the read and write control never access the same buffer at the same time so there is no conflict as to which pair is accessed by which row decoder.

In the same way in which each row decoder can access rows from each buffer, both the read and write circuitry within the structure of the present invention connect to each pair of bitlines, one pair from each buffer. The read and writes are then multiplexed into each of the buffers and, for the same reasons explained above, there will not be conflict.

As shown in Figure 48, a swing unit 1 includes swing buffers 10 with RAM 12 and 14 in accordance with the present invention. The swing unit 1 also includes a write control circuit and a read control circuit, which control the data into and out of the RAM 12 and 14. The read control circuit and the write control circuit accomplish this by use of strobes, data and address control lines, 8. Lines 7 and 9 are control lines to indicate the RAM used by the write control circuit and the RAM used by the read control circuit. Line 7 functions to control the write control circuitry, i.e., when the read control circuitry is using, RAM 12 if low, RAM 14 if high. Similarly, Line 9 functions to inform the read control circuitry that the write control circuitry is using RAM 12 if low, RAM 14 if high.

In the present invention, swing buffer 10 has two RAM arrays, 12 and 14. Swing Buffer 10 is capable of asynchronous, alternative reading and writing to the RAM area which enables the apparatus to achieve the necessary band width for high speed accessing of the memory. The RAMs 12 and 14 require the following signals: write address 16, read address 18, data in 20, data out 22; and a read and write enable signal (not shown). See also Figure 49.

The write address and read address signals are multiplexed by multiplexers 24. The RAM array 12 and 14 operate with the write circuitry, row decoder and read circuitry in a conventional sense.

In the first embodiment of the present invention, during initiation of the swing buffer 10, RAM 12 will be written to until the control circuitry switches a write enable single to RAM 14.

Once the RAM array 12 has been written, it falls under the control of the read circuitry 4, to be read. During this time, the RAM array 14 is also being written. It is important to note when the RAM array falls under the control of the read array control 2, or the write control circuit 4, the control is established until reading or writing is completed and then control is turned over. In the situation where the read control circuit 4 is accessing the RAM array, such as 12, and the write control circuitry 2 needs to access the same RAM array 12, then the write control circuit will begin waiting.

Therefore, in accordance with the present invention, two control events are created. When a write control circuit or a read control circuit swings to a different RAM, it will either begin immediately accessing the RAM since the RAM is free and not under control of the alternative circuit, or it will begin to wait. During start up, the read side defers to the write side, since there is nothing valid to be read out of either buffer.

The second embodiment of the present invention is shown in Figure 50. An integrated swing buffer 30 includes a RAM array 32 having the logical size of RAM array 12 combined with RAM array 14. In other words, there is the same amount of RAM in both the first and second embodiments, however, it is combined in the second embodiment. Accordingly, the integrated swing buffer has the advantage of saving much of the busing area while still performing the same swing buffer function.

In the second embodiment of the present invention, the write circuit and read circuit 34 and 36 respectively, are similar to those used in the swing buffer 10. However, these circuits now include selectors which choose from the pairs of bit lines described hereinafter. Likewise, the read access row decoder 38 and the write access row decoder 40 are similar to those contained in swing buffer 10, however, they are able to access a pair of rows as described hereinafter in Figure 51.

As shown in Figure 51, the particular structure of the integrated swing buffer 30, in accordance with the present invention, is detailed. Individual cells 42 are contained in rows 44. The read row decoder 38 and write row decoder 40 access the rows 44 in pairs. A pair of rows have the same address provided by the address lines 16 and 18. The read buffer line 52 and write buffer line 54 provide the control information for selecting one of the paired rows 42. Tile buffer 0 bitlines 48 and buffer 1 bitlines 50 connect to alternative rows of cells and to the read and write circuitry 34 and 36. For clarity in depicting the addressing, the lighter shading illustrates the read row decoder 38 accessing a row in buffer 0. Similarly, the darker shading illustrates the write row decoder 40 accessing a row in buffer 1.

In summary, the present invention includes a swing buffer apparatus having at least two RAM arrays, a write control circuit in communication with the RAM arrays for controlling data input into the RAM array, and a read control circuit in communication with the RAM arrays for controlling data output from the RAM arrays. Furthermore, the write control circuit and read control circuit are in communication with one another to allow a synchronized control of the RAM arrays. There is also a swing buffer apparatus having a RAM array, a write control circuit in communication with the RAM array through a pair of bit lines, a read control circuit in communication with the RAM array through another pair of bit lines and a read row decoder and a write row decoder for addressing the RAM through a pair of rows so that individual cells are read. The present invention also provides a method of asynchronously addressing RAM, by decoding at least a pair of cells in the RAM, using a row decoder to decode at least a pair of rows and selecting one of the rows to be assessed, using at least two pairs of bitlines connected to read a circuit and a write circuit and selecting the pair of bitlines to be used.

DETAILED DESCRIPTION OF THE INVENTION FOR STORING VIDEO INFORMATION

Video decompression systems contains three basic parts used to decode and display picture information. The three main parts of a video decompression system are the spatial decoder, temporal decoder and the video formatter. The present invention involves the temporal decoder and video formatter and the way in which the temporal decoder and video formatter manage their respective picture buffers, hereinafter the frame store buffer. In MPEG systems, the temporal decoder contains two frame store buffers and the video formatter contains two frame store buffers.

MPEG uses three different picture types: Intra (I), Predicted (P) and Bidirectionally interpolated (B). B pictures are based on predictions from two other pictures; one picture is from the future and one from the past. The I pictures require no further decoding by the temporal decoder, but must be stored in one of the two frame store buffers for later use in decoding P and B pictures. Decoding a P picture requires forming predictions from a previously decoded P or I picture. The decoded P picture is stored in a frame store buffer for use in decoding further P and B pictures. B pictures can require predictions from both of the frame store buffers. However, B pictures are not stored in the frame store buffers.

It will be appreciated that I and P pictures are not output from the temporal decoder as they are decoded. Instead, I and P pictures are written into one of the frame store buffers, and they are read out only when a subsequent I or P picture arrives for decoding. In other words, the temporal decoder relies on subsequent P or I pictures to flush previous pictures out of the two picture buffers. Accordingly, the spatial decoder of the present invention can provide a fake I or P picture when it is necessary to flush the temporal decoder's two frame store buffers. In turn, this fake picture is flushed when a subsequent video sequence begins.

As shown in Table 14, the picture frames are displayed in numerical order. <tables id="tabl0018" num="0018"><img file="EP0891094A2_D0075.tif" /></tables> However, in order to reduce the number of frames that must be stored in memory by the temporal decoder, the frames are transmitted in a different order. It is useful to begin the analysis from an intra frame (I frame). The I frame is transmitted in the order it is to be displayed. The next predicted frame (P frame), P4 is then transmitted. Then, any bi-directionally interpolated frames (B frames) to be displayed between the I frame and P4 frame are transmitted, represented by Be and B3. This allows the transmitted B frames to reference a previous frame (forward prediction) or a future frame (backward prediction). After transmitting all the B frames to be displayed between I and P4, the P7 frame is transmitted. Next, all the B frames to be displayed between the P4 and P7 frames are transmitted, i.e., corresponding to B5 and B6. Then, the next I frame, I10, is transmitted. Finally, all the B frames to be displayed between the P7 and I10 frames are transmitted, corresponding to B8 and B9. This ordering of transmitted frames requires only 2 frames to be kept in memory by the temporal decoder at any one time, and does not require the decoder to wait for the transmission of the next P frame or I frame to display an interjecting B frame. As described above and shown in Table 14, the temporal decoder of the present invention can be configured to provide MPEG picture reordering. With this picture reordering, the output of P and I pictures is delayed until the next P or I picture in the data stream starts to be decoded by the temporal decoder.

As the P and I pictures are reordered, certain tokens, i.e. Picture_Start, Picture_Type, and Temporal_Reference, are stored temporarily on the chip as the picture is written into the picture buffers. When the picture is read out for display, these stored tokens are retrieved. At the output of the temporal decoder, the DATA tokens of the newly decoded P or I picture are replaced with DATA tokens for the older P or I picture, and they are then sent to the video formatter. Note that the output from the temporal decoder is in tokenized macroblock format and there is no block-to-raster conversion.

In brief, the video formatter of the present invention stores two framestores or pictures. In some video formatters three pictures or framestores are used to accommodate such features as repeating or skipping pictures. The video formatter's off-chip DRAM holds three framestores. The use of three framestores here allows frames to be either repeated or skipped in situations where the frame rates of the decoded video and the display are different.

All I, B and P frames are stored in the framestores of the video formatter. At any one time, there may be one frame store from which data is being displayed, one frame store into which data is being written, and in video formatters with three framestores, one other frame may be being stored in the third frame store.

The present embodiment performs all the prediction, reordering and block-to-raster tasks MPEG normally handles by using a temporal decoder with two framestores and a video formatter with two framestores, i.e., for a total of four framestores. This is accomplished in the present invention by using a frame store sharing scheme that only uses three framestores. The present embodiment cannot, however, handle the repeat and skip frame tasks of a video formatter with only the three framestores.

The present invention stores I pictures in a first frame store and P pictures in a second frame store. Because of the need to perform the block-to-raster conversion, B frames are stored in the manner detailed below in a third frame store. In order to minimize the amount of external DRAM required, a scheme is used where successive B frames share the same third frame store.

When a B frame is decoded, it may refer to the two previously decoded I or P frames occupying the first and second framestores. The decoded B frame is written into the third frame store. The present embodiment allows the raster to commence prior to a frame store being completely filled. The raster is allowed to start before the frame store is filled so that the next B frame can be written into the same frame store to occupy the space vacated by the raster at the top of the previous frame.

In order to keep a record of which parts of the frame store are occupied with picture data, and which are available for new data, each frame store is split into sectors. In the present invention, each frame store is first split into two field stores, each of which comprises N sectors, where N is the number of block rows in the field.

Frames coded as field pictures are straightforward. Each successive macroblock row occupies two sectors in a field store. Once the write back has progressed far enough down the frame, the raster starts reading out each sector from the top. Once the write back of the first frame has been completed, the start of the next frame is written into the space left by the raster. Checks on the status of each of the sectors ensures that the sector to be rastered is indeed full, and that for write back, the two sectors required are empty.

Frames coded as frame pictures are more difficult. Unlike field pictures, the macroblock rows of data are not written to the DRAM in the same order as they are to be rastered. The field stores are written to in parallel, whereas the fields are rastered in turn.

Consider a picture with 8 sectors per field store. That is, Field store 0 consists of 8 sectors numbered 0 to 7, each of which contains one row of blocks (i.e., each 8 pixels deep by the width of the picture). Field store 1 consists of 8 sectors, numbered 8 to 15, each of which contains one row of blocks (i.e., each 8 pixels deep by the width of the picture).

The first macroblock row is written back into sector 0 in field store 0 and to sector 8 in field store 1. The field stores continue to be filed in parallel. At some point, the raster beings displaying sectors from field store 0, that point being chosen so that the raster of field store 0 does not catch up with the write back. However, the second frame cannot be written back in the same manner as the first. Because the sectors are written and read in a different order, waiting for the same two sectors to be free at the start of a frame would mean that write and read could not run continuously. This must be achieved in order to maintain the display and to maintain decoding at the necessary rate.

Accordingly, the second frame must be written into sectors of the frame store already freed by the raster. This is implemented by dividing the framestores in two. Hence, for the second frame, the meanings of the half field stores change. Sectors 4-7 become the upper part of the second field store and sectors 8-11 become the lower part of the first field store, i.e., they swap over. The first macroblock row is written to sectors 0 and 4, once they are freed, with subsequent rows written to 1 and 5, then 2 and 6, and then 3 and 7. The next row is written to sectors 8 and 12, and so on through to 11 and 15. This reallocation to the memory is sufficient to allow the write back and raster to continue at the appropriate rate.

Should a third successive B frame arrive, the write back order reverts to that of the first frame.

In the shared B frame store, with FRAME pictures: The FIRST picture is written back to - Sectors 0 and 8 [1st macroblock row=2 block rows] Then 1 and 9, 2 and 10, 3 and 11, ... 7 and 15.

The FIRST picture is rastered from - Sector 0, Then 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15. The SECOND frame is written to - Sectors 0 and 4, Then 1 and 5, 2 and 6, 3 and 7, 8 and 12, 9 and 13, 10 and 14, 11 and 15.

The SECOND frame is rastered from - Sector 0, Then 1, 2, 3 8, 9, 10, 11, 4, 5, 6, 7, 12, 13, 14, 15.

Note that, in accordance with the present invention, the second frame, the first macroblock row is not written into sectors 0 and 1, which are, after all, the first two sectors to be freed by the raster. Instead, it waits for sector 4 to clear. This is done for two reasons: First, waiting for sector 4 to clear does not affect the system's ability to maintain continuous decoding and display, even in the situation of worst-case coded data, and it is easier to implement. Secondly, with picture sizes which divide into a number of sectors that are not a power of two, the sequence for writing to and reading from sectors of memory does not repeat often (for example, NTSC format has 30 sectors per field and the sequence would repeat every 58 frames). This makes testability and recovery difficult.

As far as implementation is concerned in the present invention, rather than keep a record of the status of each individual sector, each half field store is effectively implemented as a fifo, with pointers to the next location to be written and to be read. Thus, each fifo being full or empty causes write back and raster, respectively to be disabled. This makes use of the knowledge that each half field store is itself written and read only one way, just like a fifo.

In summary, the present invention, provides method for storing video information by providing video information in the form of an I Frame, a P Frame, a B1 Frame and a B2 Frame, storing the I Frame in a first Frame store, storing the P frame in a second frame store; providing a third Frame store having a first and second field store, the first and second field store being split into at least two memory areas respectively, storing the B1 Frame in the third register, reading the B1 Frame from a selected portion of the memory area in the first or second field store; writing a portion of the B2 Frame into the selected portion of the memory area from which the B1 Frame was read; whereby a reduced amount of memory can be used to store video information.

The two programs found herein below contain code to be used in the preferred embodiment of the invention.

Detailed Description of the Invention for a Parallel Huffman Decoder

In accordance with the present invention, the Parallel Huffman Decoder block will decode Huffman coded Variable Length Codes (VLCs) and Fixed Length Codes (FLCs), and pass through tokens under the control of the parser microprogrammable state machine (MSM).

This embodiment of the present invention handles both MPEG-2 as well as MPEG-1 Huffman codes. An important aspect of this embodiment of the invention is that it can sustain a high through-put due to the fact that it is a parallel decoder rather than a serial one.

This embodiment of the present invention uses a code lookup technique to decode Huffman codes. This is done to achieve the performance requirements and also to handle the second MPEG-2 transform coefficient table which is irregular or non-canonical in nature.

Furthermore, this embodiment of the invention has some features that allow it to decode certain more complex components from the stream in a single cycle without the assistance of an external controller. Examples of such complex components are Escape-coded coefficients, Intra-DC values and Motion Vector deltas, all of which are present in the stream as combined VLC/FLC components.

Referring now to Figure 52, there is shown how the Parallel Huffman Decoder 300 deals with variable length codes (VLCs). FLCs require a bypass mechanism which uses the selector 301 output to generate data and an input field to specify the length of the FLC. Thus, the ROM 302 is not required at all during FLC decoding.

However, to decode a VLC, input is first loaded into the two input data registers, 'MSReg' and 'LSReg' as shown in Figure 52. As the names imply, the "earlier" or most significant data is stored in MSReg. The selector is used to align the beginning of the next VLC with the ROM input. Thus, to decode the very first VLC, the selector outputs the top 28 bits of its 59-bit input and the top 16 bits of these are passed to the Huffman Code ROM 302. For subsequent VLCs, the selector effectively shifts the input according to the total count of bits decoded thus far. The count is maintained by adding the size of each VLC, as it is decoded, to a running total. The various word widths are a result of the maximum coded size which can be decoded, which is the 28-bit MPEG-1 Escape Coded Coefficient, and the maximum VLC size which is 16 bits (DCT coefficient tables).

The "table select" input is used to select between the various different Huffman code tables required by MPEG.

The Huffman Code ROM

The core of the implementation of the present invention, used to decode all the VLCs is a special ROM 302 whose addresses are controlled with a selector/shifter 301 as shown in Figures 52 and 53. The ROM 302 has the job of performing a VLC table index calculation, followed by the index-to-data operation that yields decoded data.

The index calculation can be thought of as a content addressable memory (CAM) operation with "don't care" matching implemented to handle the Huffman codes which form the presented data. Since all the VLC code tables are fixed, a CAM-ROM will suffice and this is the job of the ROM AND-plane shown in Figures 54 through 57. Since the index generation is performed in a look-up manner (rather than algorithmically) there is no restriction to handling tables which are canonical.

The ROM Or-plane converts the "index" (an activated word-line) into the decoded data and the size (or length) of the code. The data forms the decoded output (subject to error checking) and the size information is fed back to allow a calculation to be performed which controls the selector and, thus, presents the decoder ROM 302 with the correct data to perform the decoding of the next VLC in the subsequent cycle.

The ROM 302 address of the present invention is in two fields. The larger field is the bit-pattern to be decoded and the smaller field selects which Huffman code table is to be examined. The bit-pattern which must be examined is quite long, 16 bits, corresponding to the longest VLC code and there is an additional 4 bits of table select. Thus, there is a total address space of 20 bits (approximately one million addresses) although there are only in 450 entries in the ROM 302. The reason for the difference is due to the existence of "don't care" bits.

In order to decode VLCs, the AND-plane must be able to decode "don't care" bits in the VLC bit-pattern. This is because all VLCs which are shorter than the maximum 18 bits will be followed by additional bits which form no part of the decoding of that VLC. Because of the wide address, the AND-plane is predecoded (2->4), and the ROM 302 must combine "don't care" handling with this predecode. Furthermore, in addition to the complete MPEG code tables, the ROM 302 also has entries to identify illegal VLC patterns, which exist for some code tables.

Maximizing Throughput

In order to sustain output of one decoded item every cycle, some care must be taken to control the decoder input and special handling must be used for some "complex" symbols (i.e., ones which are not single FLCs or VLCs).

In order to sustain peak throughput of Escape-coded coefficients it must be possible to input at least one complete code per cycle. Since the maximum length required is 28 bits in MPEG-1 this dictates the input word width of 32 bits (being the next sensible size greater than 28).

Normal transform coefficients are also "complex" symbols, in the sense that they consist of a VLC followed by a 1-bit FLC which gives the sign of the level value and are handled in a similar manner to the other complex symbols (e.g. motion Vectors, Intra DC and Escape coded coefficients). Peak throughput cannot be achieved if coefficients are decoded as a VLC followed by an FLC (in separate cycles) and the alternative of allowing the ROM 302 to decode the sign bit would double the size of the two largest tables in the ROM. Thus in the present invention, special handling is used for various symbols so that a single cycle can produce the "final" required result.

FLCs and Tokens

The basis of FLC handling is to control the selector with the required length of the FLC and to bypass the ROM 302 and simply output the correctly selected FLC. Thus, simple FLCs are handled fairly naturally by the decoder, without significant extra hardware. Furthermore, tokens are not manipulated, but simply passed directly to the output of the decoder.

Implementation

This section describes several important features of the implementation of the decoder., in accordance with the present invention. The implementation includes the arrangement of registers with the counter 303 and selector 301, as shown in Figure 52, and the actual code ROM.

The schematic of Figure 53 shows how the core components are interconnected to implement the main Huffman decoding core section of the present invention. The registers ms[31:0] and ls[31:0] are MSReg and LSReg, respectively, and the block phselect is the selector. The counter logic is contained in the block phcclog (together with various other logic) and the count latch is called cntl[4:0]. The other logic on this schematic deals with handling commands, data and command dynamics, tokens, and the manipulation of the more "complex" symbols (performed in block phcop).

The schematic shown in Figure 54 illustrates a very small sample ROM design of the type used to implement the Huffman code ROM 302 in accordance with the present invention. The unusual features of this ROM 302 lie in the AND-plane where predecode and "don't care" handling are used to implement a method of decoding variable length Huffman codes.

Referring now to Figures 55, 56 and 57 and, more particularly to Figure 55, there is shown a first embodiment of a ROM AND-plane capable of "don't care" handling. In this embodiment, each address line (a[3], a[2], a[1] and a[0]) is driven across the AND-plane in both its true and inverted directions. To decode a "one" or a "zero" on a given address line, a transistor is connected to either the true or inverted address line in the conventional manner. In order to decode a "don't care" (denoted by x) a transistor is not connected to either the true or the inverted line.

Figures 56 and 57 show alternative embodiments that utilize pre-decoding to reduce worst-case number of series transistors in the decoding logic. In these examples, two address bits are combined together in predecoding such that one of four lines is driven high for each of the four possible numbers that can be represented with the two address bits. It will be appreciated by one of ordinary skill in the art that the present invention would work equally well with higher levels of predecoding in which more than two bits are combined together. If the two address bits that are grouped together in the predecoding have defined values (either 1 or zero, but not the "don't care") then a transistor is connected to the appropriate predecoded address line in the conventional manner. Similarly, if both of the address bits have a "don't care", then no transistor is used as before. However, if one of the address bits needs to have a defined value (1 or zero) whilst the other address bit requires "don't care", then the decoding requires that the wordline driven across the Or-plane be selected when either of two of the predecoded address lines is active. In the embodiment shown in Figure 56, this is achieved by placing two transistors, one on each of the relevant predecoded address lines, in parallel as shown in the case for the code; 001x. In the embodiment shown in Figure 57 the required decoding is achieved without using a parallel connection of transistors. In this case, two separate decodes are performed both of which must be selected. They are combined together using a NOR gate in the wordline driver such that the wordline is only activated if both of the selects are active.

The foregoing description is believed to adequately describe the overall concepts, system implementation and operation of the various aspects of the invention in sufficient detail to enable one of ordinary skill in the art to make and practice the invention with all of its attendant features, objects and advantages. However, in order to facilitate a further, more detailed in depth understanding of the invention, and additional details in connection with even more specific, commercial implementation of various embodiments of the invention, the following further description and explanation is proffered.

Note that additional Figures, which are self explanatory to those of ordinary skill in the art, are included with this application for providing further insight into the detailed structure and operation of the environment in which the present invention is intended to function.

The aforedescribed pipeline system of the present invention satisfies a long existing need for further improvements in various aspects of video decoding systems, including an MPEG video decompression method and apparatus utilizing a plurality of stages interconnected by a two-wire interface arranged as a pipeline processing machine. Control tokens and DATA Tokens pass over the single two-wire interface for carrying both control and data in token format. A token decode circuit is positioned in certain of the stages for recognizing certain of the tokens as control tokens pertinent to that stage and for passing unrecognized control tokens along the pipeline. Reconfiguration processing circuits are positioned in selected stages and are responsive to a recognized control token for reconfiguring such stage to handle an identified DATA Token. A wide variety of unique supporting subsystem circuitry and processing techniques are disclosed for implementing the system, including memory addressing, transforming data using a common processing block, time synchronization, asynchronous swing buffering, storing of video information, a parallel Huffman decoder, and the like.

It will be apparent from the foregoing that, while particular forms of the invention have been illustrated and described, various modifications can be made without departing from the spirit and scope of the invention. Accordingly, it is not intended that the invention be limited, except as by the appended claims. The following more detailed description of the system of the present invention is set forth for purposes of organization, clarity and convenience of explanation under the headings listed below: Overview Start Code Detector Parser Spatial Processing Predictions Display Circuitry Parallel Start Code Detector (scdp) Input Fifo Input Circuit Start Codes Removal of bit stuffing Search modes Non-aligned start codes Overlapping Start Codes Unrecognized Start Codes Extension and User Data Insertion of PICTURE_END Tokens Stop After Picture Interrupt discard_all Access Bit Tokens Recognized by scdp Scdp Memory Map Implementation DataFlow Around the Coded Data Buffer Theory of Operation Discontinuities Start-up Embodiment Hardware MSM handling of Time-Stamp Information Start-Up MSM Time-stamp error codes Support for 30 Hz Introduction State Machine Jumps and Calls Interrupts and errors Jump addresses State Machine internal instructions State Machine testing State Machine ucode map State Machine ucode word Arithmetic Core ALU Shift block Carry block Condition block ALU core ALU ucode word Use of the ALU Register File Register file addressing Register file register types Register file address map Register file ucode word Token Port Token Port ucode word Multiplexers UPI Memory Map Introduction Interfaces Functional Description Timing requirements Microprocessor Interface Access Introduction Interfaces Functional description Mal-formed tokens Zig-zag scan paths Raster scan order Microprocessor Interface Access Introduction Prediction in frame pictures Frame-based prediction Field-based prediction (in a frame picture) Dual prime (in frame pictures) Prediction in field pictures Field-based prediction 16x8 MC Dual prime in field pictures Overall organization Horizontal Upsampler Introduction 4:3 Upsampling 3:2 Upsampling 2:1 Upsampling Boundary Effects The number of output pels Position signals Multiplexed data Horizontal Alignment Upsampling ratio Video Timing Generator Introduction Horizontal Timing Vertical Timing - PAL Vertical Timing - NTSC VTG Structure Horizontal Machine Vertical Machine Hardwired Comparator Design Output multiplex Border generation Vertical Border UPI controls Output multiplex

Overview

This detailed description deals with the present invention as an entire chip. Referring now to Figure 58, there is shown a very high level block diagram of the system. In subsequent sections, each block is expanded to provide a more detailed block diagram. This description accurately documents all of the interfaces between the various functional blocks of circuitry. This should allow each block to be designed with a complete knowledge of the interfaces that it is expected to provide. As shown in Figure 58, the primary system components include clock generator 350, a start code detector 201, a parser 202, a microprocessor interface 320, a memory control subsystem 352, a spatial processing subsystem 351, a predictions subsystem 208 and a display 355. Figure 58 further illustrates the interfacing that occurs between the various system components.

Start Code Detector

Figure 59 shows the start code detector 201 (SCD) interfaces with other blocks of circuitry of the system in accordance with the present invention. The SCD 201 can be thought of as providing three distinct functions. First, the SCD 201 provides an input circuit that receives data either from dedicated pins or from the MPI 320. Second, the SCD 201 detects start codes in the data, and third, the SCD provides the necessary circuitry to assemble the incoming data into a format to be used internally within the coded data buffer (CDB) 321.

Parser

Figure 60 illustrates the parser subsystem, in accordance with the present invention. Data which was formatted for the CDB 321 is unpacked and passed to the parser which receives instructions from the MPI 320. Thereafter, the data is passed via a two-wire interface to the rest of the system.

Spatial Processing

Figure 61 illustrates the components of the spatial processing circuitry. These components include an inverse modeler (Imodel) 325, an inverse zig-zag (IZZ) 326 and inverse quantizer (Iquant) 327 and an inverse discrete cosine transfer (IDCT) 328. The data passes into the Imodel 325, then to the IZZ 326, next to the Iquant 327 and then to the IDCT 328.

Display Circuitry

The display circuitry of the present invention is shown in Figure 62. This system includes a vertical upsampler 210, a horizontal scale subsystem 331, an output multiplexer 332 and a video timing generator 333.

Parallel Start Code Detector (scdp)

The start code detector 201, in accordance with the present invention, is a parallel start code detector, i.e., it passes data in parallel. This system is similar to that previously disclosed in British Application Serial No. 9405914.4 filed March 24, 1994, and EPO Applicaation Serial no. 92306038.8 filed June 30, 1992, (hereinafter "Brolly"). However, several major differences exist between the two start code detectors. First, byte alignment is assumed. There is no shifting of the data in order to find start codes in the present invention. Second, the present invention operates primarily with MPEG data. An MPEG (1 and 2) start code consists of a unique bit (byte pattern) in the bit stream known as the start_code_prefix. The pattern is 23 zeros followed by a one. The 8 bits immediately following the start_code_prefix is known as the start_code_value. This indicates the type of the start code. Start codes arriving at the SCD of the present invention are required to be byte aligned. Accordingly, the above data can be specified as a byte sequence. For example: 0x00 0x00 0x01 0xb8 is a group_start code.

Input Fifo

The present invention is designed such that given a peak data rate of 250 Kbytes/s and assuming that the coded data buffer does not overflow, the in_accept pin will never be pulled low. Hence, to calculate the length of the input fifo, it is necessary to know: 1) the worst case wait time for a swing buffer, and 2) the worst case data expansion through the SCD. With the input data arriving at the coded data clock rate, in accordance with the present invention, scdp will generate two stalls per start code (having removed three bytes from the data stream).

Input Circuit

The input circuit of the present invention performs exactly the same way as is disclosed in Brolly. However, there are a few differences of note between the two circuits. First, the upi won't be made to wait until a valid end of a token ('cause this may never set). Instead, it will be made to wait until a signal in_token is low. Second, generation of the DATA header, when entering byte mode, depends on there being some byte mode data.

Start Codes

In the present invention, the MPEG start codes are recognized and converted to tokens by the SCD. These are shown in Table 15. <tables id="tabl0019" num="0019"><img file="EP0891094A2_D0076.tif" /></tables>

Removal of Bit Stuffing

Any zero bits preceding a start_code_prefix are stuffing and can safely be removed. In the present invention, only complete bytes of stuffing are removed. For example, in the byte sequence shown below there are 13 stuffing bits, only 8 of which are actually removed. 0x20 / / 5 stuffing bits 0x00 / / 8 stuffing bits 0x00 0x00 0x01 / / start_code_prefix

Search Modes

The search_modes, in accordance with the present invention, are described as follows in Table 16: <tables id="tabl0020" num="0020"><img file="EP0891094A2_D0077.tif" /></tables> Any non-zero search mode causes all arriving data to be discarded until the desired class of start code is found. At this point, the search mode is reset to zero, and a start_code_search interrupt may be generated. A new control bit, stop_on_search, determines whether the SCD actually stops after generating the interrupt (the interrupt is also masked in the usual way, but stopping is not mandatory). In the present invention, search_mode is also set to zero if the SCD receives a FLUSH token. However, when the FLUSH token terminates discard_all, search_mode is completely reset, i.e., search_mode is reset by the combination of a FLUSH token and discard_all.

Non-aligned Start Codes

Any run of more than one zero bytes followed by a 0x01 is a start code. Furthermore, any run of greater than 23 zeros NOT followed by a one is a non-aligned start code. In the byte aligned world, this translates to: If, after removal of bit stuffing, 0x01 is not received, then the start code was non-aligned. Note that this statement actually misses some non-aligned start codes (where less than a byte of stuffing was involved).

Rather than going to the effort of describing in the data sheet which classes of non-aligned start codes are detected, the scdp of the present invention ignores them. In other words, stuffing is still removed.

Overlapping Start Codes

It is possible for the "value" part of a start code to form part of the "prefix" of a subsequent start code. This typically occurs for two reasons: 1) the standard allows system level start codes to occur anywhere in the stream - including directly in the middle of a video level start code, and 2) errors. Removing all erroneous looking start codes until the last one provides a better chance of error recovery. In the byte aligned environment, in accordance with the present invention, the only way an overlapping start can happen is if a picture_start (value = 0x00) forms part of another start code. In this scenario, the picture_start is removed from the data, and the second start code is decoded. If this, in turn, is overlapped then the same procedure applies until a non-overlapping start code is detected..

Unrecognized Start Codes

In the present invention, the reserved values (0xb0, 0xb1, 0xb6), all system start codes (0xb9 to 0xff), and the sequence_error code (0xb4) are each treated as unrecognized start codes. After removing the unrecognized start code, the SCD discards all incoming data until the next valid start code is found. It will also set the unrecognized_start error register and, depending on the unrecognized_start mask, will generate an interrupt.

Extension and User Data

Two configuration bits are used in the present invention: <ul id="ul0011" list-style="none" compact="compact"><li>1) Discard_user (or not)</li><li>2) Discard_extn (beyond MPEG2 main profile, main level)</li></ul> Both of these configuration bits are reset to ONE. MPEG2 extn start codes are different. The four bits following the extension_start_value are now an extension_start_code_identifier and must be decoded by the SCD. Four new tokens are generated to flag these. The allowed extension_start_code_identifiers and their respective tokens are shown in Table 17. However, reserved extension_start_code identifiers are not recognized. Unrecognized extension_start_codes are either discarded (depending on Discard_extn), or replaced with the (old) extension_data token. <tables id="tabl0021" num="0021"><img file="EP0891094A2_D0078.tif" /></tables><tables id="tabl0022" num="0022"><img file="EP0891094A2_D0079.tif" /></tables>

Insertion of PICTURE_END Tokens

None of the current standards (MPEG1,2, JPEG, or H.261) specify a way of ending a current picture. However, in the present invention, the SCD 201 maintains a piece of state called in_picture. This state is set whenever a PICTURE_START token is output by the SCD 201 . Any subsequent start code that is higher in the syntax than picture_start (or a FLUSH token) causes the generation of a PICTURE_END token. The PICTURE_END token is generated and output before any tokens associated with the new start code. in_picture is reset when the PICTURE_END token leaves the SCD 201. If the SCD 201 receives tokens in the input data stream, the action is logically identical - including receiving a PICTURE_END token. In summary, the start codes (and tokens) which may cause a PICTURE_END to be generated, in accordance with the present invention, are: picture_start_code OR token group_start_code OR token sequence_start_code OR token sequence_end_code OR token FLUSH token

Stop After Picture Interrupt

The stop after picture (sap) feature is of the present invention functions to facilitate a clean way of finishing off a current sequence, e.g.. channel change. It is necessary to accomplish this function as automatically as possible and without the need for external real time software. The sap control bit is referred to as a flag_picture_end. There are two control bits in addition to the flag_picture_end, mask, and error bits: <ul id="ul0012" list-style="none"><li>1) after_picture_stop: Determines whether, after generating the interrupt, the SCD stops.</li><li>2) after_picture_discard: Having generated a flag_picture_end interrupt, this bit determines whether scdp automatically goes into discard_all mode.</li></ul> In this way, discard_all mode doesn't need to know what event called it and it is possible to leave the discard_all mode and to proceed to a search mode quickly and cleanly. In accordance with the invention, whenever a PICTURE_END token is output by the SCD, the flag_picture_end bit determines whether any action is taken. If flag_picture_end is set, a FLUSH is generated after the PICTURE_END, and the event is generated. Interrupting depends on the flag_picture_end_mask, and (having interrupted) stopping depends on after_picture_stop. By way of example, for a channel change, the sequence of events is as follows: <ul id="ul0013" list-style="none"><li>1) Set flag_picture_end with after_picture_stop = 0 and after_picture_discard = 1.</li><li>2) Respond to flag_picture_end_event. <ul id="ul0014" list-style="none" compact="compact"><li>a) Set search mode to sequence (for example).</li><li>b) Retune, etc.</li></ul></li><li>3) Either FLUSH or s/w resets discard_all.</li><li>4) scdp searches for the start of the next sequence.</li></ul>

discard_all

An R/W control bit, discard_all, causes the scdp of the invention to discard all input up to and including a FLUSH token. This bit is automatically reset by a FLUSH token and may be set by the flag_picture_end function.

Tokens Recognized by scdp

While the primary function of most of the scdp of the present invention is related to actual token generation, there are, several tokens which when applied to the coded data port (or via the input circuit) are decoded and acted upon by the scdp. Table 18 illustrates and defines these tokens. <tables id="tabl0023" num="0023"><img file="EP0891094A2_D0080.tif" /></tables>

Scdp Memory Map

The various registers and their associated addresses for the scdp of the present invention are described in Table 19. <tables id="tabl0024" num="0024"><img file="EP0891094A2_D0081.tif" /></tables><tables id="tabl0025" num="0025"><img file="EP0891094A2_D0082.tif" /></tables><tables id="tabl0026" num="0026"><img file="EP0891094A2_D0083.tif" /></tables>

DataFlow Around the Coded Data Buffer

The present invention provides the following advantages: <ul id="ul0015" list-style="none"><li>1) A method of forcing the buffer to swing.</li><li>2) A way of avoiding having to pack bytes into an odd number of bits.</li><li>3) Reducing the width of the (potentially long) bus of the SCD down to 8 bits.</li><li>4) The SCD does its own packaging into 32 bit data. To avoid a large bus, this bit of the SCD sits inside the dramif. In the present invention, it is referred to as sccdbin. This module packs all DATA into 32 bit words, dead-reckoning in between non-DATA tokens.</li><li>5) The swing buffers do their own counting and swinging. The buffers flush in response to a signal, fill_and_swing, from sccdbin in response to a PICTURE_END or a FLUSH token (or signal).</li><li>6) The unpacking module, sccdbout, which sits prior to the Huffman Decoder, deletes all data following a FLUSH or PICTURE_END until it receives a buffer_start signal provided by the output swing buffer.</li></ul>

Introduction

This section defines the handling of time-stamp information, in accordance with the present invention.

Theory of Operation

In MPEG-2 video and audio, data is synchronized using information carried in the MPEG-2 systems stream. There are essentially two types of information that deal with synchronization; clock references and time-stamps. Clock references are used to inform the decoder what number is used to represent the time "now". This is used to initialize a counter that is incremented at regular intervals so that the decoder has, at all times, a notion of what the current time is. Time-stamps are carried for each of the streams of data that are used to make up the program (typically video and audio). In the case of video, a time-stamp is associated with a picture and it tells the decoder at what "time" (defined by the counter that was initialized by the clock reference) it should display the picture. However, as with all things in MPEG, the situation is rather more complicated than this. There are two types of clock references; Program Clock References (PCRs) and System Clock References (SCRs). Clock has information to a resolution of 90 kHz while the other clock has additional information to extend the resolution to 27 MHZ. Clock references are included in the data stream fairly often in order that "time" may be reinitialized after a random access or channel change. There are also two types of time-stamps: Presentation Time-Stamps (PTSs) and Decoder Time Stamps (DTSs). These only differ for I-pictures and P-pictures which have to be reordered (not B-pictures). The DTS tells you when to decode the picture, whereas the PTS tells you when to display it. In the simple case of frame pictures with no 2-3 pull-down effects, the difference between DTS and PTS of an I-picture or P-picture will be one more than the number of B-pictures that follow that picture frame periods. The important complication to appreciate is that the DTS and PTS refer to a hypothetical model of a decoder that can decode pictures instantly. Any real decoder cannot do this and must take steps to modify the theoretical time that it should display pictures (defined by the time-stamps and the clock references). This modification will depend on the details of the architecture of the decoder. Clearly any delay introduced by the video decoder must be matched by an equivalent delay in the audio decoder.

Discontinuities

Discontinuities in the concept "time" may occur. For instance, in an edited bitstream each edit point will have discontinuous time. A similar situation occurs at a channel change. Care must be taken because using a time-stamp that was encoded in one time regime with respect to a "time" defined by a clock reference from another regime will clearly lead to incorrect results.

Start-up

A particular problem occurs at start-up (or channel change) because there are two potentially competing requirements for starting to decode correctly. For video considerations, it is now necessary to start decoding with an I-picture that follows a system header (this may not be true in all situations, but is largely a correct statement) but for system considerations the first decoded picture ought to carry a time-stamp. However, there is no requirement that every picture carry a time stamp and, therefore, it is possible that one may wait for ever if they try and look for a picture that is both an I-picture and carries a time-stamp. One might think of calculating what the time-stamp would have been for an I-picture from a picture that precedes it that does have a time-stamp. Unfortunately this is very difficult to do because it would be necessary to partially decode the intervening pictures to determine whether they are field or frame pictures (and whether repeat_first_field is set). This requires that the data go through the coded data buffer and be discarded by the Huffman Decoder.

Embodiment

Figure 63 shows a first embodiment for implementing time-stamp management. The clock references 253 are decoded by the system demultiplex 254 of the present invention and placed into a counter 255, incremented at 90 kHz, that represents time. They are also loaded into a second copy of the counter 258 that is located inside the video decoder 270. The time-stamps flow through the video buffer 271 so that they are delayed by the same amount as the video data. These are then compared with the local copy of time to determine whether the picture is too early or too late. Another embodiment, in accordance with the present invention, is shown in Figure 64. This avoids the need for the clock references 253 to be passed to the video decoder 270. This is achieved by using a second counter "vid_time" 272, 273 which is maintained both in the video decoder 270 and the system decoder 256. They are reset at power on and then free run from there on. Since this embodiment requires that the two counters stay in step, it is necessary to take steps to ensure they do not get out of step. This can be accomplished using carry out of the counter in the system demux to reset the one in the video decoder (as shown). Another advantage of this embodiment is that there is no need for the full 33 bits of the number to be dealt with. The ideal would be to restrict the counters to 16 bits to allow 16 bit handling on the video decoder 270. Although this would appear to represent an insufficient number range at a resolution of 90 kHz (only 2/3 second), there is no need for such high precision because on the video decoder, the time control is only accurate to a field time either way since the VTG free-runs (or is gen-locked to something that has nothing to do with the MPEG stream being decoded). As a result, it seems that the lower order few bits of the time-stamp going to the decoder can be discarded. In the present invention, four bits are discarded. This means that the video decoder uses 16 bits of a 20 bit number. The resolution is, thus, 5625 Hz and can represent a time difference of 11.65 seconds. Therefore, a PAL field is 112.5 ticks of the 5625 Hz clock. An NTSC field 93.84 ticks. Hence, it is still possible to achieve timing calculations to an accuracy of about 1% of a field time which is adequate for the present invention.

Hardware

Figure 65 shows the hardware in accordance with the present invention. There are two modules in addition to those disclosed in Brolly. The first is added just after the start code detector 201. It is responsible for generating a token. A TIME_STAMP token occurs just before a PICTURE_START token. In the MPEG systems stream, the time-stamp is carried in a packet header and refers to the first picture in the packet of data. Since the packets do not line up with the video data there will, in general, be the end of the previous picture before the start of the picture to which the time-stamp refers. The time-stamp information may be supplied to the system of the present invention either via the microprocessor interface or by using a Token. In either case, the time-stamp data (16 bits) is stored in a register. A flag is set to indicate the fact that valid time-stamp information is in the register. If the data was supplied using the TIME_STAMP token then that token is removed from the stream of tokens. When a PICTURE_START token is encountered, the flag that indicates the status of the register is examined. If it is clear, then no action is taken and the PICTURE_START token and all subsequent data is unaffected. If, however, the flag indicates that valid time-stamp information is available in the register, then a TIME_STAMP token is generated before the PICTURE_START token. The flag is then cleared and is available for the next time-stamp that occurs. The second hardware module is associated with the microprogrammable State Machine 218. This is simply a series of counters clocked from the 27 MHz decoder clock. The first is a prescaler that divides the clock by 4800 (the 4804.8 option shown in the diagram is discussed later). 4800 is simply 300 (27 MHz/90 kHz) times 16. The second counter is the time counter and is incremented each time that the prescaler 278 output clock. It is reset by the reset_time pin. The counters in this section should probably be implemented with fully clocked feed-back flip-flops (SYNC's) which are much more resistant to a-particle corruption than the weak-feedback latches used elsewhere. (This is because of concern that the time counter in Brian might get out of step with that in the system decoder). The microprogrammable State Machine 218 is able to read the current time indicated by the time counter and compare it with the value supplied by the TIME_STAMP token. It can therefore determine whether it is early or late compared to the time at which if should be decoding the pictures. The registers for use in the SCD 201 relating to time stamps are shown in Table 20. <tables id="tabl0027" num="0027"><img file="EP0891094A2_D0084.tif" /></tables><tables id="tabl0028" num="0028"><img file="EP0891094A2_D0085.tif" /></tables>

MSM Handling of Time-Stamp Information

This section details the function of the MSM 218, in accordance with the present invention, when it receives the TIME_STAMP token. First, a 16-bit signed time-stamp correction is added to the time-stamp that was carried by the TIME_STAMP token. This correction is reset to zero by the MSM 218 at chip-reset and, if no action is taken, the time-stamps are unaltered. The controlling microprocessor may, however, write any value into this register to modify the time-stamp and, therefore, compensate for differential delays through the video and audio decoders. Next, the corrected time-stamp is subtracted from the current time. The sign of this gives the direction of the error (and determines the error code, if any, generated by the MSM 218). The absolute value of the difference is then taken and the result is compared to the frame time. If the result is less than the frame time, no action is taken. As previously discussed, time can only be controlled to an accuracy of plus or minus a frame time from the nominal time because the VTG free-runs. In the present invention, if the error exceeds a frame-time, then some correction must be made. The MSM 218 can correct the situation itself if the decoding is too early since it can simply delay the decoding until the appropriate time. However, if the decoding is later than the intended time, then this is more difficult because it is not possible to discard pictures reliably at the output of the coded data buffer. Essentially, the decoding of the sequence is broken and the most reliable way to correct the situation is to restart the decoding process in a manner similar to random-access or channel change. In order to facilitate this procedure, the control register of the MSM 218 may be programmed to discard all data until a FLUSH token is encountered.

Start-up

If the MSM 218, in accordance with the present invention, receives a time-stamp at a time which it recognizes as a start-up situation (e.g., after reset, following a SEQUENCE_END token or FLUSH token and it is still before the first PICTURE_START) then the action of the MSM 218 may be modified. If the time-stamp indicates that decoding should have occurred earlier than the current time, then the situation is handled in the same way as detailed above. However, if the time-stamp indicates that the decoding still remains to take place after the current time (which is the normal situation on start-up), then the decoder will wait until the correct time even if the error is less than one frame-time. In this way, it is possible to set the nominal decoding time as accurately as possible to the correct time. Subsequent pictures may then be decoded, up to one frame-time before or after their nominal time, without any error situation being triggered. In addition, in the present invention the error "ERR_TOO_EARLY" is not generated during start-up (since it is expected that decoding would be early) irrespective of the setting of disable_too_early.

MSM Time-stamp error codes

As a result of the time-stamp handling, it is possible that one of two errors will be generated. ERR_TOO_EARLY is generated if the decoding is taking place earlier than the time indicated by the time-stamp. ERR_TOO_LATE is generated if the decoding is taking place later than the time indicated by the time-stamp. ERR_TOO_EARLY may be suppressed, but ERR_TOO_LATE will always be generated unless all errors are masked out. Table 21 describes the various time-stamp registers associated with the Microprogrammable State Machine, in accordance with the present invention. <tables id="tabl0029" num="0029"><img file="EP0891094A2_D0086.tif" /></tables><tables id="tabl0030" num="0030"><img file="EP0891094A2_D0087.tif" /></tables>

Support for 30 Hz

The present invention does not support a 30 Hz frame rate properly. However, it will be appreciated by one of ordinary skill in the art, that the invention may decode 30 Hz data if the clock generation circuitry is modified appropriately. In this case, the system is clocked with a 27.027 MHz clock so that the typical CCIR-601" raster produces pictures at precisely 30 Hz. In order to accommodate the 27.027 MHz clock, it must be divided by 300.3 to provide the 90 kHz clock. Since the present invention scales this value by a factor of sixteen, it is necessary to divide the clock by 4804.8.

Introduction

This section details a Micro-codeable State Machine (MSM), in accordance with the present invention. The aim of building the MSM was to produce a machine that with small amendments can be used in a number of applications such as a VLC decoder and address generators. The MSM of the present invention is of a general purpose nature providing support to a wide range of features. However, the underlying structure of the MSM is modular, allowing flexibility in building. Accordingly, those of ordinary skill in the art will appreciate that the present invention can be used with a variety of applications. As shown in Figure 66, the system design is segmented into two sections. The first is a State Machine 218. This generates instructions that are passed to a data processing pipeline under the control of a two-wire interface as previously disclosed in the Brolly application and incorporated by reference herein. The second section is an Arithmetic Core 219, comprising an ALU 222 and associated register file 221. This Arithmetic Core 219 is part of the data processing pipeline. It accepts data and instructions under the control of two 2-wire interfaces.1 It generates data at its output under the control of a two-wire interface. Bringing these two components together allows the definition of the complete ucode word. 1 If the State Machine is also controlling upstream blocks, these two 2-wire interfaces may be combined.

State Machine

The State Machine 218, in accordance with the present invention, provides instructions to the Arithmetic Core 219. It also provides instructions to control itself in the progression through the instructions. The address of the instruction being passed to the Arithmetic Core 219 is held in the Program Counter. The program counter resets to 0x00 and proceeds continuously through the address. However, "jump" or "call" instructions and/or "interrupt/error" events can cause the Program Counter to reload, hence altering the order of instruction execution. The State Machine 218 allows for up to 4096 instructions in the present invention. However, it will be appreciated by those skilled in the art that other amounts of instructions may also be used and this is not intended to act as a limitation.

Jumps and Calls

In this implementation, all instructions are conditional jump instructions. A condition is evaluated for every instruction to determine whether or not to jump (i.e., reload the Program Counter). The two conditions "True" and "False" are provided to unconditionally jump or not jump respectively. The remainder of the conditions (sixteen in total) are based on tests on the Status bus. If the condition is not "true" or "false," the State Machine 218 will wait until the Arithmetic Core 219 has executed the instruction and fed the status bus back to the State Machine for testing against the condition. These conditions are shown belo in Table 22. <tables id="tabl0031" num="0031"><img file="EP0891094A2_D0088.tif" /></tables><tables id="tabl0032" num="0032"><img file="EP0891094A2_D0089.tif" /></tables> If a jump is taken on an instruction with the call bit set, the next address, had the jump not been taken, will be stored as the return address. Accordingly, this forms a mechanism for routine calling. To return from the routine to the stored address, a call is made to address 0x001. Calling is only supported to a depth of one call, i.e., only one return address can be stored. Nevertheless, calling from calls, although erroneous, is not checked for in the hardware.

Interrupts and Errors

In the present invention, if the interrupt/error wire sampled high, an unconditional jump is made to the interrupt/error address (address 0x001). The next address that was to have been taken without the interrupt/error is stored. To return from the interrupt/error routine, is a jump to the interrupt address (0x001) is performed. The State Machine 218, in accordance with the present invention, is hardwired to execute as either an interrupt or error routine. The difference is that interrupt routines mask out other interrupts while executing, whereas error routines do not. The State Machine 218 is currently wired as an interrupt rather than an error pin.

Jump Addresses

The address loaded into the Program Counter is the Jump address. The twelve bits of this address are contained in a ucode field. It can either be an absolute address or it may have portions substituted into it from the output of the ALU 222. If an address is to be substituted, the State Machine 218 will wait until the Arithmetic Core 219 has executed the instruction and fed the ALU 222 output to the State Machine for the substitution. The format of the address, in accordance with the present invention, is shown in Table 23, "Jump Address substitution". The bits marked "a" indicate absolute address bits. The remaining address bits of lesser significance will be substituted. The LSB marked "s" is the substitute bit. <tables id="tabl0033" num="0033"><img file="EP0891094A2_D0090.tif" /></tables> The address substitution feature of the present invention allows the construction of jump tables.

State Machine Internal Instructions

It may be desired to perform repeated conditional tests on the status bus. These instructions are internal to the State Machine 218 and require stable feedback from the Arithmetic Core 219. Therefore, these type of instructions can be marked as non-valid for the Arithmetic Core 219, which will then fail to execute them. Accordingly, a "valid" bit is provided to mark instructions as valid for the Arithmetic Core 219.

State Machine Testing

In the present invention to enable the State Machine's 218 operation to be verified, a number of registers will be accessible to the microprocessor bus. Access may be gained by setting the "access" register to one and then polling the register until it reads back this value. The State Machine is then halted and it is safe to access. The machine can be restarted by writing zero to the "access" register. When the microprocessor has access, it can read and write to the following registers: <ul id="ul0016" list-style="dash" compact="compact"><li>the program counter</li><li>the call return address</li><li>the interrupt return address</li><li>the interrupt status bit (i.e., stating whether a interrupt is in progress)</li><li>all bits of the ucode</li></ul> Table 24 describes the various addresses of these registers. The State Machine 218 can also stop itself by generating a microprocessor event. Only if the event's mask bit is set will the machine halt. Access should then be gained in the normal way when servicing this event. An event can be brought about by a call to the reset address (0x00). The call will not actually be taken, but simply generate the event after the instruction is executed. It will, nevertheless, remain at the output of the instruction ROM for inspection. The State Machine 218 of the present invention possess a mode in which it will single step through its instructions. Single stepping is initiated by setting bit 0 of the MSSR register. The machine will then stop before each instruction. The stopped state is indicated by "1" = Stopped. The instruction about to be executed will then be at the output of the instruction ROM and is able to be changed via microprocessor access. To restart the machine, write "1" to bit 1 of the MSSR register. Both of these bit registers are synchronized and, therefore, require microprocessor access before they can be accessed.

State Machine Ucode Map

Table 25 shows the microcode map for the State machine of the present invention. <tables id="tabl0034" num="0034"><img file="EP0891094A2_D0091.tif" /></tables>

State Machine ucode word

Similarly, Table 26 depicts the State machine microcode word, in accordance with the present invention. <tables id="tabl0035" num="0035"><img file="EP0891094A2_D0092.tif" /></tables> where: a = address; s = substitute an address; c = call or jump; condition = jump condition code; and v = instruction valid for Arithmetic Core

Arithmetic Core

In the present invention, the Arithmetic Core 219 performs all the data manipulation within the MSM 218. As shown in Figure 67, the general structure of the Arithmetic Core 219 includes functional blocks which select their inputs from the available buses and provide a bus as output. The Arithmetic Core 219 is 32 bits wide, and is built from bit-slices which allows 8, 16, 24 or 32 bit data paths to be constructed in other implementations. As depicted in Figure 68, the Arithmetic Core 219 of the invention has three main functional blocks: the token port 360, for communicating with the data stream; the ALU 222 (and possibly other functions) for executing computations; and the Register File 221 which contains all the registers. All output buses are labeled in Figure 68. Inputs to blocks are selected from these buses. The size of these selectors and their inputs can vary and are under ucode control.

ALU

The ALU block 222, in accordance with the present invention, is responsible for all the computations and number manipulations in the arithmetic core. It allows quite complicated computations (such as recirculating, multiplication and division) to be performed by a combination of relatively simply operations (i.e., shifting, conditional inversion and addition). Each of these blocks is described below. Examples are then provided as to how these may be used in the Arithmetic Core 219, as a whole, to perform the more complicated computations.

Shift Block

In the present invention, the "shift" block allows for a 1 bit left shift, a right shift, or no shift. The 1 bit bus K is rotated into the word as if it were an extra bit. This is shown in Table 27. <tables id="tabl0036" num="0036"><img file="EP0891094A2_D0093.tif" /></tables><tables id="tabl0037" num="0037"><img file="EP0891094A2_D0094.tif" /></tables> If ss = 0b01 a "NOP" is signaled to the ALU 222 as a whole. This is a No Operation and will prevent any status flags begin altered from the last operation.

Carry Block

The Carry block either takes the carry bit from status registers or clears it. In single word addition and subtraction operations, the carry bit will be cleared, while in multiple word operations, the carry generated by the previous operation (and stored in the status flags) will be used as the carry. This is depicted in Table 28. <tables id="tabl0038" num="0038"><img file="EP0891094A2_D0095.tif" /></tables>

Condition Block

In accordance with the present invention, the block conditions, the Augend and the Carry to the ALU core functions are defined in Table 29. <tables id="tabl0039" num="0039"><img file="EP0891094A2_D0096.tif" /></tables><tables id="tabl0040" num="0040"><img file="EP0891094A2_D0097.tif" /></tables>

ALU Core

The ALU core 222 of the present invention performs a simple set of logic and arithmetic functions using two's complement arithmetic. These are defined in Table 30. <tables id="tabl0041" num="0041"><img file="EP0891094A2_D0098.tif" /></tables> From the result of the ALU core 222, four status flags are generated. (See Table 31.) These are both stored in the Register File 221 (as shown in Table 36) and are sent back to the State Machine 218 for comparison with condition codes. <tables id="tabl0042" num="0042"><img file="EP0891094A2_D0099.tif" /></tables>

ALU Ucode Word

Table 32 illustrates the ALU microcode word. <tables id="tabl0043" num="0043"><img file="EP0891094A2_D0100.tif" /></tables> where ss is the shift block controls ii is the condition block controls ff is the ALU core controls c is the carry block controls

Use of the ALU

Table 33 describes the bits patterns for the various functions of the ALU, in accordance with the present invention. <tables id="tabl0044" num="0044"><table frame="all"><title>Table 33</title><tgroup cols="8" colsep="1" rowsep="0"><colspec colnum="1" colname="col1" colwidth="19.68mm" /><colspec colnum="2" colname="col2" colwidth="19.68mm" /><colspec colnum="3" colname="col3" colwidth="19.68mm" /><colspec colnum="4" colname="col4" colwidth="19.68mm" /><colspec colnum="5" colname="col5" colwidth="19.68mm" /><colspec colnum="6" colname="col6" colwidth="19.68mm" /><colspec colnum="7" colname="col7" colwidth="19.68mm" /><colspec colnum="8" colname="col8" colwidth="19.68mm" /><thead valign="top"><row rowsep="1"><entry namest="col1" nameend="col1" align="left">Bit number</entry><entry namest="col2" nameend="col2" align="center">6</entry><entry namest="col3" nameend="col3" align="center">5</entry><entry namest="col4" nameend="col4" align="center">4</entry><entry namest="col5" nameend="col5" align="center">3</entry><entry namest="col6" nameend="col6" align="center">2</entry><entry namest="col7" nameend="col7" align="center">1</entry><entry namest="col8" nameend="col8" align="center">0</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left">Addition (I+J)</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">0</entry><entry namest="col6" nameend="col6" align="right">0</entry><entry namest="col7" nameend="col7" align="right">0</entry><entry namest="col8" nameend="col8" align="right">0</entry></row><row><entry namest="col1" nameend="col1" align="left">Subtraction (I-J)</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">0</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="right">0</entry><entry namest="col7" nameend="col7" align="right">0</entry><entry namest="col8" nameend="col8" align="right">0</entry></row><row><entry namest="col1" nameend="col1" align="left">Multiplication</entry><entry namest="col2" nameend="col2" align="right">1</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">1</entry><entry namest="col5" nameend="col5" align="right">0</entry><entry namest="col6" nameend="col6" align="right">0</entry><entry namest="col7" nameend="col7" align="right">0</entry><entry namest="col8" nameend="col8" align="right">0</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">Division</entry><entry namest="col2" nameend="col2" align="right">1</entry><entry namest="col3" nameend="col3" align="right">0</entry><entry namest="col4" nameend="col4" align="right">1</entry><entry namest="col5" nameend="col5" align="right">1</entry><entry namest="col6" nameend="col6" align="right">0</entry><entry namest="col7" nameend="col7" align="right">0</entry><entry namest="col8" nameend="col8" align="right">0</entry></row></tbody></tgroup></table></tables>

Figure 69 illustrates the register file 221 of the present invention. The register file 221 contains 64 thirty-two bit word registers. The register file 221 can address partial words, i.e., the file can be addressed as 64 x 32 bit, 128 x 16 bit, 256 x 8 bit, 512 x 4 bit, 1024 x 2 bit, or 2048 x 1 bit formats. The address is provided directly from the ucode or the address may have portions of it substituted into from special registers. This allows indexed access of the register. At each instruction, a read-modify-write will be done on a single register. The read-modify-write facilitates the writing of partial words back into the file. The source of the write is determined by an external multiplexer with its own independent ucode. If no write is desired, the output of the register file 221 should be selected by the multiplexer. Partial words will be treated as signed or unsigned numbers dependent on bit 0 of the mode register. If the partial word is negative (i.e., it has its MSB set) it will be sign extended up the full width of the bus. This allows the easy use of partial words in arithmetic. Three locations in the register file 221 of the present invention are also connected to a dedicated bus, but they are still allowed to be used in parallel with other register file locations. These are the A and B registers and the status register shown in Figure 69. The register file also contains the index registers for address substitution with accompanying terminal count registers, constant registers and a mode register specifying modes of the register file.

The addressing, in accordance with the present invention, must cope with two different features: variable length addresses for accessing varying width portions of words, and address substitution. To address partial words requires a longer address. Therefore, all addresses are of variable length and they are encoded as follows: where "a" is an address bit, the least significant of the address bits is "S", the substitution bit. <tables id="tabl0045" num="0045"><img file="EP0891094A2_D0101.tif" /></tables> The addressing is big endian. That is to say the higher, more significant portions of the words are addressed with lower addresses. Portions of the addresses "a...a" can be substituted with one of the index registers. Using an address of an eight bit word as defined in Table 34 as an example, Table 35 shows how to define the number of least significant bits which are to be substituted. All trailing zeros are substituted. <tables id="tabl0046" num="0046"><img file="EP0891094A2_D0102.tif" /></tables> For example, substituting 4 bits into a thirty-two bit address would have the form 0b000001aaa01111 or substituting zero bits into a one bit address 0b1aaaaaaaaaaaa0. In the invention, the substitution will come from one of the two eight bit index registers, which is specified in the register files ucode word. It can, therefore, be seen that a maximum of eight bits can be substituted into an address. It can also be seen that with the above scheme, it is possible to use illegal addresses, such as 0b0000000000000 or 0b11111111111111. Illegal addresses will result in no address being accessed, leaving the output bus of the register file unknown.

In the present invention, there are a plurality of register file register types. Each is described as follows:

• Independently bused registers

Three registers (A, B, and Status register) have their own dedicated buses, as well as being accessible in the normal way in the register file. This allows the registers to be connected to more places in the arithmetic core 219 and to be accessible in parallel to others in the register file. The independent buses can only access the registers in their full width, i.e., 32 bits wide. There is no ucode write enable to these registers. Writing to them is only by way of an external multiplexer which has its own ucode control word. To prevent a write, they must be written to with their own value as shown in Figure 70. When the independent bus registers are written to as if in the register file, the independent bus write is suppressed. The Status register is implemented as an independent bus register. The bits of the register are defined in Table 36. <tables id="tabl0047" num="0047"><img file="EP0891094A2_D0103.tif" /></tables>

• Index and terminal count registers

Two eight bit Index registers are provided for substituting into addresses. One of these can be incremented per instruction under the control of the ucode. Furthermore, each is accompanied by a terminal count register. When the register incremented is passed, its terminal count will be reset to zero. The index registers are called Y and Z which have terminal count registers U and V, respectively. All of these can be accessed in the register file. Index register Z has a predefined decoder attached to its output (at present this decode is an inversion). Dependent on the Index_Mode in the mode register (bit 1), this decoder rather than the index registers, will be used in address substitution and read from Z in the register file. (Index_Mode = 1 read decode, Index_Mode = 0 read count)

• Constant registers

In the present invention, sixteen of the register file's 32 bit locations will be predefined constants. These may be read out as normal registers. Writing to these locations will have no effect. (The constants selected for the current embodiment are 0-7. However, it will be appreciated that other numbers of constants may be used.) This implementation of constants in accordance with the present invention, does away with the need for a constant field in the ucode and for a constant bus in the arithmetic core. It does, however, limit the number of constants useable in the program. (The number 16 is negotiable.) These constants are programmed on a per instance basis. Furthermore, very frequently used values could be connected to multiplexers, if necessary.

Register File Address Map

Table 37 shows the Register File address map for the present invention. <tables id="tabl0048" num="0048"><img file="EP0891094A2_D0104.tif" /></tables><tables id="tabl0049" num="0049"><img file="EP0891094A2_D0105.tif" /></tables>

Register File Ucode Word

Table 38 shows the Register File microcode word for the present invention. <tables id="tabl0050" num="0050"><img file="EP0891094A2_D0106.tif" /></tables> where <dl id="dl0001" compact="compact"><dt>a</dt><dd>= whole register file address (always 12 bits)</dd><dt>s</dt><dd>= substitute bit</dd><dt>r</dt><dd>= index register to use for substitution; select Y, Z index registers if n = 0, 1 respectively</dd><dt>I</dt><dd>= increment index register specified by r</dd></dl>

Token Port

The Token Port of the present invention is the arithmetic core's connection to the data stream. It is a two-wire interface connection. The data at the Token Port input is only defined during a Token Port reading cycle. It should, therefore, be used during read cycles only. If the input port does not contain valid data during a read cycle or the output port is not accepting during a write cycle, the Arithmetic Core will stall. Accordingly, it will perform no operation, read no new ucode word, and write no registers. It will only restart when these conditions do not exist.

Token Port Ucode Word

Table 39 depicts the Token Port microcode word. <tables id="tabl0051" num="0051"><img file="EP0891094A2_D0107.tif" /></tables> where <dl id="dl0002" compact="compact"><dt>I</dt><dd>= read into input port</dd><dt>O</dt><dd>= write from output port</dd></dl>

Multiplexers

The selection of sources for blocks is done by the use of multiplexers. Almost all combinations of bus are allowed (with the exception that the input to functional blocks, e.g., the ALU must be from storage blocks, e.g., Token Port or Register File). The multiplexers are either 2, 4 or 8 input. They, therefore, use 1, 2, or 3 bits of ucode word, respectively, to control their selection of inputs.

UPI Memory Map

Table 40 shows the MSM address map, in accordance with the present invention. <tables id="tabl0052" num="0052"><img file="EP0891094A2_D0108.tif" /></tables><tables id="tabl0053" num="0053"><img file="EP0891094A2_D0109.tif" /></tables>

Introduction

In the MPEG coding standards (both EGMP-1 and MPEG-2) the quantized coefficients are coded as "events". Each event is coded as a RUN and a LEVEL. The RUN is the number of zero coefficients that precede a given non-zero coefficient. The LEVEL is the value of that coefficient. In addition, one special event, End-of-block, is used after the last non-zero coefficient to indicate that the remainder of the block is all-zeros. For example, assume the following sequence of coefficients: 1, -7, 0, 3, 0, 0, 0, -1, 0, 0, 0, 0, ...0 (total of 64 coefficients) These would be modeled by the following events represented as (RUN, LEVEL): (0, 1) (0, -7) (1, 3) (3, -1) (EOB) It is the task of the inverse modeler to reverse the modeling process such that each of the 64 coefficients is represented as a simple number for subsequent processing.

Interfaces

The following signal pins are used to transfer data into the inverse modeler of the present invention: <ul id="ul0017" list-style="bullet" compact="compact"><li>level [11:0]</li><li>run[5:0]</li><li>in_extn</li><li>in_valid</li><li>in_accept</li></ul> Tokens are transferred on the level[11:0] bus (in the lower order eight bits; level[7:0]). run[5:0] serves as an auxiliary bus to carry the RUN information. It has no meaning except in the data words of a DATA token. The following signals are used at the output of the inverse modeler: <ul id="ul0018" list-style="bullet" compact="compact"><li>out_data[11:0]</li><li>out_extn</li><li>out_valid</li><li>out_accept</li></ul>

Functional Description

Data in DATA tokens is expanded so that there is always 64 coefficients in the DATA token presented at the output of the inverse modeller. In most cases, the last data word of the DATA token will not cause the 64th coefficient to be generated. This is not an error, it is just that at this point the EOB event would have been coded in the bitstream. Therefore, in this situation the inverse modeller must continue to output zero data token words until a total of 64 coefficients have been produced at the output. In certain circumstances (e.g., when a data error occurs) it is possible for the DATA token at the input to the inverse modeller to represent more than 64 coefficients. In this situation, the modeller must discard all the extra data and produce a token at its output that contains just 64 coefficients. All non-DATA tokens that appear at the input are simply transferred, unmodifed, to the output of the inverse modeller.

Timing Requirements

It is a requirement of the present invention that data flow through the inverse modeller at the clock rate. In the situation where there are no gaps at the input to the Imodel and the circuity connected to the output does not cause the Imodel to stall (i.e., in_valid = 1, out_accept =1) then a new data word will appear at the output of the Imodel every clock cycle. Note, however, that in this situation, the Imodel may not accept new data at its input on every single clock cycle because a non-zero RUN (in a DATA token) will cause more than one data word to be produced for each input.

Microprocessor Interface Access

The inverse modeller circuitry of the present invention is not required to be connected to the MPI in its normal mode of operation. Note that the error condition (too many coefficients) should not produce a microprocessor interrupt. It is simply dealt with internally by discarding the extra data. However, microprocessor access will be required for the snooper (test) circuitry at the input of the block.

Introduction

In the MPEG coding standards, the coefficients are "zig-zag" scanned so that the lower frequency coefficients are transmitted before the higher frequency coefficients. It is the function of the inverse zig-zag, in accordance with the present invention, to convert the one-dimensional stream of coefficients it receives from the inverse modeller into a two-dimensional array of coefficients that can be processed by the IDCT. In MPEG-1, only one scan path was used, this was literally a zig-zag (hence, the name). MPEG-2, however, uses two scan paths. The first is the original MPEG-1 path, the second is optimized for use in interlaced coding where there tends to be unusually large vertical frequency components. In addition to the coefficients which are obviously transmitted in zig-zag scan order, the quantization matrices are downloaded in zig-zag scan order as well. This occurs in MPEG-1, H.261 and JPEG. As a result, the present invention has its quantizer before the inverse zig-zag (which was implemented as part of the IDCT). The quantizer, therefore, operates on a one-dimensional stream of coefficients which arrive in the same order as the downloaded quantization matrix coefficients. Hence, the quantizer simply has to associate the first coefficient with the first matrix element, the second coefficient with the second matrix element, and so forth. However, since there are now two scan paths in MPEG-2, a new approach was taken on the present invention in which the inverse zig-zag precedes the inverse quantizer. Both the coefficients and the downloaded matrices are inverse scanned and the inverse quantizer now operates on the two dimensional data. It should be noted that this is only possible because in all three representations of the data (two zig-zag scans and the raster-scan order at the output of the IZZ) the first coefficient is always first and the last coefficient is always last. The first coefficient is specially treated in the Iquant because it is the DC term. The last coefficient is specially treated because it may need to be modified as a result of mis-match control as a function of the values of all the other coefficients (so it must be last!). The 62 remaining coefficients are all handled in the same manner (excepting that each has its own quantization matrix element).

Interfaces

The following signals are used at the input of the inverse zig-zag of the invention: <ul id="ul0019" list-style="bullet" compact="compact"><li>in_data[11:0]</li><li>in_extn</li><li>in-valid</li><li>in-accept</li></ul> The following signals are used at the output of the inverse zig-zag: <ul id="ul0020" list-style="bullet" compact="compact"><li>out_data[11:0]</li><li>out_extn</li><li>in_valid</li><li>out_accept</li></ul>

Functional Description

The IZZ responds to the following tokens. <ul id="ul0021" list-style="bullet" compact="compact"><li>PICTURE_START</li><li>ALTERNATE_SCAN</li><li>DATA</li><li>QUANT_TABLE</li></ul> All other tokens are passed, unmodified, through the IZZ. The PICTURE_START token causes the IZZ to reset its internal state which represents which of the two scan paths is in force (e.g., alternate_scan) to zero (indicating the MPEG-1 scan). ALTERNATE_SCAN is a token which can be allocated the value 0xe6 with a mask 0xfe. The ALTERNATE_SCAN token is shown in Table 41. <tables id="tabl0054" num="0054"><img file="EP0891094A2_D0110.tif" /></tables> "s" is the indication of which scan to use for subsequent DATA tokens and is, therefore, loaded into the IZZ register "alternate_scan". DATA tokens are re-ordered according to scan path zero (the MPEG-1 scan path) irrespective of the setting of alternate_scan. Note that alternate_scan must retain whatever value it had (i.e., must not be set to zero) so that subsequent DATA tokens are correctly handled. QUANT_TABLE tokens are re-ordered according to scan path zero (the MPEG-1 scan path) irrespective of the setting of alternate_scan. Note that alternate_scan must retain whatever value it had (i.e., it must not be set to zero) so that subsequent DATA tokens are correctly handled.

Mal-formed Tokens

Both the DATA and QUANT_TABLE tokens may be malformed. Clearly, the DATA token should be correct since the Imodel should have ensured that it is correctly formed. However, no such assurance is available for QUANT_TABLE. Since handling the malformed QUANT_TABLE tokens must be implemented, it should also be implemented for DATA tokens as well. In accordance with the present invention, DATA and QUANT_TABLE tokens are too short when they appear at the input to the IZZ should result in a token at the output with the correct number (64) of data words. The data contained in those words is unimportant and will probably be whatever junk happened to be in the reordering RAM before the start of the token. Similarly, DATA and QUANT_TABLE tokens that are too long should also result in correctly formed tokens at the output. The first 64 coefficients (matrix elements) should be used, the remainder should be discarded. Following a mal-formed token, all subsequent (correctly formed) tokens should be handled properly. There is no requirement for a microprocessor interface error (interrupt) to be generated.

Raster Scan Order

At the output of the IZZ, the DATA and QUANT_TABLE tokens of the present invention represent two-dimensional data. However, the coefficients are still actually transferred as a one-dimensional series of numbers. The question arises whether the data should be transferred as rows or as columns. The prediction circuitry will require the pel-domain data to be organized in raster-scan order. Since the IDCT transposes the data it follows that the data going into the IDCT must be the other way around. Table 42 illustrates the order of the coefficients transferred at the output of the IZZ for DATA and QUANT_TABLE tokens. <tables id="tabl0055" num="0055"><img file="EP0891094A2_D0111.tif" /></tables>

Microprocessor Interface Access

There is no requirement for microprocessor access in the normal functioning of the IZZ. However, access will probably be required so that the reordering RAM can be tested. It is also expected that there will be no requirement for a snooper. The one at the start of the Imodel is sufficient for both blocks.

Introduction

This section deal with predictions. In this introductory section, all possible prediction modes are enumerated and diagrams are provided for each one to explain exactly what must be done. Throughout this section no special attention is given to operations, such as half-pel filtering, that occur in the horizontal dimension. This is because these operations are the same as those on Brolly In the vertical dimension, however, things are very different because of the interlaced picture format.

Prediction in Frame Pictures

Frame-based Prediction

In this mode, a prediction is formed from a reference frame. The result is as if the two reference fields were first combined into a frame and then a prediction were made from that frame. Note that this is precisely the situation as described in Brolly. Half-pel filtering may be made in the vertical direction and this is triggered by the least significant bit of the vector. In addition to the least significant bit, the next most significant bit (bit 1) has special significance since this will determine whether the top line of the prediction comes from the top reference field or the bottom reference field. Thus, four cases have to be considered, each dependant upon the binary value of the least significant two bits of the vertical vector<maths id="math0070" num=""><math display="block"><mrow><mtext>vector[1] = 0, vector[0] = 0</mtext></mrow></math><img file="EP0891094A2_D0112.tif" /></maths> As shown in Figure 71, just 16 lines (8 for the chroma) are read (since there is no half pel filtering. 8(4) lines from each reference field.<maths id="math0071" num=""><math display="block"><mrow><mtext>vector[1] = 0, vector[0] = 1</mtext></mrow></math><img file="EP0891094A2_D0113.tif" /></maths> Likewise, as shown in Figure 72, 17(9) lines are read, 9(5) lines are read from the top reference field, 8(4) lines from the bottom reference field.<maths id="math0072" num=""><math display="block"><mrow><mtext>vector[1] = 1, vector[0] = 0</mtext></mrow></math><img file="EP0891094A2_D0114.tif" /></maths> Again, as shown in Figure 73, just 16(8) lines are read but note that now the top line of the prediction has been read from the bottom reference field.<maths id="math0073" num=""><math display="block"><mrow><mtext>vector[1] = 1, vector[0] = 1</mtext></mrow></math><img file="EP0891094A2_D0115.tif" /></maths> And, Figure 74 shows 17(9) lines are read, 8(4) lines are read from the top reference field, 9(5) lines from the bottom reference field. Accordingly, bit 1 indicates which reference field holds the top-most line that must be read to produce the prediction. In addition, if bit 0 is also set, it indicates which reference field has the extra line to enable half-pel filtering to be performed. It is clear that half-pel prediction cannot be performed until both fields have been read from DRAM. Great care must also be taken when scaling vertical motion vectors to obtain offsets in the field store. The following table, Table 43, illustrates the effect: <tables id="tabl0056" num="0056"><img file="EP0891094A2_D0116.tif" /></tables>

Field-based Prediction (in a frame picture)

In this mode, each field is treated independently. A separate vector is used for each of the two fields. Associated with each vector is an additional single bit flag (motion_vertical_field_select) that indicates whether prediction should be made from the top reference field or the bottom reference field. The bottom bit of the vector still indicates the need for half-pel filtering, but bit 1 has no special significance. Note that a field vector measures different units of a frame vector; a field vector with the value n represents the same actual displacement (on the glass) as a frame vector with the value 2n. This time, however, there are sixteen cases to consider (since there are four binary variables; motion_vertical_field_select for each of the two vectors and bit 0 for each of the two vectors). There are too many cases to draw, hence, the following figures only deal with the prediction of the top field. The bottom field is obtained in an analogous manner. As depicted in Figure 75, motion_vertical_field_select = 0, vector[0] = 0 8(4) lines are read from the top reference field to form the top field of the prediction. Figure 76 shows motion_vertical_field_select = 0, vector[0] = 1 9(5) lines are read from the top reference field which are then half-pel filtered to form the top field of the prediction. Likewise, Figure 77 depicts motion_vertical_field_select = 1, vector [0] = 0 8(4) lines are read from the bottom reference field to form the top field of the prediction. And, Figure 78 illustrates motion_vertical_field_select = 1, vector[0] = 1 9(5) lines are read from the bottom reference field which are then half-pel filtered to form the top field of the prediction.

Dual Prime (in frame pictures)

Dual prime is a special case of the Field-based prediction of the previous section. Essentially, dual-prime combines two features: <ul id="ul0022" list-style="bullet" compact="compact"><li>A special method of coding the vectors so that despite the fact that four independent field predictions are formed (independent in the sense that they each have a distinct vector) effectively only one motion vector is transmitted. Thus, the vector overhead is dramatically reduced.</li><li>For each field, the prediction information is read from each of the reference fields. This is then averaged to form the final prediction. This is very similar to the B-picture case when a separate forward and backward prediction is made and then averaged.</li></ul> In the present invention, the vector decoding will all be performed in the parser. Accordingly, when the prediction circuitry receives data, there really will be four separate vectors.

The dual-prime averaging will be performed by re-using the B-frame averaging circuitry (dual-prime cannot itself be used in a B-frame). Hence, the only associated complication for the prediction circuitry is involved in the signaling that indicates that the backwards predictions (using backwards vector tokens etc.) should be performed from the forward reference fields (as opposed to the backward reference fields). Since a P-picture should never normally request a backward prediction, the prediction circuity merely needs to keep a record of the picture type (P or B) in order to be able to decide which reference store to use for a "backward" prediction.

Prediction in Field Pictures

Field-based Prediction

This is very similar to field-based prediction in frame pictures. There are four cases depending on motion_vertical_field_select and the least significant bit of the motion vector. Note that it is not really relevant to discuss top-fields and bottom-fields in the prediction that is formed, since the prediction is simply for the picture being decoded (which is either all top-field or all bottom-field). Figure 79 illustrates motion_vertical_field_select = 0, vector[0] = 0 16(8) lines are read from the top reference field to form the prediction. Figure 80 shows motion_vertical_field_select = 0, vector[0] = 1 17(9) lines are read from the top reference field and half-pel filtered to give the prediction. Figure 81 depicts motion_vertical_field_select = 1, vector[0] = 0 16(8) lines are read from the bottom reference field to form the prediction. Figure 82 shows motion_vertical_field_select = 0, vector[0] = 1 17(9) lines are read from the bottom reference field and half-pel filtered to give the prediction.

16x8 MC

In this mode, the macroblock is divided into two 16x8 regions, one above the other. For each region, a separate field vector is transmitted. Again, there are sixteen cases to consider (since there are four binary variables; motion_vertical_field_select for each of the two vectors and bit 0 for each of the two vectors). Again, these are too many cases to illustrate so the following figures need only deal with the upper 16x8 region. The lower region is obtained in an analogous manner. Figure 83 shows motion_vertical_field_select = 0, vector[0] = 0 8(4) lines are read from the top reference field to form the prediction of the upper 16x8 region. Figure 84 depicts motion_vertical_field_select = 0, vector[0] = 1 9(5) lines are read from the top reference field and half-pel filtered to form the prediction of the upper 16x8 region. Figure 85 illustrates motion_vertical_field_select = 1, vector[0] = 0 8(4) Lines are read from the bottom reference field to form the prediction of the upper 16x8 region. Figure 86 depicts motion_vertical_field_select = 1, vector[0] = 1 9(5) lines are read from the bottom reference field and half-pel filtered to form the prediction of the upper 16x8 region.

Dual Prime in Field Pictures

Dual prime in a field picture is simply a special case of field prediction in a field picture. Two field vectors will be used (one will refer to the top reference field, on to the bottom reference field and the Parser will ensure this). One of the predictions will appear to be making a backwards prediction, but because this is a P-picture, the prediction circuitry will interpret this as a second forward prediction. The two resulting predictions will then be averaged using the same circuitry as that used for B-frame averaging.

Overall organization

Figure 87 shows the overall organization of the display pipeline, in accordance with the present invention. Data arrives from the DRAM interface on a single multiplexed interface. Moreover, the DRAM interface will supply data in lines that are rounded up to the next 32 byte boundary above the correct number of bytes. However, the pels toward the end of the line that may lie outside the intended display area. In addition to the data, the DRAM interface will supply one bit for each channel (Y, Cr and Cb) that indicates whether the byte is the last in the current display line. A further bit is supplied that indicates which field the data comes from. The first block in the display pipeline of the present invention splits apart the three channels. Chrominance (Cr and Cb) data is supplied to the vertical upsamplers 210. Luminance (Y) data can be delayed in a FIFO if desired. The vertical upsamplers 210 have the task of upsampling the chrominance data by a 2:1 factor so that there are as many lines of chrominance data as there are of luminance data. In order to do this the vertical upsamplers store each line of chrominance data and produce output pels that are interpolated between this line and the subsequent line. The next stage in the display pipeline is labeled "Horizontal Align 370". This is implemented as part of the horizontal upsampler 212. Its task is to align the data so that at the start of each line, the first pel of each of the three channels is supplied to the horizontal upsampler 212 correctly. At the end of each line, it is expected that, in general, the channels will "run out of data" at different times. The "Horizontal Align" block 370 has the job of discarding this extra data from the channels that have too much data while stalling the other channels so that they wait until all three channels are aligned and ready to commence the next display line. In the invention, the horizontal upsamplers 212 upsample the data horizontally to stretch the data to fill the glass of a TV screen. In order to save silicon area, the filter is shared between the three channels. This can be done because the total output rate of the filter must be 27 Mbytes/s (the clock rate). The data is multiplexed in the CCIR 601 order so that the data stream produced is simply multiplexed into the final data stream. Note that the horizontal upsamplers 212 merely take the amount of data supplied by the DRAM interface and scale it by a selected factor. In general, they will produce too little or too much data for the actual line length in the raster. This is handled in the output multiplex. Also, note that the "Horizontal Align" block 370 does not need to know how many pels of each channel will be required to complete the line. It is very difficult to calculate this number because the relation between the number of input pels to output pels for the upsampling filter is not very simple. The Horizontal Align block 370 simply supplies data to the horizontal upsampler 212 on each of its three channels "on demand," i.e., the horizontal upsampler "pulls" the required number of pels into it in the required order. At the end of the display line, one of the channels will run out of data first and this indicates that the remaining data for the other channels (if any) should be discarded. The VTG 333 simply counts through the raster and produces a series of timing signals that are supplied to the output multiplex 371. Some of these signals are internal signals which tell the output multiplex 371 how to build the final raster. Other signals are "external" signals, such as sync and banking, and these are also supplied to the output multiplex 371 circuitry so that they are delayed by the same number of clock cycles as the data. The output multiplex 371 block has several tasks. The most interesting of these is probably the task of removing the two wire "interfaceness" from the data. Data supplied from the horizontal upsampler 212 still has an associated valid signal (and the output multiplex provides an accept signal). Data at the output of the multiplex has no two-wire interface, it is simply clocked out, one byte per clock cycle. The output multiplex 371 also has the job of painting a border around the picture. The top and left borders are painted under the control of the VTG 333. The VTG 333 simply tells the output multiplex 371 to produce the requisite number of pels of border color. At the right and bottom of the picture, the output multiplex 371 paints its own border, i.e.,it knows to do this because it runs out of picture data. The final block in the display pipeline is the 8-bit to 16-bit output mode converter 372. This is quite simply a flip-flop and a multiplexer. It is intended that this be implemented at the output PAD itself. By doing this, it is possible to simply route an 8-bit bus, rather than a 16-bit bus. Each bit will go to two output pads.

Horizontal Upsampler

Introduction

In accordance with the invention, the Horizontal Upsampler 212 performs the task of upsampling or interpolating the decoded picture in order to stretch it to fit the display raster. The upsampler 212 of the present invention can operate in four modes: <ul id="ul0023" list-style="none" compact="compact"><li>1) 1:1 -Output is the same as the input</li><li>2) 2:1</li><li>3) 3:2</li><li>4) 4:3</li></ul> After some picture simulations and consideration of likely implementation costs, it has been decided to use a three tap filter to perform the interpolation. The filter is a "polyphase" filter in the sense that each successive output is generated using a different set of filter coefficients. The number of phases is always equal to the numerator of the upsampling ratio. Thus, the 4:3 upsampler has four phases, every fourth output sample being generated using the same filter coefficients. Since the upsampler 212 is generating more output data than it accepts as input data, it is clear that a new input sample is not accepted on every clock cycle. In fact, the number of phases on which the filter does not accept new input is the difference between the numerator and the denominator of the upsampling ratio. In each of the ratios (except 1:1) this is one. Therefore, for each complete cycle around the phases, on one of the phases no new input data is accepted. In this case the data is the same as for the previous phase. The filter coefficients are, however, different to the previous phase.

4:3 Upsampling

In 4:3 Upsampling, the filter coefficients are shown in Table 44 while Figure 88 shows the filter in operation. The output pels are essentially formed as weighted averages of the input pels. <tables id="tabl0057" num="0057"><img file="EP0891094A2_D0117.tif" /></tables> Note that no new input data is accepted before the final phase (phase 3) is calculated.

3:2 Upsampling

Table 45 illustrates 3:2 upsampling, while Figure 89 illustrates filter operation. <tables id="tabl0058" num="0058"><img file="EP0891094A2_D0118.tif" /></tables>

2:1 Upsampling

Likewise, Table 46 illustrates 2:1 upsampling and Figure 90 shows filtering thereof. <tables id="tabl0059" num="0059"><img file="EP0891094A2_D0119.tif" /></tables> Note that Phase 1 could equally well have been described as having filter coefficients, 128, 128, 0. This has the advantage that the filter coefficients would then be the same as for Phase 2 of the 4:3 upsampler. However, it has the disadvantage that the rule "no new input is accepted when computing the last phase" would not be true.

Boundary Effects

At the edge of the picture, it is necessary to produce output pels that are formed from pels that lie outside the picture area. In order to avoid this problem, it is necessary to pixel-repeat edge pels so that the filter may proceed without realizing that it is at the edge of the picture. In the case of a three tap filter, as in the present invention, it is necessary to repeat just one pel at the left of the image and one at the right. (A five tap filter would have required 2 at he left, 2 at the right). This is shown in Figure 91. Conceptually, therefore, the implementation could be viewed as being formed of two boxes: Note the scheme doesn't really work properly in the case that the picture is not a multiple of 16 pels wide because the DRAM interface will always supply data that is a multiple of 16 pels wide. However, although this problem is known, we are not going to do anything about it. Most picture are multiples of 16 pels wide anyway, and in any case it is only the very last pel of the line that can be affected by the boundary effect. This is illustrated in Figure 92.

The Number of Output Pels

In the present invention, the upsampler will produce a defined number of output pels for a given number of input pels. This is important because this allows the parser State Machine to decide how many pels will be produced at the output of the upsampler and, hence, how many pels need to be cropped (or border pels added) in order for the picture to fit into the raster. The first valid output from the horizontal upsampler should occur in response to the third pel being input to the upsampler (since this is a three tap filter). Since one pel is repeated, this will occur when the second actual pel is input to the upsampler. The last valid output should occur when all of the possible output samples have been produced in response to the last (i.e., repeated) pel being input. Since the last phase of the poly-phase filters is computed using the same input data as the second-last phase, it is possible that either one or two output pels are produced as a result of this last repeated pel entering the upsampler. If this is done, the upsampler will produce "q" output samples:<maths id="math0074" num="EQ 1."><math display="block"><mrow><mtext>q = N(pDIVM) + (pREMM)</mtext></mrow></math><img file="EP0891094A2_D0120.tif" /></maths> in response to "p" input samples for an N:M upsampler. For example, for a 4:3 upsampler, Table 47 could be drawn up as follows: <tables id="tabl0060" num="0060"><img file="EP0891094A2_D0121.tif" /></tables>

Position Signals

Two signals are transferred along with the video data in the present invention. They allow the output multiplex to ensure that the data is painted into the appropriate position in the output raster. These are: <ul id="ul0024" list-style="bullet" compact="compact"><li>last_in_line</li><li>field_id</li></ul>last_in_line is active for one pel time and signals that the associated pel is the last pel in a scan line. field_id indicates which field the data belongs to. "0" indicates the spatially upper field. "1" indicates the spatially lower field. Note that this designation applies before any border lines and the like, are applied to the decoded image. field_id changes state one pel too early, i.e., between the second to last and the last pel of the field. This allows the last pel of the field to be identified without waiting for the first pel of the next field. However, there may be no "next field" if decoding stops for some reason. The field_id signal is shown in Figure 93. If a true field indicator is required, it can be obtained by delaying field_id by one pel time. Since these signals work their way along side the data through the entire display pipeline, it is important to use two signals, not three (which would allow a last pel in field signal) because it saves many flip-flops.

Multiplexed data

When position signals are applied to multiplexed data, care needs to be taken. The data is multiplexed in the order; CbY CrY. In the present invention, the three samples (CbY Cr) are co-incident in time and should, therefore, be viewed as indivisible. The remaining byte (Y) is positioned between the preceding (CbY Cr) pel and the subsequent (CbY Cr) pel. As a result, the last byte in the line will either be the Cr or Y. (Note that upsampling by 3:2 may produce an odd number of Y pels.) If the last byte in the lines is Cr, then, there should be a discontinuity in the multiplex signal because the first byte of a line is always Cb: (CbY1Cr)(Y)(CbY1Cr)\(CbY1Cr)(Y)(CbY1Cr)

Horizontal Alignment

At the input of the upsampler, there is no guarantee that the three different channels will line up. In order to achieve alignment, in the present invention, a "protocol" between the horizontal upsampler and the horizontal alignment blocks needs to be agreed. In accordance with the present invention, the protocol performs as follows: <ul id="ul0025" list-style="bullet" compact="compact"><li>The horizontal block supplies pels, on demand, to the horizontal upsampler. When it runs out of data for a given channel, it will signal this to the filter using a signal marking the last pel of the line. This will only happen for the repeated pel.</li><li>The horizontal upsampler ensures that once it has been supplied the last pel from a given channel it will not ask for another pel from that channel in the current line. However, the filter continues to operate, taking any necessary pels from other channels, until just before it will demand a pel from the channel that it knows has run out of data. The filter marks the last pel it can produce at the output as the last in the line. At this point, it resets itself as ready for the next line of data.</li><li>When the horizontal upsampler sees the filter accept data for a channel that has already been exhausted, it knows that the filter is asking for the first pel of the next line. At this point, any remaining pels on the other two channels are discarded. The next pel that will be supplied on each of these channels will be the first pel of the line.</li></ul> Although it is convenient to think of two separate blocks (the horizontal alignment block and the horizontal upsampler filter) it is likely that the two will be implemented together, in order to explain the operation.

Upsampling Ratio

The upsampling ratio will be supplied to the filter as a two bit binary number. In order that the filter operates in a sensible manner, the upsampling ratio should be sampled, by the upsampler itself, once per field time. The circuitry supplying the ratio is then free to update the sampling ratio, in readiness for the next field, at any time during the current field. The ratio should be sampled as the first pel of each field is actually accepted (rather than just after the last pel of the previous field). In this way, the very first field after reset (or after some pause in decoding) is upsampled with the correct ratio.

Video Timing Generator

Introduction

This section describes the video timing generator circuit (VTG 333) in accordance with the present invention. The VTG is primarily responsible for generating the various analogue video synchronizing signals, and also for maintaining knowledge of the display system's current raster position. This enables the VTG to provide controlling signals for the output multiplexer, which selects between active video, border and blanking sources for output. Both analogue and digital standards are supported, with two frame sizes (PAL and NTSC), and associated synchronizing behavior, selectable at setup. Border or cropping width will be specified in a token which will load a hardwired input to the VTG.

Horizontal Timing

The horizontal timing parameters are illustrated in Figure 94. These are split into those that are fixed (for either PAL or NTSC) and those that are variable (i.e., the parameters associated with any borders or cropping that may be specified. The interlaced nature of the video being displayed imposes a requirement for half-line based counting, so than various timing points are shown separately for each half of the line. A line comprises an initial banking period, the insertion of a SAV token, an active period, the insertion of an EAV token, and the trailing blanking period. During blanking lines, the active area will have blank values inserted rather than border and data. A line sync pulse appears at the beginning of every line (HSYNC). On certain blanking lines, two sync pulses appear, one at the beginning and the other after the first half line. The width of these is dependent on which vertical region is active: equalization or serration (field sync). During the initial horizontal blanking period, pels are discarded according to the cropping value (if the crop bit is set) - a fixed period of 120 cycles is allowed to discard the RHS cropped pels from the preceding line. The LHS pels for the current line are then discarded, and pels are stalled until the start of the active region. It is essential that there are no gaps in the data stream from which pels are being discarded, otherwise distortions will occur. If the crop bit is not set, however, a border is constructed by inserting border value for a period of borderL; followed by data for picture width, and then border again until the end of the active region. Note that it is not necessary to calculate the borderR value. The total horizontal border or crop width is specified in pels. The LHS border/crop value must be a multiple of 2 pels in order for the sampling to remain consistent. Consequently, it must be a multiple of 4 in terms of clock cycles. This can be achieved by masking out the least significant 2 bits from the original total border value in pels. For example, if the specified border is 91 pels, the left border will be 88 cycles long, and the picture width will be (720 - 91)*2 cycles. Streams of pels arriving at the output max are padded to give blocks of 32 pels. Considering this, together with the scaling factors to be supported, the maximum number of pels to be received for a line will be 832. This means that the maximum crop value will be 112 pels, giving 112 cycles of cropping at the LHS and the RHS.

Vertical Timing - PAL

The vertical timing parameters for PAL in accordance with the present invention, are illustrated in Figure 95. Two fields are shown separately, as they have slightly different timing. Analogue parameters are indicated by the shaded regions, being identical for each field, and digital parameters are shown by the waveforms. For simplicity, the zero-border case is shown. If a non-zero vertical border is specified, border is inserted for a period of borderT, then data for picture height, then border again until the end of the active region (fixed). BorderT and picture height are calculated in a way analogous to borderL and picture width (in horizontal timing) respectively. Once again, the initial border (borderT) must be a multiple of 4, this time in terms of half lines because the top border must be a multiple of 2. Note that MPEG codes 576 lines of video for PAL, whereas the analogue standard specifies only 525. This difference is accommodated by selecting data for output for 576 half-lines per field, but only asserting the analogue banking signal for the requisite 575 lines.

Vertical Timing - NTSC

Next, NTSC vertical timing, in accordance with the present invention, is illustrated in Figure 96. It is similar in principle to the PAL timing, although slightly more complex. MPEG codes 480 lines of video for NTSC, whereas the analogue standard specifies 483. This means that 3 lines of border must be inserted per frame to fill the gap (3 half lines per field). In addition, the judicial vertical banking indicator, V, is specified in such a way that additional border lines are required to be inserted as padding before the active video lines. Non-zero vertical borders will be inserted in addition to those lines already indicated, as described in the previous section. Furthermore, note that vertical cropping is not allowed in either standard. There is, at present, some uncertainty about the digital blank signal, V, since various reference sources give conflicting information. There are two main timing possibilities, illustrated by V and V', with the associated border select signals SB and SB', respectively.

VTG Structure

The video timing generator of the present invention comprises separate machines for the horizontal and vertical timing domains. The vertical machine provides control signals for the horizontal machine, which, in turn, provides the half-line increment signal for the vertical counters. Inputs to the VTG are: <ul id="ul0026" list-style="bullet" compact="compact"><li>clocks and reset</li><li>PAL not NTSC</li><li>horizontal border value with crop indicator</li><li>vertical border value</li></ul> Outputs are: <ul id="ul0027" list-style="bullet" compact="compact"><li>horizontal, vertical and composite sync and blanking signals</li><li>select signals for data, border, banking</li><li>a discard data bit for cropping</li><li>insert SAV and EAV</li><li>F and V values for construction of SAV and EAV</li><li>a 2-bit YUV position counter for SAV/EAV insertion</li><li>a firstline bit to indicate the start of a picture at startup</li></ul> All of the outputs go to the output multiplexer block, including the sync signals which can then remain in synchronization with the data.

Horizontal Machine

The horizontal machine is essentially a counter with hardware to detect the arrival of the various timing points as shown in Figure 94. The count goes from zero to half line length (which is different for PAL and NTSC) and is repeated for each half line. A hardwired comparator exists for each of the fixed timing points, these being activated according to the standard. In addition, there is a register for the border value (which is polled once per field), a subtractor to determine the picture width, and an auxiliary counter for counting down from the border value to zero. This procedure occurs in parallel with the main half-line coining. The datapath is 10 bits wide, and 15 hardwired comparators are required to implement both PAL and NTSC. The structure of this current embodiment is shown in Figure 97, together with approximate sizes. The datapath is estimated to be 360u x 330u. In addition to the datapath, most of the control logic in the VTG of the present invention will be associated with the horizontal machine. This will probably amount to 100-200 gates. Inputs to the horizontal machine are: <ul id="ul0028" list-style="bullet" compact="compact"><li>clocks and reset</li><li>horizontal border value and crop bit</li><li>line, equalization or field sync indicators</li><li>PAL not NTSC</li><li>vertical blank</li><li>insert vertical border</li></ul> Outputs from the horizontal machine are: <ul id="ul0029" list-style="bullet" compact="compact"><li>horizontal and composite blanks</li><li>insert data</li><li>insert border</li><li>insert blank values</li><li>discard input</li><li>insert SAV or EAV, with YUV count</li><li>hsync</li><li>composite sync</li><li>start of line</li><li>half-line increment</li></ul>

Vertical Machine

The vertical datapath has essentially the same structure as the horizontal datapath, but with 22 hardware comparators (8 for PAL, 14 for NTSC). The principal counter increments each half line, counting the half-lines through each half line, and counting the half-lines through each field, in turn. It is also 10 bits wide. Moreover, it is advantageous for test purposes to multiplex the half-line pulse input with another, more frequent clock, so that the vertical machine can be run independently of the horizontal machine. The estimated size is 360u x 420u. Inputs to the vertical machine are: <ul id="ul0030" list-style="bullet" compact="compact"><li>clocks and reset</li><li>PAL not NTSC</li><li>vertical border value</li><li>half-kline increment</li></ul> Outputs from the vertical machine are: <ul id="ul0031" list-style="bullet" compact="compact"><li>select equalization, field or line sync</li><li>vertical blank (analogue)</li><li>vertical sync</li><li>F, V and V' bits for SAV/EAV construction</li><li>insert vertical border</li><li>insert data</li><li>insert blank value</li><li>start of frame</li></ul>

Hardwired Comparator Design

In the present invention, the hardwired comparator design is based on a string of series n-type transistors, either pre-charged or with pull-up, organized in a similar style to memory row decoders. Typically, these comparators will be about 8u high in the area estimates given.

Output Multiplex

The output multiplex of the invention has the task of putting together the data for display. It combines data arriving from the earlier sections of the display pipeline with timing information obtained from the VTG. The other input task of the output multiplex is to remove the two-wire interfacing. All the pipeline stages up to the output multiplex have a two-wire interface, indeed the data arriving at the input of the output multiplex will always arrive too early and will be stalled by taking accept low. However, there is no two-wire interface at the output of the device. In order to achieve the above removal of the two-wire interfacing, the dynamics of the supply of data need to be sorted out so that the DRAM interface never stalls the data arriving at the output of the horizontal upsampler. Basically, the output multiplex is making a decision on a field by field basis as to whether to output a fled of data or not. At some point, close to the start of the first active line of the field, the output multiplex makes a decision. If there is valid data waiting at its input (i.e., in_accept is low) then it will start to output the data. If, on the other hand, there is no valid data (for example, before the first picture has been decoded) then it will paint border color through the entire picture. Actually, this procedure is slightly more complicated because the output multiplex must also ensure that the data is painted into the correct field. That is, there must be valid data waiting that belongs to the correct field before the display commences. If at some point the data ceases to be valid, at a time that the output multiplex expects to have valid data available to paint into the display (which should never happen) then the output multiplex reverts to outputting border color which it continues to do for the remainder of the field.

Border Generation

Figure 98 shows the generation of border color to the left and right of the picture display in accordance with the present invention, As shown, the VTG generates the border region at the left of the picture by asserting a signal that selects border color in the output multiplex. However, at the right hand side of the picture, the border color is generated by the output multiplex itself. It does this by recognizing that ii has "run out" of data and paints the remainder of the width of the picture in border color. It must be understood that there are two possible interpretations of "run out" of data. One is that the output data from horizontal upsampler is not valid. However, this is not what is meant here. In this case, one runs out of data after the pel that is marked by the last_in_line signal as going the last one in the line has been included in the output stream. Figure 99 shows the equivalent action when clipping of the picture occurs. As shown, the VTG signals to the output multiplex to clip pels to the left of the picture by asserting a signal to tell the output multiplex to discard input pels. Once this has occurred, the VTG will signal that the output multiplex should start to output the remaining pels. At the end of the active line (i.e., 720 pels later) the VTG de-asserts the signal and the output multiplex discards any remaining pels in the data on its input. Note that, in general, there will be a gap (in time) between the time when the VTG indicates that cropping should occur and the start of the active line. This significantly simplifies the design of the VTG. The output multiplex discards pels when the crop signal is asserted and then waits until the start of the active line period.

Output multiplex

The output multiplex controls the multiplexing of various sources of data together to form a CCIR 601 8 bit multiplexed data stream. The timing (i.e., what is multiplexed in and when) is largely controlled by the VTG. The output multiplex is concerned with higher level issues. For example, at the start of decoding, when no pictures are available for display, the output multiplex will be painting border color throughout the entire image. Eventually, the first decoded picture will arrive at the output of the horizontal upsampler. Typically, this will not occur conveniently at the start of the field. The output multiplex asks once per field time "is there valid data ready for display?". If not, it waits for the next field to occur (and any valid data that happens to turn up in the meantime has to wait for the start of the next field). The output multiplex also ensures that the correct field of data arriving from the SDRAM interface is painted into the correct field of the PAL or NTSC raster. In addition, to dealing with the data, the output multiplex also selects the correct sync and blanking signals for outputting to the pins. This facilitates easy connection to a wide range of composite encoders, DAC's, and the like. The registers for the output multiplex are as shown in Table 48. The bits for the output multiplex control are illustrated in Table 49. There are four bytes of MPI registers associated with the output multiplex: <tables id="tabl0061" num="0061"><img file="EP0891094A2_D0122.tif" /></tables><tables id="tabl0062" num="0062"><img file="EP0891094A2_D0123.tif" /></tables><tables id="tabl0063" num="0063"><img file="EP0891094A2_D0124.tif" /></tables><ul id="ul0032" list-style="none" compact="compact"><li>a. Irrespective of the setting of this bit, chrominance data (both Cb and Cr) will be 0x80 (128 decimal) during blanking.</li></ul>

Video Decoder Specifications and Features

In addition to the aforementioned detailed description; the following disclosure is also provided regarding a preferred embodiment of a video decoder suitable for practice of the invention. <tables id="tabl0064" num="0064"><table frame="all"><tgroup cols="2" colsep="1" rowsep="0"><colspec colnum="1" colname="col1" colwidth="78.75mm" /><colspec colnum="2" colname="col2" colwidth="78.75mm" /><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left">• MPEG-2 MP @ ML</entry><entry namest="col2" nameend="col2" align="left">• 2/3 and 1/1 pull down</entry></row><row><entry namest="col1" nameend="col1" align="left">• Single 16 Mbit SDRAM</entry><entry namest="col2" nameend="col2" align="left">• Video scaling</entry></row><row><entry namest="col1" nameend="col1" align="left">• High resolution MPEG-1</entry><entry namest="col2" nameend="col2" align="left">• Power including SDRAM ≈ 2.5 W</entry></row><row><entry namest="col1" nameend="col1" align="left">• α Vision compatible</entry><entry namest="col2" nameend="col2" align="left">• Self configuring</entry></row><row><entry namest="col1" nameend="col1" align="left">• Automatic error concealment</entry><entry namest="col2" nameend="col2" align="left">• Small board area</entry></row><row><entry namest="col1" nameend="col1" align="left">• Channel change support</entry><entry namest="col2" nameend="col2" align="left">• QuietPad™ outputs</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">• Time stamp management</entry><entry namest="col2" nameend="col2" align="left">• On-chip video timing generator</entry></row></tbody></tgroup></table></tables> The present invention includes a highly integrated, easy to use, MPEG-2 video decoder. It fully supports all the requirements of MPEG-2 Main Profile at Main Level. The system of present invention is also self configuring (a single pin selects between PAL and NTSC operation) and, in many applications; can start-up and maintain video decoding with no external software support Error concealment and recovery is fully automatic. More demanding applications may utilize the advanced features controlled by software running on an external microprocessor. The present invention stores its own microcode in an on-chip ROM, thus avoiding the need to use an external ROM or download microcode before decoding can commence. See Figure 100. The following more detailed description of the system of the present invention is set forth for purposes of organization, clarity and convenience of explanation under the headings listed below: Signals Register map Power supplies Logic levels Clock signals Reset signals Coded data interface signals Supply data via the microprocessor interface Switching between input modes Rate of accepting coded data Coded data interface timing CDCLOCK Video output signals Video output control registers Borders, scaling and cropping Video output control registers Video signal timing MPI signals MPI electrical specifications Interrupts Page register SDRAM interface signals SDRAM configurations Connection of JTAG pins in non-JTAG systems Supported Instructions Characteristics Level of Conformance to IEEE 1149.1 Start code detector registers Detection of start codes discard_all facility flag_picture_end facility start_code_search facility SCD example - channel change Parser registers Error codes Dealing with user data System organization Signals and registers Electrical specifications Coded data interface Video output interface Microprocessor interface Synchronous DRAM interface JTAG interface Start code detector Video parser Timestamp management Address generator configuration Mechanical information This section includes a listing of all the signals (pins) used, in accordance with the present invention, and a listing of all the registers available through the microprocessor interface. (See Tables 50 and 51.)

Signals

The register map of the present invention is divided into areas. The first 32 locations are required for the normal operation of the system. There is only five bits of address. The next set of 32 locations are those in the address generation circuitry that are required to setup a non-default SDRAM memory map. The remainder of the register map are registers that are only used for test and diagnostic purposes. These can be paged in instead of the address generator registers. Table 52 illustrates the register map of the present invention. <tables id="tabl0068" num="0068"><img file="EP0891094A2_D0128.tif" /></tables><tables id="tabl0069" num="0069"><img file="EP0891094A2_D0129.tif" /></tables> Table 53 depicts the page select register. <tables id="tabl0070" num="0070"><img file="EP0891094A2_D0130.tif" /></tables> Table 54 illustrates the interrupt service area. <tables id="tabl0071" num="0071"><img file="EP0891094A2_D0131.tif" /></tables><tables id="tabl0072" num="0072"><img file="EP0891094A2_D0132.tif" /></tables> Table 55 shows the input circuit registers of the present invention. <tables id="tabl0073" num="0073"><img file="EP0891094A2_D0133.tif" /></tables> Table 56 shows the start code detector register of the present invention. <tables id="tabl0074" num="0074"><img file="EP0891094A2_D0134.tif" /></tables><tables id="tabl0075" num="0075"><img file="EP0891094A2_D0135.tif" /></tables> In accordance with the present invention, Table 57 shows the timestamp insertion registers. <tables id="tabl0076" num="0076"><img file="EP0891094A2_D0136.tif" /></tables> Likewise, Table 58 illustrates the video parser registers. <tables id="tabl0077" num="0077"><img file="EP0891094A2_D0137.tif" /></tables><tables id="tabl0078" num="0078"><img file="EP0891094A2_D0138.tif" /></tables> The output control registers are shown in Table 59. <tables id="tabl0079" num="0079"><img file="EP0891094A2_D0139.tif" /></tables>

Test Registers

The complete register map is shown in Table 60 through Table 69. <tables id="tabl0080" num="0080"><img file="EP0891094A2_D0140.tif" /></tables><tables id="tabl0081" num="0081"><img file="EP0891094A2_D0141.tif" /></tables><tables id="tabl0082" num="0082"><img file="EP0891094A2_D0142.tif" /></tables><tables id="tabl0083" num="0083"><img file="EP0891094A2_D0143.tif" /></tables><tables id="tabl0084" num="0084"><img file="EP0891094A2_D0144.tif" /></tables><tables id="tabl0085" num="0085"><img file="EP0891094A2_D0145.tif" /></tables><tables id="tabl0086" num="0086"><img file="EP0891094A2_D0146.tif" /></tables>

Summary of Test Register Locations

Power Supplies

The present invention essentially operates from a single 5V supply. However, in order to enable simple connection to synchronous DRAM, a 3.3V supply is also provided. <tables id="tabl0089" num="0089"><img file="EP0891094A2_D0149.tif" /></tables>

Logic Levels

Three different signal interface types are implemented in accordance with the present invention. Standard (5 V) TTL levels are employed by the microprocessor interface. In addition, 5 V CMOS levels are used by the coded data interface and the video output interface. 3 V LVTTL levels are also employed by the SDRAM interface.

TTL (5 V) Levels

CMOS (5 V) Levels

For CMOS inputs VIHmin is approximately 70% of VDD and VILmax is approximately 30% of VDD. The values shown in Table 73 are those for VIH and VIL at their respective extreme limits of operation. <tables id="tabl0091" num="0091"><img file="EP0891094A2_D0151.tif" /></tables>

LVTTL (3.3 V) Levels

Clock Signals

The present invention uses one clock (SYSCLOCK) for almost all on-chip functions. Since this clock is used by the video output circuitry, it is assumed that a 27 MHz clock will be used so that the VTG (Video Timing Generator) will produce pictures at the correct rate. A second clock (CDCLOCK) may be used to clock coded data into the present invention. This clock may be synchronous to SYSCLOCK and this allows data to be transferred into the system from circuitry that is not operating on the 27 MHz clock (perhaps a clock derived from a disk or network interface circuit). Internally, the invention derives high speed clocks for driving the SDRAM interface using a phase locked loop (PLL). This clock is output ot the SDRAM as DCLKOUT. An on-chip PLL is also used to derive an even mark-space ratio. The requirements for the SYSCLOCK are shown in Figure 101 <tables id="tabl0094" num="0094"><img file="EP0891094A2_D0154.tif" /></tables>

Reset Signals

The present invention uses three reset signals: <ul id="ul0033" list-style="none" compact="compact"><li>1) <maths id="math0075" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">RESET</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0155.tif" /></maths></li><li>2) <maths id="math0076" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">VTGRESET</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0156.tif" /></maths></li><li>3) <maths id="math0077" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">TIMERESET</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0157.tif" /></maths></li></ul><maths id="math0078" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">RESET</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0158.tif" /></maths> is the main chip reset signal. All circuitry is reset and adopts the reset state indicated in the various tables as described herein. <maths id="math0079" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">RESET</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0159.tif" /></maths> must be asserted (LOW) for at least four clock cycles after the power and clocks are stable to ensure a correct reset. <maths id="math0080" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">VTGRESET</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0160.tif" /></maths> is used to reset the video timing generator of the present invention without affecting other aspects of the present invention. <maths id="math0081" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">TIMERESET</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0161.tif" /></maths> is used by the timestamp handling circuitry in accordance with the present invention.

Introduction

The coded data interface, in accordance with the present invention, provides a dedicated set of pins that may be used to supply the coded video data to system. Alternatively, coded data may be written via the microprocessor interface This section discusses both of these methods. If the dedicated pins are used, coded data may be supplied either as a simple stream of bytes or as "Tokens." The Tokens allow other types of information to be supplied in addition to the coded data. For example, time stamp information may be transferred using this mechanism. If the microprocessor interface is used for coded data, then Tokens are always used. Furthermore, this is quite simple. Once a "Token Head" has been written to declare that subsequent data is coded data (requiring just two registers to be written) coded data may, thereafter, be simply written into a register.

Coded Data Interface Signals

Table 76 defines the coded data interface signals used in the present invention. <tables id="tabl0095" num="0095"><img file="EP0891094A2_D0162.tif" /></tables><tables id="tabl0096" num="0096"><img file="EP0891094A2_D0163.tif" /></tables>CDVALID and CDACCEPT are used to control the transfer of data in accordance with the present invention. This type of protocol is referred to as a "two-wire" interface. Both signals must be high at the rising edge of CDCLOCK in order for a data transfer to occur. Figure 102 shows the relationship between the data (CD[7:0], CDEXTN and BMODE) and CDVALID and CDACCEPT. Note: If data is to be supplied via the coded data interface pins, the micropocessor interface register "enable_mpi_input" must be zero (this is its reset state).

Byte Mode

In the present invention, if BMODE is sampled HIGH at the rising edge of CDCLOCK (and CDVALID and CDACCEPT are both high), then the data is treated as simple coded data. In fact, the data is immediately built into a DATA. In this case, CDEXTN is ignored.

Token Mode

If BMODE is sampled LOW, at the rising edge of CDCLOCK (and CDVALID and CDACCEPT are both high), then the data is treated as Tokens. Tokens are used extensively in accordance with the present invention, to control the flow of data and control signals throughout the system. Theoretically, it is possible to supply any Token at the coded data input. All Tokens, in accordance with the present invention, consist of a series of bytes (CD[7:0]), each of which has associated with it an extension bit (CDEXTN). The first byte of the Token indicates the type of information carried by the Token. The last byte of the Token is indicated by the extension bit being LOW. For example, coded data is supplied using the DATA Token. This is illustrated in Figure 103. As shown, the first byte is 0x04 (indicating that this is a DATA Token). This information is followed by bytes of coded data that extend until CDEXTN is sampled LOW. The next data that is sampled will be interpreted as the first byte of a new Token (assuming that BMODE is still LOW). Another Token that is particularly useful is the FLUSH Token This Token acts like a "reset" and it may be used after the end of one video stream in order to ready the system for the next video stream. The FLUSH Token is illustrated in Figure 104.

Supply Data via the Microprocessor Interface

In the present invention, tokens can be supplied to the system via the microprocessor interface (MPI) by accessing the coded data input registers. Table 77 defines the coded data input registers. <tables id="tabl0097" num="0097"><img file="EP0891094A2_D0164.tif" /></tables>

Writing Tokens vis the MPI

The coded data registers are grouped into two bytes within the memory map to allow for efficient data transfer. The 8 data bits, coded_data[7:0], are in one location and the control registers, coded_busy, enable_mpi-input and coded_extn are in a second location. (See Table 56.) When configured for Token input via the MPI, the current Token is extended with the current value of coded_extn each time a value is written into coded_data[7:0]. Software is responsible for setting coded_extn to 0 before the last word of any Token is written to coded_data[7:0]. For example, a DATA Token is started by writing 1 into coded_extn and then 0x04 into coded_data[7:0]. The start of this new DATA Token then passes into the system for processing. Each time a new 8 bit value is written to coded_data[7:0], the current Token is extended. coded_extn need only be accessed again when terminating the current Token (for example, to introduce another Token). The last word of the current Token is indicated by writing 0 to coded_extn followed by writing the last word of the current Token into coded_data[7:0]. Moreover, each time before writing to coded_data[7:0]. coded_busy should be inspected to see if the interface is ready to accept more data.

Switching between Input Modes

Provided suitable precautions are observed, it is practical to dynamically change the data input mode. In general, the transfer of a Token via any one route should be completed before switching modes. These switching modes are shown in Table 78. <tables id="tabl0098" num="0098"><img file="EP0891094A2_D0165.tif" /></tables> The first byte supplied in byte mode causes a DATA Token header to be generated on-chip. Any further bytes transferred in byte mode are appended to this DATA Token until the input mode changes. The MPI register bit coded_busy and the signal coded_accept indicated on which interface the system is willing to accept data. Correct observation of these signals should ensure that no data is lost.

Rate of Accepting Coded Data

The input circuit of the present invention passes Tokens to the start coded detector. This analyses data in the DATA Tokens and its normal rate of processing is one byte per clock (of CDCLOCK). However, extra processing cycles are occasionally required. For example, when a start code is encountered in the coded data. When this occurs, CDACCEPT will go low to indicate that data cannot be accepted. It follows that CDCLOCK must have a higher clock frequency than the rate at which bytes of data are to be supplied to the system. In many applications, it will be appropriate to use the same clock (typically 27 MHz) for both SYSCLOCK and CDCLOCK. One example is shown in figure 105.

Coded Data Interface Timing

Similarly, Table 79 shows the coded data interface timing for the present invention. <tables id="tabl0099" num="0099"><img file="EP0891094A2_D0166.tif" /></tables> The coded data interface uses CMOS levels.

CDCLOCK

The transfer of data across the coded data interface is controlled by CDCLOCK which may be synchronous to the main video decoder clock (SYSCLOCK). This facility may be useful in allowing the system decoder to operate on a different clock to the video clock. However, CDCLOCK is also used internally in the present invention to clock circuitry such as the start code detector. Since CDCLOCK does not have the benefit of a Phase Locked Loop (PLL) to ensure even mark-space ratio, external circuitry must be used to ensure this or the timing parameters 2 and 3 shown in Figure 105. In situations where CDCLOCK and SYSCLOCK do not need to be synchronous, the facility exists to drive the internal circuitry such as the start code detector from the PLL rather than CDCLOCK. This frees the external circuitry from the need to guarantee the even marked-spaced ratio. Figure 106 shows the internal arrangement which allows the even mark-space ratio clock generated by the PLL to be routed to the start code detector in place of CDCLOCK. If un_named_register is 0 (reset condition), the start code detector is clocked from the PLL. In this case, both CDCLOCK and SYSCLOCK must be connected to the same signal. The AC timing requirements for SYSCLOCK. If un_named_register is 1, the start code detector is clocked using CDCLOCK. In this case, CDCLOCK may be synchronous to SYSCLOCK. CDCLOCK must obey the timings as specified in Figure 105.

Introduction

The video output interface of the invention implements a digital output interface that complies to CCIR Recommendations 601 and 656. All of the synchronization and blanking information is included, in the form of special code words (SAV and EAV), in the same byte-wide stream of data as the video information. In addition, separate sync and banking pins are provided so that the system may be connected directly to a wide range of devices (such as video DACs or NTSC encoders). The timing of these signals is suitable for the generation of a video signal that complies with CCIR Recommendation 624. The video data may be time-multiplexed on a single byte-wide bus. Alternatively, a sixteen bit output mode is provided, in which case, the luminance data is output on one byte wide bus while the two color difference signals are time multiplexed on a second byte wide bus.

Video Output Signals

Table 80 provides the signals for the video output interface, in accordance with the present invention. <tables id="tabl0100" num="0100"><img file="EP0891094A2_D0167.tif" /></tables><tables id="tabl0101" num="0101"><img file="EP0891094A2_D0168.tif" /></tables> Figure 107 shows the output timing in 16 bit mode. Figure 108 shows the output timing in 8 bit mode.

Video Output Control Registers

Video output control registers, in accordance with the present invention as shown in Table 81. <tables id="tabl0102" num="0102"><img file="EP0891094A2_D0169.tif" /></tables><tables id="tabl0103" num="0103"><img file="EP0891094A2_D0170.tif" /></tables><tables id="tabl0104" num="0104"><img file="EP0891094A2_D0171.tif" /></tables>

Borders, Scaling and Cropping

The present invention attempts to always produce a picture for display that is 720 pels by either 480 lines (525 line raster) or 576 lines (625 line raster). The invention automatically scales the decoded picture in order to attempt to fill this area. Since only a limited number of scale factors are supported, it will not always be possible to fill this area precisely. If the resulting picture is too small, then a border will be painted around the decoded picture. This border will be such that the decoded picture is in the center of the screen. Conversely, if the scaling produces a picture that is too big, then the picture is cropped to enable it to be displayed properly. The displayed region is the center of the decoded picture. This cropping is limited so that not more than approximately 10% of the decoded picture is cropped. If more than this would be lost then a smaller scaling factor is used. The border color may be selected by writing to the registers border_cb, border_y and border_cr. After the device is reset and before any pictures have been decoded, the entire screen will be filled with the border color. In addition, it is possible to paint border color over the entire screen by writing to blank_screen. This may be used to hide the video during, for instance, a channel change.

Video Output Characteristics

Characteristics

Figure 109 illustrates, in accordance with the present invention, the timing of the video output interface. Similarly, Table 82 illustrates the video output interface timing. <tables id="tabl0105" num="0105"><img file="EP0891094A2_D0172.tif" /></tables> Table 83 defines video output mode signals. Figure 110 shows the video output mode signals. <tables id="tabl0106" num="0106"><img file="EP0891094A2_D0173.tif" /></tables>

Video Signal Timing

The video timing of the present invention is such that the resulting video output complies with the following CCIR recommendations. <ul id="ul0034" list-style="bullet" compact="compact"><li>CCIR Recommendation 601</li><li>CCIR Recommendation 656</li><li>CCIR Recommendation 624</li></ul>

Horizontal Timing

The horizontal timing is shown in Figure 111. The numbers are in SYSCLOCK cycles for the 525 line system (625 line system (625 line system in parentheses). During equalization, the <maths id="math0082" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">HSYNC</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0174.tif" /></maths> signal is LOW for 62 cycles (66 cycles in the 625 line system). During field synchronization, the <maths id="math0083" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">HSYNC</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0175.tif" /></maths> signal is LOW for 732 cycles (738 cycles in the 625 line system).

Vertical Timing

The vertical timing is illustrated in Figure 112 for the 525 line (NTSC) system and Figure 113 for the 625 line (PAL) system. In these drawings the numbers down the left hand side provide the line number as per CCIR Rec. 656. The two columns at the right provide the "F" and "V" bits to be found in the SAV and EAV codes (see CCIR Rec. 601). The smaller numbers in the center of the thick, solid, black lines provide the logical line numbers of the decoded MPEG picture. These are, therefore, numbered 0 to 479 for the 480 line used in the 525 line (NTSC) system and 90 to 575 for the 576 lines used in the 625 line (PAL) system. Figure 114 shows the timing of the sync and blanking pins for the 525 line system and Figure 115 for the 625 line system. Note that only one of <maths id="math0084" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">HSYNC</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0176.tif" /></maths> or <maths id="math0085" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">CSYNC</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0177.tif" /></maths> may be output (see hs_not_cs) and that the polarity of each of these signals may be inverted (see cblank_ah, etc.).

VTG Reset State

In the invention, the VTG resets to the start of line 4 for the 525 line (NTSC) system and to the start of line 1 for the 625 line (PAL) system.

Introduction

A standard byte wide microprocessor interface (MPI) is used in accordance with the present invention. The MPI operates synchronously to the various decode chip clocks.

MPI Signals

Table 84 depicts the MPI interface signals. <tables id="tabl0107" num="0107"><img file="EP0891094A2_D0178.tif" /></tables>

MPI Electrical Specifications

DC Characteristics

See 2.2.1, "TTL (5 V) levels."

Figures 123 and 124 illustrate the read and write timing of the MPI, respectively.

AC Characteristics

Table 85 shows the Read Timing for the MPI. <tables id="tabl0108" num="0108"><img file="EP0891094A2_D0179.tif" /></tables> Likewise Table 86 shows the write timing for the MPI. <tables id="tabl0109" num="0109"><img file="EP0891094A2_D0180.tif" /></tables>

Interrupts

"event" is the term used to describe an on-chip condition that a user might want to observe. An event could indicate an error condition or it could be informative to user software. There are two single bit registers associated with each interrupt or "event". These are the condition event register and the condition mask register.

Condition Event Register

The condition event register is a one bit read/write register whose value is set to one by a condition occurring within the circuit. The register is set to one even if the condition only existed transiently. The register is then guaranteed to remain set to one until the user's software resets it or the entire chip is reset. <ul id="ul0035" list-style="bullet" compact="compact"><li>The register is set to zero by writing the value one</li><li>Writing zero to the register leaves the register unaltered.</li><li>The register must be set to zero by user software before another occurrence of this condition can be observed.</li><li>The register will be reset to zero up on reset.</li></ul>

Condition Mask Register

The condition mask register is a one bit read/write register which enables the generation of an interrupt request if the corresponding condition event register(s) is (are) set. If the condition event is already set when 1 is written to the condition mask register, an interrupt request will be issued immediately. <ul id="ul0036" list-style="bullet" compact="compact"><li>The value 1 enables interrupts.</li><li>The register clears to zero upon reset.</li></ul> Unless stated otherwise, a block will stop operation after generating an interrupt request and will re-start soon after either the condition event or the condition mask register are cleared.

Event and Mask Bits

In the present invention, event bits and mask bits are always grouped into corresponding bit positions in consecutive bytes in the register map (see Table 55). This allows interrupt service software to use the value read from the mask registers as a mask for the value in the event registers to identify which event generated the interrupt.

The Chip Event and Mask

The present invention has a single "global" event bit that summarizes the event activity on the chip. The chip event register presents the OR of all the on-chip events that have 1 in their mask bit. A 1 in the chip mask bit allows the chip to generate interrupts. A 0 in the chip mask bit presents any on-chip events generating interrupt requests. Writing 1 or 0 to the chip event has no effect. It will only clear when all the events (enabled by a 1 in their mask bit) have been cleared. The <maths id="math0086" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">IRQ</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0181.tif" /></maths> Signal

The <maths id="math0087" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">IRQ</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0182.tif" /></maths> signal in the invention is asserted if both the chip event bit and the chip event mask are set. The <maths id="math0088" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">IRQ</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0183.tif" /></maths> signal is an active low, "open collector" output which requires an off-chip pull-up resistor. When active the <maths id="math0089" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">IRQ</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0184.tif" /></maths> output is pulled down by an impedance of 100 Ω or less. A pull-up resistor of approximately 4 kΩ should be suitable for most applications.

Page Register

In order to reduce the number of register address signals required by the present invention, a page register is employed to enable more than 64 registers to be addressed. This page register is at location 0x1f. Register locations 0x00 to 0x1f are not affected by the contents of the page register and are always present in the register map. Registers in locations 0x20 to 0x3f depend on the page register. There are no paged registers that are required for normal device operation. The paged registers are, finally, only used for test purposes. In the invention, the page register is reset to the value zero. The user should ensure that no other value is written to this register.

Introduction

SDRAM Interface Signals

Table 87 illustrates the SDRAM Interface Signals <tables id="tabl0110" num="0110"><img file="EP0891094A2_D0185.tif" /></tables>

SDRAM Configurations

Table 88 illustrates SDRAM configurations. <tables id="tabl0111" num="0111"><img file="EP0891094A2_D0186.tif" /></tables><tables id="tabl0112" num="0112"><img file="EP0891094A2_D0187.tif" /></tables>

Configuration Zero

See Figure 116 for the Configuration Zero SDRAM Connection. Figure 117 illustrates the configuration for one SDRAM connection. Similarly, Figures 118 and 119 depict a configuration of two and three SDRAM connections, respectively.

Introduction

The system, in accordance with the present invention, fully supports the Joint Test Action Group (JTAG) "Standard Test Access Port and Boundary Scan Architecture", now adopted by the IEEE as standard 1149.1. All JTAG operations are performed via the Test Access Port (TAP), which consists of five pins. The TREST (Test Reset) pin resets the JTAG circuitry to ensure that the device doesn't power-up in test mode. The TCK (Test Clock) pin is used to clock serial test patterns into the TDI (Test Data Input) pin, and out of the TDO (Test Data Output) pin. Furthermore, the operational mode of the JTAG circuitry is set by clocking the appropriate sequence of bits into the TMS (Test Mode Select) pin. The JTAG standard is extensible to provide for additional features at the discretion of the chip manufacturer. In accordance with the present invention, there are 9 user instructions, including three JTAG mandatory instructions. The extra instructions allow a degree of internal device testing to be performed, and provide additional external test flexibility. For example, all device outputs may be made to float by a simple JTAG sequence. See Table 89.

Connection of JTAG Pins in Non-JTAG Systems

Supported Instructions

This section describes the instructions supported in this implementation of the present invention. See Tables 90, 91 and 92. <tables id="tabl0114" num="0114"><img file="EP0891094A2_D0189.tif" /></tables> The following optional JTAG instructions are not supported: <ul id="ul0037" list-style="none" compact="compact"><li>1) IDCODE</li><li>2) RUNBIST</li></ul><tables id="tabl0115" num="0115"><img file="EP0891094A2_D0190.tif" /></tables>

Allocation of Instruction Codes

There are 14 defined instructions altogether. Hence there is a 4-bit long instruction register, with 2 unassigned instructions. Unassigned instructions are aliases of the BYPASS instruction, in accordance with IEEE1149.1. The full list of instructions and their codes is shown in Table 93. <tables id="tabl0116" num="0116"><img file="EP0891094A2_D0191.tif" /></tables>

Level of Conformance to IEEE 1149.1

Rules

ALL rules are adhered to, although the following should be noted: <tables id="tabl0117" num="0117"><img file="EP0891094A2_D0192.tif" /></tables><tables id="tabl0118" num="0118"><img file="EP0891094A2_D0193.tif" /></tables>

Recommendations

Permissions

Introduction

The start code detector (SCD), in accordance with the present invention, has the task of detecting start codes in the coded data stream. It converts these to Tokens for further internal processing by the system. In addition to this task there are a series of features that support, for example, channel change.

Start Code Detector Registers

Table 98 illustrates the registers for the start code detector of the present invention. <tables id="tabl0122" num="0122"><img file="EP0891094A2_D0197.tif" /></tables><tables id="tabl0123" num="0123"><img file="EP0891094A2_D0198.tif" /></tables><tables id="tabl0124" num="0124"><img file="EP0891094A2_D0199.tif" /></tables><tables id="tabl0125" num="0125"><img file="EP0891094A2_D0200.tif" /></tables>

Detection of Start Codes

The start code detector of the present invention will only detect start codes that are correctly byte aligned. The present invention deals only with video start codes. Unrecognized start codes are detected and cause an unrecognized_start_code event. The unrecognized start codes are the system start codes (with values 0xb9 through 0xff) the reserved start codes (0xb0, 0xb1, and 0xb6) and the sequence_error_code (0xb4).

discard_all Facility

The discard_all facility may be used to discard all data that enters the system. It is possible to select the discard_all facility "manually" by setting the register discard_all to 1. However, it is necessary that scdp_access must first be set to 1 and then polled until it reads-back 1. Generally, it is typical to enter this mode automatically as part of the flag-picture_end facility. The present invention will continue to discard all data until either the value 0 is written to discard_all or a FLUSH Token is encountered Note that FLUSH Token that the resets discard_all is deleted from the stream of tokens and does not affect the parser or any subsequent blocks of circuitry.

flag_picture_end Facility

The flag_picture_end facility, in accordance with the present invention, is intended to allow a clean termination of decoding by waiting until the end of a picture before stopping the flow of data into the system. The parser, therefore, will see no incomplete pictures. Figure 120 illustrates as a flow chart the flag_picture_end facility. As shown, it is possible to generate an interrupt (flag_picture_end_event) when the end of the picture is detected. This may cause the SCD to stop processing data until the interrupt is serviced. Alternatively, the SCD may be allowed to proceed. If after-picture_discard is set to 1, then after the end of the picture is detected, all subsequent data will be discarded. This is most useful for discarding the trailing data from one channel that is "in flight" in the system demultiplexor prior to a channel change. Note that the start_code_search facility in this embodiment takes priority over flag_picture_end facility. In this way, the data that is being discarded due to the start_code_search is not examined to determine whether the end of a picture has been reached.

start_code_search Facility

In the invention, the SCD can be set to search for specific types of start codes. This may be used, for instance, after a channel change to search for a sequence start code before decoding commences. <tables id="tabl0126" num="0126"><img file="EP0891094A2_D0201.tif" /></tables> The search mode is entered by writing a non-zero value into start_code_search. The start code detector will then search for the appropriate start codes as indicated by Table 99. All data and Tokens are discarded while the search continues. When one of the appropriate start codes is encountered, the search ends, start_code_search is set to zero and an interrupt may optionally be generated. Note also that a FLUSH Token will terminate the search as if one of the indicated start codes had been encountered. However, in the special case that the FLUSH Token is terminating the discard_all function, the search is not terminated. Further, this allows a direct transition between the discard_all and a previously selected search mode when the FLUSH Token is encountered. Figure 121 illustrates as a flow chart the start_code_search facility, in accordance with the present invention..

SCD Example - Channel Change

An example of the using the SCD facilities in the invention is shown in the following sequence of actions which effect a channel change operation. <ul id="ul0038" list-style="none" compact="compact"><li>1) The controlling microprocessor recognizes the need for a channel change (perhaps responding to a signal from a remote control unit). The microprocessor will use the flag_picture_end facility of the SCD by writing; <ul id="ul0039" list-style="bullet" compact="compact"><li>1 in to flag_picture_end</li><li>1 in to after_picture_discard</li><li>1 in to flag_picture_end_mask</li></ul></li><li>2) When the start code detector detects the end of the current picture, it immediately starts to discard all subsequent data. The microprocessor is interrupted and determines that the cause of the interrupt was flag_picture_end_event. The microprocessor first prepares the start code detector for the new channel by writing, <ul id="ul0040" list-style="bullet" compact="compact"><li>3 (search for sequence_start) into start_code_search.</li><li>1 to flag_picture_end_event (to clear the event)</li></ul></li><li>3) Then the microprocessor retunes the tuner to select the new channel.</li><li>4) After the last data from the old channel is transferred into the system (and before the first data from the new channel) a FLUSH Token is inserted. (Alternatively, the value 0 is written to discard_all.) The start code detector, therefore, stops discarding the data (from the old channel) and starts searching (the data from the new channel) for a sequence start code.</li><li>5) Once the sequence start code is detected, the start code detector ceases discarding data and resumes normal decoding</li></ul>

Introduction

The video parser, in accordance with the present invention, is responsible for decoding the video data stream. It is implemented as a microprogrammed processor In the normal course of events, there is little need to interact with the video parser and many simple applications may simply let it get on with its job of decoding video. However, the video parser is able to notify the controlling microprocessor when it detects unusual or unexpected events, such as bitstream errors. In all cases, the microcode includes code to recover from (and conceal) errors so that it is safe to ignore bitstream errors. However, the knowledge that bitstream errors are occurring may be useful for diagnostic purposes. Furthermore, some aspects of Timestamp management are dealt with in the parser's microcode processor. These are documented in Chapter 10

Parser Registers

The registers used by the parser as shown in Table 100 <tables id="tabl0127" num="0127"><img file="EP0891094A2_D0202.tif" /></tables><tables id="tabl0128" num="0128"><img file="EP0891094A2_D0203.tif" /></tables><tables id="tabl0129" num="0129"><img file="EP0891094A2_D0204.tif" /></tables>

Error Codes

Whenever the parser detects an event condition, it sets parser_event. If parser_mask is set to 1 (indicating that the user system is interested in servicing parser events) the parser stops processing and (assuming that chip_mask is set to 1) an interrupt is generated On responding to the interrupt the controlling microprocessor should read parser_error_code to determine the cause of the event. Table 101 provides the complete list of defined error codes in this regard. After the controlling microprocessor has responded to the event in the appropriate manner it must allow the parser of the present invention to resume processing. This is done by clearing the event by writing the value 1 to parser_event. <tables id="tabl0130" num="0130"><img file="EP0891094A2_D0205.tif" /></tables>

Dealing with User Data

Small amounts of user data may be read out from the parser. By default, all user data is discarded by the start code detector. This is to protect the system from the inappropriate use of large amounts of user data which would be beyond its capabilities In order to allow user data to reach the parser the register discard_user must be set 0. Whenever user data is encountered in the bitstream the bytes of data are buffered up in an on-chip user data RAM. The RAM has space for 192 bytes of data to be buffered. When all of the bytes of user data have been read (or the RAM is full) the parser will generate an event (ERR_USER_DATA) which allows the controlling microprocessor to read the data from the RAM Before the user data RAM is read, the microprocessor must first obtain access to the parser's internal registers by setting parser_access to 1 and then polling this bit until it reads back 1. The number of bytes in the user data RAM is indicated by parser_status. The user-data RAM cannot be accessed directly. Instead, it is necessary to write the address that is to be read into user_keyhole_addr (usually zero) then data is read from user_keyhold_data. Since user_keyhole_addr is automatically incremented each time that a read is performed from user-keyhole_data, the appropriate number of bytes of user data can be read very quickly. If there are less than 192 bytes of user data, then all of the data is dealt with by a single event. If there are more than 192 bytes, then parser_status will contain 192 bytes the first time that ERR_USER_DATA is generated. After the event has been cleared (by writing zero to parser_access and then 1 to parser_event) the microcode will interrogate parser_continue to determine what to do next. If parser_continue is 1 the parser continues dealing with user data. The remaining bytes of user data (or the next 192 bytes) are parsed from the stream and the process repeats. However, if parser_continue is 0 then the parser discards the remaining user data and proceeds with normal video decoding. Note that even if parser_continue is zero, the first ERR_USER_DATA event will always be generated.

Limiting the Amount of User Data

If it is intended that user data should be used, it is important that this is limited in order that the real-time decoding of video data can be guaranteed in accordance with the present invention. It is very difficult to specify the acceptable limit on user data since it depends on many external constraints such as the interrupt response time of the controlling microprocessor and the time taken to read a byte of data from the system. As a guide, the amount of user data should be limited to the amount that can be guaranteed to be read from the system in about 50µs (including interrupt response time etc.).

User Data RAM

During the decoding of picture data, the user RAM is used by the microcode processor for other purposes (storage of concealment motion vectors, for instance). For this reason, it is not possible to leave data in the RAM and expect it to be preserved for later use.

Introduction

The present invention includes circuity to assist in the management of video time stamps. It is assumed that the external circuitry associated with the MPEG system stream parser has recovered a stable 27 MHz clock by using the clock references (Programmed Clock Reference or System Clock Reference as appropriate). The circuitry, in accordance with the present invention, is, therefore, concerned with starting video decoding at the appropriate time to ensure synchronization with audio and, thereafter, monitoring video timestamps to ensure continued synchronization. In the absence of errors, no subsequent correction will be required. It is desirable to avoid the need to transfer clock reference information into the video decoder Hardware is divided into two areas, a circuit associated with the input stages of the system for loading video time stamps and a real-time counter that is associated with the video parser circuitry.

System Organization

The present invention includes a counter that is incremented at regular intervals derived from the 27 MHz SYSCLOCK. The system for timestamp management depends (conceptually) on a second copy of this counter being maintained outside of the system. These two counters are initialized to the same value by being reset by the same signal. Thereafter, the two counters free-run. The present invention performs its timestamp management with respect to its internal time counter denoted "videotime". To assure that the correct comparisons are made, the video timestamps are modified by the system decoder. It is not necessary to know the absolute time - simply the difference between the actual time that a picture is decoded and the nominal time it should have been decoded. Equation 1 below denotes this by setting the difference between the video time counter and the modified time stamp equal to the difference between the actual "time" (derived from the clock references) and the timestamp. Equation 2 is merely a reorganization of the variables to derive the modified time stamp.<maths id="math0090" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtable><mlabeledtr><mtext>EQ 1:</mtext><mtd><mrow><mtext>videotime - modifiedtimestamp = timestamp - time</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>EQ 2:</mtext><mtd><mrow><mtext>modifiedtimestamp = videotime + (timestamp - time)</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0891094A2_D0206.tif" /></maths> Figure 122 shows one possible organization of the arithmetic to derive the modified time stamp. In reality, it is most likely that the actual additions (and the shift) will be performed on a processor rather than in dedicated hardware. There are, of course, many other ways to derive the same numeric value of the modified time stamp. For instance, rather than having a copy of the videotime counter, it may be better to simply record the value of "time", when the <maths id="math0091" num=""><math display="inline"><mrow><mover accent="true"><mrow><mtext mathvariant="bold">RESET_TIME</mtext></mrow><mo>¯</mo></mover></mrow></math><img file="EP0891094A2_D0207.tif" /></maths> pin of the invention was last asserted. From this information and the current value of "time" it is always possible to deduce the current contents of video time within the system. It will be appreciated that any suitable rearrangement of arithmetic operations that yields a suitable value of the modified time stamp may be used. As shown in Figure 122, the modified timestamps used by the invention use only sixteen bits. This is achieved in two ways. First, since the difference between time and the timestamp (used to derive the modified timestamp - see Equation 2) should always be small, the more significant bits can be discarded. Second, since the invention only controls the presentation of video to the nearest frame-time, the less significant bits are also not required and are discarded by shifting right by four bits. Thus, the sixteen bits of time information maintained are able to deal with timing errors of up to about 11.5 seconds with an accuracy of about 180 µs (about 1% of a field time).

Contents6

365 sheets

Sheet 1
Sheet 2
Sheet 3
Sheet 4
Sheet 5
Sheet 6
Sheet 7
Sheet 8
Sheet 9
Sheet 10
Sheet 11
Sheet 12
Sheet 13
Sheet 14
Sheet 15
Sheet 16
Sheet 17
Sheet 18
Sheet 19
Sheet 20
Sheet 21
Sheet 22
Sheet 23
Sheet 24
Sheet 25
Sheet 26
Sheet 27
Sheet 28
Sheet 29
Sheet 30
Sheet 31
Sheet 32
Sheet 33
Sheet 34
Sheet 35
Sheet 36
Sheet 37
Sheet 38
Sheet 39
Sheet 40
Sheet 41
Sheet 42
Sheet 43
Sheet 44
Sheet 45
Sheet 46
Sheet 47
Sheet 48
Sheet 49
Sheet 50
Sheet 51
Sheet 52
Sheet 53
Sheet 54
Sheet 55
Sheet 56
Sheet 57
Sheet 58
Sheet 59
Sheet 60
Sheet 61
Sheet 62
Sheet 63
Sheet 64
Sheet 65
Sheet 66
Sheet 67
Sheet 68
Sheet 69
Sheet 70
Sheet 71
Sheet 72
Sheet 73
Sheet 74
Sheet 75
Sheet 76
Sheet 77
Sheet 78
Sheet 79
Sheet 80
Sheet 81
Sheet 82
Sheet 83
Sheet 84
Sheet 85
Sheet 86
Sheet 87
Sheet 88
Sheet 89
Sheet 90
Sheet 91
Sheet 92
Sheet 93
Sheet 94
Sheet 95
Sheet 96
Sheet 97
Sheet 98
Sheet 99
Sheet 100
Sheet 101
Sheet 102
Sheet 103
Sheet 104
Sheet 105
Sheet 106
Sheet 107
Sheet 108
Sheet 109
Sheet 110
Sheet 111
Sheet 112
Sheet 113
Sheet 114
Sheet 115
Sheet 116
Sheet 117
Sheet 118
Sheet 119
Sheet 120
Sheet 121
Sheet 122
Sheet 123
Sheet 124
Sheet 125
Sheet 126
Sheet 127
Sheet 128
Sheet 129
Sheet 130
Sheet 131
Sheet 132
Sheet 133
Sheet 134
Sheet 135
Sheet 136
Sheet 137
Sheet 138
Sheet 139
Sheet 140
Sheet 141
Sheet 142
Sheet 143
Sheet 144
Sheet 145
Sheet 146
Sheet 147
Sheet 148
Sheet 149
Sheet 150
Sheet 151
Sheet 152
Sheet 153
Sheet 154
Sheet 155
Sheet 156
Sheet 157
Sheet 158
Sheet 159
Sheet 160
Sheet 161
Sheet 162
Sheet 163
Sheet 164
Sheet 165
Sheet 166
Sheet 167
Sheet 168
Sheet 169
Sheet 170
Sheet 171
Sheet 172
Sheet 173
Sheet 174
Sheet 175
Sheet 176
Sheet 177
Sheet 178
Sheet 179
Sheet 180
Sheet 181
Sheet 182
Sheet 183
Sheet 184
Sheet 185
Sheet 186
Sheet 187
Sheet 188
Sheet 189
Sheet 190
Sheet 191
Sheet 192
Sheet 193
Sheet 194
Sheet 195
Sheet 196
Sheet 197
Sheet 198
Sheet 199
Sheet 200
Sheet 201
Sheet 202
Sheet 203
Sheet 204
Sheet 205
Sheet 206
Sheet 207
Sheet 208
Sheet 209
Sheet 210
Sheet 211
Sheet 212
Sheet 213
Sheet 214
Sheet 215
Sheet 216
Sheet 217
Sheet 218
Sheet 219
Sheet 220
Sheet 221
Sheet 222
Sheet 223
Sheet 224
Sheet 225
Sheet 226
Sheet 227
Sheet 228
Sheet 229
Sheet 230
Sheet 231
Sheet 232
Sheet 233
Sheet 234
Sheet 235
Sheet 236
Sheet 237
Sheet 238
Sheet 239
Sheet 240
Sheet 241
Sheet 242
Sheet 243
Sheet 244
Sheet 245
Sheet 246
Sheet 247
Sheet 248
Sheet 249
Sheet 250
Sheet 251
Sheet 252
Sheet 253
Sheet 254
Sheet 255
Sheet 256
Sheet 257
Sheet 258
Sheet 259
Sheet 260
Sheet 261
Sheet 262
Sheet 263
Sheet 264
Sheet 265
Sheet 266
Sheet 267
Sheet 268
Sheet 269
Sheet 270
Sheet 271
Sheet 272
Sheet 273
Sheet 274
Sheet 275
Sheet 276
Sheet 277
Sheet 278
Sheet 279
Sheet 280
Sheet 281
Sheet 282
Sheet 283
Sheet 284
Sheet 285
Sheet 286
Sheet 287
Sheet 288
Sheet 289
Sheet 290
Sheet 291
Sheet 292
Sheet 293
Sheet 294
Sheet 295
Sheet 296
Sheet 297
Sheet 298
Sheet 299
Sheet 300
Sheet 301
Sheet 302
Sheet 303
Sheet 304
Sheet 305
Sheet 306
Sheet 307
Sheet 308
Sheet 309
Sheet 310
Sheet 311
Sheet 312
Sheet 313
Sheet 314
Sheet 315
Sheet 316
Sheet 317
Sheet 318
Sheet 319
Sheet 320
Sheet 321
Sheet 322
Sheet 323
Sheet 324
Sheet 325
Sheet 326
Sheet 327
Sheet 328
Sheet 329
Sheet 330
Sheet 331
Sheet 332
Sheet 333
Sheet 334
Sheet 335
Sheet 336
Sheet 337
Sheet 338
Sheet 339
Sheet 340
Sheet 341
Sheet 342
Sheet 343
Sheet 344
Sheet 345
Sheet 346
Sheet 347
Sheet 348
Sheet 349
Sheet 350
Sheet 351
Sheet 352
Sheet 353
Sheet 354
Sheet 355
Sheet 356
Sheet 357
Sheet 358
Sheet 359
Sheet 360
Sheet 361
Sheet 362
Sheet 363
Sheet 364
Sheet 365

Every citation, both ways

Citations
Document	Relation	Office	Cited during
US11451776B2	Cited by	United States of America	Applicant
US7113886B2	Cited by	United States of America	Applicant
US10390013B2	Cited by	United States of America	Applicant
US10812799B2	Cited by	United States of America	Applicant
WO03063420A2	Cited by	World Intellectual Property Organization (WIPO)	International search
US2013016771A1	Cited by	United States of America	Pre-grant
US11805253B2	Cited by	United States of America	Applicant
US8767824B2	Cited by	United States of America	Search report
WO03063420A3	Cited by	World Intellectual Property Organization (WIPO)	International search
EP0503956A2	Cites	European Patent Office (EPO)	Search report
EP0506294A2	Cites	European Patent Office (EPO)	Search report
EP0562419A2	Cites	European Patent Office (EPO)	Search report
EP0576749A1	Cites	European Patent Office (EPO)	Search report
US5173695A	Cites	United States of America	Search report
US5253053A	Cites	United States of America	Search report
US5280349A	Cites	United States of America	Search report
US5325092A	Cites	United States of America	Search report

296 members in 12 offices

This recordMember, by publication datePriority claim2 more offices are in the list below

Priority claims11

Priority claims
Document	Office	Kind	Date
9415413	United Kingdom	A	1994-07-29
9415413	United Kingdom	–	1994-07-29
9511569	United Kingdom	A	1995-06-07
9511569	United Kingdom	–	1995-06-07
95305308	European Patent Office (EPO)	A	1995-07-28
9415413	–	–	–
9511569	–	–	–
95305308	–	–	–
EP19950305308	–	–	–
GB19940015413	–	–	–
GB19950011569	–	–	–

Members296

Family members, oldest first
Document	Office	Kind
CA2099172A1	Canada	A1	1993-12-31
EP0576749A1	European Patent Office (EPO)	A1	1994-01-05
GB9405914D0	United Kingdom	D0	1994-05-11
GB9415365D0	United Kingdom	D0	1994-09-21
GB9415387D0	United Kingdom	D0	1994-09-21
GB9415391D0	United Kingdom	D0	1994-09-21
GB9415413D0	United Kingdom	D0	1994-09-21
GB9416153D0	United Kingdom	D0	1994-09-28
EP0621691A2	European Patent Office (EPO)	A2	1994-10-26
JPH06326592A	Japan	A	1994-11-25
JPH06348492A	Japan	A	1994-12-22
EP0621691A3	European Patent Office (EPO)	A3	1995-03-22
GB9503964D0	United Kingdom	D0	1995-04-19
GB9504019D0	United Kingdom	D0	1995-04-19
GB9504046D0	United Kingdom	D0	1995-04-19
GB9504047D0	United Kingdom	D0	1995-04-19
GB9505942D0	United Kingdom	D0	1995-05-10
GB9511569D0	United Kingdom	D0	1995-08-02
CA2145156A1	Canada	A1	1995-09-25
CA2145157A1	Canada	A1	1995-09-25
CA2145158A1	Canada	A1	1995-09-25
CA2145159A1	Canada	A1	1995-09-25
CA2145218A1	Canada	A1	1995-09-25
CA2145219A1	Canada	A1	1995-09-25
CA2145220A1	Canada	A1	1995-09-25
CA2145221A1	Canada	A1	1995-09-25
CA2145222A1	Canada	A1	1995-09-25
CA2145223A1	Canada	A1	1995-09-25
CA2145224A1	Canada	A1	1995-09-25
CA2145225A1	Canada	A1	1995-09-25
CA2145361A1	Canada	A1	1995-09-25
CA2145362A1	Canada	A1	1995-09-25
CA2145363A1	Canada	A1	1995-09-25
CA2145365A1	Canada	A1	1995-09-25
CA2145379A1	Canada	A1	1995-09-25
CA2145423A1	Canada	A1	1995-09-25
CA2145424A1	Canada	A1	1995-09-25
CA2145425A1	Canada	A1	1995-09-25
CA2145426A1	Canada	A1	1995-09-25
CA2145427A1	Canada	A1	1995-09-25
CA2145549A1	Canada	A1	1995-09-25
CA2244810A1	Canada	A1	1995-09-25
EP0674266A2	European Patent Office (EPO)	A2	1995-09-27
EP0674442A2	European Patent Office (EPO)	A2	1995-09-27
EP0674443A2	European Patent Office (EPO)	A2	1995-09-27
EP0674446A2	European Patent Office (EPO)	A2	1995-09-27
GB2287808A	United Kingdom	A	1995-09-27
GB2287850A	United Kingdom	A	1995-09-27
GB2288520A	United Kingdom	A	1995-10-18
GB2288521A	United Kingdom	A	1995-10-18
GB2288957A	United Kingdom	A	1995-11-01
KR950033862A	Republic of Korea	A	1995-12-26
KR950033894A	Republic of Korea	A	1995-12-26
KR950033895A	Republic of Korea	A	1995-12-26
KR950033896A	Republic of Korea	A	1995-12-26
CN1114489A	China	A	1996-01-03
CA2154962A1	Canada	A1	1996-01-30
EP0695095A2	European Patent Office (EPO)	A2	1996-01-31
AU2501995A	Australia	A	1996-02-08
KR960006647A	Republic of Korea	A	1996-02-23
JPH0855060A	Japan	A	1996-02-27
JPH0870452A	Japan	A	1996-03-12
JPH0870453A	Japan	A	1996-03-12
CN1118475A	China	A	1996-03-13
GB2293076A	United Kingdom	A	1996-03-13
JPH0897725A	Japan	A	1996-04-12
GB2288521A8	United Kingdom	A8	1996-04-15
JPH08116260A	Japan	A	1996-05-07
JPH08116261A	Japan	A	1996-05-07
US5519339A	United States of America	A	1996-05-21
JPH08172624A	Japan	A	1996-07-02
JPH08179983A	Japan	A	1996-07-12
JPH08179984A	Japan	A	1996-07-12
JPH08202614A	Japan	A	1996-08-09
EP0674442A3	European Patent Office (EPO)	A3	1996-08-14
EP0674446A3	European Patent Office (EPO)	A3	1996-08-14
JPH08228343A	Japan	A	1996-09-03
JPH08228344A	Japan	A	1996-09-03
JPH08228345A	Japan	A	1996-09-03
JPH08228346A	Japan	A	1996-09-03
JPH08228347A	Japan	A	1996-09-03
JPH08228348A	Japan	A	1996-09-03
JPH08237654A	Japan	A	1996-09-13
JPH08241066A	Japan	A	1996-09-17
CN1133534A	China	A	1996-10-16
JPH08279763A	Japan	A	1996-10-22
JPH08316838A	Japan	A	1996-11-29
JPH08322044A	Japan	A	1996-12-03
JPH08322045A	Japan	A	1996-12-03
CN1137212A	China	A	1996-12-04
JPH0918871A	Japan	A	1997-01-17
US5603012A	United States of America	A	1997-02-11
CN1144434A	China	A	1997-03-05
US5625571A	United States of America	A	1997-04-29
US5689313A	United States of America	A	1997-11-18
EP0674266A3	European Patent Office (EPO)	A3	1997-12-03
US5699544A	United States of America	A	1997-12-16
EP0621691B1	European Patent Office (EPO)	B1	1997-12-29
US5703793A	United States of America	A	1997-12-30
DE69407471D1	Germany	D1	1998-02-05

Showing 100 of 296

10 legal events, as the office reported them to INPADOC

Over the term

Point at a mark for the event

Events

Legal events, newest first
	Event	Code
2003-09-03	Application deemed to be withdrawnWithdrawn18D	18D
2003-07-18	Information on the status of an ep patent application or granted ep patentGrantedSTATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWNSTAA	STAA
2001-04-11	Information on inventor provided before grant (corrected)RIN1	RIN1
2001-04-11	Information on inventor provided before grant (corrected)RIN1	RIN1
2000-01-12	Designated contracting statesAK	AK
1999-11-26	Search report despatchedORIGINAL CODE: 0009013PUAL	PUAL
1999-01-13	Request for examination filed17P	17P
1999-01-13	Divisional application: reference to earlier applicationAC	AC
1999-01-13	Designated contracting statesAK	AK
1998-11-27	Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI	PUAI

Video decompression

Abstract

Term

GLOSSARY

DETAILED DESCRIPTIONS

DETAILED DESCRIPTION OF THE INVENTION

DETAILED DESCRIPTION OF THE INVENTION FOR STORING VIDEO INFORMATION

ALU

CDCLOCK

Priority claims11

Members296

Over the term

Events

Numbers

Titles4

Classification

Designated states13