CA2145221A1 - System and apparatus for decoding variable-length video data and methods relating thereto - Google Patents

Abstract

A multi-standard video decompression apparatus has 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.

Description

DEMANDES OU BREVETS VOLUMINEUX

LA PRÉSENTE PARTIE DE ~ l I t I~ENIANDE OU CE BREVE~
COMPREND PLUS D'UN TOME~ -CECI EST LE TOME DE

NOTE: Pour les tomes additionels, veuillez contacter le Bureau canadien des brevets 2.

JUMBO APPLICATIONS/PATENTS

THIS SECTION OF THE APPLlCATlON/iATENT CONTAINS MORE
THAN ONE VOLUME

THIS IS VOLUME l OF 3 NOTE: For additional v~lumes please c~ntact the Canadian Patent Office - 21~5221 PADDING
This application claims priority from British Application No. British Application No. 9405914.4 filed March 24, 1994 and British Application No. (not yet known) filed February 28, 1995.
RACR~ROUND OF THE lNv~N-LlON
The present invention is directed to improvements in methods and apparatus for decompression which operates to decompress and/or decode a plurality of differently encoded input signals. The illustrative embodiment chosen for description hereinafter relates to the decoding of a plurality of encoded picture standards. More specifically, this embodiment relates to the decoding of any one of the well known standards known as JPEG, MPEG and H.261.
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.
Video compression/decompression systems are generally well-known in the art. However, such systems have generally been dedicated in design and use to a single compression standard.
They have also suffered from a number of other inefficiencies and inflexibility in overall system and subsystem design and data flow management.
Examples of prior art systems and subsystems are enumerated as follows:
One prior art system is described in United States Patent No. 5,216,724. The apparatus comprises a plurality of compute modules, in a preferred embodiment, for a total of four compute modules coupled in parallel. Each of the - 21~5221 compute modules has a processor, dual port memory, scratch-pad memory, and an arbitration mechanism. A first bus couples the compute modules and a host processor. The device comprises a shared memory which is coupled to the host processor and to the compute modules with a second bus.
United States Patent No. 4,785,349 discloses a full motion color digital video signal that is compressed, formatted for transmission, recorded on compact disc media and decoded at conventional video frame rates. During compression, regions of a frame are individually analyzed to select optimum fill coding methods specific to each region.
Region decoding time estimates are made to optimize compression thresholds. Region descriptive codes conveying the size and locations of the regions are grouped together in a first segment of a data stream. Region fill codes conveying pixel amplitude indications for the regions are grouped together according to fill code type and placed in other segments of the data stream. The data stream segments are individually variable length coded according to their respective statistical distributions and formatted to form data frames. The number of bytes per frame is withered by the addition of auxiliary data determined by a reverse frame sequence analysis to provide an average number selected to minimize pauses of the compact disc during playback, thereby avoiding unpredictable seek mode latency periods characteristic of compact discs. A decoder includes a variable length decoder responsive to statistical information in the code-stream for separately variable length decoding individual segments of the data stream. Region location data is derived from region descriptive data and applied with region fill codes to a plurality of region specific decoders selected by detection of the fill code type (e.g., relative, absolute, dyad and DPCM) and decoded region pixels are stored in a bit map for subsequent display.

``- ` 2145221 United States Patent No. 4,922,341 discloses a method for scene-model-assisted reduction of image data for digital television signals, whereby a picture signal supplied at time is to be coded, whereby a predecessor frame from a scene already coded at time t-1 is present in an image store as a reference, and whereby the frame-to-frame information is composed of an amplification factor, a shift factor, and an adaptively acquired quad-tree division structure. Upon initialization of the system, a uniform, prescribed gray scale value or picture half-tone expressed as a defined luminance value is written into the image store of a coder at the transmitter and in the image store of a decoder at the receiver store, in the same way for all picture elements (pixels). Both the image store in the coder as well as the image store in the decoder are each operated with feed back to themselves in a manner such that the content of the image store in the coder and decoder can be read out in blocks of variable size, can be amplified with a factor greater than or less than 1 of the luminance and can be written back into the image store with shifted addresses, whereby the blocks of variable size are organized according to a known quad tree data structure.
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.
United States Patent No. 5,146,325 discloses a video decompression system for decompressing compressed image data wherein odd and even fields of the video signal are independently compressed in sequences of intraframe and interframe compression modes and then interleaved for transmission. The odd and even fields are independently decompressed. During intervals when valid decompressed odd/even field data is not available, even/odd field data is substituted for the unavailable odd/even field data.
Independently decompressing the even and odd fields of data and substituting the opposite field of data for unavailable data may be used to advantage to reduce image display latency during system start-up and channel changes.
United States Patent No. 5,168,356 discloses a video signal encoding system that includes apparatus for segmenting encoded video data into transport blocks for signal transmission. The transport block format enhances signal recovery at the receiver by virtue of providing header data from which a receiver can determine re-entry points into the data stream on the occurrence of a loss or corruption of transmitted data. The re-entry points are maximized by providing secondary transport headers embedded within encoded video data in respective transport blocks.
United States Patent No. 5,168,375 discloses a method for processing a field of image data samples to provide for one or more of the functions of decimation, interpolation, and sharpening. This is accomplished by an array transform processor such as that employed in a JPEG compression system.
Blocks of data samples are transformed by the discrete even cosine transform (DECT) in both the decimation and interpolation processes, after which the number of frequency terms is altered. In the case of decimation, the number of frequency terms is reduced, this being followed by inverse transformation to produce a reduced-size matrix of sample points representing the original block of data. In the case of interpolation, additional frequency components of zero value are inserted into the array of frequency components after which inverse transformation produces an enlarged data sampling set without an increase in spectral bandwidth. In the case of sharpening, accomplished by a convolution or filtering operation involving multiplication of transforms of data and filter kernel in the frequency domain, there is provided an inverse transformation resulting in a set of blocks of processed data samples. The blocks are overlapped followed by a savings of designated samples, and a discarding of excess samples from regions of overlap. The spatial representation of the kernel is modified by reduction of the number of components, for a linear-phase filter, and zero-padded to equal the number of samples of a data block, this 2S being followed by forming the discrete odd cosine transform (DOCT) of the padded kernel matrix.
United States Patent No. 5,175,617 discloses a system and method for transmitting logmap video images through telephone line band-limited analog channels. The pixel organization in the logmap image is designed to match the sensor geometry of the human eye with a greater concentration of pixels at the center. The transmitter divides the frequency band into channels, and assigns one or two pixels to each channel, for example a 3KHz voice quality telephone 2~4~221 line is divided into 768 channels spaced about 3.9Hz apart.
Each channel consists of two carrier waves in quadrature, so each channel can carry two pixels. Some channels are reserved for special calibration signals enabling the receiver to detect both the phase and magnitude of the received signal. If the sensor and pixels are connected directly to a bank of oscillators and the receiver can continuously receive each channel, then the receiver need not be synchronized with the transmitter. An FFT algorithm implements a fast discrete approximation to the continuous case in which the receiver synchronizes to the first frame and then acquires subsequent frames every frame period. The frame period is relatively low compared with the sampling period so the receiver is unlikely to lose frame synchrony once the first frame is detected. An experimental video telephone transmitted 4 frames per second, applied quadrature coding to 1440 pixel logmap images and obtained an effective data transfer rate in excess of 40,000 bits per second.
United States Patent No. 5,185,819 discloses a video compression system having odd and even fields of video signal that are independently compressed in sequences of intraframe and interframe compression modes. The odd and even fields of independently compressed data are interleaved for transmission such that the intraframe even field compressed data occurs midway between successive fields of intraframe odd field compressed data. The interleaved sequence provides receivers with twice the number of entry points into the signal for decoding without increasing the amount of data transmitted.
United States Patent No. 5,212,742 discloses an apparatus and method for processing video data for compression/decompression in real-time. The apparatus comprises a plurality of compute modules, in a preferred embodiment, for a total of four compute modules coupled in - ` 21~221 parallel. Each of the compute modules has a processor, dual port memory, scratch-pad memory, and an arbitration mechanism. A first bus couples the compute modules and host processor. Lastly, the device comprises a shared memory S which is coupled to the host processor and to the compute modules with a second bus. The method handles assigning portions of the image for each of the processors to operate upon.
United States Patent No. 5,231,484 discloses a system and method for implementing an encoder suitable for use with the proposed IS0/IEC MPEG standards. Included are three cooperating components or subsystems that operate to variously adaptively pre-process the incoming digital motion video sequences, allocate bits to the pictures in a sequence, and adaptively quantize transform coefficients in different regions of a picture in a video sequence so as to provide optimal visual quality given the number of bits allocated to that picture.
United States Patent No. 5,267,334 discloses a method of removing frame redundancy in a computer system for a sequence of moving images. The method comprises detecting a first scene change in the sequence of moving images and generating a first keyframe containing complete scene information for a first image. The first keyframe is known, in a preferred embodiment, as a "forward-facing" keyframe or intraframe, and it is normally present in CCITT compressed video data. The process then comprises generating at least one intermediate compressed frame, the at least one intermediate compressed frame containing difference information from the first image for at least one image following the first image in time in the sequence of moving images. This at least one frame being known as an interframe. Finally, detecting a second scene change in the sequence of moving images and generating a second keyframe containing complete scene information for an - 21~221 image displayed at the time just prior to the second scene change, known as a "backward-facing" keyframe. The first keyframe and the at least one intermediate compressed frame are linked for forward play, and the second keyframe and the intermediate compressed frames are linked in reverse for reverse play. The intraframe may also be used for generation of complete scene information when the images are played in the forward direction. When this sequence is played in reverse, the backward-facing keyframe is used for the generation of complete scene information.
United States Patent No. 5,276,513 discloses a first circuit apparatus, comprising a given number of prior-art image-pyramid stages, together with a second circuit apparatus, comprising the same given number of novel motion-vector stages, perform cost-effective hierarchical motion analysis (HMA) in real-time, with minimum system processing delay and/or employing minimum system processing delay and/or employing minimum hardware structure. Specifically, the first and second circuit apparatus, in response to relatively high-resolution image data from an ongoing input series of successive given pixel-density image-data frames that occur at a relatively high frame rate (e.g., 30 frames per second), derives, after a certain processing-system delay, an ongoing output series of successive given pixel-density vector-data frames that occur at the same given frame rate. Each vector-data frame is indicative of image motion occurring between each pair of successive image frames.
United States Patent No. 5,283,646 discloses a method and apparatus for enabling a real-time video encoding system to accurately deliver the desired number of bits per frame, while coding the image only once, updates the quantization step size used to quantize coefficients which describe, for example, an image to be transmitted over a communications channel. The data is divided into sectors, each sector - ` 21~5221 including a plurality of blocks. The blocks are encoded, for example, using DCT coding, to generate a sequence of coefficients for each block. The coefficients can be quantized, and depending upon the quantization step, the number of bits required to describe the data will vary significantly. At the end of the transmission of each sector of data, the accumulated actual number of bits expended is compared with the accumulated desired number of bits expended, for a selected number of sectors associated with the particular group of data. The system then readjusts the quantization step size to target a final desired number of data bits for a plurality of sectors, for example describing an image. Various methods are described for updating the quantization step size and determining desired bit allocations.
The article, Chong, Yong M., A Data-Flow Architecture for Digital Imaqe Processing, Wescon Technical Papers: No.
2 Oct./Nov. 1984, discloses a real-time signal processing system specifically designed for image processing. More particularly, a token based data-flow architecture is disclosed wherein the tokens are of a fixed one word width having a fixed width address field. The system contains a plurality of identical flow processors connected in a ring fashion. The tokens contain a data field, a control field and a tag. The tag field of the token is further broken down into a processor address field and an identifier field. The processor address field is used to direct the tokens to the correct data-flow processor, and the identifier field is used to label the data such that the data-flow processor knows what to do with the data. In this way, the identifier field acts as an instruction for the data-flow processor. The system directs each token to a specific data-flow processor using a module number (MN). If the MN matches the MN of the particular stage, then the appropriate operations are 21~221 performed upon the data. If unrecognized, the token is directed to an output data bus.
The article, Kimori, S. et al. An Elastic PiPeline Mechanism by Self-Timed Circuits, IEEE J. of Solid-State Circuits, Vol. 23, No. 1, February 1988, discloses an elastic pipeline having self-timed circuits. The asynchronous pipeline comprises a plurality of pipeline stages. Each of the pipeline stages consists of a group of input data latches followed by a combinatorial logic circuit that carries out logic operations specific to the pipeline stages. The data latches are simultaneously supplied with a triggering signal generated by a data-transfer control circuit associated with that stage. The data-transfer control circuits are interconnected to form a chain through which send and acknowledge signal lines control a hand-shake mode of data transfer between the successive pipeline stages.
Furthermore, a decoder is generally provided in each stage to select operations to be done on the operands in the present stage. It is also possible to locate the decoder in the preceding stage in order to pre-decode complex decoding processing and to alleviate critical path problems in the logic circuit. The elastic nature of the pipeline eliminates any centralized control since all the interworkings between the submodules are determined by a completely localized decision and, in addition, each submodule can autonomously perform data buffering and self-timed data-transfer control at the same time. Finally, to increase the elasticity of the pipeline, empty stages are interleaved between the occupied stages in order to ensure reliable data transfer between the stages.

Accordingly, those concerned with the design, development and use of video compression/decompression systems and related subsystems have long recognized a need for improved methods and apparatus providing enhanced flexibility, efficiency and performance. The present invention clearly fulfills all these needs.

8UMMARY OF THE l~v~c.~-ION
Briefly, and in general terms, the present invention provides, in a pipeline machine, a fixed size, fixed width buffer and means for padding the buffer to pass an arbitrary number of bits through the buffer. The padding means may be a start code detector.
Padding may be performed only on the last word of a token and padding insures uniformity of word size. In accordance with the invention, a reconfigurable processing stage may be provided as a spatial decoder and the padding means adds to picture data being handled by the spatial decoder sufficent additional bits such that each decompressed picture at the output of the spatial decoder is of the same length in bits.
The above and other objectives and advantages of the invention will become apparent from the following more detailed description when taken in conjunction with the accompanying drawings.

Figure. 1 illustrates six cycles of a six-stage pipeline for different combinations of two internal control signals;
Figures. 2a and 2b illustrate a pipeline in which each stage includes auxiliary data storage. They also show the manner in which pipeline stages can "compress" and "expand" in response to delays in the pipeline;
Figures. 3a(1), 3a(2), 3b(1) and 3b(2) illustrate the control of data transfer between stages of a preferred embodiment of a pipeline using a two-wire interface and a multi-phase clock;
Figure. 4 is a block diagram that illustrates a basic embodiment of a pipeline stage that incorporates a two-wire transfer control and also shows two consecutive pipeline processing stages with the two-wire transfer control;
Figures. 5a and 5b taken together depict one example of a timing diagram that shows the relationship between timing signals, input and output data, and internal control signals used in the pipeline stage as shown in Figure. 4;
Figure. 6 is a block diagram of one example of a pipeline stage that holds its state under the control of an extension bit;
Figure. 7 is a block diagram of a pipeline stage that decodes stage activation data words;
Figures. 8a and 8b taken together form a block diagram showing the use of the two-wire transfer control in an exemplifying "data duplication" pipeline stage;
Figures. 9a and 9b taken together depict one example of a timing diagram that shows the two-phase clock, the two-wire transfer control signals and the other internal data and control signals used in the exemplifying embodiment shown in Figures. 8a and 8b.
Figure 10 is a block diagram of a reconfigurable processing stage;

Figure 11 is a block diagram of a spatial decoder;
Figure 12 is a block diagram of a temporal decoder;
Figure 13 is a block diagram of a video formatter;
Figures 14a-c show various arrangements of memory blocks used in the present invention:
Figure 14a is a memory map showing a first arrangement of macroblocks;
Figure 14b is a memory map showing a second arrangement of macroblocks;
Figure 14c is a memory map showing a further arrangement of macroblocks;
Figure 15 shows a Venn diagram of possible table selection values;
Figure 16 shows the variable length of picture data used in the present invention;
Figure 17 is a block diagram of the temporal decoder including the prediction filters;
Figure 18 is a pictorial representation of the prediction filtering process;
Figure 19 shows a generalized representation of the macroblock structure;
Figure 20 shows a generalized block diagram of a Start Code Detector;
Figure 21 illustrates examples of start codes in a data stream;
Figure 22 is a block diagram depicting the relationship between the flag generator, decode index, header generator, extra word generator and output latches;
Figure 23 is a block diagram of the Spatial Decoder DRAM
interface;
Figure 24 is a block diagram of a write swing buffer;
Figure 25 is a pictorial diagram illustrating prediction data offset from the block being processed;
Figure 26 is a pictorial diagram illustrating prediction data 21~5221 offset by (1,1);
Figure 27 is a block diagram illustrating the Huffman decoder and parser state machine of the Spatial Decoder.
Figure 28 is a block diagram illustrating the prediction filter.

Figure 29 shows a typical decoder system;
Figure 30 shows a JPEG still picture decoder;
Figure 31 shows a JPEG video decoder;
5 Figure 32 shows a multi-standard video decoder;
Figure 33 shows the start and the end of a token;
Figure 34 shows a token address and data fields;
Figure 35 shows a token on an interface wider than 8 bits;
10 Figure 36 shows a macroblock structure;
Figure 37 shows a two-wire interface protocol;
Figure 38 shows the location of external two-wire interfaces;
Figure 39 shows clock propagation;
15 Figure 40 shows two-wire interface timing;
Figure 41 shows examples of access structure;
Figure 42 shows a read transfer cycle;
Figure 43 shows an access start timing;
Figure 44 shows an example access with two write 20 transfers;
Figure 45 shows a read transfer cycle;
Figure 46 shows a write transfer cycle;
~-~ure 47 shows a refresh cycle;
Figure 48 shows a 32 bit data bus and a 256 kbit deep DRAMs (9 bit row address);
Figure 49 shows timing parameters for any strobe signal;
Figure 50 shows timing parameters between any two strobe signals;
30 Figure 51 shows timing parameters between a bus and Figure 52 shows timing parameters between a bus and a strobe;
Figure 53 shows an MPI read timing;
35 Figure 54 shows an MPI write timing;
Figure 55 shows organization of large integers in the memory map;
Figure 56 shows a typical decoder clock regime;
Figure 57 shows input clock requirements;
40 Figure 58 shows the Spatial Decoder;
Figure 59 shows the inputs and outputs of the input circuit;
Figure 60 shows the coded port protocol;
Figure 61 shows the start code detector;
45 Figure 62 shows start codes detected and converted Figure 63 shows the start codes detector passing Tokens; shows overlapping MPEG start codes (byte aligned);

Figure 65 shows overlapping MPEG start codes (not byte aligned);
Figure 66 shows jumping between two video sequences;
5 Figure 67 shows a sequence of extra Token insertion;
Figure 68 shows decoder start-up control;
Figure 69 shows enabled streams queued before the output;
10 Figure 70 shows a spatial decoder buffer;
Figure 71 shows a buffer pointer;
Figure 72 shows a video demux;
Figure 73 shows a construction of a picture;
Figure 74 shows a construction of a 4:2:2 15 macroblock;
Figure 75 shows a calculating macroblock dimension from pel ones;
Figure 76 shows spatial decoding;
Figure 77 shows an overview of H.261 inverse 20 quantization;
Figure 78 shows an overview of JPEG inverse quantization;
Figure 79 shows an overview of MPEG inverse quantization;
25 Figure 80 shows a quantization table memory map;
Figure 81 shows an overview of JPEG baseline sequential structure;
Figure 82 shows a tokenised JPEG picture;
Figure 83 shows a temporal decoder;
30 Figure 84 shows a picture buffer specification;
Figure 85 shows an MPEG picture sequence (m=3);
Figure 86 shows how "I" pictures are stored and output;
Figure 87 shows how "P" pictures are formed, stored 35 and output;
Figure 88 shows how "B" pictures are formed and output;
Figure 89 shows P picture formation;
Figure 90 shows H.261 prediction formation;
Figure 91 shows an H.261 "sequence";
Figure 92 shows a hierarchy of H.261 syntax;
Figure 93 shows an H.261 picture layer;
Figure 94 shows an H.261 arrangement of groups of blocks;
Figure 95 shows an H.261 "slice" layer;
Figure 96 shows an H.261 arrangement of macroblocks;
Figure 97 shows an H.261 sequence of blocks;
Figure 98 shows an H.261 macroblock layer;
Figure 99 shows an H.261 arrangement of pels in blocks;

Figure 100 shows a hierarchy of MPEG syntax;
Figure 101 shows an MPEG sequence layer;
Figure 102 shows an MPEG group of pictures layer;
Figure 103 shows an MPEG picture layer;
5 Figure 104 shows an MPEG "slice" layer;
Figure 105 shows an MPEG sequence of blocks;
Figure 106 shows an MPEG macroblock layer;
Figure 107 shows an "open GOP";
Figure 108 shows examples of access structure;
10 Figure 109 shows access start timing;
Figure 110 shows a fast page read cycle;
Figure 111 shows a fast page write cycle;
Figure 112 shows a refresh cycle;
Figure 113 shows extracting row and column address 15 from a chip address;
Figure 114 shows timing parameters for any strobe signal;
Figure 115 shows timing parameters between any two strobe signals;
20 Figure 116 shows timing parameters between a bus and a strobe;
Figure 117 shows timing parameters between a bus and a strobe;
Figure 118 shows a Huffman decoder and parser;
Figure 119 shows an H.261 and an MPEG AC Coefficient Decoding Flow Chart;
Figure 120 shows a block diagram for JPEG (AC and DC) coefficient decoding;
Figure 121 shows a flow diagram for JPEG (AC and DC) coefficient decoding;
Figure 122 shows an interface to the Huffman Token Formatter;
Figure 123 shows a token formatter block diagram;
Figure 124 shows an H.261 and an MPEG AC Coefficient Decoding;
Figure 125 shows the interface to the Huffman ALU;
Figure 126 shows the basic structure of the Huffman ALU;
Figure 127 shows the buffer manager;
40 Figure 128 shows an imodel and hsppk block diagram;
Figure 129 shows an imex state diagram;
Figure 130 illustrates the buffer start-up;
Figure 131 shows a DRAM interface;
Figure 132 shows a write swing buffer;
45 Figure 133 shows an arithmetic block;
Figure 134 shows an iq block diagram;
Figure 135 shows an iqca state machine;
Figure 136 shows an IDCT 1-D Transform Algorithm;
Figure 137 shows an IDCT 1-D Transform Architecture;
50 Figure 138 shows a token stream block diagram;
Figure 139 shows a standard block structure;

21~5221 Figure 140 is a block diagram showing;
microprocessor test access;
Figure 141 shows 1-D Transform Micro-Architecture;
Figure 142 shows a temporal decoder block diagram;
5 Figure 143 shows the structure of a Two-wire interface stage;
Figure 144 shows the address generator block diagram;
Figure 145 shows the block and pixel offsets;
10 Figure 146 shows multiple prediction filters;
Figure 147 shows a single prediction filter;
Figure 148 shows the 1-D prediction filter;
-Figure 149 shows a block of pixels;
Figure 150 shows the structure of the read rudder;
15 Figure 151 shows the block and pixel offsets;
Figure 152 shows a prediction example;
Figure 153 shows the read cycle;
Figure 154 shows the write cycle;
Figure 155 shows the top-level registers block diagram with timing references;
Figure 156 shows the control for incrementing presentation numbers;
Figure 157 shows the buffer manager state machine (complete);
Figure 158 shows the state machine main loop;
Figure 159 shows the buffer 0 containing an SIF (22 by 18 macroblocks) picture;
Figure 160 shows the SIF component 0 with a display window;
Figure 161 shows an example picture format showing storage block address;
Figure 162 shows a buffer 0 containing a SIF (22 by 18 macroblocks) picture;
Figure 163 shows an example address calculation;
35 Figure 164 shows a write address generation state machine;
Figure 165 shows a slice of the datapath;
Figure 166 shows a two cycle operation of the datapath;
40 Figure 167 shows mode 1 filtering;
Figure 168 shows a horizontal up-sampler datapath;
and Figure 169 shows the structure of the color-space converter.

THIS PAGE IS INTENTIONALLY
LEFT BLANK.

21~5221 THIS PAGE IS INTENTIONALLY
LEFT BLANK.

In the ensuing description of the practice of the invention, the following terms are frequently used and are generally defined by the following glossary:

BLOC~: An 8-row by 8-column matrix of pels, or 64 DCT
coefficients (source, quantized or dequantized).
CHR~TN~NCE (CONPONENT): 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 REPRE8ENTATION: A data element as represented in its encoded form.
CODED VIDEO BIT 8TREAM: 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.
COMPONEN~: A matrix, block or single pel from one of the three matrices (luminance and two chrominance) that make up a picture.
COMPRE88ION: Reduction in the number of bits used to represent an item of data.
DECODER: An embodiment of a decoding process.
DECODING (PROCE88): The process defined in this specification that reads an input coded bitstream and produces decoded pictures or audio samples.
DI8PLAY 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 (PROCES8): 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.

~145221 INTRA CODING: Coding of a macroblock or picture that uses information only from that macroblock or picture.
LUMTN~NCE (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.
~ACROBLOCR: 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 214~2~1 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.
P~CONFIGURABLE PROCES8 8TAGE (RP8): A stage, which in response to a recognized token, reconfigures itself to perform various operations.
8LIC~: A series of macroblocks.
TOREN: A universal adaptation unit in the form of an interactive interfacing messenger package for control and/or data functions.
8TART CODE8 ~8Y8TEM 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 8EQ~ENCE: A series of one or more pictures.
Detailed Descriptions -DESCRIPTION OF THE PREFERRED EMBODIMENT(S) As an introduction to the most general features used in a pipeline system which is utilized in the preferred embodiments of the invention, Fig. 1 is a greatly simplified illustration of six cycles of a six-stage pipeline. (As is explained in greater detail below, the preferred embodiment of the pipeline includes several advantageous features not shown in Fig 1.).
Referring now to the drawings, wherein like reference numerals denote like or corresponding elements throughout the various figures of the drawings, and more particularly to Fig. 1, there is shown a block diagram of six cycles in practice of the present invention. Each row of boxes illustrates a cycle and each of the different stages are labelled A-F, respectively. Each shaded box indicates that the corresponding stage holds valid data, i.e., data that is to be processed in one of the pipeline stages. After processing (which may involve nothing more than a simple transfer without manipulation of the data) valid data is transferred out of the pipeline as valid output data.
Note that an actual pipeline application may include more or fewer than six pipeline stages. As will be appreciated, the present invention may be used with any number of pipeline stages. Furthermore, data may be processed in more than one stage and the processing time for different stages can differ.
In addition to clock and data signals (described below), the pipeline includes two transfer control signals -- a "VALID" signal and an "ACCEPT" signal. These signals are used to control the transfer of data within the pipeline.
The VALID signal, which is illustrated as the upper of the two lines connecting neighboring stages, is passed in a forward or downstream direction from each pipeline stage to the nearest neighboring device. This device may be another '`=~ 2145221 ~``

pipeline stage or some other system. For example, the last pipeline stage may pass its data on to subsequent processing circuitry. The ACCEPT signal, which is illustrated as the iower of the two lines connecting neighboring stages, passes in the other direction upstream to a preceding device.
A data pipeline system of the type used in the practice of the present invention has, in preferred embodiments, one or more of the following characteristics:
1. The pipeline is "elastic" such that a delay at a particular pipeline stage causes the minimum disturbance possible to other pipeline stages. Succeeding pipeline stages are allowed to continue processing and, therefore, this means that gaps open up in the stream of da;a following the delayed stage. Similarly, preceding 1J pipeline stages may also continue where possible. In this case, any gaps in the data stream may, wherever poss!ble, be removed from the streaml of data.
2. Control signals that arbitrate the pipeline are organized so that they only propagate to the nearest 2C neighboring pipeline stages. In the case of signalsflowing in the same direction as the data flow, this is the immediately succeeding stage. In the case of signals flowing in the opposite direction to the data flow, this is the immediately preceding stage.
2~ 3. The data in the pipeline is encoded such that many different types of data are processed in the pipeline.
This encoding accommodates data packets of variable size and the size of the packet need not be known in advance.
~. The overhead associated with describing the type o~
,u data is as s~lall as possible.
5. It is possible for each pipeline stage to recognize only the ~inimum number of data types that are needed for its required function. It should, however, still be able to pass all data types onto the succeeding stage eve~

~'~

- 21~5221 though it does not recognize them. This ena~les communication between non-adjacent pipeline stages.
Although not shown in Fig. 1, there are data lines, either single lines or several parallel lines, which form a data bus that also lead into and out of each pipeline stage.
As is explained and illustrated in greater detail below, data is transferred into, out of, and between the stages of the pipeline over the data lines.
Note that the first pipeline stage may receive data and ;3 control signals from any form of preceding device. For example, reception circuitry of a digital image transmission system, another pipeline, or the like. On the other hand, it may generate itself, all or part of the data to be processed in the pipeline. Indeed, as is explained below, a "stage"
1~ may contain arbitrary processing circuitry, including none at all (for simple passing of data) or entire systems (for example, another pipeline or even multiple systems or pipelines), and it may generate, change, and delete data as desired ~~ hhen a pipeline stage contains valid data that is tO ~e transferred down the pipeline, the VALID signal, which indicates data validity, need not be transferred further than tO the immediately subsequent pipeline stage. A two-wire interface is, therefore, included between every pair of 2~ pipeline stages in the system. This includes a two-wire interface between a preceding device and the first stage, and between a subsequent device and the last stage, if such other devices are included and data is to be transferred ~etween the~ and the pipeline.
o Each of the signals, ACCEPT and VALID, has a HIGH and a LOw value. These values are abbreviated as ~H~ and "L", respec.ively. The ~ost common applications of the pipeline, in practicing the invention, will typically be digital. In such digital implementations, the HIGH value may, for ~ - 2145~21 example, be a logical "1" and the LOW value may be a logical "O". The system is not restricted to digital implementations, however, and in analog implementations, the HIGH value may be a voltage or other similar quantity above (or below) a set threshold, with the LOW value being indicated by the corresponding signal being below (or above) the same or some other threshold. For digital applications, the present invention may be implemented using any known technology, such as CMOS, bipolar etc.
It lS not necessary to use a distinct storage device and wires to provide for storage of VALID signals. This is true even in a digital embodiment. All that is required is that the indication of "validity" of the data be stored along with the data. By way of example only, in digital television pictures that are represented by digital values, a, specified in the ,nternational standard CCI~ 601, certain speci~ c values are not allowed. In this system, eight-bit ~lnar~
numbers are used to represent samples of the picture and .he values zero and 255 may not be used.
2v If such a picture were to be processed in a pipeline built in the practice of the present invention, then one of these values (zero, for example) could be used to indicate that the data in a specific stage in the pipeline is not valid.
Accordingly, any non-zero data would be deemed to be valid.
2~ In this example, there is no specific latch that can be identified and said to be storing the "validness" of .he associated data. Nonetheless, the validity of the data is stored along with the data.
As shown in Fig. 1, the state of the VALID signal into ach stage is indicated as an ~H~ or an "L" on an uppe-, r gkt-pointed arrow. Therefore, the VALID signal from sta~e A intG Stage B is LOW, and the VALID signal from Stage D lntc Stage E is HIGH. The state of the ACCEPT signal into each stage is indicated as an ~H~ or an ~L~ on a lower, left-~ 2145221 . ;.

pointing arrow. Hence, the AC~EPT signal from Stage E intoStage D is HIGH, whereas the ACCEPT signal from the device connected downstream of the pipeline into Stage F is LOW.
Data is transferred from one stage to another during a cycle (explained below~ whenever the ACCEPT signal of the downstream stage into its upstream neighbor is HIGH. If the ACCEPT signal is LOW between two stages, then data is not transferred between these stages.
Referring again to Fig. 1, if a box is shaded, the ~u corresponding pipeline stage is assumed, by way of exa~ple, to contain valid output data. Likewise, the VALID signal which is passed from that stage to the following stage is HIGH. Fig. 1 illustrates the pipeline when stages B, D, and E contain valid data. Stages A, C, and F do not contain ~- valid data. At the beginnirg, the VALID signal into pipeline stage A is ~IGH, ~eaning that the data on the trans~issior 'ine into the pipeline is valid.
Also at this time, the ACCEPT signal into pipeline s.age E is LOW, so that no data, whether valid or not, is 23 transferred out of Stage F. Note that both valid and invalid data is transferred between pipeline stages. Invalid data, which is data not worth saving, may be written over, thereby, eliminating it from the pipeline. However, valid data must . not be written over since it is data that must ~e saved for 2~ processing or use in a downstream device e.g., a pipeline stage, a device or a system connected to the pipeline that receives data from the pipeline.
In the pipeline illustrated in Fig. 1, Stage E contains valid data D1, Stage D contains valid data D2, Stage 3 _5 cor.tains valid data D3, and a device (not shown) connected to tne p.peline upstrea~ contains data D4 that is ~o be transferred into and processed in the pipeline. Stages 3, and E, in addition to the upstream device, contain valid da~a and, therefore, the ~v~ALID signal from these stages or deviceS

~ 21~15221 into their respective following devices is HIGH. The VALID
signal from the Stages A, C and F is, however, LOW since these stages do not contain valid data.
Assume now that the device connected downstream from the pipeline is not ready to accept data from the pipelinè. The device signals this by setting the corresponding ACCEPT
siqnal LOW into Stage F. Stage F itself, however, does not contain valid data and is, therefore, able to accept data from the preceding Stage E. Hence, the ACCEPT signal from :3 Stage F into Stage E is set HIGH.
Siimilarly, Stage E contains valid data and Stage F is ready to accept this data. Hence, Stage E can accept new data as long as the valid data D1 is first transferred to Stage F. In other words, although Stage F cannot transfer 1, data downstream, all the other stages can do so without any valid data being overwritten or lost. At the end of Cycle 1, àata can, therefore, be "shifted" one step to the right.
This condition is sho~n in Cycle 2.
In the illustrated example, the downstream device is stiil not ready to accept new data in Cycle 2 and, therefore, the ACCEPT signal into Stage F is still LOW. Stage F cannot, .herefore, accept new data since doing so would cause valid data Dl to be overwritten and lost. The ACCEPT signal from Stage F into Stage E, therefore, goes LOW, as does the ACCEPT
2, signal from Stage E into Stage D since Stage E also contains valid data D2. All of the Stages A-D, however, are able to accept new data (either because they do not contain valid data or because they are able to shift their valid data downstream and accept new data) and they signal this ,~i condition tO their immediately preceding neighbors by setting their corresponding ACCEPT signals HIGH.
The state of the pipelines after Cycle 2 is illustrated in Fig. i for the row labelled Cycle 3. By way of example, i-is 2ssumed that the downstream device is still not ready to ' ~ - 219~221 accept new data fror. Stage F tthe ACCEPT signal into Stage F
is LOW). Stages E and F, therefore, are still "blocked", but in Cycle 3, stage D has received the valid data D3, which has overwritten the invalid data that was previously in this stage. Since Stage D cannot pass on data D3 in Cycle 3, it cannot accept new data and, therefore, sets the ACCEPT signal into Stage C LOW. ~owever, stages A-C are ready to accept new data and signal this by setting their corresponding ACCEPT signals HIGH. Note that data D4 has been shifted from 0 Stage A to Stage B.
Assu~e now that the downstream device becomes ready to accept new data in Cycle 4. It signals this to the pipeline by setting the ACCEPT signal into Stage F HIGH. Although Stages C-F contain valid data, they can now shift the data 1~ downstream and are, thus, able to accept new data. Since each stage is ~herefore able to shift data one step downstream, they set their respective ACCEPT signals OUt HIGH.
As long as the ACCEPT signal into the final pipeline stage 2~ (ln this example, Stage F) is HIGH, the pipeline shown in Fig. 1 acts as a rigid pipeline and simply shifts data one step downstream on each cycle. Accordingly, in Cycle ~, data Dl, which was contained in Stage F in Cycle 4, is shifted out of the pipeline to the subsequent device, and all other data 2~ is shifted one step downstream.
Assume now, that the ACCEPT signal into Stage F goes LO~
in Cycle 5. Once again, this means that Stages D-F are not able to accept new data, and the ACCEPT signals out of these stages into their immediately preceding neighbors go LO~.
~'J Hence, the data D2, D3 and D4 cannot shift downstrea~i"
however, the data D5 can. The corresponding state of the pipeline after Cycle ~ is, thus, shown in Fig. 1 as Cycle 6.
The ability of the pipeline, in accordance with thie preferred embodiments of the present invention, to ~fill up"

. ~ .

2 1 g 52 2 1 empty processing stages is highly advantageous since the processing stages in the pipeline thereby become decouple from one another. In other words, even though a pipeline stage ~ay not be ready to accept data, the entire pipeline does not have to stop and wait for the delayed stage.
Rather, when one stage is unable to accept valid data it simply forms a temporary "wall" in the pipeline.
Nonetheless, stages downstream of the "wall" can continue to advance valid data even to circuitry connected to the pipeline, and stages to the left of the "wall" can stil~
accept and transfer valid data downstream. Even when several pipeline stages temporarily cannot accept new data, other stages can continue to operate normally. In particular, the plpeline can continue to accept data into its initial stage '-, A as long as stage A does not already contain valid data that cannot be advanced due to the next stage not being 'eady tc accept new data. As this example illustrates, data can be ~rans'erred into the pipeline and between stages even when or.e or r,ore processing stages is blocked.
~^ In the embodiment shown in Fig. 1, it is assumed that the various pipeline stages do not store the ACCEPT signals they receive ~rom their immediately following neighbors. Instead, whenever the ACCEPT signal into a~downstream stage goes LOW, this LOW signal is propagated upstream as far as the nearest 2~ pipeline stage that does not contain valid data. For example, referring to Fig. 1, it was assumed that the ACCEPT
signal into Stage F goes ~OW in Cycle 1. In Cycle 2, the LOW
signal propagates from Stage F back to Stage D.
In Cycle 3, when the data D3 is latched into Stage D, the ,a ~CCEPT signal propagates upstream four stages to stage C.
when ~he ACCEPT signal into Stage F goes HIG~ in Cycle 4, it ~ust propagate upstream all the way to Stage C. In other words, the change in the ACCEPT signal must propagate back four stages. It is not necessary, however, in the embcdi~ent ` ' - 2145221 -illustrated in Fig. 1, for the ACCEPT signal to propagate all the way back to the beginning of the pipeline if there is some intermediate stage that is able to accept new data.
In the embodiment illustrated in ~ig. 1, each pipeline stage will still need separate input and output data latches to 2110'w data to be transferred between stages without unintended overwriting. Also, although the pipel ne illustrated in Fig. 1 is able to "compress" when downstrea~
pipeline stages are blocked, i.e., they cannot pass on the ;3 data ;hey contain, the pipeline does not "expand" to prov-de stages that contain no valid data between stages that do contaln valid data. Rather, the ability to compress depends on there being cycles during which no valid data is presented tO the first pipeline stage.
In Cycle 4, for example, if the ACCEPT signal into Stage F rer.alned LOw and valid data filled pipeline stages A and 3, as long as valid data continued to be presented to Stage A
the pipeline would not be able to compress any further and valid input data could be lost. Nonetheless, the pipeline 2~ illustrated in Fig. 1 reduces the risk of data loss since ~t is able to compress as long as there is a pipeline stage that àoes not contain valid data.
Fig. 2 illustrates another embodiment of the pipeline that can both compress and expand in a logical manner and which 2~ includes circuitry that limits propagation of the ACCrP~
signal to the nearest preceding stage. Although ~he circuitry for implementing this embodiment is explained ar.d illustrated in greater detail below, Fig. 2 serves t~
illustrate the principle by which it operates.
,v For ease of comparison only, the input data and AC.EFT
sigr,als into the pipeline embodiment shown in Fig. 2 are the same as in the pipeline embodiment shown in Fig. 1.
Acco~dingly, stages E, D and B contain valid data D1, D2 and ~, respec~ively. The ACCEPT signal into Stage F is LOW; and ~`1 . 21~5221 data D4 is presented to the beginning pipeline Stage A. In Fig. 2, three lines are shown connecting each neighboring pair of pipeline stages. The uppermost line, which may be a bus, is a data line. The middle line is the line over which the ~ALID signal is transferred, while the bottom line is the line over which the ACCEPT signal is transferred. Also, 2S
before, the ACCEPT signal into Stage F remains LOW except in Cycle 4. Further~ore, additional data D5 is presented to the pipeline in Cycle ~,.
In Fig. 2, each pipeline stage is represented as a biock divided into two halves to illustrate that each stage in this embodiment of the pipeline includes primary and secondary data storage elements. In Fig. 2, the primary data storage lS shown as the right half of each stage. However, it will 1~ be appreciated that this delineation is for the purpose of llustraticn only and is not intended as a limitation.
As Fi7- 2 illustrates, as long as the ACCEPT signal ln~o a stage is HIGH, data is transferred from the primary storage e.ements of the stage to the secondary storage eleruents of .~ the ~ollowing stage during any given cycle. Accordingly, aithough the ACCEPT signal into Stage F is LOW, the ACCFPT
signal into all other stages is HIGH so that the data D1, D2 and D3 is shifted forward one stage in Cycle 2 and the data ~ is shifted into the first Stage A.
~p to this point, the pipeline embodiment shown in Fig. 2 acts in a manner similar to the pipeline embodiment shown in ~ig. 1. The ACCEPT signal from Stage F into Stage E, however, is HIGH even though the ACCEP~ signal into Stage F
is LOw. As is explained below, because of the secondary C storage elements, it is not necessary for the LO~ ACCEPT
signal to propagate upstream beyond Stage F. Moreover, by leaving .he ACCEPT signal into Stage E HIGH, stage F signais that it is ready to accept new data. Since Stage F is nc-able to transfer the data 21 in its primary storage elements ~ - 21~5221 downstream (the ACCEPT signal into Stage F is LOW) in Cycle 3, Stage E must, therefore, transfer the data D2 into the secondary storage elements of Stage F. Since both the primary and the secondary storage elements of Stage F now 5 contain valid data that cannot be passed on, the ACCrPT
signal from Stage F into Stage E is set LOW. Accordingly, this represents a propagation of the LOW ACCEPT signal back only one stage relative to Cycle 2, whereas this ACCEPT
signal had to be propagated back all the way to Stage C in 1 r the embodiment shown in Fig. 1.
Since Stages A-E are able to pass on their data, the ACCEPT signals from the stages into their immediately preceding neighbors are set HIGH. Consequently, the data D3 and D4 are shifted one stage to the right so that, in Cycle they are loaded into the primary data storage elements of S.age E and Stage C, respectively. Although Stage E now contains valid data D3 in its primary storage elements, ltS
secondary storage elements can still be used to store other data without risk of overwriting any valid data.
2!~ Assume now, as before, that the ACCEPT signal into Stage F beco~es HIGH in Cycle 4. This indicates that the downstream device to which the pipeline passes data is ready to accept data from the pipeline. Stage F, however, has set ts ACCEPT signal LOW and, thus, indicates to Stage E that Stage F is not prepared to accept new data. Observe that the ACCEPT signals for each cycle indicate what will ~happen" in the next cycle, that is, whether data will be passed on (ACCEPT HIGH) or whether data must remain in place (ACCEPT
oW~. Therefore, from Cycle 4 to Cycle 5, the data ~1 is ,r passed from Stage F to the following device, the data D2 is shifted from secondary to primary storage in Stage F, but ~he aata ~ in Stage F is not transferred to Stage F. The ~ata C and D5 can be transferred into the following pipeline stages as normal since the following stages have their ACCE~T

~ 214t5~21 signals HIGH.
Comparing the state of the pipeline in Cycle 4 and Cycle 5, it can be seen that the provision of secondary storage elements, enables the pipeline em~odiment shown in Fig. 2 to expand, that is, to free up data storage elements into which valid data can be advanced. For example, in Cycle ~, the data blocks Dl, D2 and D3 form a "solid wall" since their data cannot be transferred until the ACCEPT signal into Stage F goes HIGH. Once this signal does become HIGH, however, . J data D1 is sh fted out of the pipellne, data D2 is shifted lnto the primary storage elements of Stage F, and the secondary storage elements of Stage F become free to accept new data if the following device is not able to receive the data D2 and the pipeline must once again "compress." This is 1_ shown in Cycle 6, for which the data D3 has been shifted into the secondary storage elements of Stage F and the data ~ has ~een passed on from Stage D to Stage E as normal.
Figs. 3a(1), 3a(2~, 3b(1) and 3b(23 (which are referred .~
ccllectively as Fig. 3) illustrate generally a preferred 2C~ embodi~ent of the pipeline. This preferred em~odiment implements the structure shown in Fig. 2 using a two-phase, non-overlapping clock with phases oO and 01. Although a two-phase clock is preferred, it will be appreciated that it is also possible to drive the various embodiments of the 2~ invention using a clock with more than two phases.
As shown in Fig. 3, each pipeline stage is represented as having two separate boxes which illustrate the primary and secondary storage elements. Also, although the VALID sig-.al and the data lines connect the various pipeline stages as ~~ before~ for ease of illustration, only the AcCEPT signal is shown in Fig. 3. A change of state during a clock phase of cer~ain of the ACCEPT signals is indicated in Fig. 3 using an up~ard-pointing arrow for changes from LOW to HI~-H-Simllarly~ a downward-pointing arrow for changes from HIGH to ~ - 21~5221 LOW. Transfer of data from one storage element to another is indicated by a large open arrow. It is assumed that the '~ALID signal out of the primary or secondary storage elements of any given stage is HIGH whenever the storage elements contain valid data.
In Fig. 3, each cycle is shown as consisting of a full period of the non-overlapping clock phases o0 and ol. As is explained in greater detail below, data is transferred fror., the secondary storage elements (shown as the left box in each stage) to the primary storage elements (shown as the right box in each stage) during clock cycle al, whereas data is transferred from the primary storage elements of one stage to .he secondary storage elements of the following stage during the clock cycle o0. Fig. 3 also illustrates that the primary and secondary storage elements in each stage are further _onnected via an internal acceptance line to pass an ACCEPT
signal in the same manner that the ACCEPT signal is passed ~ror~ stage to stase. In this way, the secondary storage element will kno~ when it can pass its date to the primary ~0 storage element.
Fig. 3 shows the al phase of Cycle 1, in which data D1, D2 and D3, which were previously shifted into the secondary storage elements of Stages E, D and 8, respectively, are shifted into the primary storage elements of the respective 2~ stage. During the ~1 phase of Cycle 1, the pipeline, herefore, assumes the same configuration as is shown as Cycle 1 of Fig. 2. As before, the ACCEPT signal into Stage F is assumed to be LOW. As Fig. 3 illustrates, however, th,s ~eans that the AC.EPT signal into the primary storage ele~e~t -, of Stage F is LOh, but since this storage element does not cGntai~ valid data, it sets the ACCEPT signal into i.s secondary storage element HIGH.
The ACCEPT signal from the secondary storage elements of Stage F into the prir.ary storage elements of Stage E is a~so 21~5221 set HIGH since the secondary storage elements of Stage F do not contain valid data. As before, since the primary storage elements of Stage F are able to accept data, data in all the upstream. primary and secondary storage elements can be shifted downstream without any valid data being overwritten.
The shift of data from one stage to the next takes piace during the next oO phase in Cycle 2. For example, the valid data D1 contained in the primary storage element of Stage E
is shifted into the secondary storage element of Stage F, the data D4 is shifted into the pipeline, that is, into the secondary storage element of Stage A, and so forth.
The primary storage element of Stage F still does no~
contain valid data during the ~O phase in Cycle 2 and, therefore, the ACCEPT signal from the primary storage elements into the secondary storage elements of Stage r remains HIGH. During the 01 phase in Cycle 2, data can therefore be shifted yet another step to the right, i.e., from the secondary to the primary storage elements within each staqe.
2v However, once valid data is loaded into the prir.ary storage elements of Stage F, if the ACCEPT into Stage F fro~, the downstream device is still LOW, it is not possible to shift data out of the secondary storage element of Stage F
without overwriting and destroying the valid data Dl. The 2~ ACCEPT signal from the primary storage elements into t;~e secondary storage elements of stage F therefore goes LO~.
Data D2, however, can still be shifted into the secondar~
storage of Stage F since it did not contain valid data anà
' tS ACCEP~ signal out was HIGH.
~~ During the Ol phase of Cycle 3, it is not possible to shift data D2 into the primary storage elements of Stage F
although data can be shifted within all the previous stages.
Once valid data is loaded into the secondary storage ele~ent~
of Stage F, however, Stage F is not able to pass on thL' 21~5221 data. It signals this event setting its ACCEPT signal out LOW
Assu~ing that the ACCFPT signal into Stage F remains LO~, data upstream of Stage F can continue to be shifted between stages and within stages on the respective clock phases until the next valid data block D3 reaches the primary storage elements of Stage E. As illustrated, this condition is reached during the ol phase of Cycle 4.
During the o0 phase of Cycle 5, data D3 has been loaded '~ into the prlmary storage ele~ent of Stage E. Since this data cannot be shifted further, the ACCE~T signal out of the primary storage elements of Stage E is set LOW. Upstream data can be shifted as normal.
Assume now, as in Cycle 5 of Fig. 2, that the device 1~ connected downstream of the pipeline is able to accept pipeline data. It signals this event by setting the ACCEPT
signal into pipeline Stage F HIGH during the ol phase of Cycle ~. The pri..mary storage elements of Stage F can now sh.f. data to the right and they are also able to accept new J data. Hence, the data Dl was shifted out during the al phase of Cycle 5 so that the primary storage elements of Stage F no longer contain data that must be saved. During the ~1 phase of Cycle 5, the data D2 is, therefore, shifted within Stage F from the secondary storage elements to the primary storage 2~ elements. The secondary storage elements of Stage F are also able to accept new data and signal this by setting the ACCEPT
signal into the primary storage elements of Stage E HIGH.
During transfer of data within a stage, that is, from its secondary to its primary storage elements, both sets of ,~ storage elements will contain the same data, but the data in ~ke secondary storage elements can be overwritten with no data loss since this data will also be held in the prim.ar~
storage elements. The same holds true for data transfer f~o~
t~e primary storage elements of one stage into the secondarY

21~5221 storage elements of a subsequent stage.
Assume now, that the ACCEPT signal into the primary storage elements of Stage F goes LOW during the ol phase in Cycle ~. This means that Stage F is not able to transfer the data D2 out of the pipeline. Stage F, consequently, sets the ACCEPT signal from its primary to its secondary storage elements LOW to prevent overwriting of the valid data D2.
The data D2 stored in the secondary storage elements of Stage F, however, can be overwritten without loss, and the data D3, 13 is therefore, transferred into the secondary storage elements cc Stage F during the o0 phase of Cycle 6. Data D4 and D5 can be shifted downstream as normal. Once valid data D3 is stored in Stage F along with data D2, as long as the ACCEPT
signal into the primary storage elements of Stage F is LOW, i, neither of the secondary storage elements can accept new data, and it signals this by setting the ACCEPT signal into Stage ~ LO~.
~ hen the ACCEPT signal into the pipeline from the downstream device changes from LOW to HIGH or vice versa, this change does not have to propagate upstream within the pipeline further than to the immediately preceding storage elements (within the same stage or within the preceding pipeline stage). Rather, this change propagates upstream within the pipeline one storage element block per clock 2- phase.
As this example illustrates, the concept of a "stage" in the pipeline structure illustrated in Fig. 3 is to some extent a matter of perception. Since data is transferred wlthin a stage (from the secondary to the pri~ary storage _^ ele~en.s) as it is between stages (from the primary storage ele~ents of the upstream stage into the secondary storage ele~ents ~f the neigh~oring downstream stage), one could just as well consider a stage to consist of "primary" s.orage ele~ents followed by ~secondary storage elements~ instead _f ` ~145221 as illustrated in Fig. 3. The concept of "primary" and "secondary" storage elements is, therefore, mostly a question of labeling. In Fig. 3, the "primary" storage elements can also be referred to as "output" storage elements, since they are the elements from which data is transferred out of a stage into a following stage or device, and the "secondary"
storage elements could be "input" storage elements for the same stage.
In explaining the aforementioned embodiments, as shown in Figs. 1-3, only the transfer of data under the control of 'he ACCEPT and VALID signals has been mentioned. It is to be further understood that each pipeline stage may also process the data it has received arbitrarily`before passing i_ between its internal storage elements or before passing it to 1~ the following pipeline stage. Therefore, referring once again tO Fig. 3, a pipeline stage can, therefore, be defined as the portion of the pipeline that contains input and -u~put storage elements and that arbitrarily processes data sts-eà
in its storage elements.
Furthermore, the "device" downstream from the pipeline Stage F, need not be some other type of hardware structure, but rather it can be another section of the same or part of another pipeline. As illustrated below, a pipeline stage can set its ACCEPT signal LOW not only when all of the downstrea~
storage elements are filled with valid data, but also when a stage requires more than one cloc~ phase to finish processi.ng its data. This also can occur when it creates valid data in one or both of its storage elements. In other words, it is not necessary for a stage simply to pass on the ACCEPT sigr.al ,~ based on whether or not the immediately downstream sto.a~e elements contains valid data that cannot be passed cn.
2ather, the ACCEPT signal itself may also be altered witkin the stage or, by circuitry external to the stage, in order ~o control the passage of data between adjacent storaae - ` 21~5221 elements. ~he VALID signal may also be processed in an analogous manner.
A great advantage of the two-wire interface (one wire for each of the VALID and ACCEPT signals) is its ability to control the pipeline without the control signals needing to propagate back up the pipeline all the way to its beginning stage. Referring once again to Fig. 1, Cycle 3, for example, although stage F "tells" stage E that it cannot accept data, and s.age E tells stage D, and stage D tells stage C.
; Indeed, if there had been more stages containing valid data, then this signal would have propagated back even further alon~ the pipeline. In the e~bodiment shown in Fig. 3, Cycle ', the LOW ACCEPT si~nal is not propagated any further upstream than to Stage E and, then, only to its primarv 1, storage elements.
A.s described below, this embodiment is able to achieve this flexibility without adding significantly to the silicon area that is required to implement the design. Typically, each latch in the pipeline used for data storage requires 2~ only 2 single extra transistor (which lays out very efficiently in silicon). In addition, two extra latches and a small number of gates are preferably added to process the ACCEPT and VALID signals that are associated with the data latches in each half-stage.
2, Fig. 4 illustrates a hardware structure that implements a stage as shown in Fig. 3.
By way of example only, it is assumed that eight-bit da_a is to be transferred (with or without further manipulation in op~ional combinatorial logic circuits) in parallel .hrougn ~~ the pipeline. However, it will be appreciated that either ~_re or less than eight-bit data can be used in prac.icinc ~he lnvention. Furthermore, the two-wire interface in accordance with this embodiment is, however, suitable for use ~ith anv data bus width, and the data bus width may even - 21~5221 change from one stage to the next if a particuIar application so requires. The in~erface in accordance with this em~odiment can also be used to process analog signals.
As discussed previously, while other conventional timing arrangements may be used, the interface is preferably controlled by a two-phase, non-overlapping clock. In Figs.
~-9, these clock phase signals are referred to as PHO and P~l. In Fig. 4, a line is shown for each clock phase signal.
Input data enters a pipeline stage over a multi-bit data lo bus I~_DATA and is transferred to a following pipeline stage or to subsequent receiving circuitry over an output data bus O~T_DA~A. The input data is first loaded in a manner - described below into a series of input latches (one for each input data signal) collectively referred to as LDIN, which 1~ constitute the secondary storage elements described above.
In the illustrated example of this embodiment, it is assumed that the Q outputs of all latches follow ~heir lnpU.s, that is, they are "loaded", when the clock input is HIGH, i.e., at a logic "1" level. Additionally, the Q
outputs hold their last values. In other words, the Q
outputs are "latched" on the falling edge of their respective clock signals. Each latch has for its clock either one of two non-overlapping clock signals PHO or PH1 (as shown in Fig. ,)~ or the logical AND combination of one of these clock signals PHO, PH1 and one logic signal. The invention works equally well, however, by providing latches that latch on the rising edges of the clock signals, or any other kncw~
latching arrangement, as long as conventional methods are applied to ensure proper timing of the latching operaticr.s.
,5 The output data from the input data latch LDIN passes via an ar~itrary and optional com~inatorial logic circuit ~1, which ~iay be provided to convert output data from input la.ch L~ into intermeaiate data, which is ther. later loaded in 2n output data latch LDOUT, which comprises the primary s,~-2~

i i 214522i elements described above. The output from the output data latch LDOUT may similarly pass through an arbitrary and optional combinatorial logic circuit B2 before being passed on~ard as OUT DATA to the next device downstream. This ~ay be another pipeline stage or any other device connected to the pipeline.
In the practice of the present invention, each stage of the pipeline also includes a validation input latch LVI~, a validation output latch LVOUT, an acceptance input latch 1^~ AIN, and an acceptance output latch LAOUT. Each of these four latches is, preferably, a simple, single-stage latch.
The outputs from latches LVIN, LVOUT, LAIN and LAOUT are, respectively, QVIN, QVOUT, QAIN, QAOUT. The output signal Q~'IN from the validation input latch is connected either ', directly as an input to the validation output latch LVO~'T, or via intermediate logic devices or circuits that may alter .he s lgna 1 .
Similarly, the output validation signal QVOUT of a g1ven s.age ~ay be connected either directly to the input of the ~, ~alldation input latch QVIN of the following stage, or via 1ntermediate devices or logic circuits, which may alter the vaiidation signal. This output QVIN is also connected to a logic gate (to be described below), whose output is connected to the input of the acceptance input latch LAIN. The output 2~ ~AO~T from the acceptance output latch LAOUT is connected to a similar logic gate (described below), optionally via another logic gate.
As shown in Fig. 4, the output validation signal QVOUT
forms an O~T_VALID signa that can be received by subsequer.t ~C s.ages as an IN_'~ALID signal, or simply to indicate valid data ~3 subsequent circuity connected to the pipeline. The readiness of the following circuit or stage to accept data is indlcated to each stage as the signal OUT_ACCEPT, ~hich is connected as the Lnput to the acceptance output latch LAOUT, ~ 21~5221 preferably via logic circuitry, which is described below.
Similarly, the output QAOUT of the acceptance output latch LAOUT is connected as the input to the acceptance input latch LAI.N, preferably via logic circuitry, which is described below.
In practicing the present invention, the output signals Q~'IN, QVOUT from the validation latches LVIN, LVO~ are combined with the acceptance signals QAOUT, OUT_ACCEPT, respectively, to form the inputs to the acceptance latches LAIN, LAOUT, respectively. In the embodiment illustrated in ~ig. ~, these input signals are formed as the logical NAND
co~.bination of the respective validation signals QVIN, QVOUT, with the logical inverse of the respective acceptance output signals QAOUT, OUT_ACCEPT. Conventional logic gates, NAND1 1. and NAND2, perform the NAND operation, and the inverters ItJ~l, INV2 form the logical inverses of the respective accep.ance signals.
As is well known in the art of digital design, the output from a NAND gate is a logical "1" when any or all of its .5 input signals are in the logical "O" state. The output from a NAND gate is, therefore, a logical "O" only when all of its inputs are in the logical "1" state. Also well known in the art, lS that the output of a digital inverter such as IN'vl is a logical "1" when its input signal is a "O" and is a "0"
2~ when its input signal is a "1"
The inputs to the NAND gate NAND1 are, therefore, QVIN and ~iOT (QAO~T), where "NOT" indicates binary inversion. ~sing known techniques, the input to the acceptance latch LAIN can be resolved as follows:
_J NAt1D(Q~IN,NOT~QAO~T)3 = NOT(QVIN) OR QAOUT
In other words, the combination of the inverter TNVl and .he N~ND gate NANDl is a logical "1" either when the signal QYI~' is a "O" or the signal QAOUT is a "1", or both. Ihe gate NANDl and the inverter INVl can, therefore, be `i' 2145221 implemented by a single OR gate that has one of its inputs tied directly to the QAOUT output of the acceptance latch LAO~T and its other-input tied to the inverse of the output signal 2~!IN of the validation input latch LVIN.
As is well known in the art of digital design, many latches suitable for use as the validation and acceptance latches may have two outputs, Q and NOT(Q), that is, Q and its logical inverse. If such latches are chosen, the one input to the O~ gate can, therefore, be tied directly to the ;o NOT(Q) output of the validation latch LVIN. The gate NANDl and the inverter IN~'1 can be implemented using well known conventional techniques. Depending on the latch architecture used, however, it may be more efficient to use a latch ~ithout an inverting output,-and to provide instead the gate 1~ NAND1 and the inverter INV1, both of which also can be imple~ented efficiently in a silicon device. Accordingly, any known arrangement may be used to generate the Q signal and/or its logical inverse.
The data and validation latches LDIN, LDOUT, LVIN and LVO~T, load their respective data inputs when both clock signals (PH0 at the input side and PH1 at the output side) and the output from the acceptance latch of the same side are - logical "1". Thus, the clock signal (PH0 for the input latches LDIN and LVIN) and the output of the respective 2~ acceptance latch (in this case, LAIN) are used in a logicai A~D manner and data is loaded only when they are both logical " 1 " .
In particular applications, such as CMOS implementations o~ the latches, the logical AND operation that controls the ,G lcading (via the illustrated CK or enabling "input") of the latches can be implemented easily in a conventional manner by connecting the respective enabling input signals (for example, PH0 and QAIN for the latches LVIN and LDIN~, to ~he gates of MOS transis.ors connected in series in the input i . 2145221 lines of the latches. Consequently, is necessary to provide an actual logic A~D gate, which might cause problems of timing due to propagation delay in high-speed applications.
~-he AND gate shown in the figures, therefore, only indicates the logical function to be performed in generating the enable signals of the various latches.
Thus, the data latch LDIN loads input data only when PHO
and QAIN are both "1". It will latch this data when either of these two signals goes to a "O".
'' IJ Although only one of the clock phase signals PHO or PH1, is used to clock the data and validation latches at the lnput (and output) side of the pipeline stage, the other clock phase signal is used, directly, to clock the acceptance latch at the same side. In other words, the acceptance latch on i- either side (input or output) of a pipeline stage is preferably clocked "out of phase" with the data and validation latches on the same side. For example, PH1 ~s used to clock the acceptance input latch, although ?~C ~s useà in generating the clock signal CK for the data latoh ~Q LDI.~ and the validation latch LVIN.
.~s an example of the operation of a pipeline augmented by the two-wire validation and acceptance circuitry assume that no valid data is initially presented at the input to the circuit, either from a preceding pipeline stage, or from a 2, transmission device. In other words, assume that the validation input signal IN VALID to the illustrated stage has not gone to a "1" since the system was ~ost recently rese..
Assu~e further that several clock cycles have taken place s1nce the system was last reset and, accordingly, the .G clrcultry has reached a steady-state condition. The valLdation input signal Q~rI~ from the validation latch rVI~
is, therefore, ioaded as a "O" during the next posi.ive period of the clock PHO. The input to the acceptance input latch LAI.~ (via the gate ~AND1 or another equivalent sate~, ! - 2 1 45 ~ 2 1 is, therefore, loaded as a "1" during the next positive period of the clock signal PH1. In other words, since the data in the data input latch LDIN is not valid, the stage slgnals that it is ready to accept input data ~since it does not hold any data worth saving).
In this example, note that the signal IN_ACCEPT is used to enable the data and validation latches LDIN and LVIN. Since the signal IN_ACCEPT at this time is a "1", these latches effectively work as conventional transparent latches so that r', whatever data is on the I~_DATA bus simply is loaded into the data latch LDIN as soon as the clock signal PH0 goes to a "1". Of course, this invalid data will also be loaded into the next data latch LDOUT of the following pipeline stage as long as the output QAOUT from its acceptance latch is a "1".
i~ ~ence, as long as a data latch does not contain valid data, it accepts or "loads" any data presented to it during the next positive period of its respective clock signal. ~n the other hand, such invalid data is not loaded in any stage fcr which the acceptance signal from its correspondinc acceptance latch is low (that is, a "0"). Furthermore, the output signal from a validation latch (which forms the vaiidation input signal to the subsequent validation latch) remains a "0" as long as the corresponding IN_VALID (or QVI.~) signal to the validation latch is low.
h'hen the input data to a data latch is valid, _he validation signal IN_VALID indicates this by rising to a "1".
The output of the corresponding validation latch then rises to a "1" on the next rising edge of its respective clock phase signal. For example, the validation input signal QVI~
~r~ of latch LVIN rises to a "1" ~hen its corresponding IN_VALIC
si~r.al ~oes high (that is, rises to a "1") on the next risinc edge ~f the clock phase signal PH0.
Assume no-~, instead, that the data input latch L~l~
co~ains valid data. ~f the data output latch LDO~T is ready 214~21 to accept new data, its acceptance signal QAOUT will be a "1". In this case, during the next positive period of the clock signal PH1, the data latch LDOUT and validation latch ;vO~T wili be enabled, and the data latch LDOUT will load the data present at its input. This will occur before the next rising edge of the other clock signal PH0, since the clock signals are non-overlapping. At the next rising edge of P~0, the preceding data latch (LDIN) will, therefore, not latch in neT~input data from the preceding stage until the data output latch LDO~'T has safely latched the data transferred from the latch LDIN.
Accordingly, the same sequence is followed by every adjacent pair of data latches ~within a stage or between adjacent stages) that are able to accept data, since they 1~ will be operating based on alternate phases of the clock.
Any data latch that is not ready to accept new data because it contains valid data that cannot yet be passed, will have an output acceptance signal (the QA output fro,~ i~s acceptance latch LA) that is LOw, and its data latçh LDIN cr ~, LDCVT ~iil not be loaded. Hence, as long as the acceptance signal (the output from the acceptance latch~ of a given s~age or side (input or output) of a stage is LOW, its corresponding data latch will not be loaded.
F.g. . also shows a reset feature included in a preferred 2~ embodiment. In the illustrated example, a reset signa NOTRESET0 is connected to an inverting reset input R
(inversion is hereby indicated by a small circle, as is conventional) of the validation output latch LVO~T. As is well known, this means that the validation latch LVO~T will be forced to output a "0" whenever the reset signal NOTRESET0 ~ecomes a "0". One advantage of resetting the latch when the reset signal goes low (becomes a "0") is that a break in trans~lission ~ill rese. the latches. They wili then be in ~heir ~null~ or reset state whenever a valid trar.s~ission 214~221 begins and the reset signal goes HIGH. The reset signal NOTRESET0, therefore, operates as a digital "ON/OFF" switch, such that it must be at a HIGH value in order to activate the pipeline.
Note that it is not necessary to reset all of the latches that hold valid data in the pipelir.e. As depicted in Fig. 4, the validation input latch LVIN is not directly reset by the reset signal NOTRESET0, but rather is reset indirectly.
Assume that the reset signal NOTRESET0 drops to a "0". The :o validation output signal QVOUT also drops to a "0", regardless of its previous state, whereupon the input to the acceptance output latch LAOUT (via the gate NAND1) goes HIGH.
The acceptance output signal QAOUT also rises to a "1". This QAO~'T value of "1" is then transferred as a "1" to the input of the acceptance input latch LAIN regardless of the state of ~he validation input signal QVIN. The acceptance input signal QAIN then rises to a "l" at the next rising edge of the clock signal PHl. Assuming that the validation s gnal ~ ~'ID has been correctly reset to a "0", then upon the subsequent rising edge of the clock signal PH0, the output from the validation latch L~IN will become a "0", as it would have done if it had been reset directly.
As this example illustrates, it is only necessary to reset .he validation latch in only one side of each stage (including the final stage) in order to reset all validation latches. In fact, in many applications, it -will not he necessary to reset every other validation latch: If the reset signal NOTRESET0 can be guaranteed to be low during ~ore than one complete cycle of both phases PH0, PH1 of the ~G clock, then the "automatic reset" ~a backwards propa~ation of ~he rese. signal~ will occur for validation latches ir.
preceding pipeline stages. Indeed, if the reset signal lS
held low for at least as r.any full cycles of both phases of the clock as there are plpeline stages, it ~ill only be ~ - 2145221 necessary to directly reset the validation output latch in the final pipeline stage.
Figs. 5a and Sb (referred to collectively as Fig. 5) illustrate a timing diagram showing the relationship between the non-overlapping clock signals PHO, PH1, the effect of the reset signal, and the holding and transfer of data for the different permutations of validation and acceptance signals into and between the two illustrated sides of a pipeline stage configured in the embodiment shown in Fig. 4. In the example illustrated in the timing diagram of Fig. S, it has been assumed that the outputs from the data latches LDIN, L~O~'T are passed without further manipulation by intervening logic blocks Bl, B2. This is by way of example and not necessarily by way of limitation. It is to be understood 1. that anv combinatorial logic structures may be included between the data latches of consecutive pipeline stages, or between the input and output sides of a single pipeline stage. ~he actual illustrated values for the input data (for example the HEX data words "aa" or "04") are also merely _J illustrative. As is mentioned above, the input data bus may have any width (and may even be analog3, as long as the data latches or other storage devices are able to accommodate and latch or store each bit or value of the input word.

Preferred Data Structure - "tokens"
2, In the sample application shown in Fig. 4, each stage processes all input data, since there is no control circuitry that excludes any stage from allowing input data to pass through its combinatorial logic block B1, B2, and so forth.
To provlàe greater flexibility, the present invention ~~ inc~udes a data structure in which ~tokens~ are used to distribute data and control information throughout the system. rach token consists of a series of bina~y b.ts separa.ed into one or ~ore blocks of token words.

-~ 2~S221 Furthermore, the bits fall into one of three types: address bits (A~, data bits (D), or an extension bit (E). Assume by way of example and, not necessarily by way of limitation, that data is transferred as words over an 8-bit bus with a 1-bit extension bit line. An example of a four-word token is, in order of transmission:

First word: E A A A D D D D D
Second word: E D D D D D D D D
Third word: E D D D D D D D D
;~ Fourth word: E D D D D D D D D

Note that the extension bit E is used as an addition (preferably) to each data word. In addition, the address field can be of variable length and is preferably .ransmitted just after the extension bit of the flrst word.
, Tokens, therefore, consist of one or more words o.
(~inary) digital data in the present invention. _ach of .hese words is transferred in sequence and preferably in parallel, although this method of transfer is not necessary:
seriai data transfer is also possible using known techniques.
2~ For example, in a video parser, control information is transmitted in parallel, whereas data is transmitted serially.
As the example illustrates, each token has, preferably at the start, an address field (the string of A bits) .hat identifies the type of data that is contained in the token.
In most applications, a single word or portion of a ~-ord is sufficient to transfer the entire address field, but this is not necessary in accordance with the invention, so long as logic ~ircuitry is included in the corresponding p;peline ~ s.ages ~hat is able to store some representation of par~
address fields long enough for the stages to receive and decode the entire address field.

~ 2145221 ~ ote that no dedicated wires or registers are required to transmit the address field. It is transmitted using the data bits. As is explained below, a pipeline stage will not be sio~eà down if it is not intended to be activated by the particular address field, i.e., the stage will be able to pass along the token without delay.
Ihe remainder of the data in the token following the address field is not constrained by the use of tokens. Ihese D-data bits may take on any values and the meaning attached __ tO tnese blts is of no importance here. That is, the me2ning of tne data can ~ary, for example, depending upon where the data lS positioned within the system at a particular poin. in time. The number of data bits D appended after the address field can be as long or as short as required, and the number L~ of data words in different tokens may vary greatly. The address fleld and extension bit are used to convey control s_anals to the pipeline stages. Because the number cf wc.~s ln tke da~a field (the strinq of D bits) can be arbitrar,-, as C2.1 be the infor ation conveyed in the data field can also ,~, vary accordingly. The explanation below is, therefcre, à~rected .o the use of the address and extension bits.
Tn the present i~vention, to~ens are a particularly usef~l data structure when a number of blocks of circuitry are connected together in a relatively simple configuration. The 2, sl~plest configuration is a pipeline of processing steps.
For e~ample, in the one shown in Fig. 1. ~he use of tokens, however, is not restricted to use on a pipeline structure.
Assume once again that each box represents a complete pipeline s~age. In the pipeline of Fig. 1, data flows frc~
left to right in the diagram. Data enters the machine 2~.d p2sses into processing stage A. This may or may not moài~y the da~a and it then passes the data to Sta~e B. Th~
~odificaticn, if any, may be arbitrarily complicated and, in seneral, .here will not be the same number of data it~C

21~5221 flowing into any stage as flow out. Stage B modifies the data again and passes it onto Stage C, and so forth. In a scheme such as this, it is impossible for data to flow in the opposi~e direction, so that, for example, Stage C cannot pass data to Stage A. This restriction is often perfec~ly acceptable.
On the other hand, it is very desirable for Stage A to be able to communicate information to Stage C even though there is no direct connection between the two blocks. Stage A and :^ C co~unicat1on lS only via Stage B. One advantage of the tokens is their ability to achieve this kind of communication. Since any processing stage that does not recognize a token simply passes it on unaltered to the nex-block.
_, According to this example, an extension bit is transmitted 210ng wlth the address and data fields in each token so .ha' a processing stage can pass on a token (which can be ~.
arbltrary length) ~lthout having to decode its address 2t all. According to this example, any token in which _he _~ extension bit is HIGH (a "l"~ is followed by a subsequent ~-ord whlch is part of the same token. This word also has an extension bit, ~hich indicates whether there is a furthe~
token word in the token. When a stage encounters a token word whose extension bit is LOW (a "O"), it is known to se 2~ the last word of the token. The next word is then assumed ~o be the first word of a new token.
~ ote that although the simple pipeline of processing stages is particularly useful, it will be appreciated that tokens may be applied to more complicated configurations o' ~ -rocessing elements. An example of a more compli_ated process_ng element is described below.
It is not necessary, in accordance with the presen_ inventlon, to use the state of the extension bit to sigr.a1 the last word of a given token by giving it an extension 4it -21~5221 set to "O". One alternative to the preferred scheme is to move the extension bit so that it indicates the first word of a to~en instead of the last. This can be accomplished with appropriate changes in the decoding hardware.
The advantage of using the extension bit of the present invention to signal the last word in a token rather than the first, is that it is often useful to modify the behavior of a block of circuitry depending upon whether or not a token has extension bits. An example of this is a token that activates a stage that processes video quantization values stored in a quantization table (typically a memory device).
For example, a table containing 64 eight-bit arbitrary binary integers.
In order to load a new quantization table into the 1~ quantizer stage of the pipeline, a "QUA~T_TABLE" token is sent to the quantizer. In such a case the token, for exa~ple, consists of 65 token words. The first word conta~.~s the code "QU~NT_TABLE", i.e., build a quantization table.
This is followed by 64 words, which are the integers of the ~3 quantization table.
When encoding video data, it is occasionally necessary to transmit such a quantization table. In order to accomplish this function, a QUANT_TABLE token with no extension words can be sent to the quantizer stage. On seeing this token, 2~ and noting that the extension bit of its first word is LOW, the quantizer stage can read out its quantization table and construct a QUANT_TABLE token which includes the 64 quantization table values. The extension bit of the first word (which was LOW~ is changed so that it is HIGH and the ~5 to~en continues, with HIGH extension bits, until the new end o~ the token, indicated by a LOW extension bit on the sixty ~ourth quantization table value. This proceeds in the t~plcal way through the system and is encoded into ~he bit strea~.

21~5~21 Continuing with the example, the quantizer may either load a new quantization table into its own memory device or read out its table depending on whether the first word of the Q~ANT_TABLE token has its extension bit set or not.
The choice of whether to use the extension bit to signa the first or last token word in a token will, therefore, depend on the system in which the pipeline will be used.
Both alternatives are possible in accordance with the invention.
lo Another alternative to the preferred extension bit sche~e is to include a length count at the start of the token. Suc.~
an arrangement may, for example, be efficient if a token is ~ery long. For example, assume that a typical token in a given application is 1000 words long. Using the illustrated _~ extension bit scheme (with the bit attached to each token word), the token would require lO00 additional bits ' 5 contain all the extension bits. However, only ten bits wou d De required to encode the token length in binary form.
~lthough there are, therefore, uses for long tokens, 2 J experlence has shown that there are many uses for short tokens. Here the preferred extension bit scheme s advantageous. If a token is only one word long, then only one bit is required to signal this. However, a counting scheme would typically require the same ten bits as before.
2~ Disadvantages of a length count scheme include the following: 1~ it is inefficient for short tokens; 2) i.
places a maximum length restriction on a token (with only ~en bits, no more than 1023 words can be counted); 3~ the iengt~
c r a token must be known in advance of generating the coun.
~which is presumably at ;he start of the token); ~) every Llock of circuitry that deals with tokens would need to be p~ovided with hardware ts count words; and ~) if the coun+
shoul~ get corrupted (due to a data transmission error) it lS
not clear whether recovery can be achieved.

~ he advantages of the extension bit scheme in accordance with the present invention include: 1) pipeline stages need not include a block of circuitry that decodes every token since unrecognized tokens can be passed on correctly by considering only the extension bit; 2) the codinq of the extension bit is identical for all tokens; 3) there is no llmit placed on the length of a token; 4) the scheme is efficient (in terms of overhead to represent the length of the token) for short tokens; and 5) error recovery is :~ naturally achieved. If an extension bit is corrupted then one random token will be generated (for an extension bit corrupted from "1" to "O") or a token will be lost (extensior.
bit corrupted "O" to "1"). - Furthermore, the problem is locaiized to the tokens concerned. After that token, correct ', ope~atlon is resumed automatically.
In addition, the length of the address fieid r.lay be varled. This is highly advantageous since it allows the ~os~
.o,.,mon tokens to be squeezed into the minimum number cf wcrds. This, in turn, is of great importance in video data ~C pipeline systems since it ensures that all processing stages can be continuously running at full bandwidth.
In accordance to the present invention, in order to allow variable length address fields, the addresses are chosen so ;hat a short address followed by random data can never be 2, .onfused with a longer address. The preferred technique for encoding the address field ~which also serves as the "code"
for activating an intended pipeline stage) is the ~ell-known technique first described by Huffman, hence the common name "Huffman Code". ~evertheless, it will be appreciated by one _, of Jrd;r,ary skill in the art, that other coding schemes ".av also ~e s~ccessfully er..ployed.
Although Huffman encoding is weil understood in the flela Gf digital design, the following example provides a generaL
background:

Huffman codes consist of words made up of a string of symbols ~in the context of digital systems, such as the present invention, the symbols are usually binary digits).
The code words may have variable length and the special property of Huffman code words is that a code word is chosen so that none of the longer code words start with the symbols that form a shorter code word. In accordance with the invention, token address fields are preferably (although not necessarily) chosen using known Huffman encoding techniques.
Also in the present invention, the address fieid preferably starts in the most significant bit (MSB) of the first word token. (Note that the designation of the ~.53 is arbitrary and that this scheme can be modified to accommodate various designations of the MSB.) The address field ;- continues through contiguous bits of lesser significance.
If, in a given appiication, a token address requires .-ore ~han one token word, the least significant bit in any gi~en word the address field will continue in the most signlflcan.
bit of the next word. The rminimum length of the address 2 3 f ield is one bit.
Any of several known hardware structures can be used .o generate the tokens used in the present invention. One such structure is a microprogrammed state machine. However, known -icroprocessors or other devices may also be used.
2 ~ The principle advantage of the token scheme in accordance ~ith the present invention, is its adaptability t_ unanticipated needs. For exarple, if a new token is introduced, it is r.~ost likely that this will affect only a sr.all number of pipeline stages. The most likely case is ~i that only two stages or blocks of circuitry are affec~-d, i.e., ~he one block that generates the tokens in the firct place and the bloc~ or stage that has been newly designed or mod,f,ed to deal *ith this new token. Note that ,t is ~ot .,ecessary to r.odify any other plpeline stages. Rather, t~ese 214~221 will be able to deal with the new token without modification to their designs because they will not recognize it and will, accordingly, pass that token on unmodlfied.
This ability of the present invention to leave substantially existing designed devices unaffected has clear advantages. It may be possible to leave some semiconductor chips in a chip set completely unaffected by a design improvement in some other chips in the set. This is advantageous both from the perspective of a customer and from that of a chip manufacturer. Even if modifications mean that all chips are affected by the design change (a situation that becomes increasingly likely as levels of integration progress so that the number of chips in a system drops) there will still be the considerable advantage of better time-to-market than can be achieved, since the same design can be reused.
In par-icular, note the situation that occurs when it ~ecomes necessary to extend the token set to include two ~ord aàdresses. ~ven in this case, it is still not necessary to ~od~fy an existing design. Token decoders in the pipeline s.ages -will attempt to decode the first word of such a token and wlil conclude that it does not recognize the token. It will then pass on the token unmodified using the extension bi- to perform this operation correctly. It will not attempt tc decode the second word of the token (even though this _ontains address bits) because it will "assume" that the second word is part of the data field of a token that it does not recognize.
In many cases, a pipeline stage or a connected block cf ~rcuitry will modlfy a token. This usually, but no.
necessarily, takes the form of modifying the data field of a to~en. In addition, it is common for the number of data woras in the token to be ~odified, either by removing certain data -~ords or by adding new ones. In some cases, tokens are remGved entirely from the token stream.

214~221 In most applications, pipeline stages will typically only decode (be activated by) a few tokens; the stage does not recognize other tokens and passes them on unaltered. In a iarge number of cases, only one token is decoded, the DATA
Token word itself.
In many applications, the operation of a particular stage will depend upon the results of its own past operations. The "state" of the stage, thus, depends on its previous states.
In other words, the stage depends upon stored state ~v information, which is another way of saying it must reta;n some information about its own history one or more clock cycles ago. The present invention is well-suited for use in pipelines that include such "state machine" stages, as well as for use in applications in which the latches in the data 1~ path are simple pipeline latches.
The sultability of the two-wire interface, in accordance -~ith the present invention, for such "state machine" c_rcu;~s is a significant advantage of the invention. Thls is especiaily true where a data path is being controlled by a 23 state ~.achine. In this case, the two-wire interface technique above-described may be used to ensure that the "current state" of the machine stays in step with the data which it is controlling in the pipeline.
Fig. 6 shows a simplified block diagram of one exa~ple of 2~ circultry included in a pipeline stage for decoding a token address field. This illustrates a pipeline stage that has the characteristics of a "state machine~. Each word of a token includes an "extension bit~ which is HIGH if there are more ~ords in the token or LOW if this is the last word of ^v tke token. If this is the last word of a token, the next vaild data word is the start of a new token and, therefore, its address ~ust be decoded. The decision as to whether or ~0. tO decode the token address in any given word, -hus, depends upon knowing the value of the previous extension ~it.

For the sake of simplicity only, the two-wire interface (with the acceptance and validation signals and latches) is not illustrated and all details dealing with resetting the circult are omitted. As before, an 8-bit data word is assumed by way of example only and not by way of limitation.
This exemplifying pipeline stage delays the data bits and the extension bit by one pipeline stage. It also decodes the DATA Token. At the point when the first word of the DAT~.
Token is presented at the output of the circuit, the signal v "DATA ADDR" is created and set HIGH. The data bits are delayed by the latches LDIN and LDOUT, each of which is repeated eight times for the eight data bits used in this example (corresponding to an 8-input, 8-output latch).
Similarly, the extension bit is delayed by extension bit l_ 'atches LEIN and LEOUT.
In this example, the latch LEPREV is provided to store 'he mcst recent state of the extension bit. The value of ..~e extension bit is loaded into LEIN and is then loaded ,r.to LEOUT on the next rising edge of the non-overlapping clock ~, phase signal PHl. Latch LEOUT, thus, contains the value of the current extension bit, but only during the second half of the non-overlapping, two-phase clock. Latch LEPREV, however, loads this extension bit value on the next rising edge of the clock signal PHO, that is, the same signal that enables the 2-, extension bit input latch LEIN. The output QEPREV of the latch LEPREV, thus, will hold the value of the extension bi.
during the previous PHO clock phase.
The five bits of the data word output from the inver. na ~ output, plus the non-inverted MD[2j, of the latch LDIN are ,i~ c~mbined -with the previous extension bit value QEPRE~? in a ser;es of logic gates NAND1, NAND2, and NORl, whose cperations are well known in the art of digital design. The iesignation ~N MD;mi indicates the logical inverse of bi-cf the ~id-data word MD[7:0~. ~sing known techniques cf - 21~5~21 Boolean algebra, it can be shown that the output signal SA
from this logic block (the output from NO~l) is HIGH (a "1") only when the previous extension bit is a "O" (QPREV="O") and the data word at the output of the non-inverting Q latch (the original input word) LDIN has the structure "000001xx", that is, the five high-order bits MD~]-~D[31 bits are all "O" anà
the bit MD'23 is a "1" and the bits in the Zero-one positior.s have any arbitrary value.
There are, thus, four possible data words (there are four permutations of "xx") that will cause SA and, therefore, the output of the address signal latch LADDR to whose input SA is connected, to become HIGH. In other words, this stage provides an activation signal (DATA ADDR = "1") only when one of the four posslble proper tokens is presented and only when 1~ the previous extension bit was a zero, that is, the previous data word was the last word in the previous serles of ~o~en words, ~hich -,eans that the current token word is the fi-s_ one in the current token.
~ hen the slgnal QPREV from latch LEPREV is LOW, the va,~e at the output of the latch LDIN is therefore the first wcr~
of a new token. The gates NAND1, NAND2 and NORl decode the DATA token (000001xx). This address decoding signal SA is, however, delayed in latch LADDR so that the signal DATA_ADDR
. has the same timing as the output data OUT_DATA and OUT_EXT~.
2, Fig. 7 is another simple example of a state-dependent pipellne stage in accordance with the present invention, which generates the signal LAST_OUT_EXTN to indicate the value of the previous output extension bit OUT_EXTN. One cf the two enabling signals (at the CK inputs) to the preser..
_ J and last extension bit latches, LEOUT and L_2R-V, respect ~el~, is derived from the gate ANDl such that .~ese ~atches only ioad a new value for them when the data is va~id and is being accepted (the Q outputs are HIGH frc~ ~he output validation and acceptance latches LVOUT and L~.~UT, respectively). In this way, they only hold valid extension bits and are not loaded with spurious values associated ~ith .
data that is not valid. In the embodiment shown in Fig. 7, the two-~ire valid/accept logic includes the OR1 and OR2 gates with input signals consisting of the downstrea~
acceptance signals and the invertin~ output of the validaticn latches L-~tIN and LVO~T, respectively. This illustrates one ~ay in which the gates NAND1/2 and INV1/2 in Fig. ~ can be replaced if the latches have inverting outputs.
_!~ Although this is an extre~ely simple example of a "state-dependent" pipeline stage, i.e., since it depends on the state of only a single bit, it is generally true that all latches holding state information will be updated only wher data is actually transferred between pipeline stages. I~
, other words, only when the data is both valid and bein~
accepted by the next stage. Accordingly, care must be taken to ensure that such latches are properly reset.
The generation and use of tokens in accordance with the present invention, thus, provides several advantages oJe~
~' known encoding techniques for data transfer through a pipeline.
First, the tokens, as described above, allow for variable ;ength address fields (and can utilize ~uffman coding for example) to provide efficient representation of co~mc.-2, tokens.
Second, consistent encoding of the length of a to~enallows the end of a token (and hence the start of the .~e~t token) to be processed correctly (including simpie non-manipulative transfer), even if the token is not recognize~
û ~-y the token decoder circuitry in a given pipeline stage.
Third~ rules and hardware structures for the handling ~f unreccgnized tokens (that is, for passing them on unmodlfied aliou co~munication bet~een one stage and a downstrea~ sta~
tha~ lS nct its nearest neighbor in the pipeline. ~his sc~

~3 21~5221 increases the expandability and efficient adaptability of the pipeline since it allows for future changes in the token set without requiring large scale redesigning of existing plpeline stages. The tokens of the present invention are particularly useful when used in con~unction with the two-wire interface that is described a~ove and below.
As an example of the above, Figs. 8a and 8b, taker.
together (and referred to collectively below as Fig. 8), deplct a block diagram of a pipeline stage whose function is as follows. If -he stage is processing a predetermined token ~known in this example as the DATA token), then it will duplicate every word in thls token with the exception of the first one, which includes the address field of the DAIA
token. If, on the other hand, the stage is processing any other kind of token, it will delete every word. The overall effec- lS tnat, at the output, only DATA Tokens appear and each word within these tokens is repeated twice.
~ .any of the components of this illustrated syste~ may _e ~he same as those described in the much simpler structures 2, shown in Figs. ~, 6, and 7. This illustrates a significant advantage. More complicated pipeline stages will still enjoy the same benefits of flexibility and elasticity, since the sa.-,e two--~ire interface may be used with little or no adaptation.
~, The data duplicatlon stage shown in Fig. 8 is merely one example of the endless number of different types of operatlons that a pipeline stage could perform in any given application. This "duplication stage" illustrates, however, a stage that can form a "bottleneck", so that the pipeline _ according to this e~.bodi~ent will "pack together".
A "bottleneck" can be any stage that either taXes ~
relalively long .i~,e to perform its operations, or that creates ~ore àata in the pipeline than it receives. This exa~ple a'so illustrates that the two-wire accept/vali~

j~i 2145~21 interface according to this e~,bodiment can be adapted very easily to different applications.
The duplication stage shown in Fig. 8 also has two latches LEIN and LEO~T that, as in the example shown in Fig. 6, latch the state of the extension bit at the input and at the output of the stage, respectively. As Fig. 8a shows, the ;nput extension latch LEIN is clocked synchronously with the inpu~
data latch LDIN and the validation signal IN_VALID.
For ease of reference, the various latches included in the C duplication stage are paired below with their respective output signals:

In the duplication stage, the output from the data latch LDIN forms intermediate data referred to as MID_DATA. This intermediate data word is ioaded into the data output latch ' _ LDO~'T only when an intermediate acceptance signal (labeled "~TD_ACCrPT" in Fig. 8a) is set HIGH.
The portion of the circuitry shown in Fig. 8 below the acceptance latches LAIN, LAO~T, shows the circuits that are added to ~he basic pipeline structure to generate the variol-S

internal control signals used to duplicate data. These include a "DATA TOKEN" signal that indicates that the circuitry is currently processing a valid DATA Token, and a NOT_D~PLICATE signal which is used to control duplication of data. When the circuitry is processing a DATA Token, the NOT_DUPLICATE siqnal toggles ~et~een a HIGH and a LOW state and this causes each word in the token to be duplicated once (but no more times). When the circuitry is not processing a valid DATA Token then the NOT DUPLICATE signal is held in a lo HIGH state. Accordingly, this means that the token words that are being processed are not duplicated.
As Fig. 8a illustrates, the upper six bits of 8-bit ntermediate data word and the output signal QIl from the latch LI1 form inputs to a group of logic gates NOR1, NOR2, l_ NAN31~. The output signal from the gate NAND18 is labeled Sl. ~slng ~ell-known Boolean algebra, it can be shown that .Ae signal Sl is a "O" only when the output signal QI1 is a ~ and the MID_DATA ~ord has the following structure:
"OOGOOlxx", that is, the upper five bits are all "O", the bit - ,3 ~ID_DATAL23 is a "1" and the bits in the MID_DATA~1] and .MI2_DATA;Ol positions have any arbitrary value. Signal S1, therefore, acts as a "token identification signal" which is low only when the MID_DATA signal has a predetermined st-ucture and the output from the latch LI1 is a "1". The 2~ nature of the latch LIl and its output QI1 is explained further below.
Latch LOl performs the function of latching the last value of the intermediate extension bit (labeled "MID_EXTN" and as s gnal S4), and it loads this value on the next rising edge -~ 5, _he clock phase PHO into the latcn LIl, whose output is ~he Dit QI1 and is one of the inputs to the token decod1~.a logic group that forms signal S1. Signal Sl, as is explalned above, .~ay only drop to a "0" if the signal QI1 is a "1" (an~
~he.~lID-DATA signal has the predetermined structure). S gnal 21~5221 Sl may, therefore, only drop to a "O" whenever the last extension bit was "0", indicating that the previous token has ended. Thereore, the MID DATA word is the first data word in a new token.
The latches LO2 and LI2 together ~ith the NAND gates NAND20 and NAND22 form storage for the signal, DATA TOKEN.
In the normal situation, the signal QIl at the input to ~AND20 and the signal S1 at the input to ~AND22 will both be at logic "1". It can be shown, again by the techniques of J 3Oolean algebra, that in this situation these NAND gates operate in the same manner as inverters, that is, the signal Q~2 fro~ the output of latch LI2 is inverted in NAND20 and hen this signal 1S inverted again by NAND22 to form the signal S2. In this case, since there are two logical 1_ inversions in this path, the signal S2 will hàve the sa.me -~alue as ~I2-.
It can also be seen that the signal DATA_TOKE~' at the output of latch LO2 forms the input to latch LI2. As a result, as long as the situation remains in which both QIl 2, and S1 are HIGH, the signal DATA TOKEN will retain its state ~whether "0" or "1"). This is true even though the clock signals PHO and PH1 are clocking the latches (LI2 and LC2 respectively). The value of DATA TOKEN can only change when one or both of the signals QI1 and S1 are "0".
~, As explained earlier, the signal QI1 will be "0" w~en the previous extension bit was "0". Thus, it will be "0"
whenever the MID_DATA value is the first word of a token (and~ thus, includes the address field for the to~en). In thls situation, the signal Sl may be either "0" or "1". ..s explained earlier, signal S1-~ill be "0" if the MID DAIA-~ord has .he predetermined structure that in this exa~p_e indicates a "DATA~ Token. If the MID_DATA word has ar.y o.her s.ructure, (indicating that the token is some other token, not a DATA Token), S1 ~ill be "1".

:; ~ 214~221 If QIl is "0" and Sl is "l", this indicates there is some token other than a DATA Token. As is well known in the field of digital electronics, the output of NAND20 will be "l".
The NAND gate NAND22 will invert this (as previously explained~ and the signal S2 will thus be a "0". As a result, this "0" value will be loaded into latch LO2 at the start of the next PHl clock phase and the DATA_TOKEN signal -~ill become "0", indicating that the circuitry is not processing a DATA token.
If QIl is "0" and SO is "0", thereby indicating a DATA
token, then the signal S2 will be "l" (regardless of the other input to NAND22 from the output of NAND20). As a result, this "l" value will be loaded into latch L02 at the start of the next PHl clock phase and the DATA_TOKEN signal will beco~e "l", indicating that the circuitry is processlng a DATA token.
The NOT_DUPLICATE signal (the output signal Qo3) is sl~iiarly loaded into the latch LI3 on the next rising edae of the clock PHO. The output signal QI3 from the latch LI3 is co..~bined with the output signal QI2 in a gate NAND24 to for~ the signa~l S3. As before, Boolean algebra can be used to show that the signal S3 is a "0" only when both of the signals QI2 and QI3 have the value "l". If the signal ~I2 beco~.es a "0", that is, the DATA TOKEN signal is a "0", then the signal S3 becomes a "l". In other words, if there is not a valid DATA TOKEN (QI2 = 0) or the data word is not a duplicate (QI3 = 0), then the signal S3 goes high.
Assume now, that the DATA TOKEN signal remains HIGH f,r ~ore than one clock signal. Since the NOT D~PLICATE sig..a1 03) is ~'fed back~' to the latch ~I3 and will be inverteà by '~.e gate NAND 24 (since its other input QI2 is held HIC~
the output signal Q03 will toggle bet~een "0" and ".". If there lS no valid DATA Token, however, the signal QI2 w ll b~
a "0", and the signal 53 and the output Q03, -~ill be forc~d HIGH until the DATE_TOKEN signal once again goes to a "1".
The output Q03 (the NOT DUPLICATE signal) is also fed back and is combined with the output QAl from the acceptance latch ;AIN in a series of logic gates (NAND16 and IN~'16, which together fo~m an AND gate) that have as their output a "1", only when the s~gnals QAl and Q03 both have the value "1".
As Fig. 8a sho~s, the output from the AND gate (the gate NAND16 followed by the gate INV16) also forms the acceptance signal, IN_ACCEPT, which is used as described above in .he t-~o-wire interface structure.
The acceptance signal IN_ACCEPT is also used as an enabling signal to the latches LDIN, LEIN, and LVI~. As a result, if the NOT_DUPLICATE signal is low, the acceptance signal I~_ACCEPT will also be low, and all three of these '~ latches will be disabled and will hold the values stored at their outputs. Ihe stage will not accept new data untll .he ~OT DUPLICATE signal becomes HIGH. This is in addl,ion tc the requirements described above for forcing the output fro~.
_he acceptance latch LAIN high.
2u As long as there is a valid DATA_TOKEN (the DATA_.O~E~
signai Q02 is a "1"), the signal Q03 will toggle between the HIGH and LOW states, so that the input latches will be enabled and will be able to accept data, at most, during every other complete cycle of both clock phases PH0, PH~.
2~ The additional condition that the following stage be prepared to accept data, as indicated by a "HIGH" OUT_ACCEPT signa , ~ust, of course, still be satisfied. The output latch LDOUI
will, therefore, place the same data word onto the output bls O~T_DATA for at least two full clock cycles. The o~.T V~L.C
3G signal will be a "1" only when there is both a vali~
TOKE~ (2G2 H C-U) and the validation sigr,al QVo~T ~s riIC-H .
The signal QEI~ hich is the extension bit correscnd-r;g 'c .~IG_~TA, is co.-.bined with the signal S3 in a series of - 21~221 loqic gates (INV10 and NAND10) to form a signal S4. During presentation of a DATA Token, each data word MID_DATA will ~e repeated by loading it into the output latch LDOUT twice.
During the first of these, S4 will be forced to a "1" by the action of NAND10. The signal S4 is loaded in the latch LEOUT
to form O~TEXTN at the same time a~ MID_DATA is loaded ir.to LDOUT to form O~'T_DATA[~:O].
Thus, the first time a given MID_DATA is loaded int_ LEOUT, the associated OUTEXTN will be forced high, whereas, on the second occasion, OUTEXTN will be the same as the signal QEIN. Now consider the situation during the very las_ ~ord of a token in which QEIN is known to be low. Durlng the first time MID_DATA is loaded into LDOUT, OUTEXTN will be "1", and during the second time, OUTEXTN will be "O", indicating the true end of the token.
The output signal QVIN from the validation latch L~ N s comblned with the signal QI3 in a similar gate combinatio.
~ 12 and NAND12) to form a signal S5. Using known Booiea-.
~echniques, it can be shown that the signal S5 is HIGH either hen the validation signal QVIN is HIGH, or when the signa' ~I3 lS low (indicating that the data is a duplicate). The signal 55 is loaded into the validation output latch LVO~'T at the same time that MID_DATA is loaded into LDOUT and the ntermediate extension bit (signal S4) is loaded into LEOUT.
~-, Slgnal 55 is also combined with the signal Q02 (the data token signal) in the logic gates NAND30 and INV30 to form the output validation signal OUT_'vALID. As was mentioned earlier, OUT_VALID is HIGH only when there is a valid toke-and the validation signal VOUT is high.
In the present invent on, the MID ACCEPT signal lS
ccmk ned -~lth the signal S5 in a series of logic gates (~Al1326 and ~N~26) that perform the well-known AND func~i~
to form a signai S6 that lS used as one of the t~o enaDlin~
signals to the latches LOl, L02 and L03. The signal 56 riseS

`-- 21~5221 to a "1" when the MID_ACCEPT signal is HIGH and when either the validation signal QVIN is high, or when the token is a duplicate (QI3 is a "O"). If the signal ~ID_ACCEPT is HIGH, the la~ches LOl-L03 will, therefore, be enabled when the clock signal PH1 is high whenever valid input data is loaded at the input of the stage, or when the latched data is a duplicate.
From the discussion above, one can see that the stage shown in Figs. 8a and 8b will receive and transfer data between stages under the control of the validation and acceptance signals, as in previous embodiments, with the exception that the output signal from the acceptance latch LAIN at the input side is combined with the toggling duplicatlon signal so that a data word will be output twice 1~ ~efore a new word will be accepted.
The varlous logic gates such as NAND16 and INV16 may, of course, be replaced by equivalent logic circuitry (in thls case, a single AND gate). Similarly, if the latches LEIN and LVIN, for example, have inverting outputs, the inverters 2~ ~10 and IN~'12 will not be necessary. Rather, the corresponding input to the gates NAND10 and NAND12 can be tied directly to the inverting outputs of these latches. As long as the proper logical operation is performed, the stage will operate in the same manner. Data words and extension 2~ bits will still be duplicated.
One should note that the duplication function that the illustrated stage performs will not be performed unless ~he first data word of the token has a "l" in the third posi~ion of the word and "O's" in the five high-order bits. (~f ,v ^ourse, the required pattern can easily be changed and set by selec~ing other logic gates and interconnections other than ~he ~OR~ OR2, ~N~18 gates shown.) In add ~ion, as ~lg. 8 sho-~s, the OUT_~TALID signal ~lll te forced lo-~ durlng ~he entire token unless the first dat2 ~rd 21 1~221 has the structure described above. This has the effect that all tokens except the one that causes the duplication process will be deleted from the token stream, since a device connected to the output terminals (OUTDATA, OUTEXTN and S OUTVALID) will not recognize these token words as valid data.
As before, both validation latches LVIN, LVOUT in the stage can be reset by a single conductor NOT_RESETO, and a single resetting input R on the downstream latch LVOUT, with the reset signal being propagated backwards to cause the upstream validation latch to be forced low on the next clock cycle.
It should be noted that in the example shown in Fig. 8, the duplication of data contained in DATA tokens serves only as an example of the way in which circuitry may manipulate the ACCEPT and VALID signals so that more data is leaving the pipeline stage than that which is arriving at the input.
Similarly, the example in Fig. 8 removes all non-DATA tokens purely as an illustration of the way in which circuitry may manipulate the VALID signal to remove data from the stream.
In most typical applications, however, a pipeline stage will simply pass on any tokens that it does not recognize, unmodified, so that other stages further down the pipeline may act upon them if required.
Figs. 9a and 9b taken together illustrate an example of a timing diagram for the data duplication circuit shown in Figs. 8a and 8b. As before, the timing diagram shows the relationship between the two-phase clock signals, the various internal and external control signals, and the manner in which data is clocked between the input and output sides of the stage and is duplicated.

Referring now more particularly to Figure 10, there is shown a reconfigurable process stage in accordance with one aspect of the present invention.
Input latches 34 receive an input over a first bus 31. A first output from the input latches 34 is passed over line 32 to a token decode subsystem 33. A second output from the input latches 34 is passed as a first input over line 35 to a processing unit 36. A first output from the token decode subsystem 33 is passed over line 37 as a second input to the processing unit 36. A second output from the token decode 33 is passed over line 40 to an action identification unit 39.
The action identification unit 39 also receives input from registers 43 and 44 over line 46. The registers 43 and 44 hold the state of the machine as a whole. This state is determined by the history of tokens previously received. The output from the action identification unit 39 is passed over line 38 as a third input to the processing unit 36. The output from the processing unit 36 is passed to output latches 41. The output from the output latches 41 is passed over a second bus 42.
Referring now to Figure 11, a Start Code Detector (SCD) 51 receives input over a two-wire interface 52. This input can be either in the form of DATA tokens or as data bits in a data stream. A first output from the Start Code Detector 51 is passed over line 53 to a first logical first-in first-out buffer (FIFO) 54. The output from the first FIF0 54 is logically passed over line 55 as a first input to a Huffman decoder 56. A second output from the Start Code Detector 51 is passed over line 57 as a first input to a DRAM
interface 58. The DRAM interface 58 also receives input from a buffer manager 59 over line 60. Signals are transmitted to and received from external DRAM (not shown) by the DRAM
interface 58 over line 61. A first output from the DRAM
interface 58 is passed over line 62 as a first physical input to the Huffman decoder 56.

- ~14~221 The output from the Huffman decoder 56 i8 passed over line 63 as an input to an Index to Data Unit (ITOD) 64.
The Huffman decoder 56 and the ITOD 64 work together as a single logical unit. The output from the ITOD 64 is passed over line 65 to an arithmetic logic unit (ALU) 66. A first output from the ALU 66 is passed over line 67 to a read-only memory (ROM) state machine 68. The output from the ROM state machine 68 is passed over line 69 as a second physical input to the Huffman decoder 56. A second-output from the ALU 66 is passed over line 70 to a Token Formatter (T/F) 71.
A first output 72 from the T/F 71 of the present invention is passed over line 72 to a second FIFO 73. The output from the second FIFO 73 is passed over line 74 as a first input to an inverse modeller 75. A second output from the T/F 71 is passed over line 76 as a third input to the DRAM interface 58. A third output from the DRAM interface 58 is passed over line 77 as a second input to the inverse modeller 75. The output from the inverse modeller 75 is passed over line 78 as an input to an inverse quantizer 79 The output from the inverse quantizer 79 is passed over line 80 as an input to an inverse zig-zag (IZZ) 81. The output from the IZZ 81 is passed over line 82 as an input to an inverse discrete cosine transform (IDCT) 83. The output from the IDCT 83 is passed over line 84 to a temporal decoder (not shown).
Referring now more particularly to Figure 12, a temporal decoder in accordance with the present invention is shown. A fork 91 receives as input over line 92 the output from the IDCT 83 (shown in Fig. 11). As a first output from the fork 91, the control tokens, e.g., motion vectors and the like, are passed over line 93 to an address generator 94.
Data tokens are also passed to the address generator 94 for counting purposes. As a second output from the fork 91, the - 21~221 data is passed over line 95 to a FIFO 96. The output from the FIFO 96 i8 then passed over line 97 as a first input to a summer 98. The output from the address generator 94 is passed over line 99 as a first input to a DRAM interface 100.
Signals are transmitted to and received from external DRAM
(not shown) by the DRAM interface 100 over line 101. A first output from the DRAM interface 100 is passed over line 102 to a prediction filter 103. The output from the prediction filter 103 is passed over line 104 a a second input to the summer 98. A first output from the summer 98 is passed over line 105 to output selector 106. A second output from the summer 98 is passed over line 107 as a second input to the DRAM interface 100. A second output from the DRAM interface 100 is passed over line 108 as a second input to the output selector 106. The output from the output selector 106 is passed over line 109 to a Video Formatter (not shown in Figure 12).
Referring now to Figure 13, a fork 111 receives input from the output selector 106 (shown in Figure 12) over line 112. As a first output from the fork 111, the control tokens are passed over line 113 to an address generator 114.
The output from the address generator 114 is passed over line 115 as a first input to a DRAM interface 116. As a second output from the fork 111 the data is passed over line 117 as a second input to the DRAM interface 116. Signals are transmitted to and received from external DRAM (not shown) by the DRAM interface 116 over line 118. The output from the DRAM interface 116 is passed over line 119 to a display pipe 120.
It will be apparent from the above descriptions that each line may comprise a plurality of lines, as necessary.

21~5~21 Referring now to Figure 14a, in the MPEG standard a picture 131 is encoded as one or more slices 132. Each slice 132 is, in turn, comprised of a plurality of blocks 133, and is encoded row-by-row, left-to-right in each row.
As is shown, each slice 132 may span exactly one full line of blocks 133, less than one line B or D of blocks 133 or multiple lines C of blocks 133.
Referring to Figure 14b, in the JPEG and H.261 standards, the Common Intermediate Format (CIF) is used, wherein a picture 141 is encoded as 6 rows each containing 2 groups of blocks (GOBs) 142. Each GOB 142 is, in turn, composed of either 3 rows or 6 rows of an indeterminate number of blocks 143. Each GOB 142 is encoded in a zigzag direction indicated by the arrow 144. The GOBs 142 are, in turn, processed row-by-row, left-to-right in each row.
Referring now to Figure 14c, it can be seen that, for both MPEG and CIF, the output of the encoder is in the form of a data stream 151. The decoder receives this data stream 151. The decoder can then reconstruct the image according to the format used to encode it. In order to allow the decoder to recognize start and end points for each standard, the data stream 151 is segmented into lengths of 33 blocks 152.
Referring to Figure 15, a Venn diagram is shown, representing the range of values possible for the table selection from the Huffman decoder 56 (shown in Fig. 11) of the present invention. The values possible for an MPEG
decoder and an H.261 decoder overlap, indicating that a single table selection will decode both certain MPEG and certain H.261 formats. Likewise, the values possible for an MPEG decoder and a JPEG decoder overlap, indicating that a single table selection will decode both certain MPEG and - ~145221 certain JPEG formats. Additionally, it is shown that the H.261 values and the JPEG values do not overlap, indicating that no single table selection exists that will decode both formats.
Referring now more particularly to Figure 16, there is shown a schematic representation of variable length picture data in accordance with the practice of the present invention. A first picture 161 to be proc~Cc~ contains a first PICTURE START token 162, first-picture information of indeterminate length 163, and a first PICTURE_END token 164.
A second picture 165 to be processed contains a second PICTURE_START token 166, second picture information of indeterminate length 167, and a second PICTURE_END token 168.
The PICTURE_START tokens 162 and 166 indicate the start of the pictures 161 and 165 to the processor. Likewise, the PICTURE_END tokens 164 and 168 signify the end of the pictures 161 and 165 to the processor. This allows the processor to process picture information 163 and 167 of variable lengths.
Referring to Figure 17, a split 171 receives input over line 172. A first output from the split 171 is passed over line 173 to an address generator 174. The address generated by the address generator 174 is passed over line 175 to a DRAM interface 176. Signals are transmitted to and received from external DRAM (not shown) by the DRAM interface 176 over line 177. A first output from the DRAM interface 176 is passed over line 178 to a prediction filter 179. The output from the prediction filter 179 is passed over line 180 as a first input to a summer 181. A second output from the split 171 is passed over line 182 as an input to a first-in first-out buffer (FIFO) 183. The output from the FIFO 183 is passed over line 184 as a second input to the summer 181.
The output from the summer 181 is passed over line 185 to a - 21~5221 write signal generator 186. A first output from the write signal generator 186 is p~s-^~ over line 187 to the DRAM
interface 176. A second output from the write signal generator 186 is passed over line 188 as a first input to a read signal generator 189. A second output from the DRAM
interface 176 is passed over line 190 as a second input to the read signal generator 189. The output from the read signal generator 189 is passed over line 191 to a Video Formatter (not shown in Figure 17). -Referring now to Figure 18, the prediction filtering process is illustrated. A forward picture 201 is passed over line 202 as a first input to a summer 203. A
backward picture 204 is passed over line 205 as a second input to the summer 203. The output from the summer 203 is passed over line 206.
Referring to Figure 19, a slice 211 comprises one or more macroblocks 212. In turn, each macroblock 212 comprises four luminance blocks 213 and two chrominance blocks 214, and contains the information for an original 16 x 16 block of pixels. Each of the four luminance blocks 213 and two chrominance blocks 214 is 8 x 8 pixels in size. The four luminance blocks 213 contain a 1 pixel to 1 pixel mapping of the luminance (Y) information from the original 16 x 16 block of pixels. One chrominance block 214 contains a representation of the chrominance level of the blue color signal (Cu/b), and the other chrominance block 214 contains a representation of the chrominance level of the red color signal (Cv/r). Each chrominance level is subsampled such that each 8 x 8 chrominance block 214 contains the chrominance level of its color signal for the entire original16 x 16 block of pixels.
Referring now to Figure 20, the structure and function of the Start Code Detector will become apparent. A

value register 221 receives image data over a line 222. The line 222 is eight bit~ wide, allowing for parallel transmission of eight bits at a time. The output from the value register 221 is passed serially over line 223 to a decode register 224. A first output from the decode register 224 is pA~e~ to a detector 225 over a line 226. The line 226 is twenty-four bits wide, allowing for parallel transmission of twenty-four bits at a time. The detector 225 detects the presence or absence of an-image which corresponds to a standard-independent start code of 23 "zero" values followed by a single "one" value. An 8-bit data value image follows a valid start code image. On detecting the presence of a start code image, the detector 225 transmits a start image over a line 227 to a value decoder 228.
A second output from the decode register 224 is passed serially over line 229 to a value decode shift register 230. The value decode shift register 230 can hold a data value image fifteen bits long. The 8-bit data value following the start code image is shifted to the right of the value decode shift register 230, as indicated by area 231.
This process eliminates overlapping start code images, as discussed below. A first output from the value decode shift register 230 is passed to the value decoder 228 over a line 232. The line 232 is fifteen bits wide, allowing for parallel transmission of fifteen bits at a time. The value decoder 228 decodes the value image using a first look-up table (not shown). A second output from the value decode shift register 230 is passed to the value decoder 228 which passes a flag to an index-to-tokens converter 234 over a line 235. The value decoder 228 also passes information to the index-to-tokens converter 234 over a line 236. The information is either the data value image or start code index image obtained from the first look-up table. The flag - 214~221 indicates which form of information is passed. The line 236 is fifteen bits wide, allowing for parallel transmission of fifteen bits at a time. While 15 bits has been chosen here as the width in the present invention it will be appreciated that bits of other lengths may also be used. The index-to-tokens converter 234 converts the information to token images using a second look-up table (not shown) similar to that given in Table 12-3 of the Users Manual. The token images generated by the index-to-tokens converter 234 are then output over a line 237. The line 237 is fifteen bits wide, allowing for parallel transmission of fifteen bits at a time.
Referring to Figure 21, a data stream 241 consisting of individual bits 242 is input to a Start Code Detector (not shown in Figure 21). A first start code image 243 is detected by the Start Code Detector. The Start Code Detector then receives a first data value image 244. Before processing the first data value image 244, the Start Code Detector may detect a second start code image 245, which overlaps the first data value image 244 at a length 246. If this occurs, the Start Code Detector does not process the first data value image 244, and instead receives and processes a second data value image 247.
Referring now to Figure 22, a flag generator 251 receives data as a first input over a line 252. The line 252 is fifteen bits wide, allowing for parallel transmission of fifteen bits at a time. The flag generator 251 also receives a flag as a second input over a line 253, and receives an input valid image over a first two-wire interface 254. A
first output from the flag generator 251 is passed over a line 255 to an input valid register (not shown). A second output from the flag generator 251 is passed over a line 256 to a decode index 257. The decode index 257 generates four outputs; a picture start image is passed over a line 258, a 21~ ~221 picture number image is p~S~ over a line 259, an insert image is passed over a line 260, and a replace image is passed over a line 261. The data from the flag generator 251 is passed over a line 262a. A header generator 263 uses a look-up table to generate a replace image, which is passed over a line 262b. An extra word generator 264 uses the MPU
to generate an insert image, which is passed over a line 262c. Line 262a, and line 262b combine to form a line 262, which is first input to output lat-ches 265. The output latches 265 pass data over a line 266. The line 266 is fifteen bits wide, allowing for parallel transmission of fifteen bits at a time.
The input valid register (not shown) passes an image as a first input to a first OR gate 267 over a line 268. An insert image is passed over a line 269 as a second input to the first OR gate 267. The output from the first OR
gate 267 is passed as a first input to a first AND gate 270 over a line 271. The logical negation of a remove image is passed over a line 272 as a second input to the first AND
gate 270 is passed as a second input to the output latches 265 over a line 273. The output latches 265 pass an output valid image over a second two-wire interface 274. An output accept image is received over the second two-wire interface 274 by an output accept latch 275. The output from the output accept latch 275 is passed to an output accept register (not shown) over a line 276.
The output accept register (not shown) passes an image as a first input to a second OR gate 277 over a line 278. The logical negation of the output from the input valid register is passed as a second input to the second OR gate 277 over a line 279. The remove image is passed over a line 280 as a third input to the second OR gate 277. The output from the second OR gate 277 is passed as a first input to a second AND gate 281 over a line 282. The logical negation of 21~52~1 an insert image is pAsFe~ as a second input to the second AND
gate 281 over a line 283. The output from the second AND
gate 281 is passed over a line 284 to an input accept latch 285. The output from the input accept latch 285 is passed over the first two-wire interface 254.

21~5221 TABL~ 600 Format Ima~e Received Tokens Generated 1. H.261 SEQUENCE START SEQUENCE START
MPEG PICTURE START GROUP START
JPEG (None) PICTURE START
PICTURE DATA
2. H.261 (None) PICTURE END
MPEG (None) PADDING
JPEG (None) - FLUSH
STOP AFTER PICTURE
As set forth in Table 600 which shows a relationship between the absence or presence of standard signals in the certain machine independent control tokens, the detection.of an image by the Start Code Detector 51 generates a sequence of machine independent Control Tokens. Each image listed in the "Image Received" column starts the generation of all machine independent control tokens listed in the group in the "Tokens Generated" column. Therefore, as shown in line 1 of Table 600, whenever a "sequence start" image is received during H.261 processing or a "picture start" image is received during MPEG processing, the entire group of four control tokens is generated, each followed by its corresponding data value or values. In addition, as set forth at line.2 of Table 600, the second group of four control tokens is generated at the proper time irrespective of images received by the Start Code Detector 51.

DISPLAY ORDER: I1 B2 B3 P4 B5 B6 P7 B8 B9 I10 TRANSMIT ORDER: Il P4 B2 B3 P7 B5 B6 I10 B8 B9 As shown in line 1 of Table 601 which shows the timing relationship between transmitted pictures and displayed pictures, the picture frames are displayed in numerical order. However, in order to reduce the number of frames that ~4 must be stored in memory, the frames are transmitted in a different order. It is useful to begin the analysis from an intraframe (I frame). The Il 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 I1 frame and P4 frame are transmitted, represented by frames 82 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 the I1 frame and the P4 frame, the next P frame, P7, is transmitted. Next, all the B frames to be displayed between the P4 and P7 frames are transmitted, corresponding to B5 and B6. Then, the next I frame, IlO, is transmitted. Finally, all the B frames to be displayed between the P7 and IlO frames are transmitted, corresponding to frames B8 and B9. This ordering of transmitted frames requlres only two frames to be kept in memory at any one tlme, and does not require the decoder to wait for the transmission of the next P frame or I frame to display an interjacent B frame.
Further information regarding the structure and operation, as well as the features, objects and advantages, of the invention will become more readily apparent to one of ordinary skill in the art from the ensuing additional detailed description of illustrative embodiment of the invention which, for purposes of clarity and convenience of explanation are grouped and set forth in the following sections:
~0 1 . Multi-Standard Configurations 2. J?EG Still Picture Decoding 3. Motion Plcture Decompression 4. ~M Memory Map '. Bitstream Characteristlcs ~_ . 21~5221 6. Reconfigurable Processing Stage 7. Multi-Standard Coding 8. Multi-Standard Processing Circuit-2nd Mode of Operatlon 9. Start Code Detector 10. Tokens ll. DRAM Interface 12. Prediction Filter 13. Accessing Registers 14. Microprocessor Interface (MPI) 13 15. MPI Read Timing 16. MPI ~rite Timing 17. Key Hole Address Locations 18. Picture End 19. Flushing Operation 1- 20. Flush Function 21. Stop-After-Picture 22. Multi-Standard Search Mode 23. Inverse Modeler 24. Inverse Quantizer 2C 25. Huffman Decoder and Parser 26. Diverse Discrete Cosine Transformer 27. Buffer Manager 214~221 1. N~LTI-STA~DARD CONFIG~RATION8 Since the variou8 compression standards, i.e., JPEG, MPEG and H.261, are well known, as for example as described in the aforementioned United States Patent No. 5,212,742, the detailed specifications of those standards are not repeated here.
As previously mentioned, the present invention is capable of decompressing a variety of differently encoded, picture data bitstreams. In each of -the different standards of encoding, some form of output formatter is required to take the data presented at the output of the spatial decoder operating alone, or the serial output of a spatial decoder and temporal decoder operating in combination, ~as subsequently described herein in greater detail) and reformatting this output for use, including display in a computer or other display systems, including a video display system. Implementation of this formatting varies significantly between encoding standards and/or the type of display selected.
In a first embodiment, in accordance with the present invention, as previously described with reference to Figures 10-12 an address generator is employed to store a block of formatted data, output from either the first decoder (Spatial Decoder) or the combination of the first decoder (Spatial Decoder) and the second decoder (the Temporal Decoder), and to write the decoded information into and/or from a memory in a raster order. The video formatter described hereinafter provides a wide range of output signal combinations.
In the preferred multi-standard video decoder embodiment of the present invention, the Spatial Decoder and the Temporal Decoder are required to implement both an MPEG
encoded signal and an H.261 video decoding system. The DRAM
interfaces on both devices are configurable to allow the quantity of DRAM required to be reduced when working with 214~221 small picture formats and at low coded data rates. The reconfiguration of these DRAMs will be further described hereinafter with reference to the DRAM interface. Typically, a single 4 megabyte DRAM is required by each of the Temporal Decoder and the Spatial Decoder circuits.
The Spatial Decoder of the present invention performs all the required processing within a single picture. This reduces the redundancy within one picture.
The Temporal Decoder reduces the redundancy between the subject picture with relationship to a picture which arrives prior to the arrival of the subject picture, as well as a picture which arrives after the arrival of the subject picture. One aspect of the Temporal Decoder is to provide an address decode network which handles the complex addressing needs to read out the data associated with all of these pictures with the least number of circuits and with high speed and improved accuracy.
As previously described with reference to Figure 11, the data arrives through the Start Code Detector, a FIFO register which precedes a Huffman decoder and parser, through a second FIFO register, an inverse modeller, an inverse quantizer, inverse zigzag and inverse DCT. The two FIFOs need not be on the chip. In one embodiment, the data does not flow through a FIFO that is on the chip. The data is applied to the DRAM
interface, and the FIFO-IN storage register and the FIFO-OUT
register is off the chip in both cases. These registers, whose operation is entirely independent of the standards, will subsequently be described herein in further detail.
The majority of the subsystems and stages shown in Figure 11 are actually independent of the particular standard used and include the DRAM interface 58, the buffer manager 59 which is generating addresses for the DRAM interface, the inverse modeller 75, the inverse zig-zag 81 and the inverse 21~5221 DCT 83. The standard independent units within the Huffman decoder and parser include the ALU 66 and the token formatter 71.
Referring now to Figure 12, the standard-independent units include the DRAM interface 100, the fork91, the FIFO register 96, the summer 98 and the output selector 106. The standard dependent units are the address generator 94, which is different in H.261 and in MPEG, and the prediction filter 103, which is-reconfigurable to have the ability to do both H.261 and MPEG. The JPEG data will flow through the entire machine completely unaltered.
Figure 13 depicts a high level block diagram of the video formatter chip. The vast majority of this chip is independent of the standard. The only items that are affected by the standard is the way the data is written into the DRAM in the case of H.261, which differs from MPEG or JPEG; and that in H.261, it is not necessary to code every single picture. There is some timing information referred to as a temporal reference which provides some information regarding when the pictures are intended to be displayed, and that is also handled by the address generation type of logic in the video formatter.
The remainder of the circuitry embodied in the video formatter, including all of the color space conversion, the up-sampling filters and all of the gamma correction RAMs, is entirely independent of the particular compression standard utilized.
The Start Code Detector of the present invention is dependent on the compression standard in that it has to recognize different start code patterns in the bitstream for each of the standards. For example, H.261 has a 16 bit start code, MPEG has a 24 bit start code and JPEG uses marker codes which are fairly different from the other start codes. Once the Start Code Detector has recognized those different start - 21~221 codes, its operation is essentially independent of the compression standard. For instance, during searching, apart from the circuitry that recognizes the different category of markers, much of the operation is very similar between the three different compression standards.
The next unit is the state machine 68 (Figure 11) located within the Huffman decoder and parser. Here, the actual circuitry is almost identical for each of the three compression standards. In fact, the only element that is affected by the standard in operation is the reset address of the machine. If just the parser is reset, then it jumps to a different address for each standard. There are, in fact, four standards that are recognized. These standards are H.261, JPEG, MPEG and one other, where the parser enters a piece of code that is used for testing. This illustrates that the circuitry is identical in almost every aspect, but the difference is the program in the microcode for each of the standards. Thus, when operating in H.261, one program is running, and when a different program is running, there is no overlap between them. The same holds true for JPEG, which is a third, completely independent program.
The next unit is the Huffman decoder 56 which functions with the index to data unit 64. Those two units cooperate together to perform the Huffman decoding. Here, the algorithm that is used for Huffman decoding is the same, irrespective of the compression standard. The changes are in which tables are used and whether or not the data coming into the Huffman decoder is inverted. Also, the Huffman decoder itself includes a state machine that understands some aspects of the coding standards. These different operations are selected in response to an instruction coming from the parser state machine. The parser state machine operates with a different program for each of the three compression standards and issues the correct command to the Huffman decoder at different times consistent with the standard in operation.
The last unit on the chip that i8 dependent on the compression standard is the inverse quantizer 79, where the mathematics that the inverse quantizer performs are different for each of the different standards. In this regard, a CODING STANDARD token is decoded and the inverse quantizer 79 remembers which standard it is operating in. Then, any subsequent DATA tokens that happen after that event, but before another CODING_STANDARD may come along, are dealt with in the way indicated by the CODING_STANDARD that has been remembered inside the inverse quantizer. In the detailed description, there is a table illustrating different parameters in the different standards and what circuitry is responding to those different parameters or mathematics.
The address generation, with reference to H.261, differs for each of the subsystems shown in Figure 12 and Figure 13.
The address generation in Figure 11, which generates addresses for the two FIFOs before and after the Huffman decoder, does not change depending on the coding standards.
Even in H.261, the address generation that happens on that chip is unaltered. Essentially, the difference between these standards is that in MPEG and JPEG, there is an organization of macroblocks that are in linear lines going horizontally across pictures. As best observed in Figure 14a, a first macroblock A covers one full line. A macroblock B covers less than a line. A macroblock C covers multiple lines. The division in MPEG is into slices 132, and a slice may be one horizontal line, A, or it may be part of a horizontal line B, or it may extend from one line into the next line, C. Each of these slices 132 is made up of a row of macroblocks.
In H.261, the organization is rather different because the picture is divided into groups of blocks (GOB).

- ~145221 A group of blocks iB three rows of macroblocks high by eleven macroblocks wide. In the ca~e of a CIF picture, there are twelve such groups of blocks. However, they are not organized one above the other. Rather, there are two groups of blocks next to each other and then six high, i.e., there are 6 GOB's vertically, and 2 GOB's horizontally.
In all other standards, when performing the addressing, the macroblocks are addressed in order as described above. More specifically, addressing proceeds along the lines and at the end of the line, the next line is started. In H.261, the order of the blocks is the same as described within a group of blocks, but in moving onto the next group of blocks, it is almost a zig-zag.
The present invention provides circuitry to deal with the latter affect. That is the way in which the address generation in the spatial decoder and the video formatter varies for H.261. This is accomplished whenever information is written into the DRAM. It is written with the knowledge of the aforementioned address generation sequence so the place where it is physically located in the RAM is exactly the same as if this had been an MPEG picture of the same size. Hence, all of the address generation circuitry for reading from the DRAM, for instance, when forming predictions, does not have to comprehend that it is H.261 standard because the physical placement of the information in the memory is the same as it would have been if it had been in MPEG sequence. Thus, in all cases, only writing of data is affected.
In the Temporal Decoder, there is an abstraction for H.261 where the circuitry pretends something is different from what is actually occurring. That is, each group of blocks is conceptually stretched out so that instead of having a rectangle which is 11 x 3 macroblocks, the macroblocks are stretched out into a length of 33 blocks (see 21~5221 Figure 14c) group of blocks which is one macroblock high. By doing that, exactly the same counting mechanisms used on the Temporal Decoder for counting through the groups of blocks are also used for MPEG.
There is a correspondence in the way that the circuitry is designed between an H.261 group of blocks and an MPEG slice. When H.261 data is processed after the Start Code Detector, each group of blocks is preceded by a slice start_code. The next group o blocks is preceded by the next slice_start code. The counting that goe~ on inside the Temporal Decoder for counting through this structure pretends that it is a 33 macroblock-long group that is one macroblock high. This is sufficient, although the circuitry also counts every 11th interval. When it counts to the 11th macroblock or the 22nd macroblock, it resets some counters.
This is accomplished by simple circuitry with another counter that counts up each macroblock, and when it gets to 11, it resets to zero. The microcode interrogates that and does that work. All the circuitry in the temporal decoder of the present invention is essentially independent of the compression standard with respect to the physical placement of the macroblocks.
In terms of multi-standard adaptability, there are a number of different tables and the circuitry selects the appropriate table for the appropriate standard at the appropriate time. Each standard has multiple tables; the circuitry selects from the set at any given time. Within any one standard, the circuitry selects one table at one time and another table another time. In a different standard, the circuitry selects a different set of tables. There is some intersection between those tables as indicated previously in the discussion of Figure 15. For example, one of the tables used in MPEG is also used in JPEG. The tables are not a completely isolated set. Figure 15 illustrates an H.261 21~5221 set, an MPEG set and a JPEG set. Note that there is a much qreater overlap between the H.261 set and the MPEG set. They are quite common in the tables they utilize. There is a small overlap between MPEG and JPEG, and there is no overlap at all between H.261 and JPEG so that these standards have totally different sets of tables.
As previously indicated, most of the system units are compression standard independent. If a unit is standard independent, and such units need not remember what CODING_STANDARD is being processed. All of the units that are standard dependent remember the compression standard as the CODING_STANDARD token flows by them. When information encoded/decoded in a first coding standard is distributed through the machine, and a machine is changing standards, prior machines under microprocessor control would normally choose to perform in accordance with the H.261 compression standard. The MPU in such prior machines generates signals statlng in multiple different places within the machine that the compression standard is changing. The MPU makes changes at different times and, in addition, may flush the pipeline through.
In accordance with the invention, by issuing a change of CODING_STANDARD tokens at the Start Code Detector that is positioned as the first unit in the pipeline, this change of 2~ compression standard is readily handled. The token says a certain coding standard is beginning and that control information flows down the machine and configures all the other registers at the appropriate time. The MPU need not program each register.
? ~ The prediction token signals how to form predlctions usin~ the blts in the bitstream. Depending on whlch co~pression standard is operating, the circuitry translateS
the information that is found in the standard, i.e. from the bitstream into a prediction mode token. T~is processing 15 ~_` ` 2145221 perfo~med by the Huffman decoder and parser state machine, where it is easy to manipulate bits based on certain conditions. The Start Code Detector generates this preàiction mode token. The token then flows down the machine to the circuitry of the Temporal Decoder, which is the device responsible for forming predictions. The circuitry of the spatial decoder interprets the token without having to kno~
what standard it is operating in because the bits in it are invariant in the three different standards. The Spatial J Decoder just does what it is told in response to that token.
By having these tokens and using them appropriately, the design of other units in the machine is simplified. Although there may be some complications in the program, benefits are received in that some of the hard wired logic which would be l~ difficult to design for multi-standards can be used here.

2. JPEG STILL PlCTURE DECODING
As previously indicated, the present invention relates to signal decompression and, more particularly, to the decompression of an encoded video signal, irrespective of the compression standard employed.
One aspect of the present invention is to provide a first decoder circuit (the Spatial Decoder) to decode a first encoded signal (the JPEG encoded video signal) in combination -~lth a second decoder circuit (the Temporal Decoder) to 2~ decode a first encoded signal (the MPEG or H.261 encoded video signal) in a pipeline processing system. The Temporal Decoder is not needed for JPEG decoding.
In this regard, the invention facilitates the ecompression of a plurality of differently encoded signais 'hrough the use of a single pipeline decoder and decompression system. The decoding and decompression plpeline processor is organized on a unique and specia1 config~ration ~hich allows the handling of the multi-stanàar~

-- ` 21~5221 encoded video signals through the use of techniques all compatible with the single pipeline decoder and processing system. The Spatial Decoder is combined with the Temporal Decoder, and the Video Formatter is used in driving a video display.
Another aspect of the invention is the use of the combination of the Spatial Decoder and the Video Formatter for use with only still pictures. The compression standard independent Spatial Decoder performs all of the data 1v processing within the boundaries of a single picture. Such a decoder handles the spatial decompression of the internal picture data which is passing through the pipeline and is distributed within associated random access memories, standard independent address generation circuits for handling the storage and retrieval of information into the memories.
Still picture data is decoded at the output of the Spatial Decoder, and this output is employed as input to the multi-standard, configurable Video Formatter, which then provides an output to the display terminal. In a first sequence of similar pictures, each decompressed picture at the output of the Spatial Decoder is of the same length in bits by the time the picture reaches the output of the Spatial Decoder. A
second sequence of pictures may have a totally different picture size and, hence, have a different length when compared to the first length. Again, all such second sequence of similar pictures are of the same length in bits by the time such pictures reach the output of the Spatial Decoder.
Another aspect of the invention is to internally organize the incoming standard dependent bitstream into a sequence of control tokens and DATA tokens, in combination ~ith a piurality of sequentially-positioned reconfigurable processing stages selected and organized to act as a standard-independent, reconfigurable-pipeline-processor-21~5221 With regard to JPEG decoding, a single Spatial Decoderwith no off chip DRAM can rapidly decode baseline JPEG
images. The Spatial Decoder supports all features of baseline JPEG encoding standards. However, the image size that can be decoded may be limited by the size of the output buffer provided. The Spatial Decoder circuit also includes a random access memory circuit, having machine-dependent, standard independent address generation circuits for handling the storage of information into the memories.
As previously, indicated the Temporal Decoder is not required to decode JPEG-encoded video. Accordingly, signals carried by DATA tokens pass directly through the Temporal Decoder without further processing when the Temporal Decoder is configured for a JPEG operation.
1~ Another aspect of the present invention is to provide in the Spatial Decoder a pair of memory circuits, such as buffer memory circuits, for operating in combination with the Huffman decoder/video demultiplexor circuit (HD & VDM). A
first buffer memory is positioned before the HD & VDM, and a second buffer memory is positioned after the HD ~ VDM. The HD & VDM decodes the bitstream from the binary ones and zeros that are in the standard encoded bitstream and turns such stream into numbers that are used downstream. The advantage of the two buffer system is for implementing a multi-standard 2, decompression system. These two buffers, in combination with the identified implementation of the Huffman decoder, are described hereinafter in greater detail.
A still further aspect of the present multi-standard, decompression circuit is the combination of a Start Code Detector circuit positioned upstream of the first forward buffer operating in combination with the Huffman decoder.
One advantage of this combination is increased flexibility ir.
dealing with the input bitstream, particularly padding, whic-~has to be added to the bitstream. The placement of these '- - 21~5221 ident~i~ied components, Start Code Detector, memory buffers, and Huffman decoder enhances the handling of certain sequences in the input bitstream.
In addition, off chip DRAMs are used for decoding JPEG-encoded video pictures in real time. The size and speed ofthe buffers used with the DRAMs will depend on the video encoded data rates.
The coding standards identify all of the standard dependent types of information that is necessary for storage 0 in the DRAMs associated with the Spatial Decoder using standard independent circuitry.
3. MOTION PICTURE DECOMPRES8ION
In the present invention, if motion pictures are being decompressed through the steps of decoding, a further Temporal Decoder is necessary. The Temporal Decoder combines the data decoded in the Spatial Decoder with pictures, previously decoded, that are intended for display either before or after the picture being currently decoded. The Temporal Decoder receives, in the picture coded datastream, information to identify this temporally-displaced information. The Temporal Decoder is organized to address temporally and spatially displaced information, retrieve it, and combine it in such a way as to decode the information located in one picture with the picture currently being 2~ decoded and ending with a resultant picture that is complete and is suitable for transmission to the video formatter for driving the display screen. Alternatively, the resultant picture can be stored for subsequent use in temporal decoding of subsequent pictures.
0 Generally, the Temporal Decoder performs the processing ~e~ween pictures either earlier and/or later in time with reference to the picture currently being decoded. The Ter,poral Decoder reintroduces information that is not encoded wilhin the coded representation of the picture, because it is redu~dan~ and is already available at the decoder. More specifically, it is probable that any given picture will contain similar information as pictures temporally surrounding it, both before and after. This similarity can be made greater if motion compensation is applied. The Temporal Decoder and decompression circuit also reduces the redundancy between related pictures.
In another aspect of the present invention, the Temporal Decoder is employed for handling the standard-dependent lo output information from the Spatial Decoder. This standard dependent information for a single picture is distributed among several areas of DRAM in the sense that the decompressed output information, processed by the Spatial Decoder, is stored in other DF~ registers by other random 1~ access memories having still other machine-dependent, standard-independent address generation circuits for -ombinlng one picture of spatially decoded information packet of spatially decoded picture information, temporally displaced relative to the temporal position of the first 2~ picture.
In multi-standard circuits capable of decoding MPEG-encoded signals, larger logic DRAM buffers may be required to support the larger picture formats possible with MPEG.
. The picture information is moving through the serial 2~ pipellne in 8 pel by 8 pel blocks. In one form of the invention, the address decoding circuitry handles these pel blocks (storing and retrieving) along such block boundaries.
The address decoding circuitry also handles the storing and - retrieving of such 8 by 8 pel blocks across such boundaries.
3~ This versatility is more completely described hereinafter-A second Temporal Decoder may also be provided which passes the output of the first decoder circuit (the spatial Decoder) directly to the Video Formatter for handling without signal processing delay.

T~e~Temporal Decoder also reorders the blocks of picture data for display by a display circuit. The address decode circuitry, described hereinafter, provides handling of this reordering.
As previously mentioned, one important feature of the Temporal Decoder is to add picture information together from a selection of pictures which have arrived earlier or later than the picture under processing. When a picture is described in this context, it may mean any one of the following:
1. The coded data representation of the picture;
2. The result, i.e., the final decoded picture resulting from the addition of a process step performed by the decoder;
3. Previously decoded pictures read from the DRAM; and . The result of the spatial decoding, i.e., the extent of data between a PICTURE_START token and a subsequent PICTURE_END token.
After the picture data information is processed by the Temporal Decoder, it is either displayed or written back into a picture memory location. This information is then kept for further reference to be used in processing another different coded data picture.
Re-ordering of the MPEG encoded pictures for visual display involves the possibility that a desired scrambled picture can be achieved by varying the re-ordering feature of the Temporal Decoder.

4. RAM MEMORY MAP
The Spatial Decoder, Temporal Decoder and Vldeo For~atter all use external DRAM. Preferably, the same DR~M
is used for all three devices. While all three devices use DRAM, and all three devices use a DRAM interface lr, conjunction wlth an address generator, what each implementS

in DRAM is different. That is, each chip, e.g. Spatial Decoder and Temporal Decoder, have a different DRAM interface and address generation circuitry even through they use a similar physical, external DRAM.
In brief, the Spatial Decoder implements two FIFOs in the common DRAM. Referring again to Figure 11, one FIFO 54 is positioned before the Huffman decoAer 56 and parser, and the other is positioned after the Huffman decoder and parser.
The FIFOs are implemented in a relatively straightforward manner. For each FIFO, a particular portion of DRAM is set aside as the physical memory in which the FIFO will be implemented.
The address generator associated with the Spatial Decoder DRAM interface 58 keeps track of FIFO addresses using two pointers. One pointer points to the first word stored in the FIFO, the other pointer points to the last word stored in the FIFO, thus allowing read/write operation on the appropriate word. When, in the course of a read or write operation, the end of the physical memory is reached, the address generator "wraps around" to the start of the physical memory.
In brief, the Temporal Decoder of the present invention must be able to store two full pictures or frames of whatever encoding standard (MPEG or H.261) is specified. For simplicity, the physical memory in the DRAM into which the two frames are stored is split into two halves, with each half being dedicated (using appropriate pointers) to a particular one of the two pictures.
~ MPEG uses three different picture types: Intra (I), Predicted (P) and Bidirectionally interpolated (B). As previously mentioned, B pictures are based on predictions from two pictures. One picture is from the future and one from the past. I pictures re~uire no further decoding by the Temporal Decoder, but must be stored in one of the two ~- 2145221 pictu~e ~uffers for later use in decoding P and B pictures.
Decoding P pictures requires forming predictions from a previously decoded P or I picture. The decoded P picture is stored in a picture buffer for use decoding P and B pictures.
B pictures can require predictions form both of the picture buffers. However, B pictures are not stored in the external DRAM.
Note 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 picture buffers, and 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, as further discussed hereinafter in the section on flushing. In brief, the Spatial Decoder can provide a fake I or P picture at the end of a video sequence to flush out the last P or I picture. In turn, this fake picture is flushed when a subsequent video sequence starts.
The peak memory band width load occurs when decoding B
pictures. The worst case is the B frame may be formed from predictions from both the picture buffers, with all predictions being made to half-pixel accuracy.
As previously described, the Temporal Decoder 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 or I pictures are reordered, certain tokens are stored temporarily on 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.

~ ` 2145221 I~n~contrast, H.261 makes predictions only from the picture just decoded. As each picture is decoded, it is written into one of the two picture buffers so it can be used in decoding the next picture. The only DRAM memory operations required are writing 8 x 8 blocks, and forming predictions with integer accuracy motion vectors.
In brief, the Video Formatter stores three frames or pictures. Three pictures need to be stored to accommodate such features as repeating or skipping pictures.

5. B~TSTREAM C~ TERI8TICS
Referring now particularly to the Spatial Decoder of the present invention, it is helpful to review the bitstream characteristics of the encoded datastream as these characteristics must be handled by the circuitry of the Spatial Decoder and the Temporal Decoder. For example, under one or more compression standards, the compression ratio of the standard is achieved by varying the number of bits that it uses to code the pictures of a picture. The number of bits can vary by a wide margin. Specifically, this means that the length of a bitstream used to encode a referenced picture of a picture might be identified as being one unit long, another picture might be a number of units long, while still a third picture could be a fraction of that unit.
None of the existing standards (MPEG 1.2, JPEG, H.261) define a way of ending a picture, the implication being that when the next picture starts, the current one has finished.
Additionally, the standards (H.261 specifically) allow incomplete pictures to be generated by the encoder.
In accordance with the present invention, there is provlded a way of indicating the end of a picture by using one of its tokens: PICTURE_END. The still encoded picture data leaving the Start Code Detector consists of pictures starting with a PICTURE_START token and ending with a PICTURE END token, but still of widely varying length. There may be other information transmitted here (between the first and second picture), but it is known that the first picture has finished.
s The data stream at the output of t~e Spatial Decoder consists of pictures, still with picture-starts and picture-ends, of the same length (number of bits) for a given sequence. The length of time between a picture-start and a picture-end may vary.
The Video Formatter takes these pictures of non-uniform time and displays them on a screen at a fixed picture rate determined by the type of display being driven. Different display rates are used throughout the world, e.g. PAL-NTSC
television standards. This is accomplished by selectively dropping or repeating pictures in a manner which is unique.
Ordinary "frame rate converters," e.g. 2-3 pulldown, operate with a fixed input picture rate, whereas the Video Formatter can handle a variable input picture rate.

6. RECONFIGURABLE PROCE88ING 8TAGE
Referring again to Figure 10, the reconfigurable processing stage (RPS) comprises a token decode circuit 33 which is employed to receive the tokens coming from a two wire interface 37 and input latches 34. The output of the token decode circuit 33 is applied to a processing unit 36 over the two-wire interface 37 and an action identification circuit 39. The processing unit 36 is suitable for processing data under the control of the action identification circuit 39. After the processing is completed, the processing unit 36 connects such completed signals to the output, two-wire interface bus 40 through output latches 41.
The action identification decode circuit 39 has an input from the token decode circuit 33 over the two-wire interface bus 40 and/or from memory circuits 43 and 44 over two-wire interface bus 46. The tokens from the token decode circuit 33 are applied simultaneously to the action identification circuit 39 and the processing unit 36. The action identification function as well as the RPS is described in further detail by tables and figures in a subsequent portion of this specification.
The functional block diagram in Figure 10 illustrates those stages shown in Figures 11, 12 and 13 which are not standard independent circuits. The data flows through the token decode circuit 33, through the processing unit 36 and onto the two-wire interface circuit 42 through the output latches 41. If the Control Token is recognized by the RPS, it is decoded in the token decode circuit 33 and appropriate action will be taken. If it is not recognized, it will be passed unchanged to the output two-wire interface 42 through the output circuit 41. The present invention operates as a pipeline processor having a two-wire interface for controlling the movement of control tokens through the pipeline. This feature of the invention is described in greater detail in the previously filed EP0 patent application number 92306038.8.
In the present invention, the token decode circuit 33 is employed for identifying whether the token presently entering through the two-wire interface 42 is a DATA token or control token. In the event that the token being examined by the token decode circuit 33 is recognized, it is exited to the action identification circuit 39 with a proper index signal or flag signal indicating that action is to be taken. At the same time, the token decode circuit 33 provides a proper flag or index signal to the processing unit 36 to alert it to the presence of the token being handled by the action identification circuit 39.

- ` 2145221 Control tokens may also be processed.
A more detailed description of the various types of tokenc usable in the present invention will be subsequently described hereinafter. For the purpose of this portion of the specification, it is sufficient to note that the address carried by the control token is decoded in the decoder 33 and is used to access registers contained within the action identification circuit 39. When the token being examined is a recognized control token, the action identification circuit 39 uses its reconfiguration state circuit for distributing the control signals throughout the state machine. As previously mentioned, this activates the state machine of the action identification decoder 39, which then reconfigures itself. For example, it may change coding standards. In this way, the action identification circuit 39 decodes the required action for handling the particular standard now passing through the state machine shown with reference to Figure 10.
Similarly, the processing unit 36 which is under the control of the action identification circuit 39 is now ready to process the information contained in the data fields of the DATA token when it is appropriate for this to occur.
On many occasions, a control token arrives first, reconfigures the action identification circuit 39 and is immediately followed by a DATA token which is then processed by the processing unit 36. The control token exits the output latches circuit 41 over the output two-wire interface 42 immediately preceding the DATA token which has been processed within the processing unit 36.
In the present invention, the action identification circuit, 39, is a state machine holding history state. The registers, 43 and 44 hold information that has been decoded from the token decoder 33 and stored in these registers.

Such registers can be either on-chip or-off chip as needed.
The~e plurality of state regieters contain action information connected to the action identification currently being identified in the action identification circuit 39. This action information has been stored from previously decoded tokens and can affect the action that is selected. The connection 40 is going straight from the token decode 33 to the action identification block 39. This is intended to show that the action can also be affected by the token that is currently being processed by the token decode circuit 33.
In general, there is shown token decoding and data processing in accordance with the present invention. The data processing is performed as configured by the action identification circuit 39. The action is affected by a number of conditions and is affected by information generally derived from a previously decoded token or, more specifically, information stored from previously decoded tokens in registers 43 and 44, the current token under processing, and the state and history information that the action identification unit 39 has itself acguired. A
distinction is thereby shown between Control tokens and DATA
tokens.
In any RPS, some tokens are viewed by that RPS unit as being Control tokens in that they affect the operation of the RPS presumably at some subsequent time. Another set of tokens are viewed by the RPS as DATA tokens. Such DATA
tokens contain information which is processed by the RPS in a way that is determined by the design of the particular circuitry, the tokens that have been previously decoded and the state of the action identification circuit 39. Although a particular RPS identifies a certain set of tokens for that particular RPS control and another set of tokens as data, that is the view of that particular RPS. Another RPS can have a different view of the same token. some of the tokens _ ` 214~221 might-~e viewed by one RPS unit as DATA Tokens while another RPS unit might decide that it is actually a Control Token.
For example, the quantization table information, as far as the Huffman decoder and state machine is concerned, is data, because it arrives on its input as coded data, it gets formatted up into a series of 8 bit words, and they get formed into a token called a quantization table token (QUANT TA~LE) which goes down the processing pipeline. As far as that machine is concerned, all of that was data; it was handling data, transforming one sort of data into another sort of data, which is clearly a function of the processing performed by that portion of the machine. However, when that information gets to the inverse quantizer, it stores the information in that token a plurality of registers. In fact, because there are 64 8-bit numbers and there are many registers, in general, many registers may be present. This information is viewed as control information, and then that control information affects the processing that is done on subsequent DATA tokens because it affects the number that you multiply each data word. There is an example where one stage viewed that token as being data and another stage viewed it as being control.
Token data, in accordance with the invention is almost universally viewed as being data through the machine. One of the important aspects is that, in general, each stage of circuitry that has a token decoder will be looking for a certain set of tokens, and any tokens that it does not recognize will be passed unaltered through the stage and down the pipeline, so that subsequent stages downstream of the current stage have the benefit of seeing those tokens and may respond to them. This is an important feature, namely there can be communication between blocks that are not adjacent to one another using the token mechanism.
Another important feature of the invention is that each of the stages of circuitry has the proce~sing capability within it to be able to perform the necessary operations for each of the standards, and the control, as to which operations are to be performed at a given time, come as tokens. There is one processing element that differs between the different stages to provide this capability. In the state machine ROM of the parser, there are three separate entirely different programs, one for each of the standards that are dealt with. Which program is executed depends upon a CODING STANDARD token. In otherwords, each of these three programs has within it the ability to handle both decoding and the CODING STANDARD
standard token. When each of these programs sees which coding standard, is to be decoded next, they literally jump to the start address in the microcode ROM for that particular program. This is how stages deal with multi-standardness.
Two things are affected by the different standards.
First, it affects what pattern of bits in the bitstream are recognized as a start-code or a marker code in order to reconfigure the shift register to detect the length of the start marker code. Second, there is a piece of information in the microcode that denotes what that start or marker code means. Recall that the coding of bits differs between the three standards. Accordingly, the microcode looks up in a table, specific to that compressor standard, something that is independent of the standard, i.e., a type of token that represents the incoming codes. This token is typically independent of the standard since in most cases, each of the various standards provide a certain code that will produce it.
The inverse quantizer 79 has a mathematical capability. The quantizer multiplies and adds, and has the ability to do all three compression standards which are configured by parameters. For example, a flag bit in the ROM
in control tells the inverse quantizer whether or not to add a constant, K. Another flag tells the inverse quantizer whether to add another constant. The inverse quantizer remembers in a register the CODING STANDARD token as it flows by the quantizer. When DATA tokens pass thereafter, the inverse quantizer remember5 what the standard i~ and it looks up the parameters that it needs to apply to the processing elements in order to perform a proper operation. For example, the inverse quantizer will look up whether K is set to 0, or whether it is set to 1 for a-particular compression standard, and will apply that to its processing circuitry.
In a similar sense the Huffman decoder 56 has a number of tables within it, some for JPEG, some for MPEG and some for H.261. The majority of those tables, in fact, will service more than one of those compression standards. Which tables are used depends on the syntax of the standard. The Huffman decoder works by receiving a command from the state machine which tells it which of the tables to use.
Accordingly, the Huffman decoder does not itself directly have a piece of state going into it, which is remembered and which says what coding it is performing. Rather, it is the combination of the parser state machine and Huffman decoder together that contain information within them.
Regarding the Spatial Decoder of the present invention, the address generation is modified and is similar to that shown in Figure 10, in that a number of pieces of information are decoded from tokens, such as the coding standard. The coding standard and additional information as well, is recorded in the registers and that affects the progress of the address generator state machine as it steps through and counts the macroblocks in the system, one after the other. The last stage would be the prediction filter 179 (Figure 17) which operates in one of two modes, either H.261 or MPEG and are easily identified.

~ 2145221 7. MULTI-8TANDaRD CODING
The system of the present invention also provides a combination of the standard-independent indices generation circuits, which are strategically placed throughout the system in combination with the token decode circuits. For example, the system is employed for specifically decoding either the H.261 video standard, or the MPEG video standard or the JPEG video standard. These three compression coding standards specify similar processes to be done on the arriving data, but the structure of the datastreams is different. As previously discussed, it is one of the functions of the start Code Detector to detect MPEG start-codes, H.261 start-codes, and JPEG marker codes, and convert them all into a form, i.e., a control token which includes a token stream embodying the current coding standard. The control tokens are passed through the pipeline processor, and are used, i.e., decoded, in the state machines to which they are relevant, and are passed through other state machines to which the tokens are not relevant. In this regard, the DATA
Tokens are treated in the same fashion, insofar as they are processed only in the state machines that are configurable by the control tokens into processing such DATA Tokens. In the remaining state machines, they pass through unchanged.
More specifically, a control token in accordance with the present invention, can consist of more than one word in the token. In that case, a bit known as the extension bit is set specifying the use of additional words in the token for carrying additional information. Certain of these additional control bits contain indices indicating information for use in corresponding state machines to create a set of standard-independent indices signals. The remaining portions of the token are used to indicate and identify the internal processing control function which is standard for all of the datastreams passing through the pipeline processor. In one 21~5221 form of the invention, the token extension is used to carry the current coding standard which is decoded by the relative token decode circuits distributed throughout the machine, and is used to reconfigure the action identification circuit 39 of stages throughout the machine wherever it is appropriate to operate under a new coding standard. Additionally, the token decode circuit can indicate whether a control token is related to one of the selected standards which the circuit was designed to handle.
More specifically, an MPEG start code and a JPEG marker are followed by an 8 bit value. The H.261 start code is followed by a 4 bit value. In this context, the Start Code Detector 51, by detecting either an MPEG start-code or a JPEG
marker, indicates that the following 8 bits contain the value associated with the start-code. Independently, it can then create a signal which indicates that it is either an MPEG
start code or a JPEG marker and not an H.261 start code. In this first instance, the 8 bit value is entered into a decode circuit, part of which creates a signal indicating the index and flag which is used within the current circuit for handling the tokens passing through the circuit. This is also used to insert portions of the control token which will be looked at thereafter to determine which standard is being handled. In this sense, the control token contains a portion indicating that it is related to an MPEG standard, as well as a portion which indicates what type of operation should be performed on the accompanying data. As previously discussed, this information is utilized in the system to reconfigure the processing stage used to perform the function required by the various standards created for that purpose.
For example, with reference to the H.261 start code, it is associated with a 4 bit value which follows immediately after the start code. The Start Code Detector passes this value into the token generator state machine. The value is applied to an 8 bit decoder which produces a 3 bit start number. The start number is employed to identify the picture-start of a picture number as indicated by the value.
The system also includes a multi-stage parallel processing pipeline operating under the principles of the two-wire interface previously described. Each of the stages comprises a machine generally taking the form illustrated in Figure 10. The token decode circuit 33 is employed to direct the token presently entering the state machine into the action identification circuit 39 or the processing unit 36, as appropriate. The processing unit has been previously reconfigured by the next previous control token into the form needed for handling the current coding standard, which is now entering the processing stage and carried by the next DATA
token. Further, in accordance with this aspect of the invention, the succeeding state machines in the processing pipeline can be functioning under one coding standard, i.e., H.261, while a previous stage can be operating under a separate standard, such as MPEG. The same two-wire interface is used for carrying both the control tokens and the DATA
Tokens.
The system of the present invention also utilizes control tokens required to decode a number of coding standards with a fixed number of reconfigurable processing stages. More specifically, the PICTURE_END control token is employed because it is important to have an indication of when a picture actually ends. Accordingly, in designing a multi-standard machine, it is necessary to create additional control tokens within the multi-standard pipeline processing machine which will then indicate which one of the standard decoding techniques to use. Such a control token is the PICTURE_END token. This PICTURE_END token is used to indicate that the current picture has finished, to force the buffers to be flushed, and to push the current picture 2~45221 through the decoder to the display.

8. ~nLTI-STANDaRD ~O~-~SSINa CIRC~I~ - 8ECOND
MOD~ OF OP~RATION
A compresæion standard-dependent circuit, in the form of S the previously described Start Code Detector, is suitably interconnected to a compression standard-independent circuit over an appropriate bus. The standard-dependent circuit is connected to a combination dependent-independent circuit over the same bus and an additional bus. The standard-independent circuit applies additional input to the standard dependent-independent circuit, while the latter provides information back to the standard-independent circuit. Information from the standard-independent circuit is applied to the output over another suitable bus. Table 600 illustrates that the multiple standards applied as the input to the standard-dependent Start Code Detector 51 include certain bit streams which have standard-dependent meanings within each encoded bit stream.

9. ~TART-CODE D~ .OR
As previously indicated the Start Code Detector, in accordance with the present invention, is capable of taking MPEG, JPEG and H.261 bit streams and generating from them a sequence of proprietary tokens which are meaningful to the rest of the decoder. As an example of how multi-standard decoding is achieved, the MPEG (1 and 2) picture_start_code, the H.261 picture_start code and the JPEG start_of_scan (SOS) marker are treated as equivalent by the Start Code Detector, and all will generate an internal PICTURE_START token. In a similar way, the MPEG sequence_start_code and the JPEG SOI
(start_of_image) marker both generate a machine sequence_start_token. The H.261 standard, however, has no equivalent start code. Accordingly, the Start Code Detector, 114 - `

in r~sp~onse to the first H.261 picture_start code, will generate a sequence start token.
None of the above described images are directly used other than in the SCD. Rather, a machine PICTURE START
token, for example, has been deemed to be equivalent to the PICTURE START images contained in the bit stream.
Furthermore, it must be borne in mind that the machine PICTURE START by itself, is not a direct image of the PICTURE START in the standard. Rather, it is a control token which is used in combination with other control tokens to provide standard-independent decoding which emulates the operation of the images in each of the compression coding standards. The combination of control tokens in combination with the reconfiguration of circuits, in accordance with the information carried by control tokens, is unique in and of itself, as well as in further combination with indices andtor flags gene~ated by the token decode circuit portion of a respective state machine. A typical reconfigurable state machine will be described subsequently.
Referring again to Table 600, there are shown the names of a group of standard images in the left column. In the right column there are shown the machine dependent control tokens used in the emulation of the standard encoded signal which is present or not used in the standard image.
2~ With reference to Table 600, it can be seen that a machine sequence start signal is generated by the Start Code Detector, as previously described, when it decodes any one of the standard signals indicated in Table 600. The Start Code Detector creates sequence start, group start, sequence end, ~0 slice start, user-data, extra-data and PICTURE START tokens for application to the two-wire interface which is used throughout the system. Each of the stages which operate in conjunction with these control tokens are configured by the contents of the tokens, or are configured by indices crea'e~

2145~21 by co~te~nts of the tokens, and are prepared to handle data which is expected to be received when the picture DATA Token arrives at that station.
As previously described, one of the compression standards, such as H.261, does not have a sequence start image in its data stream, nor does it have a PICTURE END
image in its data stream. The Start Code Detector indicates the PICTURE END point in the incoming bit stream and creates a PICTURE END token. In this regard, the system of the present invention is intended to carry data words that are fully packed to contain a bit of information in each of the register positions selected for use in the practice of the present invention. To this end, 15 bits have been selected as the number of bits which are passed between two start codes. Of course, it will be appreciated by one of ordinary skill in the art, that a selection can be made to include either greater or fewer than 15 bits. In other words, all 15 bits of a data word being passed from the Start Code Detector into the DRAM interface are required for proper operation.
Accordingly, the Start Code Detector creates extra bits, called padding, which it inserts into the last word of a DATA
Token. For purposes of illustration 15 data bits has been selected.
To perform the Padding operation, in accordance with the present invention, binary O followed by a number of binary l's are automatically inserted to complete the 15 bit data word. This data is then passed through the coded data buffer and presented to the Huffman decoder, which removes the padding. Thus, an arbitrary number of bits can be passed through a buffer of fixed size and width.
In one embodiment, a slice start control token is used to identify a slice of the picture. A slice start control token is employed to segment the picture into smaller regions. The size of the region is chosen by the encoder ~- ` 2145221 and t~e $tart Code Detector identifies this unique pattern of the slice_start code in order for the machine-dependent state stages, located downstream from the Start Code Detector, to segment the picture being received into smaller regions. The size of the region is chosen by the encoder, recognized by the Start Code Detector and used by the recombination circuitry and control tokens to decompress the encoded picture. The slice start codes are principally used for error recovery.
The start codes provide a unique method of starting up the decoder, and this will subsequently be described in further detail. There are a number of advantages in placing the Start Code Detector before the coded data buffer, as opposed to placing the Start Code Detector after the coded data buffer and before the Huffman decoder and video demultiplexor. Locating the Start Code Detector before the first buffer allows it to 1) assemble the tokens, 2) decode the standard control signals, such as start codes, 3) pad the bitstream before the data goes into the buffer, and 4) create the proper sequence of control tokens to empty the buffers, pushing the available data from the buffers into the Huffman Decoder.
Most of the control token output by the Start Code . Detector directly reflect syntactic elements of the various picture and video coding standards. The Start Code Detector converts the syntactic elements into control tokens. In -addition to these natural tokens, some unique and/or machine-dependent tokens are generated. The unique tokens include - those tokens which have been specifically designed for use -~ith the system of the present invention which are unique in and of themselves, and are employed for aiding in the multi-standard nature of the present invention. Examples of such unique tokens include PICTURE END and CODING STANDARD.
Tokens are also introduced to remove some of the synta~i~ differences between the coding standards and to function in co-operation with the error conditions. The automatic token generation is done after the serial analysis of the standard-dependent data. Therefore, the Spatial Decoder responds equally to tokens that have been supplied directly to the input of the Spatial Decoder, i.e. the SCD, as well as to tokens that have been generated following the detection of the start-codes in the coded data. A sequence of extra tokens is inserted into the two- wire interface in order to control the multi-standard nature of the present invention.
The MPEG and H.261 coded video streams contain standard dependent, non-data, identifiable bit patterns, one of which is hereinafter called a start image and/or standard-dependent code. A similar function is served in JPEG, by marker codes.
These start/marker codes identify significant parts of the syntax of the coded datastream. The analysis of start/marker codes performed by the Start Code Detector is the first stage in parsing the coded data.
The start/marker code patterns are designed so that they can be identified without decoding the entire bit stream.
Thus, they can be used, in accordance with the present invention, to assist with error recovery and decoder start-up. The Start Code Detector provides facilities to detect errors in the coded data construction and to assist the start-up of the decoder. The error detection capability of the Start Code Detector will subsequently be discussed in further detail, as will the process of starting up of the decoder.
The aforementioned description has been concerned primarilty with the characteristics of the machine-dependent bit stream and its relationship with the addressing characteristics of the present invention. The followins descr,ption is of the bit stream characteristics of the ~ - 2145221 -stand~rd-dependent coded data with reference to the Start Code Detector.
Each of the standard compression encoding systems employs a unique start code configuration or image which has been selected to identify that particular compression specification. Each of the start codes also carries with it a start code value. The start code value is employed to identify within the language of the standard the type of operation that the start code is associated with. In the multi-standard decoder of the present invention, the compatibility is based upon the control token and DATA token configuration as previously described. Index signals, including flag signals, are circuit-generated within each state machine, and are described hereinafter as appropriate.
The start and/or marker codes contained in the standards, as well as other standàrd words as opposed to data words, are sometimes identified as images to avoid confusion with the use of code and/or machine-dependent codes to refer to the contents of control and/or DATA tokens used in the machine. Also, the term start code is often used as a generic term to refer to JPEG marker codes as well as MPEG
and H.261 start codes. Marker codes and start codes serve the same purpose. Also, the term "flush" is used both to refer to the FLUSH token, and as a verb, for example when referring to flushing the Start Code Detector shift registers (including the signal "flushed"). To avoid confusion, the FLUSH token is always written in upper case. All other uses of the term (verb or noun) are in lower case.
The standard-dependent coded input picture input stream ~0 comprises data and start images of varying lengths. The start images carry with them a value telling the user what operation is to be performed on the data which immediately follows according to the standard. However, in the multi-standard pipeline processing system of the present invention, - 2~45221 where compatibility is reguired for multiple standards, the system has been optimized for handling all functions in all stAn~Ards. Accordingly, in many situations, unique start control tokens mu~t be created which are compatible not only with the values contained in the values of the encoded signal standard image, but which are also capable of controlling the various stages to emulate the operation of the standard as represented by specified parameters for each standard which are well known in the art. All such ~tA~A~rds are incorporated by reference into this specification.
It is important to understand the relationship between tokens which, alone or in combination with other control tokens, emulate the nondata information contained in the standard bit stream. A separate set of index signals, including flag signals, are generated by each state machine to handle some of the processing within that state machine.
Values carried in the standards can be used to access machine dependent control signals to emulate the handling of the standard data and non-data signals. For example, the slice_start token is a two word token, and it is then entered onto the two wire interface as previously described.
The data input to the system of the present invention may be a data source from any suitable data source such as disk, tape, etc., the data source providing 8 bit data to the first functional stage in the Spatial Decoder, the Start Code Detector 51 (Figure 11). The Start Code Detector includes three shift registers; the first shift register is 8 bits wide, the next is 24 bits wide, and the next is 15 bits wide.
Each of the registers is part of the two-wire interface. The data from the data source is loaded into the first register as a single 8 bit byte during one timing cycle. Thereafter, the contents of the first shift register is shifted one bit at a time into the decode (second) shift register. After 24 cycles, the 24 bit register is full.

Every 8 cycles, the 8 bit byte~ are lo~ded into the first shift register. Each byte is loaded into the value shift register 221 (Figure 20), and 8 additional cycles are used to empty it and load the shift regi~ter 231. Eight cycles are used to empty it, so after three of those operations or 24 cycles, there are still three bytes in the 24 bit register. The value decode shift register 230 is still empty.
Assuming that there is now a PIeTURE_START word in the 24 bit shift register, the detect cycle recognizes the PICTURE START code pattern and provides a start signal as its output. Once the detector has detected a start, the byte following it is the value associated with that start code, and this is currently sitting in the value register 221.
Since the contents of the detect shift register has been identified as a start code, its contents must be removed from the two wire interface to ensure that no further processing takes place using these 3 bytes. The decode register is emptied, and the value decode shift register 230 waits for the value to be shifted all the way over to such register.
The contents now of the low order bit positions of the value decode shift register contains a value associated with the PICTURE_START. The Spatial Decoder equivalent to the standard PICTURE_START signal is referred to as the SD
PICTURE_START signal. The SD PICTURE_START signal itself is going to now be contained in the token header, and the value is going to be contained in the extension word to the token header.

10. TO~EN8 In the practice of the present invention, a token is a universal adaptation unit in the form of an interactive interfacing messenger package for control and/or data functions and is adapted for use with a reconfigurable 5 ~ ~ /

proce~si~g stage (RPS) which is a stage, which in response to a recognized token, reconfigures itself to perform various operations.
Tokens may be either position dependent or position independent upon the processing stages for performance of various functions. Tokens may also be metamorphic in that they can be altered by a processing stage and then passed down the pipeline for performance of further functions.
Tokens may interact with all or less than all of the stages and in this regard may interact with adjacent and/or non-adjacent stages. Tokens may be position dependent for some functions and position independent for other functions, and the specific interaction with a stage may be conditioned by the previous processing history of a stage.
A PICTURE_END token is a way of signalling the end of a picture in a multi-standard decoder.
A multi-standard token is a way of mapping MPEG, JPEG
and H.261 data streams onto a single decoder using a mixture of standard dependent and standard independent hardware and control tokens.
A SEARCH MODE token is a technique for searching MPEG, JPEG and H.261 data streams which allows random access and enhanced error recovery.
A STOP AFTER PICTURE token is a method of achieving a 2~ clear end to decoding which signals the end of a picture and clears the decoder pipeline, i.e., channel change.
Furthermore, padding a token is a way of passing an arbitrary number of bits through a fixed size, fixed width buffer.
~0 The present invention is directed to a pipeline processing system which has a variable configuration which uses tokens and a two-wire system. The use of control tokens and DATA Tokens in combination with a two-wire syste~
facilitates a multi-standard system capable of having 21 ~5221 exten~e~ operating capabilities as compared with those systems which do not use control tokens.
The control tokens are generated by circuitry within the decoder processor and emulate the operation of a number of different type standard-dependent signals passing into the serial pipeline processor for handling. The technique used is to study all the parameters of the multi-standards that are selected for processing by the serial processor and noting 1) their similarities, 2) their dissimilarities, 3) their needs and requirements and 4) selecting the correct token function to effectively process all of the standard signals sent into the serial processor. The functions of the tokens are to emulate the standards. A control token function is used partially as an emulation/translation between the standard dependent signals and as an element to transmit control information through the pipeline processor.
In prior art system, a dedicated machine is designed according to well-known techniques to identify the standard and then set up dedicated circuitry by way of microprocessor interfaces. Signals from the microprocessor are used to control the flow of data through the dedicated downstream components. The selection, timing and organization of this decompression function is under the control of fixed logic circuitry as assisted by signals coming from the microprocessor.
In contrast, the system of the present invention configures the downstream functional stages under the control of the control tokens. An option is provided for obtaining needed and/or alternative control from the MPU.
The tokens provide and make a sensible format for communicating information through the decompression circuit pipeline processor. In the design selected hereinafter and used in the preferred embodiment, each word of a token is a mini~,u~ of 8 bits ~ide, and a single token can extend _ver ~ 2145221 -one or more words. The width of the token is changeable and can be selected as any number of bits. An extension bit indicates whether a token is extended beyond the current word, i.e., if it is set to binary one in all words of a token, except the last word of a token. If the first word of a token has an extension bit of zero, this indicates that the token is only one word long.
Each token is identified by an address field that starts at bit 7 of the first word of the token. The address field is variable in length and can potentially extend over multiple words. In a preferred embodiment, the address is no longer than 8 bits long. However, this is not a limitation on the invention, but on the magnitude of the processing steps elected to be accomplished by use of these tokens. It is to be noted under the extension bit identification label that the extension bit in words 1 and 2 is a 1, signifying that additional words will be coming thereafter. The extension bit in word 3 is a zero, therefore indicating the end of that token.
The token is also capable of variable bit length. For example, there are 9 bits in the token word plus the extension bit for a total of 10 bits. In the design of the present invention, output buses are of variable width. The output from the Spatial Decoder is 9 bits wide, or 10 bits 2~ wide when the extension bit is included. In a preferred embodiment, the only token that takes advantage of these extra bits is the DATA token; all other tokens ignore this extra bit. It should be understood that this is not a limitation, but only an implementation.
'O Through the use of the DATA token and control token configuration, it is possible to vary the length of the data being carried by these DATA tokens in the sense of the number of bits in one word. For example, it has been discussed that data bits in word of a DATA Token can be combined with the ~g,, ` .

data ~its in another word of the same DATA token to form an 11 bit or 10 bit address for use in accessing the random access memories used throughout this serial decompression processor. This provides an additional degree of variability that facilitates a broad range of versatility.
As previously described, the DATA token carries data from one processing stage to the next. Consequently, the characteristics of this token change as it passes through the decoder. For example, at the input to the Spatial Decoder, DATA Tokens carry bit serial coded video data pac~ed into 8 bit words. Here, there is no limit to the length of each token. However, to illustrate the versatility of this aspect of the invention (at the output of the Spatial Decoder circuit), each DATA Token carries exactly 64 words and each word is 9 bits wide. More specifically, the standard encoding signal allows for different length messages to encode different intensities and details of pictures. The first picture of a group normally carries the longest number of data bits because it needs to provide the most information to the processing unit so that it can start the decompression with as much information as possible. Words which follow later are typically shorter in length because they contain the difference signals comparing the first word with reference to the second position on the scan information field.
The words are interspersed with each other, as required by the standard encoding system, so that variable amounts of data are provided into the input of the Spatial Decoder.
However, after the Spatial Decoder has functioned, the information is provided at its output at a picture format rate suitable for display on a screen. The output rate in terms of time of the spatial decoder may vary in order tO
interface with various display systems throughout the world, such as NTSC, PAL and SECAM. The video formatter converts ~_ 2145221 this vari~ble picture rate to a constant picture rate suitable for display. However, the picture data is still carried by DATA tokens consi~ting of 64 words.

1~. DRAh I~TERFAC~
A single high performance, configurable DRAM interface is used on each of the 3 decoder chips. In general, the DRAM
interface on each chip is substantially the same; however, the interfaces differ from one to another in how they handle channel priorities. This interface is designed to directly drive the external DRAMs used by the Spatial Decoder, the Temporal Decoder and the Video Formatter. Typically, no external logic, buffers or components will be required to connect the DRAM interface to the DRAMs in those systems.
In accordance with the present invention, the interface is configurable in two ways:
1. The detailed timing of the interface can be configured to accommodate a variety of different DRAM types.
2. The width of the data interface to the DRAM can be configured to provide a cost/performance trade off for different applications.
In general, the DRAM interface is a standard-independent block implemented on each of the three chips in the system.
Again, these are the Spatial Decoder, Temporal Decoder and video formatter. Referring again to Figures 11, 12 and 13, these figures show block diagrams that depict the relationship between the DRAM interface, and the remaining blocks of the Spatial Decoder, Temporal Decoder and video formatter, respectively. On each chip, the DRAM interface connects the chip to an external DRAM. External DRAM is used because, at present, it is not practical to fabricate on chip the relatively large amount of DRAM needed. Note: each chip has its own external DRAM and its own DRAM interface.

.

Furthermore, while the DRAM interface is compression standard-independent, it still must be configured to implement each of the multiple standards, H.261, JPEG and MPEG. How the DRAM interface is reconfigured for multi-standard operation will be subsequently further describedherein.
Accordingly, to understand the operation of the DRAM
interface requires an understanding of the relationship between the DRAM interface and the address generator, and how the two communicate using the two wire interface.
In general, as its name implies, the address generator generates the addresses the DRAM interface needs in order to address the DRAM (e.g., to read from or to write to a particular address in DRAM). With a two-wire interface, reading and writing only occurs when the DRAM interface has both data (from preceding stages in the pipeline), and a valid address (from address generator). The use of a separate address generator simplifies the construction of both the address generator and the DRAM interface, as discussed further below.
In the present invention, the DRAM interface can operate from a clock which is asynchronous to both the address generator and to the clocks of the stages through which data is passed. Special techniques have been used to handle this asynchronous nature of the operation.
Data is typically transferred between the DRAM interface and the rest of the chip in blocks of 64 bytes (the only exception being prediction data in the Temporal Decoder).
~ransfers take place by means of a device known as a "swing buffer~. This is essentially a pair of RAMs operated in a double-buffered configuration, with the DRAM interface f illing or emptying one RAM while another part of the chip empties or fills the other RAM. A separate bus which carries an address from an address generator is associated with eacn swing buffer.
In the present invention, each of the chips has four swing buffers, but the function of these swing buffers is different in each case. In the spatial decoder, one swing buffer is used to transfer coded data to the DRAM, another to read coded data from the DRAM, the third to transfer tokenized data to the DRAM and the fourth to read tokenized data from the DRAM. In the Temporal Decoder, however, one swing buffer is used to write intra or predicted picture data to the DRAM, the second to read intra or predicted data from the DRAM and the other two are used to read forward and backward prediction data. In the video formatter, one swing buffer is used to transfer data to the DRAM and the other three sre used to read data from the DRAM, one for each of luminance (Y) and the red and blue color difference data (Cr and Cb, respectively).
The following section describes the operation of a hypothetical DRAM interface which has one write swing buffer and one read swing buffer. Essentially, this is the same as the operation of the Spatial Decoder's DRAM interface. The operation is illustrated in Figure 23.
Figure 23 illustrates that the control interfaces between the address generator 301, the DRAM interface 302, and the remaining stages of the chip which pass data are all two wire interfaces. The address generator 301 may either generate addresses as the result of receiving control tokens, or it may merely generate a fixed sequence of addresses (e.g., for the FIFO buffers of the Spatial Decoder). The DRAM interface treats the two wire interfaces associated with the address generator 301 in a special way. Instead of keeping the accept line high when it is ready to receive an address, it waits for the address generator to supply a valid address, processes that address and then sets the accept line high for one clock period. Thus, it implements a 21~5221 request/acknowledge (REQ/ACK) protocol.
A unique feature of the DRAM interface 302 is its ability to communicate independently with the address generator 301 and with the stages that provide or accept the data. For example, the address generator may generate an address associated with the data in the write swing buffer (Figure 24), but no action will be taken until the write swing buffer signals that there is a block of data ready to be written to the external DRAM. Similarly, the write swing buffer may contain a block of data which is ready to be written to the external DRAM, but no action is taken until an address is supplied on the appropriate bus from the address generator 301. Further, once one of the RAMs in the write swing buffer has been filled with data, the other may be completely filled and "swung" to the DRAM interface side before the data input is stalled (the two-wire interface accept signal set low).
In understanding the operation of the DRAM interface 302 of the present invention, it is important to note that in a properly configured system, the DRAM interface will be able to transfer data between the swing buffers and the external DRAM 303 at least as fast as the sum of all the average data rates between the swing buffers and the rest of the chip.
Each DRAM interface 302 determines which swing buffer it will service next. In general, this will either be a "round robin" (i.e., the next serviced swing buffer is the next available swing buffer which has least recently had a turn), or a priority encoder, (i.e., in which some swing buffers have a higher priority than others). In both cases, an additional request will come from a refresh request generator which has a higher priority than all the other requests. The refresh request is generated from a refresh counter which can be programmed via the microprocessor interface.
Referring now to Figure 24, there is shown a block diagram of a write swing buffer. The write swing buffer interface includes two blocks of RAM, RAMl 311 and RAM2 312.
As discussed further herein, data is written into RAMl 311 and RAM2 312 from the previous stage, under the control of S the write address 313 and control 314. From RAMl 311 and RAM2 312, the data is written into DRAM 515. When writing data into DRAM 315, the DRAM row address is provided by the address generator, and the column address is provided by the write address and control, as described further herein. In operation, valid data is presented at the input 316 (data in). Typically, the data is received from the previous stage. As each piece of data is accepted by the DRAM
interface, it is written into RAMl 311 and the write address control increments the RAMl address to allow the next piece of data to be written into RAM1. Data continues to be written into RAM1 311 until either there is no more data, or RAMl is full. When RAM1 311 is full, the input side gives up control and sends a signal to the read side to indicate that RAMl is now ready to be read. This signal passes between two 20 asynchronous clock regimes and, therefore, passes through three synchronizing flip flops.
Provided RAM2 312 is empty, the next item of data to arrive on the input side is written into RAM2. Otherwise, this occurs when RAM2 312 has emptied. When the round robin 2 5 or priority encoder (depending on which is used by the particular chip) indicates that it is now the turn of this swing buffer to be read, the DRAM interface reads the contents of RAMl 311 and writes them to the external DRAM
315. A signal is then sent back across the asynchronous interface, to indicate that RAM1 311 is now ready to be filled again.
If the DRAM interface empties RAMl 311 and "swings" it before the input side has filled RAM2 312, then data can be `

accep~ed by the swing buffer continually. Otherwise, when RAM2 is filled, the swing buffer will set its accept single low until RAMl has been "swung" back for use by the input side.
The operation of a read swing buffer, in accordance with the present invention, is similar, but with the input and output data busses reversed.
The D~AM interface of the present invention is designed to maximize the available memory bandwidth. Each 8x8 block of data is stored in the same DRAM page. In this way, full use can be made of DRAM fast page access modes, where one row address is- supplied followed by many column addresses. In particular, row addresses are supplied by the address generator, while column addresses are supplied by the DRAM
interface, as discussed further below.
In addition, the facility is provided to allow the data bus to the external DRAM to be 8, 16 or 32 bits wide.
Accordingly, the amount of DRAM used can be matched to the size and bandwidth requirements of the particular application.
In this example (which is exactly how the DRAM interface on the Spatial Decoder works) the address generator provides the DRAM interface with block addresses for each of the read and write swing buffers. This address is used as the row address for the DRAM. The six bits of column address are supplied by the DRAM interface itself, and these bits are also used as the address for the swing buffer RAM. The data bus to the swing buffers is 32 bits wide. Hence, if the bus width to the external DRAM is less than 32 bits, two or four external DRAM accesses must be made before the next word is read from a write swing buffer or the next word is written to a read swing buffer (read and write refer to the direction of transfer relative to the external DRAM).
The situation is more complex in the case of the 214~221 Temporal D- -A~ and the Video Formatter. The Temporal D~ er' 8 addressing i8 more complex because of its predictive aspects as discussed further in this section. The video formatter's addressing is more complex because of S multiple video output st~ rd aspects, as discussed further in the sections relating to the video formatter.
As mentioned previously, the Temporal Decoder has four swing buffers: two are used to read and write decoded intra and predicted (I and P) picture data. These operate as described above. The other two are used to receive prediction data. These buffers are more interesting.
In general, prediction data will be offset from the position of the block being processed as specified in the motion vectors in x and y. Thus, the block of data to be retrieved will not generally correspond to the block boundaries of the data as it was encoded (and written into the DRAM). This is illustrated in Figure 25, where the shaded area represents the block that is being formed whereas the dotted outline represents the block from which it is being predicted. The address generator converts the address specified by the motion vectors to a block offset (a whole number of blocks), as shown by the big arrow, and a pixel offset, as shown by the little arrow.
In the address generator, the frame pointer, base block address and vector offset are added to form the address of the block to be retrieved from the DRAM. If the pixel offset is zero, only one request is generated. If there is an offset in either the x or y dimension then two requests are generated, i.e., the original block address and the one immediately below. With an offset in both x and y, four requests are generated. For each block which is to be retrieved, the address generator calculates start and stop addresses which is best illustrated by an example.
Consider a pixel offset of (1,1), as illustrated by the shaded area in Figure 26. The address generator makes four requests, labelled A through D in the Figure. The problem to be solved is how to provide the required sequence of row addresses quickly. The solution is to use "start/stop"
technology, and this is described below.
Consider block A in Figure 26. Reading must start at position (1,1) and end at position (7,73. Assume for the moment that one byte is being read at a time (i.e., an 8 bit DRAM interface). The x value in the co-ordinate pair forms the three LSBs of the address, the y value the three MSB.
The x and y start values are both 1, providing the address, 9. Data is read from this address and the x value is incremented. The process is repeated until the x value reaches its stop value, at which point, the y value is incremented by 1 and the x start value is reloaded, giving an address of 17. As each byte of data is read, the x value is again incremented until it reaches its stop value. The process is repeated until both x and y values have reached their stop values. Thus, the address sequence of 9, 10, 11, 12, 13, 14, 15, 17... , 23, 25, ... ,31, 33,... ,... ,57,... ,63 is generated.
In a similar manner, the start and stop co-ordinates for block B are: (1,0) and (7,0), for block C: (0,1) and (0,7), and for block D: (0,0) and (0,0).
The next issue is where this data should be written.
Clearly, looking at block A, the data read from address 9 should be written to address 0 in the swing buffer, while the data from address 10 should be written to address 1 in the swing buffer, and so on. Similarly, the data read from address 8 in block B should be written to address 15 in the swing buffer and the data from address 16 should be written to address 15 in the swing buffer. This function turns out to have a very simple implementation, as outlined below.
Consider block A. At the start of reading, the swing Z1452~1 buffer address regiRter is loaded with the inverse of the stop value. The y inverse stop value forms the 3 MSBs and the x inverse stop value forms the 3 LSB. In this case, while the DRAM interface is reading address 9 in the external DRAM, the swing buffer address is zero. The swing buffer address register is then incremented as the external DRAM
address register is incremented, as consistent with proper prediction addressing.
The discussion so far has centered on an 8 bit DRAM
interface. In the case of a 16 or 32 bit interface, a few minor modifications must be made. First, the pixel offset vector must be "clipped" so that it points to a 16 or 32 bit boundary. In the example we have been using, for block A, the first DRAM read will point to address o, and data in addresses 0 through 3 will be read. Second, the unwanted data must be discarded. This is performed by writing all the data into the swing buffer (which must now be physically larger than was necessary in the 8 bit case) and reading with an offset. When performing MPEG half-pel interpolation, 9 bytes in x and/or y must be read from the DRAM interface. In this case, the address generator provides the appropriate start and stop addresses. Some additional logic in the DRAM
interface is used, but there is no fundamental change in the way the DRAM interface operates.
The final point to note about the Temporal Decoder DRAM
interface of the present invention, is that additional information must be provided to the prediction filters to indicate what processing is required on the data. This consists of the following:
a "last byte" signal indicating the last byte of a transfer (of 64,72 or 81 bytes);
an H.261 flag;
a bidirectional prediction flag;
two bits to indicate the block~s dimensions (8 or 9 bytes ~` 21~5221 in x and y); and a two bit number to indicate the order of the blocks.
The last byte flag can be generated as the data is read out of the swing buffer. The other signals are derived from the address generator and are piped through the DRAM
interface so that they are associated with the correct block of data as it is read out of the swing buffer by the prediction filter block.
In the Video Formatter, data is written into the external DRAM in blocks, but is read out in raster order.
Writing is exactly the same as already described for the Spatial Decoder, but reading is a little more complex.
The data in the Video Formatter, external DRAM is organized so that at least 8 blocks of data fit into a single page. These 8 blocks are 8 consecutive horizontal blocks.
When rasterizing, 8 bytes need to be read out of each of 8 consecutive blocks and written into the swing buffer (i.e., the same row in each of the 8 blocks).
Considering the top row (and assuming a byte-wide interface), the x address (the three LSBS) is set to zero, as is the y address (3 MSBS). The x address is then incremented as each of the first 8 bytes are read out. At this point, the top part of the address (bit 6 and above - LSB = bit 0) is incremented and the x address (3 LSBS) is reset to zero.
This process is repeated until 64 bytes have been read. With a 16 or 32 bit wide interface to the external DRAM the x address is merely incremented by two or four, respectively, instead of by one.
In the present invention, the address generator can 30 signal to the DRAM interface that less than 64 bytes should be read (this may be required at the beginning or end of a raster line), although a multiple of 8 bytes is always read.
This is achieved by using start and stop values. The start value is used for the top part of the address (bit 6 a~d 21~5221 above), and the stop value is comp~red with the start value to generate the signal which indicates when reading should stop.
The DRAM interface timing block in the present invention uses timing chains to place the edges of the DRAM signals to a precision of a guarter of the system clock period. Two guadrature clocks from the phase locked loop are used. These are combined to form a notional 2x clock. Any one chain is then made from two shift registers in parallel, on opposite phases of the 2x clock.
First of all, there is one chain for the page start cycle and another for the read/write/refresh cycles. The length of each cycle is programmable via the microprocessor interface, after which the page start chain has a fixed length, and the cycle chain's length changes as appropriate during a page start.
On reset, the chains are cleared and a pulse is created.
The pulse travels along the chains and is directed by the state information from the DRAM interface. The pulse generates the DRAM interface clock. Each DRAM interface clock period corresponds to one cycle of the DRAM, consequently, as the DRAM cycles have different lengths, the DRAM interface clock is not at a constant rate.
Moreover, additional timing chains combine the pulse from the above chains with the information from the DRAM
interface to generate the output strobes and enables such as notcas, notras, notwe, notbe.

12. PREDICTION FILTFR8 Referring again to Figures 12, 17, 18, and more particularly to Figure 12, there is shown a block diagram of the Temporal Decoder. This includes the prediction filter.
The relationship between the prediction filter and the rest of the elements of the temporal decoder is shown in greater detail in Figure 17. The essence of the structure of the prediction filter is shown in Figures 18 and 28. A detailed description of the operation of the prediction filter can be found in the section, "More Detailed Description of the Invention. n In general, the prediction filter in accordance with the present invention, is used in the MPEG and H.261 modes, but not in the JPEG mode. Recall that in the JPEG mode, the Temporal Decoder just passes the data through to the Video Formatter, without performing any substantive decoding beyond that accomplished by the Spatial Decoder. Referring again to Figure 18, in the MPEG mode the forward and backward prediction filters are identical and they filter the respective MPEG forward and backward prediction blocks. In the H.261 mode, however, only the forward prediction filter is used, since H.261 does not use backward prediction.
Each of the two prediction filters of the present invention is substantially the same. Referring again to Figures 18 and 28 and more particularly to Figure 28, there is shown a block diagram of the structure of a prediction filter. Each prediction filter consists of four stages in series. Data enters the format stage 331 and is placed in a format that can be readily filtered. In the next stage 332 an I-D prediction is performed on the X-coordinate. After the necessary transposition is performed by a dimension buffer stage 333, an I-D prediction is performed on the Y-coordinate in stage 334. How the stage perform the filtering is further described in greater detail subsequently. Which filtering operations are required, are defined by the compression standard. In the case of H.261, the actual filtering performed is similar to that of a low pass filter.
Referring again to Figure 17, multi-standard operation requires that the prediction filters be reconfigurable to perform either MPEG or H.261 filtering, or ~1~5221 to perform no filtering at all in JPEG mode. A~ with many other reconfigurable aspects of the three chip system, the prediction filter is reconfigured by means of tokens. Tokens are also used to inform the address generator of the particular mode of operation. In this way, the address generator can supply the prediction filter with the addresses of the needed data, which varies significantly between MPEG
and JPEG.

13. ACCE88INC RFGI8TER8 Most registers in the microprocessor interface (MPI) can only be modified if the stage with which they are associated is stopped. Accordingly, groups of registers will typically be associated with an access register. The value zero in an access register indicates that the group of registers associated with that particular access register should not be modified. Writing 1 to an access register requests that a stage be stopped. The stage may not stop iD ediately, however, so the stages access register will hold the value, zero, until it is stopped.
Any user software associated with the MPI and used to perform functions by way of the MPI should wait "after writing a 1 to a request access register" until 1 is read from the access register. If a user writes a value to a configuration register while its access register is set to zero, the results are undefined.

1~. MICRO-PROCE880R INTERFACE
A standard byte wide micro-processor interface (MPI) is used on all circuits with in the Spatial Decoder and Temporal Decoder. The MPI operates asynchronously with various Spatial and Temporal Decoder clocks. Referring to Table A.6.1 of the subsequent further detailed description, there is shown the various MPI signals that are used on this interface. The character of the signal is shown on the input/output column, the signal name is shown on the signal name column and a description of the function of the signal is shown in the description column. The MPI
electrical specification are shown with reference to Table A.6.2. All the specifications are cla~sified according to type and there types are shown in the column entitled symbol. The description of what these symbols represent is shown in the parameter column. The actual specifications are shown in the respective columns min, max and units.
The DC operating conditions can be seen with reference to Table A.6.3. Here the column headings are the same as with reference to Table A.6.2. The DC electrical characteristics are shown with reference to Table A.6.4 and carry the same column headings as depicted in Tables A.6.2 and A.6.3.

15. MPI READ TIMING
The AC characteristics of the MPI read timing diagrams are shown with reference to Figure 54. Each line of the Figure is labelled with a corresponding signal name and the timing is given in nano-seconds. The full microprocessor interface read timing characteristics are shown with reference to Table A.6.5. The column entitled Number is used to indicate the signal corresponding to the name of that signal as set forth in the characteristic column. The columns identified by MIN and MAX provide the minimum length of time that the signal is present the maximum amount of time that this signal is available. The Units column gives the units of measurement used to describe the signals.

16. ~IPI llRITE TIMING
The general description of the MPI write timing diagrams are shown with reference to Figure 54. Thi~ Figure shows each individual signal name as associated with the MPI
write timing. The name, the characteristic of the signal, and other various physical characteristics are shown with reference to Table 6.6.

17. ~OLE ~n~E~ LOCATION8 In the present invention, certain less frequently accessed memory map locations have been placed behind keyhole registers. A keyhole register has two r~gisters associated with it. The first register is a keyhole address register and the second register is a keyhole data register. The keyhole address specifies a location within a extended address space. A read or a write operation to a keyhole data register accesses the locations specified by the keyhole address register. After accessing a keyhole data register, the associated keyhole address register increments. Random access within the extended address space is only possible by writing in a new value to the keyhole address register for each access. A circuit within the present invention may have more than one keyhole memory maps. Nonetheless, there is no interaction between the different keyholes.

18. PICTURE-END
Referring again to Figure 11, there is shown a general block diagram of the Spatial Decoder used in the present invention. It is through the use of this block diagram that the function of PICTURE_END will be described.
The PICTURE_END function has the multi-standard advantage of being able to handle H.261 encoded picture information, MPEG and JPEG signals.
As previously described, the system of Figure 11 is interconnected by the two wire interface previously described. Each of the functional blocks i8 arranged to operate according to the state machine configuration shown with reference to Figure 10.
In general, the PICTURE END function in accordance with S the invention begins at the Start Code Detector which generates a PICTURE_END control token. The PICTURE_END
control token is passed unaltered through the start-up control circuit to the DRAM interface. Here it is used to flush out the write swing buffers in the DRAM interface.
Recall, that the contents of a swing buffer are only written to RAM when the buffer is full. However, a picture may end at a point where the buffer is not full, therefore, causing the picture data to become stuck. The PICTURE_END
token forces the data out of the swing buffer.
lS Since the present invention is a multi-standard machine, the machine operates differently for each compression standard. More particularly, the machine is fully described as operating pursuant to machine-dependent action cycles. For each compression standard, a certain number of the total available action cycles can be selected by a combination of control tokens and/or output signals from the MPU or they can be selected by the design of the control tokens themselves. In this regard, the present invention is organized so as to delay the information from going into subsequent blocks until all of the information has been collected in an upstream block. The system waits until the data has been prepared for passing to the next stage. In this way, the PICTURE_END signal is applied to the coded data buffer, and the control portion of the PICTURE_END signal causes the contents of the data buffers to be read and applied to the Huffman decoder and video demultiplexor circuit.
Another advantage of the PICTURE_END control token is to identify, for the use by the Huffman decoder --` 21~5221 demulti~lexor, the end of picture even though it has not had the typically expected full range and/or number of signals applied to the Huffman decoder and video demultiplexor circuit. In this situation, the information held in the coded data buffer is applied to the Huffman decoder and video demultiplexor as a total picture. In this way, the state machine of the Huffman decoder and video demultiplexor can still handle the data according to system design.
Another advantage of the PICTURE END control token is its ability to completely empty the coded data buffer so that no stray information will inadvertently remain in the off chip DRAM or in the swing buffers.
Yet another advantage of the PICTURE END function is its use in error recovery. For example, assume the amount of data being held in the coded data buffer is less than is typically used for describing the spatial information with reference to a single picture. Accordingly, the last picture will be held in the data buffer until a full swing buffer, but, by definition, the buffer will never fill. At some point, the machine will determine that an error condition exits. Hence, to the extent that a PICTURE END
token is decoded and forces the data in the coded data buffers to be applied to the Huffman decoder and video demultiplexor, the final picture can be decoded and the information emptied from the buffers. Consequently, the machine will not go into error recovery mode and will successfully continue to process the coded data.
A still further advantage of the use of a PICTURE END
token is that the serial pipeline processor will continue the processing of uninterrupted data. Through the use of a PICTURE_END token, the serial pipeline processor is configured to handle less than the expected amount of data and, therefore, continues processing. Typically, a prior art machine would stop itself because of an error condition. As previously described, the coded data buffer counts macroblocks as they come into its storage area. In addition, the Huffman Decoder and Video Demultiplexor generally know the amount of information expected for decoding each picture, i.e., the state machine portion of the Huffman decode and Video Demultiplexor know the number of blocks that it will process during each picture recovery cycle. When the correct number of blocks do not arrive from the coded data buffer, typically an error recovery routine would result. However, with the PICTURE_END
control token having reconfigured the Huffman Decoder and Video Demultiplexor, it can continue to function because the reconfiguration tells the Huffman Decoder and Video Demultiplexor that it is, indeed, handling the proper amount of information.
Referring again to Figure 10, the Token Decoder portion of the Buffer Manager detects the PICTURE_END
control token generated by the Start Code Detector. Under normal operations, the buffer registers fill up and are emptied, as previously described with reference to the normal operation of the swing buffers. Again, a swing buffer which is partially full of data will not empty until it is totally filled and/or it knows that it is time to empty. The PICTURE END control token is decoded in the Token Decoder portion of the Buffer Manager, and it forces the partially full swing buffer to empty itself into the coded data buffer. This is ultimately passed to the Huffman Decoder and Video Demultiplexor either directly or through the DRAM interface.

19. FLU8HING OPERATION
Another advantage of the PICTURE_END control token is its function in connection with a FLUSH token. The FLUSH

- ~ 21~52~1 token is not associated with either controlling the reconfiguration of the state machine or in providing data for the system. Rather, it completes prior partial signals for handling by the machine-dependent state machines. Each of the state machines recognizes a FLUSH control token as information not to be processed. Accordingly, the FLUSH
token is used to fill up all of the remaining empty parts of the coded data buffers and to allow a full set of information to be sent to the Huffman Decoder and Video Demultiplexor. In this way, the FLUSH token is like padding for buffers.
The Token Decoder in the Huffman circuit recognizes the FLUSH token and ignores the pseudo data that the FLUSH
token has forced into it. The Huffman Decoder then operates only on the data contents of the last picture buffer as it existed prior to the arrival of the PICTURE_END token and FLUSH token. A further advantage of the use of the PICTURE_END token alone or in combination with a FLUSH
token is the reconfiguration and/or reorganization of the Huffman Decoder circuit. With the arrival of the PICTURE_END token, the Huffman Decoder circuit knows that it will have less information than normally expected to decode the last picture. The Huffman decode circuit finishes processing the information contained in the last picture, and outputs this information through the DRAM
interface into the Inverse Modeller. Upon the identification of the last picture, the Huffman Decoder goes into its cleanup mode and readjusts for the arrival of the next picture information.
20. FLU8H F~NCTION
The FLUSH token, in accordance with the present invention, is used to pass through the entire pipeline processor and to ensure that the buffers are emptied and that other circuits are reconfigured to await the arrival of new dat~. More specifically, the present invention comprises a combination of a PICTURE END token, a padding word and a FLUSH token indicating to the serial pipeline processor that the picture processing for the current picture form is completed. Thereafter, the various state machines need reconfiguring to await the arrival of new data for new handling. Note also that the FLUSH Token acts as a special reset for the system. The FLUSH token resets each stage as it passes through, but-allows subsequent stages to continue processing. This prevents a loss of data. In other words, the FLUSH token is a variable reset, as opposed to, an absolute reset.

21. 8TOP-AFTER PICTURE
The STOP AFTER PICTURE function is employed to shut down the processing of the serial pipeline decompressing circuit at a logical point in its operation. At this point, a PICTURE_END token is generated indicating that data is finished coming in from the data input line, and the padding operation has been completed. The padding function fills partially empty DATA tokens. A FLUSH token is then generated which passes through the serial pipeline system and pushes all the information out of the registers and forces the registers back into their neutral stand-by condition. The STOP_AFTER_PICTURE event is then generated and no more input is accepted until either the user or the system clears this state. In other words, while a PICTURE_END token signals the end of a picture, the STOP_AFTER_PICTURE operation signals the end of all current processing.

22. M~LTI-STANDARD - 8EARC~ ~ODE
Another feature of the present invention is the use of a SEARCH_MODE control token which is used to reconfigure - ~145221 the input to the serial pipeline procescor to look at the incoming bit stream. When the search mode is set, the Start Code Detector searches only for a specific start code or marker used in any one of the compression standards. It will be appreciated, however, that, other images from other data bitstreams can be used for this purpose. Accordingly, these images can be used throughout this present invention to change it to another embodiment which is capable of using the combination of control tokens, and DATA tokens along with the reconfiguration circuits, to provide similar processing.
The use of search mode in the present invention is convenient in many situations including 1) if a break in the data bit stream occurs; 2) when the user breaks the data bit stream by purposely changing channels, e.g., data arriving, by a cable carrying compressed digital video, or 3) by user activation of fast forward or reverse from a controllable data source such as an optical disc or video disc. In general, a search mode is convenient when the user interrupts the normal processing of the serial pipeline at a point where the machine does not expect such an interruption.
When any of the search modes are set, the Start Code Detector looks for incoming start images which are suitable for creating the machine independent tokens. All data coming into the Start Code Detector prior to the identification of standard-dependent start images is discarded as meaningless and the machine stands in an idling condition as it waits this information.
The Start Code Detector can assume any one of a number of configurations. For example, one of these configurations allows a search for a group of pictures or higher start codes. This pattern causes the Start Code Detector to discard all its input and look for the group_start standard image. When such an image is identified, the Start Code Detector generates a GROUP_START
token and the search mode ie reset automatically.
It is important to note that a single circuit, the Huffman Decoder and Video Demultiplex circuit, is operatinq with a combination of input signals including the standard-independent set-up signals, as well as, the CODING_STANDARD
signals. The CODING_STANDARD signals are conveying information directly from the incoming bit stream as required by the Huffman Decoder and Video Demultiplex circuit. Nevertheless, while the functioning of the Huffman Decoder and Video Demultiplex circuit is under the operation of the standard independent sequence of signals.
This mode of operation has been selected because it is the most efficient and could have been designed wherein special control tokens are employed for conveying the standard-dependent input to the Huffman Decoder and Video Demultiplexer instead of conveying the actual signals themselves.

23. INVER~E MODELLER
Inverse modeling is a feature of all three standards, and is the same for all three standards. In general, DATA
tokens in the token buffer contain information about the values of the quantized coefficients, and about the number of zeros between the coefficients that are represented (a form of run length coding). The Inverse Modeller of the present invention has been adapted for use with tokens and simply expands the information about runs of zeros so that each DATA Token contains the requisite 64 values.
Thereafter, the values in the DATA Tokens are quantized coefficients which can be used by the Inverse Quantizer.

2~. INVER~E Q~ANTIZER

The Inverse Quantizer of the present invention is a required element in the decoding sequence, but has been implemented in such away to allow the entire IC set to handle multi-standard data. In addition, the Inverse Quantizer has been adapted for use with tokens. The Inverse Quantizer lies between the Inverse modeller and inverse DCT (IDCT).
For example, in the present invention, an adder in the Inverse Quantizer is used to add a constant to the pel decode number before the data moves on to the IDCT.
The IDCT uses the pel decode number, which will vary according to each standard used to encode the information.
In order for the information to be properly decoded, a value of 1024 is added to the decode number by the Inverse Quantizer before the data continues on to the IDCT.
Using adders, already present in the Inverse Quantizer, to standardize the data prior to it reaching the IDCT, eliminates the need for additional circuitry or software in the IC, for handling data compressed by the various standards. Other operations allowing for multi-standard operation are performed during a "post quantization function" and are discussed below.
The control tokens accompanying the data are decoded and the various standardization routines that need to be performed by the Inverse Quantizer are identified in detail below. These "post quantization" functions are all implemented to avoid duplicate circuitry and to allow the IC to handle multi-standard encoded data.

25. nu~l ~ DECODER AND PAR8ER
Referring again to Figures 11 and 27, the Spatial Decoder includes a Huffman Decoder for decoding the data that the various compression standards have Huffman-encoded. While each of the standards, JPEG, MPEG and H.261, require certain data to be Huffman encoded, the Huffman decoding required by each ~tandard differs in some significant ways. In the Spatial Decoder of the present invention, rather than de~ign and fabricate three separate Huffman decoders, one for each standard, the present invention saves valuable die space by identifying common aspects of each Huffman Decoder, and fabricating these common aspects only once. Moreover, a clever multi-part algorithm is used that makes common more aspects of each Huffman Decoder common to the other standards as well than would otherwise be the case.
In brief, the Huffman Decoder 321 works in conjunction with the other units shown in Figure 27. These other units are the Parser State Machine 322, the inshifter 323, the Index to Data unit 324, the ALU 325, and the Token Formatter 326. As described previously, connection between these blocks is governed by a two wire interface. A more detailed description of how these units function is subsequently described herein in greater detail, the focus here is on particular aspects of the Huffman Decoder, in accordance with the present invention, that support multi-standard operation.
The Parser State Machine of the present invention, is a programmable state machine that acts to coordinate the operation of the other blocks of the Video Parser. In response to data, the Parser State Machine controls the other system blocks by generating a control word which is passed to the other blocks, side by side with the data, upon which this control word acts. Passing the control word alongside the associated data is not only useful, it is essential, since these blocks are connected via a two-wire interface. In this way, both data and control arrive at the same time. The passing of the control word is indicated in Figure 27 by a control line 327 that runs 21~5221 ~49 beneath the data line 328 that connects the blocks. Among other thing~, this code word identifies the particular standard that is being decoded.
The Huffman decoder 321 also performs certain control functions. In particular, the Huffman Decoder 321 contains a state machine that can control certain functions of the Index to Data 324 and ALU 325. Control of these units by the Huffman Decoder is necessary for proper decoding of block-level information. Having the Parser State Machine 322 make these decisions would take too much time.
An important aspect of the Huffman Decoder of the present invention, is the ability to invert the coded data bits as they are read into the Huffman Decoder. This is-needed to decode H.261 style Huffman codes, since the particular type of Huffman code used by H.261 (and substantially by MPEG) has the opposite polarity then the codes used by JPEG. The use of an inverter, thereby, allows substantially the same table to be used by the Huffman Decoder for all three standards. Other aspects of how the Huffman Decoder implements all three standards are discussed in further detail in the "More Detailed Description of the Invention" section.
The Index to Data unit 324 performs the second part of the multi-part algorithm. This unit contains a look up table that provides the actual Huffman decoded data.
Entries in the table are organized based on the index numbers generated by the Huffman Decoder.
The ALU 325 implements the remaining parts of the multi-part algorithm. In particular, the ALU handles sign-extension. The ALU also includes a register file whichholds vector predictions and DC predictions, the use of which is described in the sections related to prediction filters. The ALU, further, includes counters that count through the structure of the picture being decoded by the Spatial Decoder. In particular, the dimensions of the picture are programmed into registers associated with the counters, which facilitates detection of "start of picture, n and start of macroblock codes.
In accordance with the present invention, the Token Formatter 326 (TF) assembles decoded data into DATA tokens that are then passed onto the remaining stages or blocks in the Spatial Decoder.
In the present invention, the in shifter 323 receives data from a FIFO that buffers the data passing through the Start Code Detector. The data received by the inshifter is generally of two types: DATA tokens, and start codes which the Start Code Detector has replaced with their respecti~e tokens, as discussed further in the token section. Note that most of the data will be DATA tokens that require decoding.
The ln shifter 323 serially passes data to the Huffman Decoder ~21. On the other hand, it passes control tokens in parallel. In the Huffman decoder, the Huffman encoded data is decoded in accordance with the first part of the multi-part algorithm. In particular, the particular Huffman code is identified, and then replaced with an index number.
The Huffman Decoder 321 also identifies certain data 2s that requires special handling by the other blocks shown in Figure 27. This data includes end of block and escape. In the present invention, time is saved by detecting these in the Huffman Decoder 321, rather than in the Index to Data unit 324.
This index number is then passed to the Index to Data unit 324. In essence, the Index to Data unit is a look-up table. In accordance with one aspect of the algorithm, the look-up table is little more than the Huffman code table specified by JPEG. Generally, it is in the condensed data format that JPEG specifies for transferring an alternate JPEG table.
From the Index to Data unit 324, the decoded index number or other data is passed, together with the accompanying control word, to the ALU 325, which performs the operations previously described.
From the ALU 325, the data and control word is passed to the Token Formatter 326 (TF). In the Token Formatter, the data is combined as needed with the control word to form tokens. The tokens are then conveyed to the next stages of the Spatial Decoder. Note that at this point, there are as many tokens as will be used by the system.

26. INVBR8~ DI8CR~TE C08IN~ TRAN8FORM
The Inverse Discrete Cosine Transform (IDCT), in accordance with the present invention, decompresses data related to the frequency of the DC component of the picture. When a particular picture is being compressed, the frequency of the light in the picture is quantized, reducing the overall amount of information needed to be stored. The IDCT takes this quantized data and decompresses it back into frequency information.
The IDCT operates on a portion of the picture which is 8x8 pixels in size. The math which performed on this data is largely governed by the particular standard used to encode the data. However, in the present invention, significant use is made of common mathematical functions between the standards to avoid unnecessary duplication of circuitry.
Using a particular scaling order, the symmetry between the upper and lower portions of the algorithms is increased, thus common mathematical functions can be reused which eliminates the need for additional circuitry.

~145221 ~ `

Thç IpCT responds to a number of multi-standard tokens.
The first portion of the IDCT checks the entering data to ensure that the DATA tokens are of the correct size for processing. In fact, the token stream can be corrected in some situations if the error is not too large.

27. BUFFE~ MANAGER
The Buffer Manager of the present invention, receives incoming video information and supplies the address generators with information on the timing of the datas arrival, display and frame rate. Multiple buffers are used to allow changes in both the presentation and display rates. Presentation and display rates will typically vary in accordance with the data that was encoded and the monitor on which the information is being displayed. Data arrival rates will generally vary according to errors in encoding, decoding or the source material used to create the data. When information arrives at the Buffer Manager, it is decompressed. However, the data is in an order that is useful for the decompression circuits, but not for the particular display unit being used. When a block of data enters the Buffer Manager, the Buffer Manager supplies information to the address generator so that the block of data can be placed in the order that the display device can use. In doing this, the Buffer Manager takes into account the frame rate conversion necessary to adjust the incoming data blocks so they are presentable on the particular display device being used.
In the present invention, the Buffer Mnager primarily supplies information to the address generators.
Nevertheless, it is also required to interface with other elements of the system. For example, there is an interface with an input FIFO which transfers tokens to the Buffer Manager which, in turn, passes these tokens on to the write ~ 21~5221 addre~s generators.
The Buffer Manager also interfaces with the display address generators, receiving information on whether the display device is ready to display new data. The Buffer Manager also confirms that the display address generators have cleared information from a bu~fer for display.
The Buffer Manager of the present invention keeps track of whether a particular buffer is empty, full, ready for use or in use. It also keeps track of the presentation number associated with the particular data in each buffer.
In this way, the Buffer Manager determines the states of the buffers, in part, by making only one buffer at a time ready for display. Once a buffer is displayed, the buffer is in a "vacant" state. When the Buffer Manager receives a PICTURE_START, FLUSH, valid or access token, it determines the status of each buffer and its readiness to accept new data. For example, the PICTURE START token causes the Buffer Manager to cycle through each buffer to find one which is capable of accepting the new data.
The Buffer Manager can also be configured to handle the multi-standard requirements dictated by the tokens it receives. For example, in the H.261 standard, data maybe skipped during display. If such a token arrives at the Buffer Mnager, the data to be skipped will be flushed from the buffer in which it is stored.
Thus, by managing the buffers, data can be effectively displayed according to the compression standard used to encode the data, the rate at which the data is decoded and the particular type of display device being used.

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, co~mercial implementation of various embodiments of the invention, the following further description and explanation is prqferred.

~` 2145221 This is a more detailed description for a multi-standard video decoder chip-set. It is divided into three main sections: A, B and C.
Again, for purposes of organization, clarity and convenience of explanation, this additional disclosure is set forth in the following sections.
Description of features common to chips in the chip-set:
Tokens Two wire interfaces DRAM interface Microprocessor interface Clocks Description of the Spatial Decoder chip Description of the Temporal Decoder chip SECrION A.l The first description section covers the majority of the electrical design issues associated with using the chip-set.
A.1.1 Typographic conv-ntions A small set of typographic conventions is used to emphasize some classes of information:
NAME8 OF TO~EN8 wire_name active high signal wire_name active low signal register_name .~' ` 21g5221 SECT~N A.2 Video Decodér Family 30 MHz operation Decodes MPEG, JPEG & H.261 Coded data rates to 25 Mbts Video data rates to 21 MB/s MPEG resolutions up to 704 x 480, 30 Hz, 4:2:0 - Flexible chroma sampling formats Full JPEG baseline decoding Glue-less page mode DRAM interface 208 pin PQFP package Independent coded data and decoder clocks Re-orders MPEG picture sequence The Video decoder family provides a low chip count solution for implementing high resolution digital video decoders. The chip-set is currently configurable to support three different video and picture coding systems:
JPEG, MPEG and H.261.
Full JPEG baseline picture decoding is supported.
720 x 480, 30 Hz, 4:2:2 JPEG encoded video can be decoded in real-time.
CIF (Common Interchange Format) and QCIF H.261 video can be decoded. Full feature MPEG video with formats up to 740 x 480, 30 Hz, 4:2:0 can be decoded.
Note: The above values are merely illustrative, by way of example and not necessarily by way of limitation, of one embodiment of the present invention. Accordingly, it will be appreciated that other values and/or ranges may be used.

A.2.1 System configurations A.2.1.1 Output formatting In each of the examples given below, some form of output formatter will be required to take the data presented at the output of the Spatial Decoder or Temporal Decoder and 21~5221 re-for~a~ it for a computer or display system. The details of this formatting will vary between applications. In a simple case, all that is required is an address generator to take the block formatted data output by the decoder chip and write it into memory in a raster order.
The Image Formatter is a single chip VLSI device providing a wide range of output formatting functions.
A.2.1.2 JP~G ~till pictur- d~-:s~in7 A single Spatial Decoder, with no-off-chip DRAM, can rapidly decode baseline JPEG images. The Spatial Decoder will support all features of baseline JPEG. However, the image size that can be decoded may be limited by the size of the output buffer provided by the user. The characteristics of the output formatter may limit the chroma sampling formats and color spaces that can be supported.
A.2.1.3 JPEG vid-o d-coding Adding off-chip DRAMs to the Spatial Decoder allows it to decode JPEG encoded video pictures in real-time. The size and speed of the required buffers will depend on the video and coded data rates. The Temporal Decoder is not required to decode JPEG encoded video. However, if a Temporal Decoder is present in a multi-standard decoder chip-set, it will merely pass the data through the Temporal Decoder without alteration or modification when the system is configured for JPEG operation.
A.2.~.4 H.26~ d-coding The Spatial Decoder and the Temporal Decoder are both required to implement an H.261 video decoder. The DRAM
interfaces on both devices are configurable to allow the quantity of DRAM required for proper operation to be reduced when working with small picture formats and at low coded data rates. Typically, a single 4Mb (e.g. 512k x 8) DRAM will be required by each of the Spatial Decoder and the Temperal Decoder.
A.2.1.5 MPEG d-coding The configuration required for MPEG operation is the same as for H.261. However, as will be appreciated by one of ordinary skill in the art, larger DRAM buffers may be required to support the larger picture formats possible with MPEG.

~145221 SECTION A.3 Tokens A.3.1 Tok~n for~at In accordance with the present invention, tokens provide an extensible format for communicating information through the decoder chip-set. While in the present invention, each word of a Token is a minimum of 8 bits wide, one of ordinary skill in the art will appreciate that tokens can be of any width. Furthermore, a single Token can be spread over one or more words; this is accomplished using an extension bit in each word. The formats for the tokens are summarized in Table A.3.1.
The extension bit indicates whether a Token continues into another word. It is set to 1 in all words of a Token except the last one. If the first word of a Token has an extension bit of 0, this indicates that the Token is only one word long.
Each Token is identified by an Address Field that starts in bit 7 of the first word of the Token. The Address Field is of variable length and can potentially extend over multiple words (in the current chips no address is more than 8 bits long, however, one of ordinary skill in the art will again appreciate that addresses can be of any length).
Some interfaces transfer more than 8 bits of data. For example, the output of the Spatial Decoder is 9 bits wide (10 bits including the extension bit). The only Token that takes advantage of these extra bits is the DATA Token. The DATA Token can have as many bits as are necessary for carrying out processing at a particular place in the system. All other Tokens ignore the extra bits.

'_` ` 2145221 A.3.2 ~h~ DATA Token The DATA Token carries data from one processing stage to the next. Consequently, the characteristics of this Token change as it passes through the decoder. Furthermore, the meaning of the data carried by the DATA Token varies depending on where the DATA Token is within the system, i.e., the data is position dependent. In this regard, the data may be either frequency domain or Pel domain data depending on where the DATA Token is within the Spatial Decoder. For example, at the input of the Spatial Decoder, DATA Tokens carry bit serial coded video data packed into 8 bit words. At this point, there is no limit to the length of each Token. In contrast, however, at the output of the Spatial Decoder each DATA Token carries exactly 64 words and each word is 9 bits wide.
A.3.3 Using To~-n formatt-d data In some applications, it may be necessary for the circuitry that connect directly to the input or output of the Decoder or chip set. In most cases it will be sufficient to collect DATA Tokens and to detect a few Tokens that provide synchronization information (such as PICTURE_START). In this regard, see subsequent sections A.16, "Connecting to the output of Spatial Decoder", and A.19, "Connecting to the output of the Temporal Decoder".
As discussed above, it is sufficient to observe activity on the extension bit to identify when each new Token starts. Again, the extension bit signals the last word of the current token. In addition, the Address field can be tested to identify the Token. Unwanted or unrecognized Tokens can be consumed (and discarded) without knowledge of their content. However, a recognized token causes an appropriate action to occur.

21~221 Furthermore, the data input to the Spatial Decoder can either be supplied as bytes of coded data, or in DATA
Tokens (see Section A.10, "Coded data input"). Supplying Tokens via the coded data port or via the microprocessor interface allows many of the features of the decoder chip set to be configured from the data stream. This provides an alternative to doing the configuration via the micro processor interface.

2 1~22~
.

6 ! s 4 3 2 1 0 Tok-nN~ R~lererce o o 1 OUANT_SCALE
O I o PREDICTION_MODE
o 1 1 (r~ d) o o MVD_FORWARDS
1 o 1 MVD_BACKWARDS
o 0 0 0 ~ QUANT_TABLE
0' 0 0 0 0 1 DATA
o o o 0 COMPONENT_NAME
o o o 1 DEFINE_SAMPLING
o o 1 o JPEG_TASLE_SELECT
o o 1 I MPEG_TABLE_SELECT
o 1 o o TEMF'ORAL_F~E~tlltrlCE
o 1 o 1 MPEG_DCH_TABLE
1, 1 0 1 1 0 (t~d) o 1 1 1 (r~wd) 0 0 0 0 (r~wd) SAVE_STATE
o o o 1 ~r~heS~OhE_STATE
1 1 1 o o 1 o Tl~1E_CODE
i 1 1 0 0 1 1 (-~5~d) l 0 0 o 0 NULL
0'. 0 0 0 0 0 0 1 (~ved) ! o o 1 o (~suved) o ! o o O 0 0 1 1 (r~se~ed) ol, o o 1 o o o o SEOUENCE_START
o, o o 1 o o o 1 GROUP_START
o o o 1 o o 1 o PICTURE_START
o o o 1 o o 1 1 SLICE_START
o o o 1 o 1 o o SEOUENCE_END
o o o 1 o 1 o 1 CODING_STANDARD
o. o o 1 o 1 1 o PICTURE_END
o I o o 1 o 1 1 1 FLUSH
o~ o o 1 1 o o o FIELD_INFO
Ta~le A.3.1 Summary of To~ens ~_ 2145221 7 6 ¦ S l 4 3 2 1 0 l~k-n N-me R-~erence o o' -o 1 1 0 o 1 MAX_COI IP_ID
o o o 1 1 o 1 o EXTENSION_DATA
0 0 o 1 1 o 1 1 USER_DATA
o o o 1 1 1 o 0 DHT_MARKER
o o o 1 1 1 o 1 DaT_MARKER
O O O 1 1 1 1 0 (r~rv d) DNL_MARKER
O O 0 1 1 1 1 1 ~r~rv d) DRI_MARKER
1 1 1 0 1 0 0 0 ~reserved) 1 1 1 1 0 1 0 0 1 ~r served) 1 1 1 0 1 0 1 0 ~r~ved) 0 1 0 1 1 (r s~d) o 1 1 o o BIT_RATE
o 1 1 o 1 V8V_BUFFER_SeE
1 1 1 o 1 1 1 o VBV_DELAY
o 1 1 1 1 PICTURE_TYPE
o o o o PICTURE_RATE
o o o 1 PEL_ASPECT
1 1 1 1 0 0 1 0 HOReOtlTAL_SlZE
o o 1 1 VERTICAL_SIZE
1 1 1 1 o 1 o o BROKEN_CLOSEn 1 ! 1 o o (r -~ d)S~c~ AL_LlMlT
0 1 1 1 DEFINE_blAX_SAMPLING
1 1 1 0 0 0 (r~erved) 1 1 1 1 1 0 0 1 (r~vd) 1 1 0 1 0 (reser~ed) 0 1 1 (r serwdl .1 1 1 1 1 1 0 0 HOReONTAL_MBS
1 1 1 1 1 o 1 VERTICAL_MBS
0 (res~rved) 1 ~ reserved) T~bl- A. 3 .1 Su~m~ry of Token~ ~contd) 21~5221 a. 3.~ D--cription of To~-n~
This section documents the Tokens which are implemented in the Spatial Deco~er and the Temporal Decoder chips in accordance with the present invention; 6ee Table A.3.2.

Note:
."r" signifies bits that are currently reserved and carry the value O
.unless indicated all integers are unsigned ~ 2145221 E 7 6 ~ 5 4 3 1 2 1 0 D~
o 1 1 o o BIT_RATE test inlo only 1 r r r r r r b b Carries th- MPEG bi~ nte parameter R Generated by ~he Huttman 1 b b t~ b b b b b decoder when decoding an MPEG bi~sueam --_ O b b b b b b b b b - an 16 Dit integer as defined by MPE6 1 o 1 o o BROKEN_CLOSED
o r r r r r r c b C~rri s two MPEG n~gS bits c '- O'~P
b broken_link o o o 1 o 1 o t CODING_STANDARD
s n ~ bit integ r indicating the current coding sundard The v lu currenny assigned ara 1~JPEG

1 1 1, o o o o c c COMPONENT_NAME
O n n n n n n n n C; i: ~ the i~ ~lonsl p between a co poc~ ~t ID and the CG ~o ~nt name Ses also c - 2 bit c~ ?orsnt ID
n 6 bit c ~r_ ,t name 1 1 1 1 1 o 1 o 1 CONSTRAINED
o r r r r r r r c c - c rnes the consl e ~_p. a ~ s-na9 decodod trom an MPEG bnstream Tabl- A 3 2 To~cn~ impl-ment-d in th- 8patial Decoder and T-mporal D-cod-r ~8h--t 1 of 9) ~ ` 214~221 E 7 6 1 s 4 3 2 1 0 - C
0 ! 1 c c DATA
1 d dl d d d d d d Curi s d~ta th~ou9h th~ decoder chlp-sct 0 d d d d d d d d c a2 bitinte9erco ~nt~nllD~seeA3s 1 ) Thisfield ts not defined ~or Tokens tha~ carry coda aala (ra~her ttlan DiXel ~r~
1 1 1 1 1 o 1 1 1 DEFINE_MAX_SAMPLING
1 r r r r r r h h Max Honzontal and Vertical sampling numbers These descri~e O r r r r r r v v the maximum numb r ot blocks h o Iy~.e i 1~ in any c,~,,,,,,,~ ,~ o~ ~ . .JCI~ S~ ~3.52 h 2 bit hori20nt~1 svnpling number v 2 bi~ verbcal s-rnpling number 1 1 1 0 o o 1 c c DEFINE_SAMPLING
r r r r r r h h Hori20n~al and V r~l sztmpling numoers ior a puticular colour O r r r r r r v v ~ ~L See A 3 52 c 2 bit cv ~1 ID
h 2 bi~ hori20ntal sampling numoer v 2 bil v~l s mpling number o o o 0 1 1 1 o o DHT_MARKER
This Token informs the Vdeo Demux that the DATA Token that ~ollowsconUinsth- ~ ot a Hu~tman ~able d scribed using the JPEG define Hu~trrtan table segment syntax This Token is only valid when the coding stancdard is confir;ured as JFEG

This Token is gen-rata by the start code detec or during JPEG
decoding when a DHT marker has t~een enccuntered in the ~ata stream Table A 3 2 To~en~ impl-m-nt-d in th- 8patial Decoder and Temporal Decoder ~Sh--t 2 of 9) ~ ` 21~5221 E 7 6 ~ 1 4 3 2 1, o c~
o o o o ~ o DNL_MARKER
This Token informs the Video Demux that the DATA Token that Idlows contains th JPEG patameter NL whKch specifies the number o~ lines in a ttame This Token is generated by the stan code delector curing JP E~i decoding when a DN- mark r h~ b-en encounteted in the data str am o o O o 1 1 1 o 1 DQT_MARKER
This Token in~onm the Vld o thmux that th- DATA Token that lollows conUinS the ~ - 'K 01 a 3 " ~n Uble described using the JPEG 'd-fin~ tabh s-gm nr syntax This Token is only valid wh-n th- coding sUn~td is configured as JPEG TheV~deoD muxg-n ratesaQuANT-TAaLEToken containing the n w 1" ~ Uble; ~

This Token is g-neraled by the stan codo detector dunng JPEG
d coding when a DOT marker has been encountered in the data s~ream~

o o o o 1 1 1 1 l DRî_MARKER
This Token intorms the Vdeo Demu~ thal th- DATA Token t~at ~dlows eontains the JPEG parameter Ri which s~ecifies the number ol minimum coding units betw~en resurt markers Ttis Tdken is genera~ed by the start code d-tector Curing JPE&
decoding when a DRI marker has ~een encountered in tne dala stream Table A 3 2 Tokenel implem-nt-d in the 8patial Decoder and Temporal Decoder ~Sh-et 3 of 9) 21~5221 ~,.

E 7' ~ 3 2 1 0 C ti~
o o o 1 1 o 1 o EXTENSION_DATA JPEG
O v v v v v v v v Thrs Tok n intorms th- Vldeo Demux that Ihe DATA Token hal Idlows contains extension dal~ See A 11 3 Conv-rsion o~ start codas lo Tokans and A 14 6 'ReCeMn9 U5er and Exlension data' Ouring JPEG op ettbon tne 9 bil bld ~ carries the JPEG marker v lue This allows tne cl ss o~ extension data to be identih d o o o o 1 1 o 1 o EXTENSION_DATA MPEG
Thrs Tok n in~orrrts tne Vld o Oerrwx that the DATA Token that loNovvs cont ins estension dat S ~ 11 3 'Conversion o~ su~
cod s to Tot~ns' nd ~14 6 'F~ cer~ing Us r and E~nsion data 1 o o o 1 1 o o o FIELD_INFO
0 r r r t p ~ ~ ~
C rri s i '~ about the picture ~ollowing to aid its display This lunction is rlot sign ll-d by any existing coding st ndard t il th- picture is n inl-rt-ced ~rame this bit inCicales H the upper Ihld is firsl tl~0) or second p i~ pictur s ue fields this indicales i~ Ihe nex~ picture is upper (p-0) or low r in the ~rarne a 3 bil numb r indicabng Position o~ th- fietd in the B fielC PAL
s ~uence o o o o 1 o 1 1 1 FLUSH
Us d to indicate the end ol th- current coded data and to pusn tne end or th- data stream ttlrough ~he decoder o o o o 1 o o o 1 GROUP_START
Generated when the group o~ pictures start code is round wnen decoding MpEG or the ~rame marker is lound wnen ~ecodins JPEG

Table A.3.2 Tokens i",F~e "enled in the Spatial ~ecoder and Temporal C~ecoder (Sheet ~ o' ~ 21~5221 E 7 6 s 4 3 2 1 o 1 1 1 1 1 1 1 o o HORIZONTAL_MEIS
1 r r r h h h h h h - a 13 bit number inleger indicating the horizontal wid~h ol the o n h h h h h h h ~icturs in - ,~I;. ~
1 1 1 1 1 o o ~ o HORIZONTAL_SIZE
1 h h h h h h h h h 16 bit numb r inleger indic ting tn- hori20nlal width ol the O h h h h h h h h picWre in pisels This ctn b- ~tny int g-r v luc 1 1 1 o o 1 o c c JPEG_TABLE_SELECT
Informs th- hv~ quantis r which ~ ~n tab~ to use on tll- sP cified colour C
c 2 bil t p~t ~1 ID (s ~ A 3 5 1 I - 2 bil int g-r Ubls numb r 1 o o o 1 1 o o 1 MAX_COMP_ID
O r r r r r r m m m - 2 bil inleg-r indicaling Ihe rruximum value o~ c~ ~on_nl ID
~sa- A 3 5 1 ) thal will be used in th- next picture 0 1 1 0 1 0 1 c c MPEB_DCH_TA13LE
Configwes which DC Co tricienl Hutlm n table shouid be used ~or colow c~...~r. ,1 cc.
c - 2 bit Cch ,~or I l ID (s ~ A 3 5 1 2 bit int g-r ta~e numb r 0 1 1 0 0 1 1 d n MPEG_TAEILE_SELECT
Intorms the inverse quanliser w~elher lo use the delault ot user d-fim d qu nlisation lable ior intra or non-intra i d~ lation n - O hdicales intra nh 1 non-intra d O indicates delaull tabl- 1 u#r rdefined Table A.3.2 To~ens impl-ment-d in the ~p~tial Decod-r and Tempor~l D-coder ~h--t S of 9) ~ ` 2145221 E 7 6 1 5 4 3 2 1 0 t2 - ~pt 1 ` O 1 d v v v v IUVD_BACKWARDS
o V Y V V V V V V
Curies one C _ ~ d tertt~ r v rtical or hon2ontal~ ot the - ~ rnotion vector d - O indicst s s ~ ~ y Col~ j)OnLht v - 12 bit two s e ~ '1 l number The LSB provides hall pixel r~soluffon 1 1 0 0 d v v v v hlVD_FORWARDS
O v v v v v v v v C~sr~n~ d~rv nical or hori20ntal) d~e lorw rds rnotbn v e~r d O hdic t ss _ Q 1 ~yc~ ~or_ l v 12 bil t~ros ~ l number The LS~ proviCes hal~ pixel r~dutbn.
0 0 0 o o o o O o NULL
t~ not~g 1 1 1 1 1 o o o 1 PEL_ASPECT
p a 4 bit integ r ~ defined by MPEG
o o o o 1 o 1 1 o PICTURE_END
Ir~d by ~e ~rt code d t ctor to indicat- th- end d the cunent pittur~
t 1 1 1 1 o o o o PICTURE_RATE
p a 4 bit int~r ~ delined by MPEG
1 o o o 1 o o 1 o PICTURE_START
O r r r r n n n n Indicates tt e st rt d e n-~v picture n a 4 bil petur i~x atlocated ~o tne picture by t~e start code det ctor Tabl- A 3 2 To~-ns impl-m-nt-d in th~ 8p~ti~1 D-cod~r ~nd T-mpor~l D~cod-r ~8~--t 6 of 91 ~ - 21~5221 E 7 6 ~ ~ 3 2 1 O C~
o 1 1 1 1 PICTURE_TYPE MPEG
0 r r r r r r p p p a 2 bit integer indicating Ihe piclure coCing rype ol the picture Iha~ ~ollows:
o Intra 1 Predict d 2 - ~idi ~ - Iy Predicted 3 - DC Intra o 1 1 1 1 PICTURE_TYPE H261 1 r r r r r r 0 1 Indic~tas v rious H 261 opbons ate on ~1 ) or o~ (0) Th~ options ' r s d I q 1 1 u- always otl lor MPEG and JPEG
s Split Scr~n Indicator d DocumentCun ra 1- Free2e Picture Rdeas;
Source picture Iorrnat q-0 OClF
q ~ 1 CIF

0 0 1 0 n y x b I PREDICTION_MODE
A s t o~ nag bits tha~ indicale the prediction mode ~or the bl~ that lo00w t ~or~rd prediction b backward Dredicbon x raset torwud v ctor prediclor y r s-~ backward v c~or predic~or h enable H 261 loop finer O O O 1 5 S 5 S S QUANT_SCALE
In~orrns the inverse quantiser d a new scale ~ac~or s 5 bi~ in~eger in range 1 31 The value o is reserver~ ~
Table A 3 2 Tokens implemented in the Spatial Decoder and Temporai Decocer (Sheet 7 ot , . _ , E 7 6 5 4 3 2 1 ¦ 0 C< ~t 1 0 0 0 0 1 r I t QUANT_TABLE
1 q q q q C C q q Loads the specihed inverse ~u ntiser table With 64 8 bn unsigned int g-rs The values ue in 2ig ug orCer O q q t~ C ~ ~ ~ q ~ - 2 bil integer sp cityino th- inverse cu-nliser ta~le to be loaced O 0 0 0 1 0 1 0 0 SEQUENCE_END
Tho MPEG #qu-nce_end_code and the JPEG EOI marker cause IhiS Token lo b- gen-rated 0 0 0 0 1 0 0 0 0 SEOUENCE_START
6en raled hy the MPEG s~uence_s~rt st trt code 1 0 0 0 1 0 0 1 1 SLICE_START
O s s s s s s s s CG.. . tO Ihe MPEG slice_sun the H261 GOB anC the JPEG resync int~ rhe ;n- ~ ~ 7n ot 8 bit integer s Citlers b twe-n coding standards MPEG Slic-V~l Posibon H 261 - Group ol Btoct~s Numbe JPEG r~ h ~ hterval ide Ic ~n (4 LSSs only) 0 1 0 0 t t TEMPORAL_REI tt~ENCE
0 t t t I I t l I
I - c ni s th- Iemporal rd r-r~ce For MPEG this is a 10 bil inleser For H 261 only th- 5 LSSs u- us~d th- MS~s will always be zero 1 1 1 1 0 0 1 0 d TIME_CODE
1 r r r h h h h h The MPEG time_eode 1 r m m m m m m d - Drop trame tlag 1 ~ ~ s s s s s s 0 ~ ~ p p p p p p h sbninte9e specityinghours m 6 bit inleger specitying minutes s 6 bit integer specitying seconds D 6 bit in~eger sDecil~ting pictures Table A.3.2 Tokens ,-,p~e.--cnted in the Spatial Decoder and Temporal Decoder (Sheet 8 of ~` ` 2115221 E 7 ! 6 5 1 4 1 3 1 2 1 O ~ too 0 i 1 1 ! 0 1 i 1 USER_DATA JPEG
O v v v v v v v v This Token intorms the Vd-o O-mux ~al the DATA Token thal ~ollows conlains user dat~ See A~ 11 3 'Convers~cn oi s an coaes to Tokens and A~14 6 'Receivlng User and Extension data During JPEG op ranon ~e 3 bit field ~ carr es the JPEG marker value This allo~vs the class o~ user data to be identifiea o o o o 1 1 0 1 1 USER_DATA MPEG
This Token in~orms th- v~d-o Demux that the DATA Token that tollo~vs contains us r dita S-e A 11 3 'Conversion ot start coaes to Tokens and A 14 6 'Receiving User and Extension data 1 1 1 1 0 1 1 0 1 VBV_BUFFER_SIZE
1 r r r r r r s s s a 10 bit integer s d fined by MPEG
O Sl S S S S S S S
1 l 1 1 0 1 1 1 0 VBV_DELAY
1 bl b b b b b b b b a 16 bit integer as de~ined by MPEG
G b! b b b b b b b 1 l 1 1 1 1 1 0 1 VERTICAL_MBS
r r r v v v v v v - a 13 bit integer indicating the v rtical size ot the Dicture in O v v v v v v v v " ,..,. ~,tJ~I~, .
1 1, 1, t, 1 0 0 1 1 VERTICAL_SIZE
vl vl vl v v v v v v - a 16 bit integer indicatmg the venical size ol the plcture 'n ;)IY-!5 O V j V I V I V V V V V
This can be any integer value Table A. 3 . 2 To~-ns impl-m-nt-d in th- 8patial Decoder and T-mporal Deco~-r ~8he-t 9 of 9) 214~221 a. 3.5 ~umb-r- ignall-d 1~ Tok-n-A.3.5.1 Compon-nt Id-ntification nu~b-r In accordance with the present invention, the Component ID number is a 2 bit integer specifying a color component.
This 2 bit field is typically located as part of the Header in the DATA Token. With MPEG and H.261 the relationship is set forth in Table A.3.3.

Component ID - MPEG or H.261 colour comDonen~
O Luminance (Y) Blue ditlerence signal (CL / U) 2 Red di~terence signal (Cr / V) 3 Never us~ed Tabl- A.3.3 Component lD for HP~G and ~.261 `- 214~221 With JPEG the situation i8 more complex as JPEG does not limit the color components that can be used. The deco~er chips permit up to 4 different color components in each scan. The TDQ are allocated sequentially as the specification of color components arrive at the decoder.
A.3.S.2 ~or$~o~t~1 ~nd V-rti¢al s~apling ~uib-r-For each of the 4 color components, there is aspecification for the number of blocks arranged horizontally and vertically in a macroblock. This specification comprises a two bit integer which is one less than the number of blocks.
For example, in MPEG (or H.261) with 4:2:0 chroma sampling (Figure 36) and component IDs allocated as per Table A.3.4.

Hon20ntal Venical Component IDsamplingWidth in blocks sampling Height in blocks number numbe~

o 1 0 3 Not usedNot used Not usedNot used ~abl- A.3.~ ~ampling numb-rs for ~:2:0/MPEG

~_ 2145221 With JPEG and 4:2:2 chroma sampling (allocation of component to component ID will vary between applications.
see A.3.5.1. Note: JPEG requires a 2:1:1 structure for its macroblocks when processing 4:2:2 data. See Table A.3.5.

Hon2cntal Ve~cal CcmDcnent IDsamplingWid~ in blockssampling He!g~t In blocks number number T~bl- a. 3.S ~a~pli~g ~umb-r- for ~:2:2 JP~G

` 2145221 A.3.6~5pecial Token formats In accordance with the present invention, tokens such as the DATA Token and the QUANT TABLE Token are used in their "extended form" within the decoder chip-set. In the extended form the Token includes some data. In the case of DATA Tokens, they can contain coded data or pixel data. In the case of QUANT_TABLE tokens, they contain quantizer table information.
Furthermore, "non-extended form" of these Tokens is defined in the present invention as "empty". This Token format provides a place in the Token stream that can be subsequently filled by an extended version of the same Token. This format is mainly applicable to encoders and, therefore, it is not documented further here.

Tok~ MPEt; JFEG H261 BIT_RATE
BRoKEN-c( oSFn CODING_STANDARD
COMPONENT_NA~IE
CONSTRAINED
DATA
DEFINE_~IAX_SAMPLING
DEEINE_SAMPLING
DtlT_~JlARKER
DNL_~AARKR
DC;IT_MARKER
DRI_MARKER

Table A.3.C tok-ns for different Qtan~-ds _` 21~5221 ., Tdurl N~me MPEG JpEG H261 EXTENSION_DATA
FIELD_INFO
FLUSH
GROUP_START
HORRONTAL_MBS
HORIZONTAL_SIZE
JPEG_TABLE_SELECT
MAX_COMP_ID
MPEG_DCH_TABLE
MPEG_TABLE_SELECT
MVD_BACKWARDS
MVD_FORWARDS
NULL
PEL_ASPECT
PICTURE_END
PICTURE_RATE
PICTURE_START
PICTURE_TYPE
PREDICTION_MODE
OUANT_SCALE
QUANT_TABLE
SEQUENCE_END
SEQUENCE_START ~ ~ ~
SLICE_START ~ ~ J
TEMPORAL_REFERENCE
TIME_CODE
USER_DATA
VBV_BUFFER_SRE
VBV_DELAY
VERTICAL_MBS
VERTICAL_SIZE
Tab~e A.3.6 Tokens for d;r(_. Ln~ standards (contd) A.3.7 Use of Tokens for different st~n~-rd~
Each standard uses a different sub-set of the defined Tokens in accordance with the present invention; ss Table A.3.6.

SECTION A.4 The two wire interface A.4.~ r- i~t-rf~c-- ~nd th- Tok-~ ~ort A simple two-wire valid/accept protocol is used at all levels in the chip-set to control the flow of information.
Data is only transferred between blocks when both the sender and receiver are observed to be ready when the clock rises.
l)Data transfer 2)Receiver not ready 3)Sender not ready If the sender is not ready (as in 3 Sender not ready above) the input of the receiver must wait. If the receiver is not ready (as in 2 Receiver not ready above) the sender will continue to present the same data on its output until it is accepted by the receiver.
When Token information is transferred between blocks the two-wire interface between the blocks is referred to as a Token Port.
A.4.2 ~her- us-d The decoder chip-set, in accordance with the present invention, uses two-wire interfaces to connect the three chips. In addition, the coded data input to the Spatial Decoder is also a two-wire interface.
A.4.3 Bu- ign~l-The width of the data word transferred by the two-wire interface varies depending upon the needs of the interface concerned (See Figure 35, "Tokens on interfaces wider than 8 bits". For example, 12 bit coefficients are input to the Inverse Discrete Cosine Transform (IDCT), but only 9 bits are output.

-- 21~5~21 InU11~C- Oat~ wictn (bitS) CoC~ ~t~ mpu~ to So~l O codor OUtDUt pOrt O~ Sp~ti~l O~ r 9 Inout Drt ol TomporL D~co~r 9 OUtDU~ pOrt o~ TomDor~l Docx-r 3 Inpu~ pOrl d Im~g~ Fomutt~r Tabl- A.~.1 Two vir- i~t-rfac- d~t~ width In addition to the data signals there are three other signals transmitted via the two-wire interface:
.valid .accept .extension a. ~ . 3 .1 Th- xt-n-ion sign~l The extension signal corresponds to the Token extension bit previously described.
A.~.~ D-sign oonsid-r~tions The two wire interface is intended for short range, point to point communication between chips.
The decoder chips should be placed adjacent to each other, so as to minimize the length of the PCB tracks between chips. Where possible, track lengths should be kept below 25 mm. The PCB track capacitance should be kept to a minimum.

21g5221 The clock distribution should be designed to minimize the clock slew between chips. If there is any clock slew, it should be arranged so that "receiving chips" see the clock before "sending chips".~
All chips communicating via two wire interfaces should operate from the same digital power supply.
a. 4.5 Int-rf-¢- timing 30 MH~ Note~
,~um. C~aracterist~ Unit Min. Ma~
InDU~ si~nal se; up bme S ns Inpu~ slgnal hol~ ~ime O ns Outpul sign~ drive ~me 23 ns OUtDUt sl9nal holC ~me 2 ns ~abl- A.4.2 Two wir- interfac- timing a. Figures in Table A.4.2 may vary in accordance with design variations b. Maximum signal loading is approximately 20 pF

' Note: Figure 38 shows the two-wire interface between the system de-mux chip and the coded data port of the Spatial Decoder operating from the main decoder clock. This is optional as this two wire interface can work from the coded data clock which can be asynchronous to the decoder clock.
See Section A.10.5, "Coded data clock". Similarly the display interface of the Image Formatter can operate from a clock that is asynchronous to the main decoder clock.

~'` ` 21~5221 A.4.6.~S~gn~ v-l-The two-wire interface uses CMOS inputs and output.
V~m,n is approx. 70% of Vl,,, and V,Lmal is approx. 30% of VDD .
The values shown in Table A.4.3 are those for VIH and V,; at their respective worst case V~n. V~ =5.0+0.25V.

SymW Pu~mot~r Min. M~. Unlts V.~ In~ut loglC '1' volUgo 3.H V~O ~ 0.5 V
V,~ InDul logic 'O' vottugoONO ~ C.5 1.43 ¦ v VO~ Out~ut lo~c 'l' volus~ V~O
Voo~0.4 1 V~
VO, Out~ut loglc ~O' volUs~ 0.1 v ' 0.4; ~C
"~ In~ut lo~go cunont :1 0 ~abl- A.~.3 DC-el-ctrical charact-ri~tic~

a. 10H5 lmA
b. 10H' 4mA
c. l";<lmA
d. 1"l<4mA

~` 21~5221 A.~.7L.~CQntrol clock In general, the clock controlling the transfers across the two wire interface is the chip's decoder clock. The exception is the coded data port input to the Spatial Decoder. This is controlled by coded clock. The clock signals are further described herein.

`_` 2145221 SECTI~N A.5 DRAM Interface A.5.1 Th- DRa~ int-rf~c-A single high performance, configurable, DRAM interface is used on each of the video decoder chips. In general, the DRAM interface on each chip is substantially the same;
however, the interfaces differ from one another in how they - handle channel priorities. The interfi~ce is designed to directly drive the DRAM used by each of the decoder chips.
Typically, no external logic, buffers or components will be necessary to connect the DRAM interface to the DRAMs in most systems.
A.5.2 Int-rfac- ~ign~l~

InDut /
Signal N~ C ~ ; h OUtDUt ORAM_d~t [31 01 UO Tho 32 bit wld~ ORAM dU- Dus opllonally Ihis ~us c~n D- confi9urttd to D- I6 or 8 bits wide See s ction ~ 5 J
DRAM_attdr~I0 0I O Tho 22 Dit wide DRAM interlace adCress Is tlm-multiDlex d over this I I 0it wide DuS
1~ 0 rh- ORAM Row Address StroDe 5ignal ~3 01 0 Tho DRAM Column A~dress SIrooe 5Ignal One 5ignal is proviCed p r byte of th- in~erlace s ~ala bus All the ~ signals are driven simultaneou51y WE O The DRAM Write En~DI- signal O The DRAM Output Ent~le 519n~l ORAM-en~Dle I Tbis input signu whan low malc s all me OUlpUt sign~ls on tho int~ C~ 90 high ~ lC~
Nole on-chip CUa p:o 1~ Is nol stopp C winen ~he ORAM int rlace is high ~ l~crS So er us will oceur it t~e enip an-mpts~ access DRAM ~v~ le DRAM_enaDle is low Ta~le A.5.1 DRAM i-,t~ ce signals In ~ordance with the present invention, the interface is configurable in two ways:
.The detail timing of the interface can be configured to accommodate a variety of different DRAM types .The "width" of the DRAM interface can be configured to provide a cost/performance trade-off in different applications.
A.5.3 Configuring tb- DRAM int-rf~c-Generally, there are three groups of registers associated with the DRAM interface: interface timing configuration registers, interface bus configuration registers and refresh configuration registers. The refresh configuration registers (registers in Table A.5.4) should be configured last.
A.5.3.1 Condition~ aft-r res-t After reset, the DRAM interface, in accordance with the present invention, starts operation with a set of default timing parameters (that correspond to the slowest mode of operation). Initially, the DRAM interface will continually execute refresh cycles texcluding all other transfers).
This will continue until a value is written into refresh interval. The DRAM interface will then be able to perform other types of transfer between refresh cycles.
A.5.3.2 Bus configuration Bus configuration (registers in Table A.5.3) should only be done when no data transfers are being attempted by the interface. The interface is placed in this condition immediately after reset, and before a value is written into refresh_interval. The interface can be re-configured later, if required, only when no transfers are-being attempted. See the Temporal Decoder chip_access register (A.18.3.1) and the Spatial Decoder buffer_manager_access reglster (A.13.1.1).

A.5.3.3 Interface timing configuration In accordance with the present invention, modifications to the interface timing configuration information are controlled by the interface_timing_access register.
Writing 1 to this register allows the interface timing registers (in Table A.5.2) to be modified. While interface_timing_access = 1, the DRAM interface continues operation with its previous configuration. After writing 1, the user should wait unit 1 can be read back from the interface_timing_access before writing to any of the interface timing registers.
When configuration is complete, 0 should be written to the interface_timing_access. The new configuration will then be transferred to the DRAM interface.
A.5.3.4 Refresh configuration The refresh interval of the DRAM interface of the present invention can only be configured once following reset. Until refresh_interval is configured, the interface continually executes refresh cycles. This prevents any other data transfers. Data transfers can start after a value is written to refresh_interval.
As is well known in the art, DRAMs typically require a "pause" of between 100 µs and 500 µs after power is first applies, followed by a number of refresh cycles before normal operation is possible. Accordingly, these DRAM
start-up requirements should be satisfied before writing a value to refresh_interval.
A.5.3.5 Read access to configuration registers All the DRAM interface registers of the present invention can be read at any time.
A.5.4 Interface timing (ticks) ~` 2145221 The~D~M interface timing is derived from a Clock which is running at four times the input Clock rate of the device (decoder clock). This clock is generated by an on-chip PLL.
For brevity, periods of this high speed clock are referred to as ticks .

A 5 5 ~'Int-rf-e~ r-gi~t-r~

~i Reglstar name ~ t cn r~
intetnc-_timing_acc--- 1 0 Thls luncDon en-DI- reç~5 et a;lov~s access lo bit ;he ORAM in~ettaCe llmmg configuraoon regi51en rh- configurauon rt~lsters 5houlc~ nc~
rw be modifia wt il- this reglsUr ~olrJs the value O Wriong a on- to this register ~eCuess acceSs to modity th- ~ 9~ n regls;Us At er a 0 ha5 be n writt-n to this r~9i5ter the GRA~1 in;Urt Ce ~ill st~n tO us th- new vUue5 in t~e timing C6 ~9 Jn registers iC p_~t tt_lengttl 5 0 Sp cifbs th- bngth ot th- cC-s5 s an in ocks bit Th- minimUrn value that c n be uSa iS 4 (m-aning 4 tiC~) O sdects th- ma~timum rw lengtn ot 32 tiCi tr ns~et_cycb_l ngtt~ 4 0 specifitils tlle I ngth ol the l~st oa~e r~ad Or bit writ cycb in ti~ci~s Tha minimum value ;hat crm b- used is ~ (m ning 4 bcks) O salects ~e rw mwmum l-ngth ol 16 0Ci~5 t--~t sh_c1ch_bngttt 4 0 Sp cifi--S b~ i ngth ol th- r~tr sn CyCI- in DCks bit The minimum value that can be ust~ is 5 (meaninç 4 ticks) O se~eC5 ~ti rna~mum rw l-ngth ot 16 tiCt~
RAS_talling 4 0 SpeCi~9 t~e numDer otbcks atter e s an ol ~ -bit the acctlss St rt that ~ lails The m~nlmurn value tilat Can b- userJ is 4 (rneUtlnç 4 ~cksl tv~ selt~c~s h- ma~timum lenr,th cf t 5 :clts CAS_laliing ~ i~ Soec;tiet; t~e numDer ott~c~s a ettlhe sla~ ct a Dlt I ~-ac :ycle ~rite cy:le or acCe55 starttl at fialls Th mlnlmum value ti'~at car k use~ s ~v ~ rr ean ng ~ hclt~ O selec~s 1~e ~ mon ens~
of~ cfs.
Taole A.-.2 Intei ~ace timlng configuration ,eg!sters ~ 21~5221 A~g~ster n~rn- ~ ~ D 7 ORAM_C~u_wiCth 2 0 Sp clfiss tn- numo r ot bits us~ on tnC MA~
Dit intort csd~t~ bus MAt~l_C~Ut31 0] See A5~
rw row_~CCr-ss_DitS 2 0 Sp elfi s ~- num~r ot ~its u~d lor tns row bit ~dCr-ss po~on ol th- DRAM intortsce ~CCress bW S - ~ 5 1 0 rw DRAI~I_ n~Olo 1 1 Wnong th- v lu 0 h to thi~ r~gist r torc s tD-bit DRAM intorbe- inlo ~ high 7.0 st~te O will bo ro~d trom t~ r~i t-r it i~-r ~e rw M~ ubb dgn-l Is Iow or 0 ~s bo-n ~t~n ~o th- r~t r CAS_itr ngth 3 6 T~ t~no oitrsgwt rseonfigurs tns outDut RAS_suong~ bit drrn str n9th ot DR~M int rt~tee Sign~l5 ~ddr_~tr ng~h This tlows tn- int ~e- to ~ eonagur-d ~or DRAbl_~-t~_su ngth rw v rious dilt r nt losds OEWE_~tr-n~

S ~S 13 Tabl- A 5 3 Int-rfac- bu~ configuration r-gi~t-r~

~ ` 21~221 A.5.6~nt-r~ac- op-ration The DRAM interface uses fast page mode. Three different types of access are supported:
.~ead .Write .Refresh Each read or write access transfers a burst of 1 to 64 bytes to a single DRAM page address. Read and write transfers are not mixed within a single access and each lo successive access is treated as a random access to a new DRAM page.

~j Fl~s#r name ~ ~ ;~

retre5n_intenral a o rhs value speutbs ~ mlerval ~een bit retr~ crcw in pertods ot 16 decoder_clock cycles Values in U~e Qn9e 1 25i c~ ~e r~v c~Ari9 ~ Th~vUu~0i5~u l~G~~ o~cec an., e5el nd torc~s the CRAM in~ertacc to cononuously ~ CUle retrh Cyc~es ~111 a va~td~L
rotr~h inlernl i5 configured It is ~ ~ thU r tresh_lnterval s~culC ~e confioured on~ once ane"ach res~
no_rdr-sh 1 0 Wriong ~e velu- 1 lo this regtsler ~events ~il xacubon ot u~ r tr sh cyc~

rv~
Tabl- A.S.~ R-fr-sh conrigur-tion r-gist-rs 21~S221 ~92 A.S.7 .Acc-s- structur-Each access is composed of two parts:
.Access start .Data transfer In the present invention, each access begins with an access start and is followed by one or more data transfer cycles. In addition, there is a read, write and refresh variant of both the access start and the data transfer cycle.
Upon completion of the last data transfer for a particular access, the interface enters its default state (see A.5.7.3) and remains in this state until a new access is ready to begin. If a new access is ready to begin when the last access has finished, then the new access will begin immediately.
A.5.7.1 acc-ss st-rt The access start provides the page address for the read or write transfers and establishes some initial signal conditions. In accordance with the present invention, there are three different access starts:
.Start of read .Start of write .Start of refresh Num. Cn V Min. MU. Unit Notes m p c~rg~ poriod s t ~y r gi~r ~ 16 oek R~.S_hlling 6 Aee~ st rt dur~0on set ~y r gist~r 4 32 p5g--sun-lon9tt~
7 ~r~rg-l ngth~lDyregi~t r 1 16 C~S_hillng.
8 F~t Uge re~ or wnt cyc!e longth ~ t t~y 4 16 t~ regist~r tr n~er_eyel-_t ngtll.
9 R5h~sh eycle 1~ 5 t t~y ttl r-gisbr ~, 16 r~ _eycl-.

Tabl- A.5.5 DRAM Int-rfac- timi~g p~r-~-t-r-a. This value must be less than RAS falling to ensure ~ before RAS refresh occurs.

- 21~5221 In each case, the timing of RAS and the row address is controlled by the registers RAS_falling and page_start_length. The state of OE and DRAM data[31:0] is held from the end of the previous data transfer until **RAS
falls. The three different access start types only vary in how they drive OE and DRAM data[31:0] when RAS falls. See Figure 43.
A.5.7.2 D~t~ tr~n-~-r In the present invention, there are different types of data transfer cycles:
.Fast page read cycle .Fast page late write cycle .Refresh cycle A start of refresh can only be followed by a single refresh cycle. A start of read (or write) can be followed by one or more fast page read (or write) cycles. At the start of the read cycle CAS is driven high and the new column address is driven.
Furthermore, an early write cycle is used. WE is driven low at the start of the first write transfer and remains low until the end of the last write transfer. The output data is driven with the address.
As a CAS before RAS refresh cycle is initiated by the start of refresh cycle, there is no interface signal activity during the refresh cycle. The purpose of the refresh cycle is to meet the minimum RAS low period required by the DRAM.
a. 5.7.3 Int-rfac- d-fault stat-The interface signals in the present invention enter a default state at the end of an access:
RAS, CAS and WE high *data and OE remain in their previous state .addr remains stable A.5.8 Data bus width ~ ` 21~5221 The two bit register, DRAM_data width, allows the widthof the DRAM interface's data path to be configured. This allows the DRAM cost to be minimized when working with small picture formats.

DR~M_CJ~_width 0- 8 Dll wido ~t~ bu~ on DRAM_d~t t31:2 16 bltwido c~t~ bu5 on DR~M_d a~31:16 2 32 bd wido ~u~ bus on DRAM_d~ 31:0].

Tabl- a . s . c Conf iguring DRAM data wid th a. Default after reset.
b. Unused signals are held high impedance.

A.S.9 row addr-ss vid th The number of bits that are taken from the middle section of the 24 bit internal address in order to provide the row address is configured by the register, row address bits.

row- adr-~-oit~ W~h d row ~dr~
1o oit~ on DR~M_: ~rp.O]
2 11 bd5 on DR~M_ ddrtl O:OI
Tabl- A.S.~ Conf igutring row ad~r-ss bits 214~221 a. s . lo ~r-ss bits On-chip, a 24 bit address is generated. How this address is used to form the row and column addresses depends on the width of the data bus and the number of bits selected for the row address. Some configurations do not permit all the internal address bits to be used and, therefore, produce "hidden bits)".
Similarly, the row address is extracted from the middle portion of the address. Accordingly, this maximizes the rate at which the DRAM is naturally refreshed.

ro~ row ~ddr~
d~ ~ ddr~5 tr~Sl-oon on rn~ st~rn~l ~idth ~t~ ~ rnd 9 [1~:6] ~ [8:0l ~ ~19:tS1 tlo:~l lS:01 0 t5:01 1~ t20:15l O ~1O:S] l5:11 O 14:01 32 ~21:151 O llO:-l I521 13:01 1 t15:6~ 9:0l ~ [19:161-~[10:61 1501[5:0l 16 [20:t61 _ [lO:Sl [5:1 1 o [4:01 32 ~21:161 ~10:-1 [5:21 " [3- 0l 11 ~16;61 0 [10:01 6 [19:171 0 ~10:6] [5:01~ [5:0]
16 t20:1~1 ~1 [10:5] [5:11 [4:01 32 [21:171 0 [10:41 [521 [3:01 ~ble A.5.8 Mapping b-tw--n int-rnal and xt-rn~l ~ddre~ses ~_ 2145221 a. s . lQ~l. Low ord-r eolumn addr-ss bit The least significant 4 to 6 bits of the column address are used to provide addresses for fast page mode transfers of up to 64 bytes. The number of address bits required to control these transfers will depend on the width of the data bus (see A.5.8).
A.5.10.2 D-coding row ddr-~ to ~cc-~s mor- DRAM banks Where only a single bank of DRAM is used, the width of the row address used will depend on the type of DRAM used.
Applications that require more memory than can be typically provided by a single DRAM bank, can configure a wider row address and then decode some row address bits to select a single DRAM bank.
NOTE: The row address is extracted from the middle of the internal address. If some bits of the row address are decoded to select banks of DRAM, then all possible values of these "bank select bits" must select a bank of DRAM.
Otherwise, holes will be left in the address space.
A.S.ll DRAM Tnt-rf~c- n~bl-In the present invention, there are two ways to make allthe output signals on the DRAM interface become high impedance, i.e., by setting the DRAM enable register and the DRAM-enable signal. Both the register and the signal must be at a logic 1 in order for the drivers on the DRAM
interface to operate. If either is low then the interface is taken to high impedance.
Note: on-chip data processing is not terminated when the DRAM interface is at high impedance. Therefore, errors will occur if the chip attempts to access DRAM while the interface is at high impedance.
In accordance with the present invention, the ability to take the DRAM interface to high impedance is provided to allow otner devices to test or use the DRAM controlled by the Spatial Decoder (or the Temporal Decoder) when the -- ` 2145221 Spatial Decoder (or the Temporal Decoder) is not in use.
It is not intended to allow other devices to share the memory during normal operation.
A.5.12 R-fr-sh Unless disabled by writing to the register, no refresh, the DRAM interface will automatically refresh the DRAM
using a~~S before ~ refresh cycle at an interval determined by the register, refresh interval.
The value in refresh interval specifies the interval lo between refresh cycles in periods of 16 decoder clock cycles. Values in the range 1.255 can be configured. The value 0 is automatically loaded after reset and forces the DRAM interface to continuously execute refresh cycles (once enabled) until a valid refresh interval is configured. It is recommended that refresh interval should be configured only once after each reset.
While rese~ is asserted, the DRAM interface is unable to refresh the DRAM. However, the reset time required by the decoder chips is sufficiently short, so that it should be possible to reset them and then to re-configure the DRAM
interface before the DRAM contents decay.
A.5.13 Sign~l str-ngths The drive strength of the outputs of the DRAM interface can be configured by the user using the 3 bit registers, CAS strength, RAS strength, addr strength, DRAM_data strength, and OEWE strength. The MSB of this 3 bit value selects either a fast or slow edge rate. The two less significant bits configure the output for different load capacitances.
The default strength after reset is 6 and this configures the outputs to take approximately lOns to drive a signal between GND and VDD if loaded with 24pF.

~_. 2145221 s~n5tt~v~1u~ 3rrw ~
o ~oprox. , n~V in~o 6 p~ b~d Aoorox. ~, ns/V into 12 o~ lo d 2 ~oprox. ~ ns/V into 2~, d lo~d 3 ~porox. 4 nsJV into ~ of lo~
4 AporoL 2 ns/V inlo 6 o~ b d ~pproL 2 n~V into 12 ol b d 6 Approx. 2 n~V hlo 24, p~ d 7 ~OL 2 ns~V in~ 4d d b d Tabl- A.5.9 O~put str-ngth configurations a. Default after reset When an output is configured appropriately for the load it is driving, it will meet the AC electrical characteristics specified in Tables A.5.13 to A.5.16. When appropriately configured, each output is approximately matched to its load and, therefore, minimal overshoot will occur after a signal transition.
A.5.1~ El-ctrical sp-cification-All information provided in this section is merely illustrative of one embodiment of the present invention and is included by example and not necessarily by way of limitation.

. ` 2145221 S~mOol Py~l r Min M~ Unlls VOO Suoply vol 49- rd4uvo to GN0 O S 6 5 V
V~ Inout volUgo on ~ny p~n GND - 0 5 V0O 0 5 V
T~ ODer~n9 lomp r~Qlro ~o ~85 C
Ts 510~9~ temD~ruwn 55 ~150 C
Tabl- A.5.10 M~xi~Uo R~ti~gs' Table A.5.10 sets forth maximum ratings for the illustrative embodiment only. For this particular embodiment stresses below those listed in this table should be used to ensure reliability of operation.

S~ol PY~m l~r Min M~x Units VOo Suppl~ volt~g~ rol~tr~o to GND 4 75 5 25 v GNO G ound 0 0 V
V~ ~ Inout logic 1 VdUg4 2 0 V0O r 0 5 V
VIL Inputb9ic ~ volUgo GN0 0 5 0 8 V
T~ OD r~bng l~m~r~tur~ 0 ~0 C~

Tabl- A.5.11 DC Op-rating eonditions a. With TBA linear ft/min transverse airflow ~, SymDol P~m tcr M~n ¦ Ma~ Units VOL OutPut 1091C 'O' volU9~ 4 V
vot~ OutptJt loglc '1' vo~t~g~ 2 ~ V
o OUtvtJtcurr n~ S 100 10z OUtPUI ol~ o lo~ oo CwTon~ S 20 2 InDutl~90curr nt s10 ~
loo RMS Do~r suoply curront 500 mA
CIN Inpu~ C `~ S pF
cou~ OUt,Dut / IO C W;' ~ ~ S DF

Tabl- a. S.12 DC El-etric~l ch~r~ct-ristics a. AC parameters are specified using VO~ = O.8V
as the measurement level.
b. This is the steady state drive capability of the interface.
Transient currents may be much greater.

~ 214 5221 A 5 1~ 1~AC c~aract-ristics Num Pu~m~ur MinM~ IJmt Note ' Cydo om- 2 ~2 ns I l Cyclo om- -2 ~2 ns 12 hl9n DUIs '5 ~2 ns 13 Low ~uls 11 ~2 ns 11 Cycl- ~ -S ~2 ns T~bl- A 5 13 Diff-r-nc-~ from no~inal v~lu-~ for a strob-a As will be appreciated by one of ordinary skill in the art, the driver strength of the signal must be 5configured appropriately for its load Num Puunnt r MinM~xUnit Nûn-IS Sb~obo to ~UOO- ~by 3 ~3 ns 16 Low hold timo 13 ~3 ns 19 Strob to~o~pt chug- 9 ICRP -9 ~3 ns IRCSMRCH tRRH tRPC
~rg pul~ ~n ~ny r~o -S ~2 ns ~d~ on wd- OR~ ~ 9 tCP or b r~v n ~ rising ~nd ~5 hlling t tRPC
18 Pt~up ~Ot oi~l- -12 ~3 ns Table A S 14 Diff-r-nc-s from nominal valu-s b-t~--n t~o strob-s a The driver strength of the two signals must be configured appropriately for their loads ~ ! 2145221 , ~

Num P ~ ~ur - Min. Mun Unlt Note~
9 Sot u~ om 12 ~3 ns ~o Hold Dm, t2 ~3 ~
~I Addr~CC SStlm~ 12 ~3 ns 2t Ncxt v~lid ~hcr st~Oo 12 ~3 ns Tabl- A S lS Diff-r-nc-- fro~ nom~n~l b-tw--n a bus and a strob-a The driver strength of the bus and the strobe must be conf igured appropriately for their loads Num P~nm tsr Min. Ms~t.unit No~
23 R ~dd~s lupom o iu ~signL o stuts tO ns-24 ~ -d d~t~Otd Dm ~ttsr ~slgn~l 0 ns st lu to C ~i9~`

T~bl- a 5 16 Diff-r-nc-- from nominal b-t r--n a bu~ ~nd a strob-When reading from DRAM the DRAM interface samples DR~M_data[31 0] as the ~ signals rise ~ 2145221 ~r~m-t r Duur~t~r ~uun~tu n~m~num~r n rn~ r~r n~rn- num~r IPC 10 tRSH 16 tRHCP 18 tCPRH
tRC 11 tCSH ~SR 19 IRP 12 tRW~ t~SC
tCP tCWL a~s tCPN tRAC IR~H 20 tRAS 13 toActtoE tCAH
tCAS tCHR IOH
tCAC tCRP 17 t~R
tWP tRCS U~A 21 IRASP tRCH tRAL
tR~SC tRRH tR~O 22 t~CPttCPA 1~ tRPC
IRCD 1 S tCP
tCSR tRPC

T~bl~ A 5 ~7 Cros~-r-f-r-nc- b-tw--n "~t-n~-r~" DRAM
paru~-t-r nam-s ~nd ti~ing p~ra~-t-r nu~b-rl ~' ` 2145221 SE:CTI~N A.6 Microprocessor interface (MPI) A standard byte wide microprocessor interface (MPI) is used on all chips in the video decoder chip-set. However, one of ordinary skill in the art will appreciate that microprocessor interfaces of other widths may also be used.
The MPI operates synchronously to various decoder chip clocks.
A.6.1 MPI signal~

Input /
Sign~l N m~ n : ~
o.,tput ~n-hl-[1 ûl Input Two ~ctln low Cnrp sn~ Sotn muSt ~e low to cn~ occs~s vi~ tns htPI
r~w Input High in~ us thU ~ ~ics wishes ~o r~a~ v~lues trom tho vidco cnip This sign~l should ~o st Uo wnib thc !llip is cnsbl d ~or(n 01 Input A¢¢r~s sp clfi on- ol 2~ locuions in th- ChiD S
m mor~ m~p This sign~l should 0- st~ls whils tns chip is ~n~l d t1~U[~ 0~ Output ~ ~it w~¢ C~l~ 1/0 poQ Th ss pins ar~ nlgn ~cc it ithsr sns~h ~gn~Hs high.
irq Output An ~ctivo low op n eoll etor intcrrupt rn~u st sign~l T~bl- a. 6.1 MPI int-rf~c- sig~ls ~_ ` 2145221 A.6.2~ ctrical ~pecific~tions Sym~ol ~uun ur Min. M~. Uniu v~0 Suoplyvolt4~ r~lUh~ u GND O.S 6.5 v v~ nout vdUge on ~ny pm GND O.S vO0 . o.s v ~~ Oo r~nng ~ mo r~nJre 40 85 'C
~s Stor~geumo ruwe S; ~150 C

Tabl- A.6.2 Absolut- MaYi~u~ Rati~g~-Symool ~u~t r Min. M~. Umts vOo SuoPIy voltJge rel~t~vo to GND 4.75 5.25 v G~D Groun~ 0 o v v!~ Inoullogic 1 vo~uge 2.0 VDo-O.S V~
vn, Inoul logic ~ volt~9e GND - O.S 0.8 v 1-1 T~ Oor~3ng~ o 70 C

$ab1- a. 6.3 DC Op-rating condition~
a. AC input parameters are measured at a 1.4V
measurement level.
b. with TBA linear ft/min transverse airflow.

,_. 219~221 Sym~ol Puunolot Mh M~ Unils VOL OIJtpUt l091C ~ volt4g-- 0,4 V
VO x Op n colhctor ouOput h~ic 'O' 0 4 V~
volt~g~
VO~ Output ogc'1'vo~t g- 24 V
OutlPutcunont ~100 ox Op n coU-ctor outlput cun nl 4 0 5 0 mA
b2 Outwtdl#Jt ~u9-curr nl ~ 20 1 IIN Ir4ulb~curront ~ 10 l~o f~MS ~r ~ cuncnt 500 C~ pr 5 IF
CO~ Ou3ut / lO - . 5 CF

T~bl- a. 6.~ DC El-ctric~l c~r~ct-ri~tic~
a. lo<l~ m~
b. This is the steady state drive capability of the interface. Transient currents may be much greater.
c. When asserted the open collector l~Fq output pulls down with an impedance of loon or less.

~_ 2145221 A 6 2 . r ~ AC charact-ri-tics Not~s Num Ch~ ~ ,,I,. Min M~X Unlt En~h low D~rlo~ loo ns 26 En~Db high D~nod 50 ns 2t ~ddrt~ or r~ s~t~Up lo Chip sn~ ns 28 Ad~ ss or r~ hold ~rom CniD ~is~Dl~ O ns 29 OUtDUt nJrn~on timo 20 n5 ~o~a ~ t~CC0s5 tim 70 n5 31 R-~d ~U~ hold omo 5 ns 32 F~d CU~ turn-otl ~m- 20 Tabl- a 6 5 Microproc-~sor i~t-rfac- r-ad ti~ing a The choice, in this example, of ena~le[o]
to start the cycle and enaDle[l] to end it is arbitrary These signal are of equal status b The access time is specified for a maximum load of 50 pF on each of the data[7 0]
Larger loads may increase the access time Num C~ -- ~ ~ Min M~x Unit Not-s 33 Wnt 2~Us t~UDtlrn- 15 n5 3 1 Wnl~ d~U holC om- 0 ns Tabl- A 6 C Microproc-ssor int-rfac- writ- ti~ing a The choice, in this example, of enaDle[0]
to start the cycle and enaDle~l] to end it is arbitrary These signal are of equal status ~ ` 2145221 A.6.3 I~t-rrupts In accordance with the present invention, "event" is the term used to describe an on-chip condition that a user might want to observe. An event can indicate an error or it can be informative to the user's software.
There are two single bit registers associated with each interrupt or "event". These are the condition event register and the condition mask register.
a. 6.3.1 condition vent r-gi-t-r 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 was merely transient and has now gone away. The register is then guaranteed to remain set to one until the user's software resets it (or the entire chip is reset).
The register is set to zero by writing the value one Writing zero to the register leaves the register unaltered.
The register must be set to zero by user software before another occurrence of this condition can be observed.
The register will be reset to zero on reset.
A.6.3.2 Condition m~k r-gist-r The condition mask reqister is one bit readtwrite 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.
The value l enables interrupts.
The register clears to zero on reset.
Unless stated otherwise a block will stop operation ~_ ` 2145221 after-~ererating an interrupt request and will re-start operation after either the condition event or the condition mask register is cleared.
A 6 3 3 Ev-nt and mask bits Event bits and mask bits are always grouped into corresponding bit positions in consecutive bytes in the memory map (see Table A.9.6 and Table A.17.6). 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.
A.6.3.~ Tb- ehip v-nt and mask Each chip 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 l in the chip mask bit allows the chip to generate interrupts. A 0 in the chip mask bit prevents any on-chip events from generating interrupt requests.
Writing 1 to 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.
A.6.3.5 Th- irg signal The irq signal is asserted if both the chip event bit and the chip event mask are set.
The irq signal is an active low, "open collector" output which requires an off-chip pull-up resistor. When active the lrq output is pulled down by an impedance of 100n or less.
I will be appreciated that pull-up resistor of approximately 4kn should be suitable for most applications.
b. 6 . ~ Acc-ssing r-gist-r~
A.6.4.~ Stopping circuit~ to nabl- acc-ss In the present invention, most registers can only -~14~

modified if the block with which they are associated is stopped. Therefore, groups of registers will normally be associated with an ~ccess register.
The value O in an access register indicates that the S group of registers associated with that access register should not be modified. Writing 1 to an access register requests that a block be stopped. However, the block may not stop immediately and block's access register will hold the value O until it is stopped.
Accordingly, user software should wait (after writing 1 to request access) until 1 is read from the access register. If the user writes a value to a configuration register while its access register is set to 0, the results are undefined.
A.6.4.2 R-g~-t-r- hol~ng int-g-rs The least significant bit of any byte in the memory map is that associated with the signal data[O].
Registers that hold integers values greater than 8 bits are split over either 2 or 4 consecutive byte locations in the memory map. The byte ordering is "big endian" as shown in Figure 55. However, no assumptions are made about the order in which bytes are written into multi-byte registers.
Unused bits in the memory map will return a O when read except for unused bits in registers holding signed integers. In this case, the most significant bit of the register will be sign extended. For example, a 12 bit signed register will be sign extended to fill a 16 bit memory map location (two bytes). A 16 bit memory map location holding a 12 bit unsigned integer will return a o from its most significant bits.
A.6.~.3 ~-y~ol-d addr-ss loca~ions In the present invention, certain less frequently accessed memory map locations have been placed behind `_ ` 2145221 "keyho~e~". A "keyhole" has two registers associated with it, a keyhole address register and a ~eyhole data register.
The keyhole address specifies a location within an extended address space. A read or a write operation to the keyhole data register accesses the location specified by the keyhole address register.
After accessing a keyhole data register the associated keyhole address register increments. Random access within the extended address space is only possible by writing a lo new value to the keyhole address register for each access.
A chip in accordance with the present invention, may have more than one "keyholed" memory map. There is no interaction between the different keyholes.
A.6.5 Sp-ci~l r-gist-rs A.6.5.1 Unus-d r-gist-rs Registers or bits described as "not used" are locations in the memory map that have not been used in the current implementation of the device. In general, the value 0 can be read from these locations. Writing 0 to these locations will have no effect.
As will be appreciated by one of ordinary skill in the art, in order to maintain compatibility with future variants of these products, it is recommended that the user's software should not depend upon values read from the unused locations. Similarly, when configuring the device, these locations should either be avoided or set to the value 0.
A.6.5.2 R-~-rv-d r-gist-r~
Similarly, registers or bits described as "reserved" in the present invention have un-documented effects on the behavior of the device and should not be accessed.
A.6.5.3 Te~t r-gist~r~
Furthermore, registers or bits described as "test registers" control various aspects of the device's - ` 21q5221 testability. Therefore, these registers have no application in the normal use of the devices and need not be accessed by normal device configuration and control software.

SECTION A.7 Clocks In accordance with the present inventions, many different clocks can be identified in the video decoder system. Examples of clocks are illustrated in Figure 56.
s As data passes between different clock regimes within the video decoder chip-set, it is resynchronized (on-chip) to each new clock. In the present invention, the maximum frequency of any input clock is 30 MH~. However, one of ordinary skill in the art will appreciate that other frequencies, including those greater than 30MHz, may also be used. On each chip, the microprocessor interface (MPI) operates asynchronously to the chip clocks. In addition, the Image Formatter can generate a low frequency audio clock which is synchronous to the decoded video's picture rate. Accordingly, this clock can be used to provide audio/video synchronization.
A.7.1 8patial D-cod-r clock ~ignal~
The Spatial Decoder has two different (and potentially asynchronous) clock inputs:
Input /
Signal Narne Descnp~ion Output coded_clock Input rhls c!ocl~ controls ca~a ;ranster n :o he cocea Cata port ol the SpaDal Decoder.
On-chip this clock conuols tne process ng o~ the coded data until i~ reaches the coded data ~u~er.
aecoder-cloc~ Input The aecoder cioc~ con~rols the ma;onry oithe processingfunc~ions ntne Spatial Oecocer.
rhe decoder clock also contro!s the !rans!er o~ da~a out ol ~he Spatial Decoder through Its OUtDUt port.
Tabl- A.7.1 ~patial D-cod-r clocks -A 7 2 T-mporal D-cod-r clock signals The Temporal Decoder has only one clock input Input /
Signal ~am- C i~
OUtDUt ~coa-r_cloct~ InDul Ths ~ coo r cloc~ controls ll o~ t~- proce e ng ~unctions on th Tampor~ D coder Tlte C cod-r dock also controls trans~cr ol Ca~a in lo th T rnDoral D cod-r ttlrough ~t inpul oort and out via its outDut Do~t Tabl- A 7 2 T-~poral D-cod-r cloc~t A 7 3 El-ctrical sp-cific~tions 30 M~2 Num ChU~ tiC Umt Nole Uin M~I
35 Cloc~ D riod 33 ns 36 Cloc~ high paliod 13 ns 37 Clocltlow p-noC 13 ns Table A ~ 3 Input clock r-guir-m-nts ~ ` 2145221 Symbol Pu~m ler Min MU~ Unns V!~ Inpu~ logic '1' vdt~gs 3 68 VOO ~ 0 5 V
V~L Inout 109* 'O' vdtagn GNO ~ O 5 143 V
loz Inwt h~kS~ cunsnt ~ 10 T~bl- a. 7 . 4 Clock input conditio~s A.7.3.1 CMOS l-v-ls The clock input signals are CMOS inputs. VIHm~ is approx. 70% of Vl~D and V~ is approx. 30% of VDD. The values shown in Table A.7.4 are those for V~H and VL at their respective worst case VDD. VDD=5 ~ 0+0. 25V.
A.7.3.2 8t~bility of clocks In the present invention, clocks used to drive the DRAM
interface and the chip-to-chip interfaces are derived from the input clock signals. The timing specifications for these interfaces assume that the input clock timing is stable to within + 100 ps.

_ ` 21~52~1 SECT10~ A.8 JTAG
As circuit boards become more densely populated, it is increasingly difficult to verify the connections between components by traditional means, such as in-circuit testing using a bed-of-nails approach. In an attempt to resolve the access problem and standardize on a methodology, the Joint Test Action Group (JTAG) was formed. The work of this group culminated in the "Standard Test Access Port and Boundary Scan Architecture", now adopted by the IEEE as standard 1149.1. The Spatial Decoder and Temporal Decoder comply with this standard.
The standard utilizes a boundary scan chain which serially connects each digital signal pin on the device.
The test circuitry is transparent in normal operation, but in test mode the boundary scan chain allows test patterns to be shifted in, and applied to the pins of the device.
The resultant signals appearing on the circuit board at the inputs to the JTAG device, may be scanned out and checked by relatively simple test equipment. By this means, the inter-component connections can be tested, as can areas of logic on the circuit board.
All JTAG operations are performed via the Test Access Port (TAP), which consists of five pins. The ~g~ tTest 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. Lastly, 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. On the Spatial Decoder and Temporal Decoder, 21~221 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.
For full details of the facilities available and instructions on how to use the JTAG port, refer to the following JTAG Applications Notes. --o a. 8.1 Con~-ction of JTAa pin- ~n non-J~Aa Jyst-~s Signal Oirect~on Descnction trst Incut This pin has an Intemal pull-up. ~ut mus; t~e taken low al power-up even i~ the JTAG ~eatures are not ~eing used. This may Ce achieved t~y ccr nec ing trst in common with the chiC reset cin reseL
~di Inpul These pinS have internal pull-ups ar~ rray t~e le~t tms a-sconne_led it the JTAG circui'ry is not ~eing used.
tck Incut This pin does not have a pull-up anc shculd ~e t~e~
to ground i~ the JTAG circuary is not useC.
tCo Cu`put High impe~ance except Curing JTAG s:an operabons. 1~ ITAG is not h~eing used ~is pln may Ce len d;-.onnc_t~

~bl- A.8.1 ~o~ to conn-ct JTAG input~

2I 452~1 A~8.2` ~v-l of Conformanc- to ~EEE 11~9.1 A.8.2.1 Rul-s All rules are adhered to, although the following should be noted:

Rules 3.1.1 tb) Ths t~ pin is ~id d.
3.5.1(b) ~ ior ~11 puOlic i~ ~ct~_ (~ IEEE 11~9.1 52.1 (c)).
52.1 (c) f;u~ lor Ul VUbac i._t~D~. for som- ~rr~le irutructJons, ~o TDO pin m~y bo ~vs duMg ~y o~ tll-states C-~tur DR, E~-nl-OR. Esil 2 0R ~ P~us~3R.
5.3.1(~) Pow~r on r~t is ~i v d by use d tt s U lt pin.
62.1 (e,i~ ~ co~ fot tns 9YP~.SS irlsrucoon i5 lo~d d in t~o Tsst-Loglc.
Reset sute.
7.1.1(d) Un--lloc~tec instruction cod-s ~to ecuiv-lent to 3vPA55 ~2.1 ~c) Ttlere i5 no d-ves 10 rogist r.

T~bl- a. 8.2 JTAG Rul-s ~(ule5 O-- '1O~lO~l 7 81(0) single-steD exraDon reCulres enernal Conrrol o~ ~e system Clock 7 9 1 ( ) Thete Is no RUNSIST bcdiry.
7 11.1(.. ) rhere is no IOCODE insUucllon 7 12 1( ) There is no USERCOOE instrucrlon 81 1 (0) There is no d~vlc~ r~gi51 8 2 1 (c) Guuanteee lor all puolic ~ns ructions The ap;arenr ~ngtn ol ~he path Irom toi ~o tdo may chans~ under c~na arcumstances while privue insuuctlon cod~s r- lotcte~
t 3 1 (d-l) Guuanl~ lor all puDlic inSUucDonS D~t~ may Dt loaaed al limeS otner Ihan on tne rising dg~ ot tck Whii- Cnvue inSUuctions codes ar~ lo~d-d 10.4.1(e) During I~TEST Ihe sy5t-m clock p~n must 0- conrroll-d xtunally 10 6 1 (c) Dunng INTEsT~ output pins u- controlled 0y C~u snitt-o in via tdi T~bl- a. 8 2 JTaG Rul-~
A 8 2 2 R--co~----nd~tion~
n l ~ c ~c ~
32 1 (b) tClt 15 ~ h;~ tu~ CMOS inpuL
3 3 1 (c) tms n s a hlgn; ~C ~ ~. pull up 3 6 1 (d~ (Appli-~ Io us o~ cnip) 3 7 ~ (APDli-5 lo u~ o~ cnip) 6 1 1(-) Th- SAMPLEIPRELOAD instrucllon code Is loaea eurmg C~ptur~lR
7 2 1 ~i~ Th- INTE5T instrucwn u 5upport-o.
7.7.1(9) Zero5 are lojoe~ u syst~m output plAS r~unng EXTcST
7.7.2~h~ All sysîem outputs may 0e S~l hiSI~ m~ ~ ~ce 7 3 ~ (f) Zeros are loaoe~ al sys em inpul Clns eur~ng ~ Sr 8 1 1 (e e~ ~esl9n~s3ecl~ic tes~ ea~a reglslerS are nol ~u~bcly ac:ess ~e Table A.8.3 Recommendations met 21~5221 O ',~
10.4.1(~) During EXTEST ~ s~ drhl n hto ~ on~hip logic Irom th- sysm clock pin is tl~t ~Ibd ~t m~

Tabl- A 8 ~ R-couo-nd~tion~ not i~pl-~-nt-~

A 8 2 3 P-rmi~ion~

r,, 3.2. 1 (C) 61~L ~ or ~11 put~liC in5trucDons~
6 1 1 (r) ~o instrucDon r~t4t r is not w d lo c pturo d-slgn sPlnc .1.'~ . '1.
7 2 1(9) S~ru addition l public ir i ~ ~ u- provid~
7 3 1 (a) - S-v~l pnv~t instn~ctbn co~ u uloc~tsd 7 3 1 (c) (Rul-?) Such r ~ ~Doro cod s u docum-nt~
7.4.1(~) ~ddition-lcod sp Itorrnid-nticulytoEypAss 1 û 1 1 (i) E~ch outPut pin h-~ it~ o~n ~ ~U conttol 10 3.1 (h) ~ pu~ tch is provid d 10.3.1 (i,j) Ounng EXTEST input p~ns u- controll d by O~U snitted in vla t~l.
10 6 1 (d c) S sUU cdls u- not lorc d in~ct~ in th- Tasl Loglc R~set st~ .

Tabl- A 8 5 P-rmi~sion~ ~-t 21~S221 SECT~O~ A.9 Spatial Decoder 30 MH, operation Decodes MPEG, JPEG & H.261 Coded data rates to 25 Mb/s Video data rates to 21 MB/s Flexible chroma sampling formats Full JPEG baseline decoding Glue-less DRAM interface Single +5V supply 208 pin PQFP package Max. power dissipation 2.5W
Independent coded data and decoder clocks Uses standard page mode DRAM
The Spatial Decoder is a configurable VLSI decoder chip for use in a variety of JPEG, MPEG and H.261 picture and video decoding applications.
In a minimum configuration, with no off-chip DRAM, the Spatial Decoder is a single chip, high speed JPEG decoder.
Adding DRAM allows the Spatial Decoder to decode JPEG
encoded video pictures. 720x480, 30Hz, 4:2:2 "JPEG video"
can be decoded in real-time.
With the Temporal Decoder Temporal Decoder the Spatial Decoder can be used to decode H.261 and MPEG (as well as JPEG). 704x480, 30Hz, 4:2:0 MPEG video can be decoded.
Again, the above values are merely illustrative, by way of example and not necessarily by way of limitation, of typical values for one embodiment in accordance with the present invention. Accordingly, those of ordinary skill in the art will appreciate that other values and/or ranges may be used.

- 21~5221 1 `Spatii~l D-cod-r Signals Signal N~rn UO Pin NutnO r ~ th ~
c30~C cloc~l 1 182 Coda O~Ut Potl Uxd lo suDO~y codeC_C~ta[70] 1 172,171,169 166~167~l66 164 cod dd~t wTokens~o~eSp 1~1 163 t lo~der oaed-enn 1 174 S soc~onsAlO 1 ar,d cod~d_v71;d 1 162 coC~t~_~cc~pl O 161 ~4 1 ~yte_moCe 1 176 en-DI-[l 01 î 126, 127 ~icro Proct~or Inl~ ce (MP~) r~ 1 12S
~ddr[6 01 1 136, 13S, 133, 132, 131, 130, 12e C~U[7 l 0 152, 151, 149, 147, 145, 143, 141, 5~ ~c~on ~6 1 rq O 154 DR~M_d~U(31 01 1~ 15, 17, 19, 20, 22, 25, 27, 30, 31, 5R~l ln~c~
33,35,38,39,42,44,4~,49,57, ss,61,63.66,6s.70.n,74,~6, Se ~ction ~52 79, 81, 63, U, 05 DR~M_~ddr~10 0] O 1U, 186, 1~, 1B9, 192 193, 195 197, 19g, 200, 203 ~ O 11 i5~[3 01 0 2, ~, 6, ;~E o 12 i5~ 0 2~4 DRAM_en~Dle I 112 out_c~u~ll l O ~, ~g, 90, 92 93, 94, 9S, 97, g~ olnput Po~
out_enn O 67 S-e s c~on ~ 4 1 cut_valid 0 99 ou:_~c:epl 1 100 1cl~ 1 115 IT~G porL
t-~ 1 116 See s~c~on ~-~ O 120 trs 1 117 t~l 1 121 TaDle A 9 1 S~attal Decoder signals Sign~l N~U~ Pin Numbe C)escnDllon ~cod r_dockI 177 Th~ mitm dooer clock S~ #CDon ~.~
r-Set I160 R SeL
Table A.9.1 Spatial Decode- signais (contd) Signal Nuno UO Pin Num C~
tphObh I1~ It ov rrido 1 tJl n tphOish ~nd tph 1 ish Ue tph1ish 1 123 inpu~ 1 b~ on-chip Iwo ph~ clock ov rrid- 1 110 for nom~ l owr~bon s I ov-rride O
tphOhh ~d tph1 ;sh u ignored (so connect to GN~ ~ VDO~
chipl st 1 111 S-l ehlpt~t O tor normal opention tloop I114 Conn ct tO GND or VOO duing normal OP~tjon.
ramtfft 1 109 11 nmt~t 1 t~l ol th- on-chip i~AMs 6 n~bd S-t nmlfft O tot normal o~ranon P~ hCt I 178 It Pll#ba . 0 ~t On-ChlP Ph C~ locke~
boo~ r di~ol d S-l pll#ba 1 lor norrnal oDerabon ti 1 180 Two c~s r quir~ hy ~e DRAM inlerlace lq 1 179 during lest op~ abon Conr~ect to GND or v~D ouing normal operaDon, pooul 0207 T~se rwo pins are conne_ ~, lor an pdin 1206 e~erna finer Iw tne ~hase loc~ loop Tabk A.9.2 Spatial Dec~der Test signals 59n~lNam- -~ P~ll SignalN~me Pin Slgn INamePir ¦ s~9nalN~m~ P
nc 208 nc 156 ne 104 I nc S2 les ~,n 207 nc 1 SS nc 103 I nc 5 1 ,es: ~In 206 , cl 154 ne 102 ¦nc 50 GND 205 ne 153 VDO 101 DRAM_eata[lS; 43 OE 204 dataf71 152 o~_a-- 100 nc 48 ORAM-adclrlol 203 d~t~f6] 151 out_v41id 99 DRAM Ca;afl6¦ 147 VOO 202 nc 150 out_dat f01 98 ne ~46 nc 201 datafS] 149 out_claU¦'¦ 97 GNO 14S
ORAM_~eCr~l j 200 ne 148 GND 96 ORAM_eaufl7~ !44 ORAM_addrt2] 199 dal~ 147 out_data~2~ 95 ne 43 GNO 198 GNO 146 out_d-t p] 94 DRAM_daufl81 42 oRAM-addrt3l 197 data(3] 145 out_data[4] 93 VOo 41 nc 196 ne ~-4 o t_r~ ~tSI 92 ne 40 ORAM_~Od~t41 195 duat21 143 VOO 9~ DR~M_dJu(19l 39 VOO 194 ne 142 out_d-t f61 90 DRAM_data(201 38 ORAM-acldr(sl 193 d t~[tl 141 a~t_d ta~7¦ 89 ne 3 ORAM_ar~drt6] 192 d~t~fOI 1~0 out_d t~f81 S8 GNo 36 nc 191 ne 139 out_extn 87 ORAM_ctataf21] 3S
GND 190 VOO 138 GND 86 nc 34 ORAM_~clCrpl 189 ne 137 DRAM-duAtol 85 ORAM_C~t~(22] '3 ORAM-acd~8l188 addrt61 136 DRAM_d t~tll 84 VOO 32 VOO 187 ~q 13S DR~M_rJu if21 83 DRAM_ctau(231 3' ORAM_~Od~(9] 186 GNO 134 VDD 82 DRAM_dataf241 30 nc 18S ~ddrt41 133 DRAM_d-t f31 81 nc 29 ORAU_adar~l01 18< ddrt31 132 ne 80 GNO 23 GNO 183 ddrt21 131 DRAM-dt~u(4l ~g ORAM_eau(251 27 cocla-ctocl~ 182 ~ddltll 130 GNo 78 nc 26 VOO 181 VDD 129 nc 77 DRAM-dau(26l 25 test_ln 180 addrtl 128 DRAM_data(S] 76 ne 24 leSt ~In 179 enaD~-[O) 127 nc ~5 VOO 23 tesl ~In 178 enaD~ 126 DRAM_cl t (6] 74 ORAM_eataf2'] 22 eecoee~ oc~t 177 ~ 12S vOO '3 nc 2 ~yt~_~noee 176 GNO t24 oRAM_C~Uf71 72 DRAM_o~ 231 28 jGND ! t75 jlest ~n 123 nc 71 DRAM_Ca~291 IS
jcoae~_e~n 1174 Ite~lDm 122 DRAM_~at f8~ ~0 GNO ~c Table A.9.3 Spatial Decoder Pin Assignments Sign l N~ Pin Siglul N~ Pin S~nal Nan~e ? n S~nal Narne Pln nc 208 nc 156 nc 1 G4 nc 52 test pin 201 K 155 nc l 03 nc S I
t s~pin 206 tr~ 154 nc 102 nc 50 GND 205 nc 1S3 VW 10~ DRAM-d~ta(1si 49 OE 204 CJt 171 152 out_acce5t lC0 nc 43 DRAM_-ddr(0l 203 d4U(61 151 ou~_valid 99 OR~M-daull6l 47 VDD 202 nc 150 out_~atat01 98 nc 46 K 201 d t~tS] 149 out_rt7ta[1] 92 GNo 45 DRAM-~ddrl1l 200 nc 148 GNo 96 oRAM-d~a~ 41 DRAM_addr~2] 199 d t~41 147 out_dtt-~21 9S nc 43 GND 198 GNO 146 out_d4;~31 94 DR~M_d ta(181 42 DRAM_~dC~(31 197 dat~31 145 out_~u~41 93 VOO 41 nc 196 nc 144 out_~t lS] 92 nc 4o DR~M_addrt4l 1gS d t~(21 143 VDO 91 DR~M_d tU~191 39VDO 194 K 142 ou~dat~61 90 OFlAM_d ta(20] 38 D~ht_~ddr~S~ 193 dU-[l] 141 out_d t~ 89 nc 3 DRAM_aadr(6] 192 d~Ol lJO out_dat~81 88 GNo 36 K 191 nc 139 out~ ~nr 87 DRAM_d a~211 35 GNO 190 VDO 138 GNO 86 nc 34 ORuht-~dd~i 189 nc 137 ORAM_d ta(OI 85 DRAM_d a~22¦ 33 DRAM_~ddrp] 188 uldrp] 136 DRAM_~U~11 84 VDO 32 VOO 187 oddrtS] 135 ORAM_d t 121 83 ORAM_o t~231 31 DR~t~t_~dd~91 186 GNO 134 VOO 82 DR~M_d~o~2~] 30 nc 18S d~l 133 ORAM_d U~31 81 nc 29 DP~l_ ~drllO~ tl 132 nc 80 GND 28 GND 183 ddrl21 131 DRAM_d tal4 79 DRAM_C~t~125] 27 co~ed_clock 182 ~11 130 GND 78 nc 26 VOO 181 VDO 129 nc 77 ORAM_d tal26] 25 teslDin 180 U~f01 128 ORAM_datalSl 76 ~c 2~
tesl pin 179 4~1~tl~clOI 127 nc 75 VOD 23 t slDin 179 ~(1] 126 DRAM_d t~l6l 74 ORAll_dU~[27~ 22 rJecod r_clocl~ 177 rw 125 VDD 73 nc 2 t~e_rnoae 176 GND 124 OR~M Cata~7i 72 DRAM-datal29l ~;r GNO 175 leS~ pln 123 nc 71 ! c~AM_aa;a2gi cr~d_e~ 174 l~t ~in 122 0RAM-aalal8l 70 1 G~
Tabie A.9.3 Spatial Decoder Pin Assignments S-gnal NVT~C ~tn S~l N~me Pin Slgn~l N~rrl~ ~ n Slgnal ~rre Pln ~:c 173 ~st 121 GND 69 o~AM_s~u(301 17 coee~_5~t-~71172 t~o 120 OR~ht_dJ~9¦ 68 nc 16 coee5_W~(6i 171 nc 119 nc 67 cR~M-s~l~plJ 15 vOO 170 V00 11a OR~M-d4ut1ol 66 ~D0 14 coses c~ta(sl 169 Im 117 VD0 65 ~c 13 s_ut4(4l 168 Idl 116 nc 6. WE 12 caC-s_~31 167 ~d~ 115 DR~ U~ 63 R~ 1 l coee5_~t~21 166 ~ pin 114 x 62 nc 10 GND 16S GN0 113 OR,~M_~(121 61 GN0 9 coCed_54;4~1¦ 16~ OR~_etubb 112 GN0 60 ~1 9 coC~_~I~OI 163 ~t pin 111 0~4_d~U1131 59 nc coses_v~ 162 t t pin 110 nc 58 ~ 6 co5~5_ ccep~161 Iestpin 109 O~_d-~14] 57 vO0 5 rC#I 160 nc 106 VDD j6 ~;21 vOO 15~ ne 107 ne 55 nc 3 nc 158 rc 106 nc 5~ ;31 2 nc 157 nc 10S x 53 nc Tabl- A.9.3 Spatial D-cod~r Pin Assignmcnts (contd) A.9.1.1 "nc" no conn-ct pins The pins labeled nc in Table A.9.3 are not currently used these pins should be left unconnected.
A.9.1.2 V~ and GND pins As ~ill be appreciated by one of ordinary skill in the art, all the Vl~,, and GND pins provided should be connected to the appropriate power supply. Correct device operat-cn -214~221 canno~-~be ensured unless all the V~ and GND pins are correctly used.
A.9.1.3 T-st pin conn-ctionQ for normal operation Nine pins on the Spatial Decoder are reserved for S internal test use.

Pin nu~r Connllon Connoet to G~O lor norm~l oD~rauon Connocl tO VOo lor norm~l ot~r~Uon L ~v Open C~ DI tor morma ooe-allon Ta~le A.9.4 D-f~ult test pin conn-ctions A.9.1.4 JTAG pins for normal op-ration See section A.8.1.

~ 21~221 A 9 2 ~ ti~l D-cod-r m-mory map Addr. (h~x) R~t ~ o S-- t~
0~00 .. 0~ r~ . A.9.6 0~ .... 0~07 Input Ckuil ~# A.9.7 0~08 .. OsOf S~ eod~ ~belor r~t~
0~10... 0~1S Su1hr~upcon~ ~t4s A.9.8 0~16 .. 0~1~ Not u~
0~18 .. 0~23 OFI~ h~ 1~, r~t~ A.9.9 0~24... 0~26 1~u1brmu~r~ dk~hohr~gist~-s A.9.IC
-Os27 No~ u~d 0~28 .. 0~2f ~n d cod~ r~gist~ A.g.13 0~30... 0~39 In~#~wnt~rr~gist~n A-914 0~3A ... Os~B Not u~d 0~3C R~d 0~30 ... 0~3F Nol u~d 0~0 ... Ox~F T~st r~t rs Tabk A.9.5 0~ ;c~: o~ Spatial Decoder memory map ~ 2145221 A~C~g"
ster N~ P~g~ tele~ences (h~)num 0~00 7 cnip_ v nt CED_EYENT_0 6 nol us d S llbg~l_bngs~_count_ v n~
Sco-luEGAL-LENGrl~t-couNr 4 rt~rv-d rr~y r~d I or 0 SCO_JPEG_OVERUPPlNG_STARr 3 o~ '~ st t_evenl Sco-NalN-JpEQovE~L~pplNG-sTARr 2 ,r3~ Urt_ v nt SCO_UNRECOGNISEO_START
rtop_ett r_pictur-_e~nt SCO_STOP_AFTER_PtCTURE
0 non_~llgn d_~t~rt_ewnt SCO_NON_ALR~VEO_ST~RT
0~01 7 c~lp_tn~CED ~AS~O
6 not u#d 5 llbg~l_bngt~_count_m~k 4 r~rv d ~rit O lo this ~tion Sco-JpEG-ovERupptNG-sTART
3 nonJp~ t~rt_me~k 2 L _ ;'- ~_~n_m~t ~top_dl~r_plctur_m~
O non_nlign d_~t~rt_m~
0~02 7 Idct_too_te~_~nt tOCT OEff NUM
6 idct_too_m~ny_~nl IOCT SUPER_NUM
S ~c~pt_ n~bh_even~ SS_STRE~vt_E~O_EVENr a~t-m~t-ev nt ES_ T~UtGET MET EVENT
3 counter_ttu~h d_too_ ~rty ~nt ES_FLUSH_BEFORE TARGET_ MEr EVENT
2 counler_tlu~ ~_ewntES_FLUSH f`YENT
~r~r_event OEMUX_EVENT
o ~uttm~n_event HUFFMAN_tVENT
Table A.9.6 Intenupt service area registers ArJ~r ~n Rc~or N~ P~g~ nl r nc~
(h~) nulTL
0~ lela_too_~ ,k 6 ida-too-mcn~-mn S C#pt_ lUOh_m~
4 1~ t_m t_mnk eount-t_nu-~d_too_~rly_~ k 2 counr_~lu~hcd_me~k p r~r_mnk O ~utlmon_mo~k T~bl- A 9 6 Int-rrupt s-rvic- ~r-~ r-gi~t-r~ (contd) -` ` 214522~

ACa~. ~a R gist-r Nun~ Page rd-rencas (hex) num 0~04 7 cod C_Ousy 6 an Ob_mpl_lnpul S eod d_e~n 4-o nol U#d 0~05 7:0 codl_CaU
0~06 7 0 non~c 0~07 7 0 not u#d 0~08 7:1 not uZZ~C
O svt-codo-~aor-a Iso input_d~_~s CED_SCO_ACCESS
0~09 7:4 not~u~ CED_SCD_C0~7~OL
3 ~Sop_~t_pk~
2 di~rd_~lon_~ta dl~r~_us r_~u 0 Ignor_~ _ali~ ~
O~A 7 5 nol UUZd CEO_SCO_S7~TV5 in~n_s queZncu_surt 3 ai~_a 2-0 s~rt_co~_~Zrct~
Table A.9.7 Start code detector and input circuit r~g.,le.s ACCrBd Rqist r N~me p~go r t-r-nc S
~c~)nurn 0~087 0 T st r~t r l ngth_count O~OC7:0 O~otD 7 not u#d sUrl_codo_~cto_coding_suno~rd O~OE7 0 ~U t_nlu O~OF7 4 not u#d 3 0 plc~_numb r Table A.9.7 Statt code detector and in~ut Circuit re~istcirs (contd) AcdrBit R gist r N~rno ~9e rder-nces (hcx) nurrL
0~107 1 nolu#d O so~tup_ o~s CED_8S_~CCESS
0~1173 notu~d 2 0 bit_counl_pnnK~io CED_8S_PRESCALE
0~12 7 0 bit_count_urpt CED_~S_rARGET
0~13 7 0 bit_count CEO_8S_COUNT
0~ 7 1 not us c 0 ottchip_qu u CED_8S_OUEUE
0~15 71 notus c o cn~o~c_str_m CEo-8s-ENA8LE-NxJ-sTM
Table A.9.8 8uner start-up resi,lers Ar~r~r. Bil R~t~r N~me P~ge references num.
0~18 7:5 not u~d 4:0 p~gc_~n_l ngth CEO_/T ~G~_SrA~r_LENG7~/
O~tg 7:4 nct us~d 3:0 r-~d_qcte_l ngth o~lA 7:4 r~ot 3:0 ~nit_c~cb_t ng~
Tabk A.9.9 DRAbl;nt~ ~eeconf;g~ t ~ ,e `~ 2145221 ArJar ~it P gi5t r NUT1- p~ge reler~nc~S
(hcS) nurr 0~1 i3 7 ~ no~
3 0 rclrc-i7_cycb_bngtt O~lC 74 notu#d 3 0 C~S_hlling 0~1D 74 no~u~
3 0 RAS_hlling 0~1 E 7 1~1 uud O Inl~hco_Umln9_~cc-~s O~ l F 7 0 ~ inl-~l O 0 7 nolus d 6 4 DR~ trengtll[2 0 3 1 CAS_~ ,~t~ 0]
O R~S_~ng~l2 0~ 6 ~S_~ng~11 0 53 O~WE_ ~ _ t2 0 2 0 DRAI1~ t~
0 7~ 7 ACCESsl~it br~ ?nol us dCED_DR~U_CONflGUAE
6 ~ero_b~t n S ~A~_en t~b no_r~h 3 " ro~_~ J~ ~ _t 1 0 10 ORA~_~_~dthll 0l 0 3 7~0 T t r~rs CED_PLL,AfS_CO~JflG
TableA.9.9 DRAU j"t~ r econfigurationr~g;~l_.s (contd) ~r i3it ~gi~t N~ R~oe relerenct5 (he~) num 0~4 71 nol t~d O br~ltl r_mc~g-r_4cce~
0~757 6 nolt#ed 5 0 bu~l r~ g r_t~hol-_~aar~s~
0~267 0 buSt-r_n~-n g~r-lc~no~--~ ¦
Table A.9.10 But/er manager access and keyhole registers ~r.
R gi t t N~ ~9~ r~l-r~
(h) num Ox~O 7 o nol us d 0x01 72 1 0 cdO_~o Os02 ~ O
0x03 7D
0x04 70 nolus d O~tOS ~
1.0 c~b_longU
Ox06 7.0 oxo7 7:0 0x08 7 0 not us~d Ox09 7 0 cdO_t d 0~0~ 7 0 OxO~ 7Ø
OxOC 70 notu~ d OxOO 7 0 dO_numO lr 0x0E 7 0 0~0F 7 0 0x 10 7 0 not u~d 0~11 7:0 t~ #
0x12 7D
0x13 7 0 Ox1-70 notu~d Ox15 70 ~_~
0x16 7 Ox17 7 0 0x18 70 nolu#d 0~19 70 tO_r d 0~1A 70 0x1B 70 0x1C 70 nolus d o~ l D 7 0 1~_num~et 0~1E 70 0~1F 70 Tab~e A.9.11 Butter manager e~cnded address space _ ` 2145221 . i~t ~egisler ~lame Page re~er-nces t~) num 0~20 7 0 nol u~d 0~1 7 0 butl r_limit 0~ O
0~23 7 0 0~24 7 4 notus d 3 aJb_~uli 2 cdb_smpty tb_tull 0 tb_cmpty Table A.9.11 3uffer ,..~l~ger extended address spac~ (contd) dr.i3it R~ist t N~ P~gc tc/-ntlc s ~h~)nurrL
0~g13 7 i _~1- ~ CEO_tt_CrRL~77 6 4 huttm n_ rtJt_tde 2 01 CEO_H_CrRL16 ~1 3 0 pri~ls butlttl n conttol bits 131 s l-ets sp ei~l C8P 12~ ~ 416 bit fi~ d length C8P
0~ 7 0 p t#t_ 70t_cod CED_H_DMUX_ERR
0~ 7 4 notus d 3D d-mu~_k~ho~-_satJrffs ~2i3 7~ CED_~ KE~ LE_~OO~
0~2C 7~ t~mu~_icr~hdb_ds~ CED_H_~EYHOLE
O~D 7 dunnny_~t~e~ro CED_H_ALU_REG0.
r_dur~_lcst ~ _bir 6 fr ~_lnto CEO_H_ALU_REG0,t_ficld_in~o_or~
5 1 nol u~d 0 contlnu CED_H_ALU_REG0.r_cont~nue_on O~E 7 0 rom_r v~on CEO_H ALU_REG1 Os2F 70 plvs~ t t Tabb A.9.12 Video demux registers ~cr. B~t Re~u rNuT- R~ger~
(~e~) num o~f ~ CED-H-TRAcE-EvENTwn~1tos~g~step~ono w~tt~r~cw~ nth< Sl p ~ ncomp~l~
6 CEO_H_TRACE_~ASK #lloonetoenlet~ngle st-pmx S cED-H-TRAcE-RsTpu~r~ ns~uenc~
1.0 40 ~UC

T~ble A. 9 .12 Vid-o d-mu~c r-gi~t-rs ~contd) ACCt. Bit R~gist~r N~ F~g~ teletenc~5 ( h~ ) nu~
C~OO 7:0 nol vsed O~OF
0~10 7:0 hork_p-ls ~ hcriz_oei5 0~11 7.~
0~12 7:0 v-~t~l~ ~_v~ls 0~13 7:~
0~1~ 7 '~ nol u~
10 buth-_si~ ~ bun~ st~
0~157 0 0~167:4 notu~ d 3:0 p l_#p~ct r~/_~a 0~17 7 nol t~d 1~0 bit_r te r_~ te 0~167:0 0~197:0 0~1 A 7:4 nol u~d 3 0 plc_nte r_~ic_~l~
0~187:1 ~olus d O ~ _ 01 1 C 7 0 p~ qp-0~107:0 h261~c_qp Table A.9.13 Video demux extended address s~ce ~Sheet 1 of 8) 21~5221 , ACCr, 8it , - Pogist rN~ Page relerences (h~) nul L
0~1 E 7~ not u~d 1 0 broen_closeC
0~1F 75 notw d 40 pr dieUon_mode 0~0 7 O vbv_dd~
0~1 70 0~22 70 priv~teregistMpEG hJll~ wd JPEG
p-ndinv ~me_ch~nge Ox23 7 0 pri~ts regist r MDEG tun~i-bwd~ JPEG
restu~_inde~
Ox24 7 0 pnv~te r-gist r horiz_mb_copy 0~25 70 plc_numo r 0~26 71 not u#d 1 0 m~_h Ox27 71 not u~d 1 0 m~_v o~2~ 7 0 priv~t r~t~r xruch1 Q~ 7 0 pnv~t r~ t~r xr~tch2 0~2A 7 0 p~te r gist r scr~3 0~28 7 0 ~ MPEG uu~dl, H261 rgob 0~2C 70 prN t r~t rblPEG h~roup,JPEG llnt_sc-n 0~20 7 0 priv~e r~tsr MPEG in_~re 0~ 7 dumm~_l~t~etur r_rom_c~
6 t;eld_lnto 51 not us d O eondnu O~F7 0 rom_r~hion 0230 7 ~ notus d 1 0 dc_hut~_0 Ox31 7~ notus d 1 0 dc_hu~_1 0~32 7'~
1 :0 dc_hun_2 Tab~e A 913 Video demux extenrJeC address space (Sheet 2 ot ô) - 21~5221 Aodr. eit -- F-gist~r N~ p~5~ ~eterences (h~) ~
O~t3 7 2 nol u#d 1 D dc_~tutt_3 0~3~ 72 notW d 1 D CC_hun_O
0~35 7 2 not t~d 1 :0 C_hun_1 Ox36 7 2 notus d 1 0 ~c_llutl_2 0~37 7 2 notus~d 1 0 ~C_hUn_3 0~38 ~ 2 not us o 1 0 t~_O r t~_O
0~39 7 2 not u~o 1.0 t~l r_ttL 1 0~ 7 2 notus d 1 0 t~_2 r_t~2 0s3~ 7 2 not uS~
1 0 tq_3 r tt 3 0~3C 7D c "r ~t_nune_O r_c_O
Ox30 70 , a_n~_1 r_c_~
Os3E 7D ~c , ,t_n-rn-_2 r_c_2 Ox3F 70 e r _n~_3 r_c_3 OX40 ~O pl~t ~ gisto~s ox63 0~40 ~ O r_tlc_pr d_O
0~41 7~0 0~42 7 0 r_dc~red_1 0~--3 7 0 0~ 7D r_dc_pred_2 0~5 7 0 0~46 7 0 r_tlc~r d_3 0~7 7 0 01~8 7:0 r~
O~-IF
Ta~e A.9.13 Video demux e~tended address space (Sheet 3 of 8) ' - `

Ar~'Cr 3~ft Regfffstfor Ns,mt~t~
f (f~f~S) nf~ff~L
OsSO 7.0 r_~fr~v_r ~sS1 ~:0 0~52 7.~0 t cf~r~v_rr 0~53 7D
O~S~ 7D r cfrcv-rn~
O~Si 7D
0~56 7:0 r cfrcv_.~b 0~57 7:0 0~5e, 7D not ~d O~SF
O~SO 7 0 r_,~lcfr~2_,T.~fcnt 0s6t 7D
0~62 7D r_vf~_~n~ent 0~53 7 0 0~64 7:0 horr~ t~ r_hori7_fmO5 Os65 7D
0So6 7 0 v ~n_. ~fff ~ r_vftf~_Tbs 0~67 7D
0~6~ 7D ~h~tfr~fi,5t<frr_rf,~ur_cn Ox69 7 0 0~6A 7.0 rurt_lntfff~l r_rftf,5tut_int oSsa 7D
0~6C 7.0 f~rivs,t~tff rfe9ist r_~Ut~_~f_cnt 0~0 7D f~tfr~f~b~t,t,r,rr_~tf~._v_crft 0s6E 7.0 pfrrvfct~fl, rf 9f~St r_ccrn~d Os6F 7D fmLr_~ _id r_~7u~_cffffr~ffc Os70 7 0 coding_sund~o~ d r_,d~std Os71 7:0 ~ tcrfcgiSUfr rJ~ n m Os72 7D f~ttsfrfJ~5tf~tfr r_~,rd_r_se-Os73 7:0 ~nqtfrrq,5tf~r r_'~wd_r_qke Os74 7:0 not f~C
Cs7 ~fs78 72 not fi~fC
UO thfOCt~5_ttf_0 r_~k_.`f_O
Ta~f~e A.9.13 Vi,dec, derr.ux extended address space (Shee~,~ 4 ot 8) ~ 21~5221 ACc~. Eit R gister Nune Fage relerences (hes) num.
Os79 7 2 nol u5~
1:0 blocvs_h_l r_blk_h_1 Os7A 72 nolus d 1.0 bloe~s_h_2 r_blk_tl_2 Os7B 7 2 nol v~d 1:0 block~_h_3 r_blk_h_3 Os7C 7.2 nolu~ d 1 0 blocl~_v_O r_blk_v_O
Os7D 7-2 nol u~d 1:0 block~_v_1 r_blk_v_1 Os7E 7 2 nol L~d 1.0 blocl~s_v_2 r_blk_v_2 Ox7F 7:2 nolus d 1:0 block~_v_3 r_blk_v_3 Os7f 7.0 n~ u~d OxFF
Os100 7 O Cc_biU_0~1S:O] CED_H_KEY-Dc-cpeo Os10f Os110 7:0 Cc_biU_111S:O] CED_H_KEY_DC_CPB1 Osl1F
Osl20 70 nolus d Os1 3F
0s140 7.0 2c-Dits-o~1s:ol CED_H_KEY_~C_CPeO
Os1 4F
051SO 7 O ~c_Dits_1~15:0] CED-H-KEy-~c-cpB1 Os 1 SF
Os160 7:0 nol u#d o517F

Os180 7:0 ~C_2555S_0 CED-H-KEy-2ssss-lNDExo Os~e1 7:0 Cc_2Ssss_1 CED_H_KEY_ZSSSS_INDEX1 0s18~ 7:0 ncl uxc ~ 7 oS'8e 7:0 ~c_eoo_O CED_H_KEY_EOB_INDEXO
Ta~e A.9.13 Video demux extended address spar e (Sheet S ot 6) Aac- Bil F~ gisl r N~ P~9e re~e-exeS
' ~ (~xl n~m.
Os189 70 ~c_ ob_1 CED_H_KEY_EO18_lNOEX
Ox18A 70 notu Ox1 8B
Oxl 8C 7:0 ~c_2rl_0 CED-H-KEy-zf~ NDExo Ox180 ~0 ce_2rl_1 CED-H-KEy-zRL-lNoEx1 Ox18E 7:0 noluS~
Os 1 FF
Ox200 7 O ~c_hut~1_0[161:0] CEO_H_KEY_AC_lTOO_o Ox2AF
Ox2E~0 7 O Cc_hum~SI_O~ O] CED_H_KEY_DC_lTOO_o Ox2Bf 0~2CO ~:0 nol w-d 0~2FF
Ox300 ~ O sc_hum~Sl_l[lC1:0] CED_H_KEY_AC_ITOO_l Ox3AF
Ox390 ~ O ~c_hut~ llll:Ol CED_H_KEY_OC_ITOO_l Ox39F
0~3CO ~.0 nol w-d Os~FF
Ox800 ~ O p~ r~
OL~C
F

Ox800 7D CEO_KEY_TCOEFF_CP9 ox80f Ox810 7 O CED_KEY_C9P_CP9 Os8 1 F
Ox820 7:0 CED_KEY_~19~_CPB
Os82F
Os830 7:0 CED_KEY_MVO_CP9 Os83F
Os840 7:0 CED_KEY_MTYPE_I_CPB
0s94F
Tab~e A.9.13 V;deo demux extended address space (Shee~ 6 of 8) 21~221 Al~Cr Ba R-9rs~el N~ P~;e re~e~er~C~S
~e~ nunL
o~eso 7:0 CED_KEY_MTYpE-p-cpB
0~65F
C~860 7:0 CED_KEY_MTYPE_3_CP~
o~e6F
o~e70 70 CED_KEY_MTYPE_H261_CPC
0~F
0~8eo 70 notu~
0~900 0~901 7:0 CED_KEY_HDSTFIOM_O
0~02 70 CED_KEY_HOSTROM_1 0~03 7:0 CED_KEY_HDSTROM_2 0~0F
0~10 7D notu~

F

O~AC 70 CED_KEY_DUX_WORD_0 o O~C 7 0 CED_KEY_DMX_WOf'~D_l 0xAC 70 CED_KEY_DMX_WORD_2 O~AC 7:0 CED_KEY_oMX_WORD_3 O~C 70 CED KEY_DMX wORD 4 0~AC 7:0 CED_KEY_DMX_WO~D_5 S
0~AC 7:0 CED_KEY_DMX_WORD_6 ~AC 7:0 CFD_KEY_DMX_WO~D_7 Table A.9.13 V~deo demux e~ended address space (Sheet 7 of c) Ar~ Bit Register N;n~e ~aSe reteterlces (t~e~) nurn O~C 7 0 CED_KEY_DMX_WORO_3 O~AC 7:0 CED_KEY_CMX_wORo_g 0xAC 7 0 nol used O~AC
B

0~AC 7 0 CED_KEY_D AX_AlNCR
C

OXAC 7:0 D

0~AC 7 0 CED_KEY_DhiX_CC
E

0~AC 7 0 F

Table A.9.13 Video demux esb~hd~d address space (Sheet 8 of 8) Aac r Bit R~t r N~ ~age relerences (he~nurrL
7 1 nol u#d 0~3071 not u#d O ~ cr;~
0~31 7 2 nol us d io e~ting_~t n~ d Os32 75 notu#d ~:0 lesl r giSter i~
0~33 72 nolus d 1 0 I~St register i~
0~3~ 72 not U#~
1 0 lest reg ster inver#_qwntiser_prer~iction_moae 0~35 7 0 1_1 reg~ter jpec ;~d; ~_tion Tab~e A.g.14 Inverse quantiser recisters _ 2I45221 AoCr 91t Rsglstsr Narn- Pa5e rel~ence5 (h-x) num Ox36 7 2 noluseC
10 last re~ls;ar mp-g_ n~ ~Ction Ox37 7 0 not uS~d Ox38 7 0 i~_UCI-_t~ynol-_~CCrsss Ox39 7 0 Iq_t~ a~nol-_CaU

T~bl- A 9 1~ Inv-r~- qu~ntiz-r r-gi~t-r~ (contd) ACCr.
Registu Nams Pa5e re~-rences (h-x) OxOO Ox3F JPEG Ir~v n- cuantlsatJon UDI- 0 MPEG C-t-Un intra U~l-Ox'0 0~7F JPEG Inverso qWntls~tlon UC's 1 MPEG d-~ault non-~nUa UCls Ox80 Ox9F JPEG Invers- qu~ntlsa~on UCIS 2 MPEG C: m !C~ intra Ubl-OxCO O~FF JPEG Inv5rsc Cuan~satlon taC'- 3 MPEG ;U~ n !C~ non intra UC's Tabl~ A 9 15 Iq tabl- xt-nd-d addr~ cp~ce 214~221 SECT~ A.10 Coded data input The system in accordance with the present invention, must know what video standard is being input for processing. Thereafter, the system can accept either pre-existing Tokens or raw byte data which is then placed intoTokens by the Start Code Detector.
Consequently, coded data and configuration Tokens can be supplied to the Spatial Decoder via two routes:
The coded data input port The microprocessor interface (MPI) The choice over which route(s) to use will depend upon the application and system environment. For example, at low data rates it might be possible to use a single microprocessor to both control the decoder chip-set and to do the system bitstream de-multiplexing. In this case, it may be possible to do the coded data input via the MPI.
Alternatively, a high coded data rate might require that coded data be supplied via the coded data port.
In some applications it may be appropriate to employee a mixture of MPI and coded data port input.

~145221 A. 10. ~ cod~d d~t~ port Input /
Sign i Num- O
Output coC-d_clocl~ Input A cbdt o~ting at uo to 30 MH2 controlling the op nttion o~ the input ci cuit coded_dsu[? OI Input Th- st ndud 11 wires r~uir d to lmDlemen~ a cod d_-~ttn Inout Tol~ n Pon t _' " ~ ~ bit data value5 See sec~on cod-d nlidInput A.-, tot tU~ H ctrical ~ ~ ~ an of ;his co~d_accapt Output intt~
Citwits ot~ chio rnust paclt-g- ~e codeC data Irto Tok-nt~
byt-_mod Input Wh-n hi~h this t~gn l indicu-s tt~al Inl~, at,en Isto tr~t n d ~cto~ th- cod d daU oort In o~e mo~ rat~t t~n roken morJe Tabl- A. 10 .1 Cod~ t~ port ~ignal~

The c~ded data port in accordance with the present invention, can be operated in two modes: Token mode and byte mode.

A.10.1.1 Tok-n ~ode In the present invention, if byte mode is low, then the coded data port operates as a Token Port in the normal way and accepts Tokens under the control of coded valid and coded accept. See section A.4 for details of the electrical operation of this interface.
The signal byte mode is sampled at the same time as data [7:0], coded extn and coded valid, i.e., on the rising edge of coded_clock.
A.10.1.2 Byte mode If, however, byte_mode is high, then a byte of data is transferred on data[7:0] under the control of the two wire interface control signals coded valid and coded accept. In this case, coded extn is ignored. The bytes are subsequently assembled on-chip into DATA Tokens until the input mode is changed.
l)First word ("Head") of Token supplied in token mode.
2)Last word of Token supplied (coded extn goes low).
3)First byte of data supplied in byte mode. A new DATA Token is automatically created on-chip.

A.10.2 Supplying d~ta vi~ th~ MPI
Tokens can be supplied to the Spatial decoder via the MPI by accessing the coded data input registers.
A.10.2.1 Writing Token~ via th- MPI
The coded data registers of the present invention are grouped into two bytes in 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.

(Se~T~ble A.9.7).
When confir~ured 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 Ox04 into coded data[7:o]. The start of this new DATA Token then passes into the Spatial Decoder 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, e.g. 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].

R-gistcr nUn- ~ ~ D

coc~5_~rtn 1 ~ Tot~ c~n t~ 5Up~b~ ~O ~ So~ c~cer rw vi~ thO MPI D~ wnting ~o tllose recls ers eoCeC_~t~? 0l 0 coC~tt_t~u~y 1 1 llle st~le ot thls eglster~ mc~ u It ~e r Soatl~l D cod~r is DIe to accec! c~e~s wntten into cod d_C-t~t7 01 Tne vUue 1 indic~tes t~st t~e inte~!~ce !S Dusy snc un~DI- to ccept d~ta 3eh~vloum5 uncelln c i~ ths us r tnes ~o wnte (o codod_ctst~t? Ol w~en co~oC_Dusy -en~Dle-mpl-inpu~ 1 The vuue in tr~ls hrction enU~Ie ~!S etS
~w cont701s w~el~er coCeC C~t~ ~npu c ~- S:ala Dcocer 15 vU, 'De COCeC C~U cor ~^; or Vla ~he MPl (1~, Tat)le ~10 2 Coded data inpUt resisters Eac~ time before writing to coded-data[7:o]~ coded busy should be inspected to see if the interface is ready to accept more data.
A.10.3 Switching b-t~--n input mod-~
Provided suitable precautions are observed, it ispossible to dynamically change the data input mode. In general, the transfer of a Token via any one route should be completed before switching modes.

Prev~ous moce N-n Mo~- B t~l~ViOur 9yte Tok nTh- on~ctlip circultr~ wiU W- tt - Iasl byte suPpiieC , MPI inout ~t- mo~- U th- t st brte oi ~- DATA Token ~a it w~s construcan9 (i s th- ~tn bd wlll b- set ~o t 3-~o~e cc pting the nen Token T~bl- A.10.3 8witching data input mod-s '' 2145221 ;~r~Vlou~ mo~- Ne~t UCC~ av~O~r o~en 3~t~ ~ cn~ o e ~eult~ s~iCo~ng ~e ~o ~en In o ~en ~oCe is les~ t 1~ to~ ~orole! ~~ e Tol~en e Wlttl t~e ~ D~l o~ ttle I~St t~ cr--a~lcn se! o O) t~or~ s~l~e ns eyte moce UPI m~ut Acc~5s tO ,not~ Vl~ tt~ MPI wlll -~ :e ran~e~ l e co~d_Dusy ~11 ~m~m S~t to ) ~l ~e o~c~ ^
ClrCJltl`f suoPIylns ~ Tok~n In ~er ~X- raS
comol~to~ thS Tot~-n (i ~ w~th ~ e~t~ n o~ tt e ast ~yt~ o~ ;."~ i.,r, s t to 0).
MPI ~nou~ 9yt~ rns conuol so~rwtu~ IllU51 h~vS ~ ec ~e MPI inDut Token ~i s ~ ~ s~n bit d t~ s ~yt~
~AI~ t S~t 10 O) t~ors ~n~Ols_rnpi_input s set toO.

Tabl- A.~0.3 Switc~ing data input mod-s (contd) 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 thereafter appended to this DATA Token until the input mode changes. Recall, DATA
Tokens can contain as many bits as are necessary.
The MPI register bit, coded busy, and the signal, coded_accept, indicate on which interface the Spatial decoder is willing to accept data. Correct observation of these signals ensures that no data is lost.
A.10.4 Rat- of acc-pting cod-d data In the present invention, the input circuit passes Tokens to the Start Code Detector (see section A.ll). The Start code Detector analyses data in the DATA Tokens blt , serially. The Detector~s normal rate of - 21~5221 procescing is one bit per clock cycle (of coded_clock).
Accordingly, it will typically decode a byte of coded data every 8 cycles of coded_clock. However, extra processing cycles are occasionally required, e.g., when a non-DATA
Token is supplied or when a start code is encountered in the coded data. When such an event occurs, the Start Code Detector will, for a short time, be unable to accept more information.
After the Start Code Detector, data passes into a first logical coded data buffer. If this buffer fills, then the Start Code Detector will be unable to accept more information.
Consequently, no more coded data (or other Tokens) will be accepted on either the coded data port, or via the MPI, while the Start Code Detector is unable to accept more information. This will be indicated by the state of the signal coded_accept and the register coded busy.
By using coded accept and/or coded busy,the user is guaranteed that no coded information will be lost.
However, as will be appreciated by one of ordinary skill in the art, the system must either be able to buffer newly arriving coded data (or stop new data for arriving) if the Spatial decoder is unable to accept data.
. A.10.5 Cod-d d~ta clock In accordance with the present invention, the coded data port, the input circuit and other functions in the Spatial Decoder are controlled by coded clock. Furthermore, this clock can be asynchronous to the main decoder clock. Data transfer is synchronized to decoder clock on-chip.

SECT~O~ A.ll Start code detector A.ll.l 8tart codes As is well known in the art, MPEG and H.261 coded video streams contain identifiable bit patterns called start codes. A similar function is served in JPEG by marker codes. Start/marker codes identify significant parts of the syntax of the coded data stream. The analysis of start/marker codes performed by the Start Code Detector is the first stage in parsing the coded data. The Start Code Detector is the first block on the Spatial Decoder following the input circuit.
The start/marker code patterns are designed so that they can be identified without decoding the entire bitstream.
Thus, they can be used in accordance with the present invention, to help with error recovery and decoder start-up. The Start Code Detector provides facilities to detect errors in the coded data construction and to assist the start-up of the decoder.
A.1~.2 Start cod- det-ctor r-gist-rs As previously discussed, many of the Start Code Detector registers are in constant use by the Start Code Detector.
So, accessing these registers will be unreliable if the Start Code Detector is processing data. The user is responsible for ensuring that the Start Code Detector is halted before accessing its registers.
The register start code_detector_access is used to halt the Start Code Detector and so allow access to its registers. The Start Code Detector will halt after it generates an interrupt.
There are further constraints on when the start code search and discard all data modes can be initiated. These are described in A.11.8 and A.11.5.1.

21~5221 -Re~istar nam- ~ ~ C-- ."Uon start_cosc_C-t c~or_aCc-# 1 0 Writing 1 ~o tnrs regls;er recuests nat te s a~
~v code d-t clor S10p to allow ac:ess o i s registers T'ne user snoulC ~alt Ut.!;! U~e va e can t~e r~aC irom t~ s resls;emncicauts Sa o~raDon h~ StO~ C antJ access s ~c~ss;s~e T~bl- A 11 1 Qt~rt cod- ~-t-ctor r-gist-rs ~8h--t 1 of 5) Reg~st-r n~me ~ ~ D scn~llon g~l-l-ngtn-count-ev-nt 1 0 An ilbgU length coun~ evenl wlll oc: r It wn~ e ~vr o coding JPEG d~U d ength ccunt 6elC s ill-gsl_bngtn_count_m~sk 1 0 tound curying ~ volu- Iess Inan 2 This shoul~
rv~ only occur ~s th- r sult ot ~n enor in Ihe JFE5 dota It me mask r giSt r is s~o 1 then ~n in~erru U
c~n b- g n-rud ~nd ~e s i~ code delec or ~ilt Stop 9-nsviow tollowlng an error is no~
~ JCt I il this nor is su~o essed (mas~
r~g#t~r s I to 0~ S~e A 11 ' 1 It~ g_ow ~-t g_sun_ev nt 1 0 Itt~codin9st nr~ rdUJPE5 ~tnd~ne rv~ s-qtJ nc- O~FF OI~FF is 'ound while looking !or jp 9_0~t~n_meslt 1 0 rt~rlt-r code thi- ev-nt will occur rw Ttli~ s quence is c legal st~ ng seCuence It tne m~sk r guter is s ~ ~o 1 then ~n inlerru t c~n be generUed ~nd the s~ cor~ detec or v.lll S100. S- ~. 1 1 .4.2 o~_ ~o ~g_son_ v nt 1 0 Ittn cooingst~n~rois MpE5 or ~ 51 anc ~v~ ~n o-s IdGpl~ g stUt cor~ is 'ound whib IOCKI~S
o _ ~; ng_sUn_rnesk 1 0 torost rtco~tnisventwiuocour ll~hernaslt rw regiS~-r is se~ ~o 1 Ulen an In~erruU can De g-neriUed imd ~he staut r;ooe de~ec~or Wlll s ;^
S ~11 4 2 Table A.11.1 Start code ~etector registers (Sheet 2 o~ 5) 21~5221 R-gisler name 9~ Descnpeon S 3 ~ 11 J-~un-event 1 0 It an ~ n~. ," s s ~ s an coCe ls enc:un erea ~w tlli5 r,vent w~ll occur li Lhe rraS~ reçlslems sel un .~ ;n ~c-sun-mnk 1 o ~O 1 then an inUrrU~ can ~- Senera~a anC ~he ,~ stan coCe Cet c~or wlil 5~0~
sun-v~lu~ S ~ rhe s ~n coC- value reaC Irom the ~ns eam s ~O availaDle in the regls~u st~n-valw wnile ~e st~n cOC~ d~lector ~5 halled See A. 11 4.3 Dunng normal OD~ra~ion st n_valu- con~ains th- value ol the most recency decoceC s~ar~
muker COd-On~y the 4 LS9s ot tsun-value are useC Curinç
H~61 oo~raoon rh- 4 MS95 will D~ zero.
stop_atl r_oictu _ v-n~ 1 0 It 1~ rer;ls~er ~top-an~-picture is se~ ~0 1 rw then a sto~ an-~ pictur- even~ will ~e ger-ra~ee stop_a~ter_plcture_n~ak 1 0 ane~ tne end ol a plc~ure has passeC th~ougn rw tn suncoaed-t c~or stop_dter--Dictur- 1 0 It the mas~ register s Sel o 1 tr en an in~erruot rw c n D- generUeC anC tne s an coce ae~ec or will stop S-~ A 11 S 1 ~top_atter_picture COes not reset to 3 atter tn enC ol a P~cture ~as Ceen ae~!ec so ShOulC ~ cl--ued CirecJv Ta~le A.11.1 Start code detector reg-slers (Sheet 3 ot 5 Reg~sur nam~ pt on h ~
non_aligneC_sUrt_even~ 1 0 When ignore_non_~ligneC ~s se~ ~o l s an rw cod s th~t ue not byte aligneC are Igrorec non_sllgneC_sUrt_nUsk 1 0 (treated U normal data~
~w Wnsn i9nore_non_align-d is set ~o 0 ~ 251 ignore_non_align-C 1 0 and MPEG stan coCes wUI be Ce~ec e~
rw regudhs5 ol brte ~ignm-nt anC he non uign-c ~t v nl will be generatec Il tt~o m~ register is set to 1 then the event will cat~ an intanupt and the stan coCe d~t ctor will stop S- A 11 6 Il the coding st nd rd is configureC as .~E~
Igno _non_align~ is ignorect anC ~e non-uign~ sun v nt will n var be g-n-rateo discard_-rtension_CaU 1 1 Wn n the reglstars are s t to 1 e~enslon or n~ us r d-ta thU cannot b- d cr ded by he Ciscar~_u~r_~ 1 1 Spabal Q cod-r is Ciscard-d br the s an coCe n~ ctat ctor S~a A 11 3 3 rJiscarC_all_CaU 1 0 Wnens tto 1 aU ~UanC Toltens are rw Crsc~rd~C by th~ start coC- c~tec:or ~I Is continu s unbl a FLUSH Tol~en is sLFt!ieC or the tegist~ is s~t to O dir ctly The FLUSH Token that resets this recls cr s disc~rd d and not output by ttl- stan coCe det ctor See A ll S
I insen_se~u-nce_sUn 1 1 See ~ll 7 r~
Tab~e A.ll.l Start code detector registers (Sheet 4 ot 5) o Register name e Oescnoscn v~ t~o st rt_cod-_s srctl 3 5 When tnls t~glSt~r Is se~ o 0 ne s an ~de ~v~ Cett~clor operates normalll ~hen set to a ~Igh~r value the sun coCe C-~e~c or ~;s;ar~s data unbl the sp~clfied type o~ s ar c~e !S
dcl c~ed When the spec fi~a s:an :xe s detected Ihe regisler is set ;o C anC r~- ~al OD-r-aon ~ollow5 S~e A 11 3 sun_coC-_ttet<ctor_coCing_sunCerd 2 0 This r gist rconfiguresnlecoeing s;ancar~
rw us~d by th~ sUrt code Ce! c or ~h~ regis;er can be loaded directly or t~y u5ln9 a CODING_STANDARD T~ken Whent~ver the stan code ce! clor ~erera;es a CODING_STANOARD Token (see .11.~.4 it c~ri-s i~s curr-rt coding sundud conngura:en his o~en w~ll th n confitwe Ihe coding sUncarC usetl ty all oth~r p ns o~ tho Cecod~r :tlip-sel See A,21. 1 A. 1 1 .7 picture_numt~ r I 0 E ch tim- me sun coaec ~etector aetecls a ~w picturo sun code in t~e Cat~ strearn (cr t~e H 261 or PEG e~uivt lem~ a PICTURE_START Token Is ~eneralr~
whiCh Carn s ths curr-nt vtlUe 01 picture_num~r This reS~sler Ihen increm nts Table A.11.1 Start coae detector reg;stcrs (Sheet 5 of 5) `- 2145221 R-gist-r nam~ ~ ~ C ~ Iv~

I-ngul_count 16 0 T~u r~U~r conu~ curr<n~ v~lue ol tr~e ~O JPEG bn~ Counl. This r-gist~- 5 t~odi~lec un~r U~ cor~ ol ~- co~ C~ c'xl~ anc t-~ vi- ~ MPI w~e~ ~c sUn cod- d-t~etot i~ stoDD~-T~bl- A.1~.2 8tart cod- d-t-ctor t-st r-gi~t-rs A.~1.3 Conv-rsion of start cod-r to Tok-ns In normal operation the function of the Start Code Detector is to identify start codes in the data stream and to then convert them to the appropriate start code Token.
In the simplest case, data is supplied to the Start code Detector in a single long DATA Token. The output of the Start Code Detector is a number of shorter DATA Tokens interleaved with start code Tokens.
Alternatively, in accordance with the present invention, the input data to the Start Code Detector could be divided up into a number of shorter DATA Tokens. There is no restriction on how the coded data is divided into DATA
Tokens other than that each DATA Token must contain 8 x n bits where n is an integer.
Other Tokens can be supplied directly to the input of the Start Code Detector. In this case, the Tokens are passed through the Start Code Detector with no processing 2/Y~2/

to oth~ ~stages of the Spatial Decoder. These Tokens can only be inserted just before the location of a start code in the coded data.
A.11.3.1 Start code format~
Three different start code formats are recognized by the Start Code Detector of the present invention. This is configured via the register, start_code_detector_coding_standard.

Coding S~nGa~d Slan Code Panem (hex) Siz~ ot stan ~de value MPeG OxO0 OxO0 0x01 cvalue~ 8 bit JPEG OxF; <value~ 8 bit H.261 I:hOO 0~01 <value~ 4 b~t Table A.11.3 Start code formats A.11.3.2 Start code Token equivalent~
~ aving detected a start code, the Start Code Detector studies the value associated with the start code and generates an appropriate Token. In general, the Tokens are named after the relevant MPEG syntax. However, one of ordinary skill in the art will appreciate that the Tokens can follow additional naming formats. The coding standard currently selected configures the relationship between start code value and the Token generated. This relationship is shown in Table A.11.4.

SU~ CoCe Value Sun coce To~on ~onorate~ MPEG H.25~ JP_G JPE5 :
~ x~ x) (he~ a~el PICTURE_START oxoo oxoo 0xDA SGS
SLICE_START ' oxo1 lo oxol to 0xO0 to ~ST~ Io 0xAF oxCC 0xD~ ~S T ?
SEOUENCE_START oxu 0xD8 SOI
SEQUENCE_END 0xB7 0xO9 _OI
GROUP_START 0xB8 oxC0 SoFo~
USER_DATA ox92 0xE0 ~o APPo t 0xEF APPt OxFe COM
EXTENSION_DATA 0xB5 oxcs JPa OxF0~o J~Go 0xFD JPG~ ¦
0x02 ~o ~ES
0x~F
0xC1 IO SOF, IO
0xCB SOF~
0xCC OAC
DHT_MARKER oxc~ D~T
DNL_MARKER oxoc DNL
DaT_MARKER OxD~ DOT
DRI_MARKER oxoo Table A.~1.4 Tokens from start cod- valu-~
a. This Token contains an 8 bit data field which is loaded with a value determined by the start code value. b. Indicates start of baseline DCT encoded data.

21~221 A.11.3~3 Ext-nd-d f-atur-s of t~- coding standards The coding standards provide a number of mechanisms to allow data to be embedded in the data stream whose use is not currently defined by the coding standard. This might be application specific "user data" that provides extra facilities for a particular manufacturer. Alternatively, it might be "extension data". The coding standards authorities reserved the right to use the extension data to add features to the coding standard in the future.
Two distinct mechanisms are employed. JPEG precedes blocks of user and extension data with marker codes.
However, H.261 inserts "extra information" indicated by an extra information bit in the coded data. MPEG can use both these techniques.
In accordance with the present invention, MPEG/JPEG
blocks of user and extension data preceded by start/marker codes can be detected by the Start Code Detector.
H.261/MPEG "extra information" is detected by the Huffman decoder of the present invention. See A.14.7, "Receiving Extra Information".
The registers, discard extension data and discard user data, allow the Start Code Detector to be configured to discard user data and extension data. If this data is not discarded at the Start Code Detector it can be accessed when it reaches the Video Demux see A.14.6, "Receiving User and Extension data".
The Spatial Decoder of the present invention supports the baseline features of JPEG. The non-baseline features of JPEG are viewed as extension data by the Spatial Decoder. So, all JPEG marker codes that precede data for non-baseline JPEG are treated as extension data.

a. ~1 . 3.4 JP~ T~bl- d-fi~t~o~-JPEG ~upports down loaded Huffman and guantizer tables.
In JPEG data, the definition of these tables is preceded by the marker codes DNL and DQT. The Start Code Detector generates the Tokens DHT MARKER and DQT MARKER when these marker codes are detected. These Tokens indicate to the Video Demux that the DATA Token which follows contains coded data describing Huffman or quantizer table (using the formats described in JPEG).
A.11.4 Error d-t-ction The Start Code Detector can detect certain errors in the coded data and provides some facilities to allow the decoder to recover after an error is detected (see A.11.8, "Start code searching").
A.11.4.1 Ill-g~l JPEG l-ngth ¢ount Most JPEG marker codes have a 16 bit length count field associated with them. This field indicates how much data is associated with this marker code. Length counts of 0 and 1 are illegal. An illegal length should only occur following a data error. In the present invention, this will generate an interrupt if illegal length count mask is set to 1.
Recovery from errors in JPEG data is likely to require additional application specific data due to the difficulty of searching for start codes in JPEG data (see A.11.8.1).
a. 11 . 4.2 Ov-rlapping start/marker cod-s In the present invention, overlapping start codes should only occur following a data error. An MPEG, byte aligned, overlapping start code is illustrated in Figure 64. Here, the Start Code Detector first sees a pattern that looks like a picture start code. Next the Start Code Detector sees that this picture start code is overlapped with a group start. Accordingly, the Start Code Detector 21~5221 generates a overlapping start event. Furthermore, the Start Code Detector will generate an interrupt and stop if overlapping start_mask is set to 1.
It is impossible to tell which of the two start codes is the correct one and which was caused by a data error.
However, the Start Code Detector in accordance with the present invention, discards the first start code and will proceed decoding the second start code "as if it is correct" after the overlapping start-code event has been serviced. If there are a series of overlapped start codes, the Start Code Detector will discard all but the last tgenerating an event for each overlapping start code).
Similar errors are possible in non byte-aligned system~
(H.261 or possibly MPEG). In this case, the state of ignore_non aligned must also be considered. Figure 65 illustrates an example where the first start code found is byte aligned, but it overlaps a non-aligned start code. If ignore non aligned is set to 1, then the second overlapping start code will be treated as data by the Start Code Detector and, therefore no overlapping start code event will occur. This conceals a possible data communications error. If ignore non aligned is set to 0, however the Start Code Detector will see the second, non aligned, start code and will see that it overlaps the first start code.
A.11.~.3 ~nr-cognis-d start cod-J
The Start Code Detector can generate an interrupt when an unrecognized start code is detected (if unrecognized start mask = 1). The value of the start code that caused this interrupt can be read from the register start value.
The start code value OxB4 (sequence error) is used in MPEG decoder systems to indicate a channel or media error.
For example, this start code may be inserted into the data by an ECC circuit if it detects an error that it was unable ~1~5~21 to cor~e&t.
A.11.4.4 8-qu-nc- of v-nt g-n-ration In the present invention, certain coded data patterns (probably indicating an error condition) will cause more than one of the above error conditions to occur within a short space of time. Consequently, the sequence in which the Start Code Detector examines the coded data for error conditions is:
l)Non-aligned start codes 2)Overlapping start codes 3)Unrecognized start codes Thus, if a non-aligned start code overlaps another, later, start code, the first event generated will be associated with the non-aligned start code. After this lS event has been serviced, the Start Code Detector's operation will proceed, detecting the overlapped start code a short time later.
The start Code Detector only attempts to recognize the start code after all tests for non-aligned and overlapping start codes are complete.
A.l~.S D~ r start-up and shutdown The Start Code Detector provides facilities to allow the current decoding task to be completed cleanly and for a new task to be started.
There are limitations on using these techniques with JPEG coded video as data segments can contain values that emulate marker codes (see A.11.8.1).
A.ll.S.l Cl-an nd to d-coding The Start Code Detector can be configured to generate an interrupt and stop once the data for the current picture is complete. This is done by setting stop after picture = 1 and stop_after picture_mask = 1.
Once the end of a picture passes through the Start Code Detector, a FL~SH Token is generated (A.11.7.2), an int~rrupt is generated, and the Start Code Detector stops. Note that the picture just completed will be decoded in the normal way. In some applications, however, it may be appropriate to detect the FLUSH arriving at the output of the decoder chip-set as this will indicate the end of the current video sequence. For example, the display could freeze on the last picture output.
When the Start Code Detector stops, there may be data from the "old" video sequence "trapped" in user implemented buffers between the media and the decode chips. Setting the register, discard all data, will cause the Spatial Decoder to consume and discard this data. This will continue until a FLUSH Token reaches the Start Code Detector or discard all data is reset via the microprocessor interface.
Having discarded any data from the "old" sequence the decoder is now ready to start work on a new sequence.
A.11.5.2 Wh-n to start discard ~ll mod-The discard all mode will start immediately after a 1 is written into the discard all data register. The resultwill be unpredictable if this is done when the Start Code Detector is actively.processing data.
Discard all mode can be safely initiated after any of the Start Code Detector events (non-aligned start event etc.) has generated an interrupt.
A.11.5.3 Starting a n-w s-qu-nc-If it is not kno~n where the start of a new coded videosequence is within some coded data, then the start code search mechanism can be used. This discards any unwanted data that precedes the start of the sequence. See A.11.8.
A.11.5.4 Ju~ping b-tw--n qu-ncss This section illustrates an application of some of the techniques described above. The objective is to "jump"

214~221 from o~e part of one coded video sequence to another. In this example, the filing system only allows access to "blocks" of data. This block structure might be derived from the sector size of a disc or a block error correction system. So, the position of entry and exit points in the coded video data may not be related to the filing system block structure.
The stop after picture and discard all data mechanisms allow unwanted data from the old video sequence to be discarded. Inserting a FLUSH Token after the end of the last filing system data block resets the discard all data mode. The start code search mode can then be used to discard any data in the next data block that precedes a suitable entry point.
A.11.6 Byt- aligno-~t As is well known in the art, the different coding schemes have quite different views about byte alignment of start/marker codes in the data stream.
For example, H.261 views communications as being bit serial. Thus, there is no concept of byte alignment of start codes. By setting ignore non aligned = 0 the Start Code Detector is able to detect start codes with any bit alignment. By setting non-aligned start mask = 0, the start code non-alignment interrupt is suppressed.
In contrast, however, JPEG was designed for a computer environment where byte alignment is guaranteed. Therefore, marker codes should only be detected when byte aligned.
When the coding standard is configured as JPEG, the register ignore non aligned is ignored and the non-aligned start event will never be generated. However, setting ignore_non aligned = 1 and non aligned start mask = 0 is recommended to ensure compatibility with future products.
MPEG, on the other hand, was designed to meet the needs of both communications (bit serial) and computer (byte orient~ systems. Start codes in MPEG data should normally be byte aligned. However, the standard is designed to be allow bit serial searching for start codes (no MPEG bit pattern, with any bit alignment, will look like a start code, unless it is a start code). So, an MPEG
decoder can be designed that will tolerate loss of byte alignment in serial data communications.
If a non-aligned start code is found, it will normally indicate that a communication error has previously occurred. If the error is a "bit-slip" in a bit-serial communications system, then data containing this error will have already been passed to the decoder. This error is likely to cause other errors within the decoder. However, new data arriving at the Start Code Detector can continue to be decoded after this loss of byte alignment.
By setting ignore non aligned = 0 and non aligned start mask = 1, an interrupt can be generated if a non-aligned start code is detected. The response will depend upon the application. All subsequent start codes will be non-aligned (until byte alignment is restored).
Accordingly, setting non aligned start mask = 0 after byte alignment has been lost may be appropriate.

M~EG JPEG U26 ignor~_non_~lign~ 0 1 o non_~lign~C_sUn_m~t 1 0 0 Ta~l- A.11.5 Configuring for byt- alignm-nt A.1~.7 autO~ tlo To~-~ g-n-r~t~o~
In the present invention, most of the Tokens output by the Start Code Detector directly reflect syntactic elements of the various picture and video coding standards. In addition to these "natural" Tokens,some useful "invented"
Tokens are generated. Examples of these proprietary tokens are PICTURE END and CODING STANDARD. Tokens are also introduced to remove some of the syntactic differences between the coding standards and to-~tidy up" under error conditions.
This automatic Token generation is done after the serial analysis of the coded data (see Figure 61, "The Start Code Detector"). Therefore the system responds equally to Tokens that have been supplied directly to the input of the Spatial Decoder via the Start Code Detector and to Tokens that have been generated by the Start Code Detector following the detection of start codes in the coded data.
A.11.7.1 I~c~t~ng t~ of ~ pictur-In general, the coding standards don't explicitly signal the end of a picture. However, the Start Code Detector ofthe present invention generates a PICTURE END Token when it detects information that indicates that the current picture has been completed.
The Tokens that cause PICTURE_END to be generated are:
SEQUENCE START, GROUP START, PICTURE_START, SEQUENCE END
and FLUSH.
A.11.7.2 8top aft-r pictur- end option If the register stop after picture is set, then the Start Code Detector will stop after a PICTURE END Token has passed through. However, a FLUSH Token is inserted after the PICTURE_END to "push" the tail end of the coded data through the decoder and to reset the system. See A.11.5.1.

--~ 2145221 , ~

2~2 A.1~ 3~ Introducing s-qu-nc- st~rt for H.2Cl H.261 does not have a syntactic element equivalent to sequence start (see Table A.11.4). If the register insert_sequence start is set, then the Start Code Detector will ensure that there is one SEQUENCE START Token before the next PICTURE_START, i.e., if the Start Code Detector does not see a SEQUENCE START before a PICTURE START, one will be introduced. No SEQUENCE START will be introduced if one is already present.
~his function should not be used with MPEG or JPFG.
A.~1.7.~ 8-tting coding st-nd-rd for ~ch s-qu-nc-All SEQUENCE START Tokens leaving the Start CodeDetector are always preceded by a CODING STANDARD Token.
This Token is loaded with the Start Code Detector's current coding standard. This sets the coding standard for the entire decoder chip set for each new video sequence.
A.11.8 St~rt cod- s-~rching The Start Code Detector in accordance with the invention, can be used to search through a coded data stream for a specified type of start code. This allows the decoder to re-commence decoding from a specified level within the syntax of some coded data (after discarding any data that precedes it). Applications for this include:
start-up of a decoder after jumping into a coded data file at an unknown position (e.g., random accessing).
to seek to a known point in the data to assist recovery after a data error.
For example, Table A.11.6 shows the MPEG start codes searched, for different configurations of start_code_search. The equivalent H.261 and JPEG
start/marker codes can be seen in Table A.11.4.

`-` 2145221 tan_CO~_s-~rct~ Slart co~es sea~c~e~ ~or o ' Nor~al cXranon R~serve~ (W~ll Den~ve als~ar2 Cata) 3 s~cu~ st~n ~n_~a- N~-c~ S~nc ~ ~ o-~, group o- s~wnc~ sun S ~ . grouP or s cu ne~
6 ~ DenJr~. grou~ or #qu~ s~Q
It~ n~n st~n or m~rlt~r co~

Tabl- a. 1l. 6 8tart cod~ rch ~Od-~
a. A FLUSH Token places the Start Code Detector in this search mode.
b. This is the default mode after reset.

When a non-zero value is written into the start_code search register, the Start Code Detector will start to discard all incoming data until the specified start code is detected. The start code search register will then reset to 0 and normal operation will continue.
The start code search will start immediately after a non-zero value is written into the start code search register. The result will be unpredictable if this is done when the Start Code Detector is actively processing data.
So, before initiating a start code search, the Start Code Detector should be stopped so no data is being processed.
The Start Code Detector is always in this condition if any of the Start Code Detector events (non-aligned start event etc.) has just generated an interrupt.
A.11.8.1 Limit~tion~ on using ~t~rt cod~ ~arch with JPEG

~` ~145221 Mos~ ~PEG marker codes have a 16 bit length count field associated with them. This field indicates the length of a data segment associated with the marker code. This segment may contain values that emulate marker codes. In normal operation, the Start Code Detector doesn't look for start codes in these segments of data.
If a random access into some JPEG coded data "lands" in such a segment, the start code search mechanism cannot be used reliably. In general, JPEG coded video will require additional external information to identify entry points for random access.

SECT~N A.12 Decoder start-up control A.12.1 Ov-rvi-w of d-cod-r start-up In a decoder, video display will normally be delayed a short time after coded data is first available. During S this delay, coded data accumulates in the buffers in the decoder. This pre-filling of the buffers ensures that the buffers never empty during decoding and, this, therefore ensures that the decoder is able to decode new pictures at regular intervals.
Generally, two facilities are required to correctly start-up a decoder. First, there must be a mechanism to measure how much data has been provided to the decoder.
Second, there must be a mechanism to prevent the display of a new video stream. The Spatial Decoder of the invention provides a bit counter near its input to measure how much data has arrived and an output gate near its output to prevent the start of new video stream being output.
There are three levels of complexity for the control of these facilities:
Output gate always open Basic control Advanced control With the output gate always open, picture output will start as soon as possible after coded data starts to arrive at the decoder. This is appropriate for still picture decoding or where display is being delayed by some other mechanism.
The difference between basic and advanced control relates to how many short video streams can be accommodated in the decoder~s buffers at any time. Basic control is sufficient for most applications. However, advanced control allows user software to help the decoder manage the start-up of several very short video streams.

-` 21~5221 A.12.~- ~PEG vid-o buff-r v-rifi-r MPEG describes a "video buffer verifier" (VBV) for constant data rate systems. Using the VBV information allows the decoder to pre-fill its buffers before it starts to display pictures. Again, this pre-filling ensures that the decoder's buffers never empty during decoding.
In summary, each MPEG picture carries a vbv delay parameter. This parameter specifies how long the coded data buffer of an "ideal decoder" should fill with coded data before the first picture is decoded. Having o~served the start-up delay for the first picture, the requirements of all subsequent pictures will be met automatically.
MPEG, therefore, specifies the start-up requirements as a delay. However, in a constant bit rate system this delay can readily be converted to a bit count. This is the basis on which the start-up control of the Spatial Decoder of the present invention operates.
A.12.3 D-finition of a str-um In this application, the term stream is used to avoid confusion with the MPEG term sequence. Stream therefore means a quantity of video data that is "interesting" to an application. Hence, a stream could be many MPEG sequences or it could be a single picture.
The decoder start-up facilities described in this chapter relate to meeting the VBV requirements of the first picture in a stream. The requirements of subsequent pictures in that stream are met automatically.

- / `
21~5221 A ~2 ~ Start-up control r-gi~t-r~

Regis er nam- ~ rn ~escrrllon rn t~
sUr2up_acc- - 1 0 Wntmg I lo this reS~ster requ s;s l~at ~e t~t CEO_gS_ACCESS rw eoun~er anct gat~ openlng log~c S oD io albw ~ceess to their configuraoon r gisters Dit_count 8 0 This Dil counler ls ~ en _ u~ as code~ ~a~a CE5)_95_COUNT rw te v~S the sttU2 code Cet ctor rhe num:er o ~ ;
bit_counl_prescale 3 0 bits t~outr d lo increment bit_count cr~ce s CED_9S_P~ESCALE rw ~oproL 2~t-~unt-Pr~~ 812 The bit eount-r stars counting Dlts a~er a FLUSH Totten ~t~sses throuSn ~he blkourtler.
Itisrt~tto~ roztndtnenstops rc~ ~ n~
ah2 r the bit count target has D~n met bit_count_urget 8 rt T~ti~ regtster ~p eifies ttle blt count btSel. A
CE8_~5_rA~GET rw tuget met event is Senerated w~enever ~l~e loltowing condition t~ cornes true bit_count ~- Dit_counl_t rgel t rget_m-t_ v nt 1 0 Wh-nth-0itcounttug-t is met hlseve 85_r~f~GET UET EVEM rw b- gen-rUed It the mask regiSter ~s setto t rg-t_m-t_mnlt 1 then an interruot can D- genera~ed~ ~owev~
rw the Dil count-r W~ `OT stop processn~s ~a~a ~hi5 vent wlll oecur when t~e Clt ;olin er ir~ ,ts to its Wget It will also oo ~r C a tuget value is wn~ten Wtlich i5 leS5 tl~an or equal to ttl- current v~ue ol ~e t;~ ccurlte WriDng 0 to Dit_count_Urget w~t a~a~s gen-rate t rSet me! event Table ~121 Decoder Statt-Up r~9;SterS

R-gist r nam- ~ ptio counter_tlusn-C_ v-nt 1 0 Wh-n a f LUSH To len p~s tllrouSn o~e o~t 35_F~US~_cVENT rw count eircuit this v-nt wlll Ocscur It the maslt counur_tlusn-d_mask 1 0 r-gisl-r ss #t tO t tnen an intenUct can oe tw g-n-rU d ~nd th- Oi~ count-r wiil s~cc counur_tlwn-e_too_ rl~_vent 1 0 Its~ FLUSH To~tenD~ ~ stnroug~ ~eo~t ~5-FLus~-sEFoRE-r~RGEr-MEr-EvENT rw count clrcuit nd the C~t count Ur9~ ~as no~
counter-tlusnee-too- rt~_mask 1 0 o- n m t tt~is ev nt will occw It th- maSl~
rw r-gister is sUt to 1 th n an interruct can oe g-n rU~ nd tt - Olt coumer will stoo 5 ~12 10 ottchip_tJu-u- 1 0 S~ttin9 tni- re9isut ~o ~ conll9ures h- ~a~e CED_QS_OUc-UE rw op ning logic to requirc n _ ~ pr~ y supporL Wh n this r~is;-r 8 S-t tO O ~e OUI~
gslt control togic Wii ~ ccnuol ~e op raoon ot the OUtcut gat-S--s~ ctonsA t26andA 127 enaOh_stream 1 0 Wh-n n oil ehip Ou-u- is in use ~;~nS to CED_BS_c-NASLE_NXT STM ~ n-OI-_stre~m conuols the e na~our ol~e outDut gUe ~tter tn ene ot a strear ~asses tnrough it.
~ on- in tr~is register enaol s t~- o~c-.t 5sdeto Op n Th- r~st r w~ll b- ret w~n an acc-pt_end~ nletrl pt is genersJte~l Tabie A.12.1 DeooJcr Start-Up registers (contd) R~hr nu~

see pt_en~OI~ n~ 1 0 T~ ven~lCatestnata FLUSH Tokcnnas rw pU~ through ~e ou~ut 9-l~ (c~us;ng ~I to EJS_STRE~M_END_EVENT
sccept_ naOle_mast~ 1 0 CtO#~Uan enaOlew s~v~ Dle toallow rw L~ 9-lo to oVen It the m-Si~ reglSter is set to 1 Ihen an ;nlerru. I
e~n De generald ~C ttle resiSter enaOle_suesm w~ll t~e rcs-L See A ~2 7 1 T~ A 12 1 D-cod-r st-rt-up r-gi~t-r~ (co~td) . 214~221 A.12.~ Output gat- ~lways op-n The output gate can be configured to remain open. This configuration is appropriate where still pictures are being decoded, or when some other mechanism is available to manage the start-up of the video decoder.
The following configurations are required after reset (having gained access to the start-up control logic by writing 1 to startup access):
set offchip queue = 1 set enable stream = 1 ensure that all the decoder start-up event mask registers are set to 0 disabling their interrupts ~this is the default state after reset).
(See A.12.7.1 for an explanation of why this holds the output gate open.) A.12.6 B~ic op-ration In the present invention, basic control of the start-up logic is sufficient for the majority of MPEG video applications. In this mode, the bit counter communicates directly with the output gate. The output gate will close automatically as the end of a video stream passes through it as indicated by a FLUSH Token. The gate will remain closed until an enable is provided by the bit counter circuitry when a stream has attained its start-up bit count.
The following configurations are required after reset (having gained access to the start-up control logic by writing 1 to startup_access):
set bit count prescale approximately for the expected range of coded data rates set counter flushed too early mask = 1 to enable this error condition to be detected Two interrupt service routines are required:
~'ideo Demux servlce to obtain the value of '` 2145~21 ~vb~_delay for the first picture in each new stream Counter flushed too early service to react to this condition The video demux (also known as the video parser) can generate an interrupt when it decodes the vbv_delay for a new video stream (i.e., the first picture to arrive at the video demux after a FLUSH). The interrupt service routine should compute an appropriate value for bit_count target lo and write it. When the bit counter reaches this target, it will insert an enable into a short queue between the bit counter and the output gate. When the output gate opens it removes an enable from this queue.

21~15221 a. ~2.~.1 8t~rti~g n-~ ~tr-~m hortly ~ft-r ~uoth-r fiui-b--As an example, the MPEG ~tream which i~ about to finishis called A and the MPEG stream about to start is called B.
A FLUSH Token should be inserted after the end of A. This pushes the last of its coded data through the decoder and alerts the various sections of the decoder to expect a new stream.
Normally, the bit counter will have reset to zero, A
having already met its start-up conditions. After the FLUSH, the bit counter will start counting the bits in stream B. When the Video Demux has decoded the vbv delay from the first picture in stream B, an interrupt will be-generated allowing the bit counter to be configured.
As the FLUSH marking the end of stream A passes through the output gate, the gate will close. The gate will remain closed until B meets its start-up conditions. Depending on a number of factors such as: the start-up delay for stream B and the depth of the buffers, it is possible that B will have already met its start-up conditions when the output gate closes. In this case, there will be an enable waiting in the queue and the output gate will immediately open.
Otherwise, stream B will have to wait until it meets its start-up requirements.
A.12.6.2 A ucc-~sion of short str-amJ
The capacity of the queue located between the bit counter and the output gate is sufficient to allow 3 separate video streams to have met their start-up conditions and to be waiting for a previous stream to finish being decoded. In the present invention, this situation will only occur if very short streams are being decoded or if the off-chip buffers are very large as compared to the picture format being decoded).
In Figure 69 stream A is being decoded and the 21 ~5221 outpu~ gate is open). Streams B and C have met their start-up conditions and are entirely contained within the buffers managed by the Spatial Decoder. Stream D is still arriving at the input of the Spatial Decoder.
Enables for streams B and C are in the queue. So, when stream A is completed B will be able to start immediately.
Similarly C can follow immediately behind B.
If A is still passing through the output gate when D
meets its start-up target an enable will be added to the queue, filling the queue. If no enables have been removed from the queue by the time the end of D passes the bit counter (i.e., A is still passing through the output gate) no new stream will be able to start through the bit counter. Therefore, coded data will be held up at the input until A completes and an enable is removed from the queue as the output gate is opened to allow B to pass through.
A.12.7 Advanced operation In accordance with the present invention, advanced control of the start-up logic allows user software to infinitely extend the length of the enable queue described in A.12.6, "Basic operation". This level of control will only be required where the video decoder must accommodate a series of short video streams longer than that described in A.12.6.2, "A succession of short streams".
In addition to the configuration required for Basic operation of the system, the following configurations are required after reset (having gained access to the start-up control logic by writing 1 to start up access):
set offchip queue = 1 set accept_enable_mask = 1 to enable interrupts ~hen an enable has been removed from the queue set target_met_mask = 1 to enable interrupts ~hen a stream's bit count target is met 21~5221 Two~a~ditional interrupt service routines are required:
accept enable interrupt Target met interrupt When a target met interrupt occurs, the service routine should add an enable to its off-chip enable queue.
A.~2.7.1 Output gat- logic b-h~vior Writing a 1 to the enable_stream register loads an enable into a short queue.
When a FLUSH (marking the end of a stream) passes through the output gate the gate will close. If there is an enable available at the end of the queue, the gate will open and generate an accept_enable event. If accept_enable_mask is set to one, an interrupt can be generated and an enable is removed from the end of the queue (the register enable_stream is reset).
However, if accept_enable_mask is set to zero, no interrupt is generated following the accept_enable_event and the enable is NOT removed from the end of the queue.
This mechanism can be used to keep the output gate open as described in A.12.5.
A.12.8 Bit counting The bit counter starts counting after a FLUSH Token passes through it. This FLUSH Token indicates the end of the current video stream. In this regard, the bit counter continues counting until it meets the bit count target set in the bit_count_target register. A target met event is then generated and the bit counter resets to zero and waits for the next FLUSH Token.
The bit counter will also stop incrementing when it reaches it maximum count (255).
A.12.9 Bit count prescale In the present invention, 2"`"-'~n'-Pr'``'~"~" x 512 bits are ~ 214~221 required to increment the bit counter once. Furthermore, bit_count prescale is a 3 bit register than can hold a value between O and 7.

Rang~ S) n~ ~ (bits) O O to 262144 1024 0 ~o s242a~ 20~
7 0 to 31457280 122t80 $abl- A.12.2 Exampl- bit counter rang-s The bit count is approximate, as some elements of the video stream will already have been Tokenized (e.g., the start codes) and, therefore includes non-data Tokens.
A.12.10 Count-r flush-d too arly If a FLUSH token arrives at the bit counter before the bit count target is attained, an event is generated which can cause an interrupt (if counter flushed_too_early_mask =
1). If the interrupt is generated, then the bit counter circuit will stop, preventing further data input. It is the responsibility of the user's software to decide when to open the output gate after this event has occurred. The output gate can be made to open by writing O as the bit count target. These circumstances should only arise when trying to decode video streams that last only a few pictures.

~` 21~5221 SECTI~ A.13 Buffer Management The Spatial Decoder manages two logical data buffers:
the coded data buffer (CDB) and the Token buffer ~TB).
The CDB buffers coded data between the Start Code Detector and the input of the Huffman decoder. This provides buffering for low data rate coded video data. The TB buffers data between the output of the Huffman decoder and the input of the spatial video decoding circuits (inverse modeler, quantizer and DCT). This second logical lo buffer allows processing time to include a spread so as to accommodate processing pictures having varying amounts of data.
Both buffers are physically held in a single off-chip DRAM array. The addresses for these buffers are generated by the buffer manager.
A.13.1 ~uffer manager registers The Spatial Decoder buffer manager is intended to be configured once immediately after the device is reset. In normal operation, there is no requirement to reconfigure the buffer manager.
After reset is removed from the Spatial Decoder, the buffer manager is halted (with its access register, buffer manager access, set to 1) awaiting configuration.
. After the registers have been configured, buffer_manager access can be set to O and decodlng can commence.
Most of the registers used in the buffer manager cannot be accessed reliably while the buffer manager is operating.
Before any of the buffer manager registers are accessed buffer_manager access must be set to 1. This makes it essential to observe the protocol of waiting until the value 1 can be read from buffer_manager_access. The time taken to obtain and release access should be taken into ` 21~52%1 consider~ion when polling such registers as cdb_full and cdb_empty to monitor buffer conditions.

Register name ~ nO Descr~Dlion tr butter_rrl nager_access 1 1 T~is access bn stops the oPera~cr ct`~e bu'l~er rranager so that ;~s rw various registers can be aessed reliably See A 6 4 1 Nole this access register is unusual as its de~ault stale a~ter rese ;s I e a~ter reset the buHer manager is naned awalting canr jvl I -viaIhe ._v~ . in~ertace Register name butter_m nager_k yhole_address 6 x K~yhol-accesstotheextendeaaccressspaceusea~ ~e~u~er rw manager registers shown below See A 6 4 3 fo- more butter_manager_keyhole_data 8 x ;~ sbout ~cc ssing reglsters throush a keyhoie buner-limlt 18 x Thisspecifiestheoveralls~ze of ~i~r ûR ~; ar~m anac-ec~o~i~e rw Spa~ial Decoder All buHer adCresses ar~ i c u; ec s~CDllus tu ~er size and so will wrap round wilhin ~he Ofl~ nvidec ~db_base 18 x rhese registers point to the b~e o' the ~ i d?rta (ccb) ancl Teken tb_hase rw (tb~ buHers cdb_length 18 x These teg;s\~specity the lenrJth (i e srze) o~ Ihe codes rlata icCc!
th_length rw and To~e~l ~b) butters cdb_read 18 x These registers hold an onset trom the ou - ase an~ ncrca~e th_read ~0 where data -~11l be re-d trom next cdt~_number 18 x Thesc ~ist rs show how much data is r ntly held ln~e lc~e!s tb_numoer ~0 ccb_tull 1 x Tl~ 5 Wiil b- set to 1 11 tnPr~ d cata ~c_t~ cr Tokr - :
~t~_~ull ro buf~`a~
cct~_empty 1 x Th~ Re9lsters will be sel ~o 1 il the coded ~a~a (cJ~ orTtl(erl :
tb_empty ~o ~e~ empaes Table A 13.1 Butfer manager registers (cor td) 214~221 A.13.~ uffer manager pointer value~
Typically, data is transferred between the Spatial Decoder and the off chip DRAM in 64 byte bursts (using the DRAM's fast page mode). All the buffer pointers and length registers refer to these 64 byte (512 bit) blocks of data.
So, the buffer manager's 18 bit registers describe a 256 k block linear address space (i.e., 128 Mb).
The 64 byte transfer is independent of the width (8, 16 or 32 bits) of the DRAM interface.
A.13.2 Use of the buffer m~nag-r registers The Spatial Decoder buffer manager has two sets of registers that define two similar buffers. The buffer limit register (buffer limit) defines the physical upper limit of the memory space. All addresses are calculated modulo this number.
Within the limits of the available memory, the extent of each buffer is defined by two registers: the buffer base (cdb_base and tb_base) and the buffer length (cdb length and tb_length). All the registers described thus far must be configured before the buffers can be used.
The current status of each buffer is visible in 4 registers. The buffer read register (cdb read and tb read) indicates an offset from the buffer base from which data will be read next. The buffer number registers (cdb number and tb_number) indicate the amount of data currently held by buffers. The status bits cdb full, tb full, cdb_empty and tb_empty indicate if the buffers are full or empty.
As stated in A.13.1.1, the unit for all the above mentioned registers is a 512 bit block of data.
Accordingly, the value read from cdb_number should be multiplied by 512 to obtain the number of bits in the coded data buffer.
A. 13 . 3 Zero buffers Still picture applications (e.g., using JPEG) that do not ha~e a "real-time" requirement will not need the large off-chip buffers supported by the buffer manager. In this case, the DRAM interface can be configured (by writing 1 to the zero_buffers register) to ignore the buffer manager to provide a 128 bit stream on-chip FIFO for the coded data buffer and the Token buffers.
The zero buffers option may also be appropriate for applications which operate working at low data rates and with small picture formats.
Note: the zero_buffers register is part of the DRAM
interface and, therefore, should be set only during the post-reset configuration of the DRAM interface.
A.13.4 Buffer operation The data transfer through the buffers is controlled by a handshake Protocol. Hence, it is guaranteed that no data errors will occur if the buffer fills or empties. If a buffer is filled, then the circuits trying to send data to the buffer will be halted until there is space in the buffer. If a buffer continues to be full, more processing stages "up steam" of the buffer will halt until the Spatial Decoder is unable to accept data on its input port.
Similarly, if a buffer empties, then the circuits trying to remove data from the buffer will halt until data is avallable .
As described in A.13.2, the position and size of the coded data and Token buffer are specified by the buffer base and length registers. The user is responsible for configuring these registers and for ensuring that there is no conflict in memory usage between the two buffers.

SECTl~ A.14 Video Demux The Video Demux or Video parser as it is also called, completes the task of converting coded data into Tokens started by the Start Code Detector. There are four main processing blocks in the Video Demux: Parser State Machine, Huffman decoder (including an ITOD), Macroblock counter and ALU.
The Parser or state machine follows the syntax of the coded video data and instructs the other units. The Huffman decoder converts variable length coded (VLC) data into integers. The Macroblock counter keeps track of which section of a picture is being decoded. The ALU performs the necessary arithmetic calculations.
A.14.1 Vid~o D~mux r~gi~t~r~

Regis er name ~ ~ C ~ tJti ui 1~
d-mux_access 1 0 This acc ss bit stops the oporatton of tne Vldeo Demux so t~ha~ It s CED_H_CTRL~] rw ntiou5 t-gist rs c n be cc~d r-liably See A 6 4 1 nu1tman- tror_code 3 Wh-n the Vd o D mux stops ~otlowing th- g~ne a~ion ol a CEo-H-crRL~6 4J t hunm n_e~ nt irltottupt tequ st this 3 bit register holds a va ue nCicaling why th--int--ttupt ~ ~ S~ A 14 5 1 pars-r_error_code 8 When tne Vtd o Demux stops ~ollowing tne gcnL a~i on ol a ~arser_event C'O_H_DMUX_ERR ro int-rnupt r~u-st thls 8 bit r~ister holds a value indicating why the internupt was g ; S- A 14 5 2 d-mu~t_k-ynole_addts 12 x K-ynole acc~ to th- Vd o Demux s n-nde~ aCdress space See Cc!7_H_~EYHOLE_AOOR rw A.64 3 ior mor- i h about acce~sing regls~e s aemux-keytlole-t~at~ 8 x tntough a k-ytlae 15 CEO_H_~Y~/OLE rw Tabtes A 14 2 A 14 3 and A 14 4 describe the registers ~al :an ~e KC~S5 d via th~ keynole Table A.14.1 Top level Video Demux rcgiste.s 21~5221 R ~ PI _ ~ ~ D ~- ivtion aummy_last_picture l O When this reglsIems set to 1 the Vldeo Oemu~ w~ll genera e mlormaDon CE3_~t_ALU_~E5~ rw tor a dummy' Intra Dlcture u the last plcture ot an MpEG sequence r_rom_con~rol This iuncDon is useiul when th- Temporal Decoder is configured lor automatic picture re crdenng (see A 18 3 5 'Plc ure sequence re r_drJmmy_la5~_~rame_0it ordering~ to nush the last P or I picture out oi the ,emporal Decoder No ~Cummy' picture is required i~
the Temporal Decoaer is not configured lor r~ c d g anotner MPEG sequence w711 be CecoCed; ~ 'y ~as this will also nush out the Iast picture) the coding standard is not MPEG
~i-ld_into 1 O When this register is set to 1 the first byte ol any MpEG
CE3_tl_ALU_REGO tw extra_; ~ picture is placed in the FIELD_INFO Token See r_rom_control r_field_ln~o_bir continue 1 0 This register allows user sottw-re to control how much extra user or CED_1-1_ALU_ftEGO rw xt-nsion data it wantS to recerve when is iI is Cetected by the Cecoder r_rom_control s-e A 14 6 and A 14 ?
r_continuo_bit rom_revision 6 1" " " a,a~ely following reset this holos a copy ol ~he micrococe ~CM
CED_~_ALU_~EGt ro revision number r_rorn_re~sion This register is also useC ~o present to control sotfwar- data va;ues reaC
irom tne coded data See ~14 6 Receiving U#r and Extensicn cata and A 14 7 'Receiving E~ra I ~ a~
Table A.14.1 Top level Video Demux registers (contd) 2~2 2145221 Registe ntme ~ ~n O ~ "t~on ~
huttman_eveot 1 0 A Hunman ev-nt is g n-tate~d it n error IS ~ounr~ in rine cocec ca;a See rw ~14 5 1 ~or a J ~ )ti~n ot these events huttman mask 1 0 l~ the mask register is S-t lo 1 then an interruct can ~e generaleC anc1~e rw Vldeo Oemux will stop l~ the mask register is set to O then no Intenu~t IS

generated and the Vldeo Demux will attempt o recover tror~ ~e e~rcr parser_event 1 0 A Parser event n oe in responce to rrors In the coceC ~ata or~othe rw arrivat of; ItO~ at th- Vdeo Oemux that recuires sott vare parser_mask 1 0 i ~nel! ~ S -A1452 ~oraCesc "tlonoltheseevens l~ the mask register is set to 1 t~hen Itn int rrupl can t~o generaleC and~e Vldeo Dernux w îl stop It th- m~k r 9ister is sel to O Ihen no interrup~ r5 g-n-rated t nd the Vrdeo O mux witl attempt to continue Table A l~ 1 Top lev-l Vid~o D-mux r-gi~t-r~ (contd) Register namo ~ ~, u~
co pon~ t_nam-_O 6 x OunngJPEG operaoonther gister c_ one ~_nam-_nholdsan ~ citvalue oo ~o ~t_nem-_1 rw indicabng(toana ~ ~)whichcolowco pDnO thasthe.u ~,oncn~lû n.
co ~n( t_name_2 _n-m-_3 hori~_p ls 16 x Thes- regislets hol~ the homontal an~ veroca dllll_~b~of~s oi tne video selng rw decoded in pixe5.
vert_oels 16 x See section A 14 2 hori2_m~c . t~ 16 x These registers nold the hori20ntal anc vertlca d Cl s ons o~ t11e v~Ceo ~e ng rw decoded in . ohlo 1 ver~ ~. otlc~ 16 x - See section A 14 2 T~ble A 14 2 video demux picture construction r-gist-rs .

C;
f~egister name ~ ~ D p~

ma~_h 2 x The# reg slers hold th- oDl~k wlatb and he~snt In Dloc~s (exepl~els)~
~w Th- valu s O to 3 indicate a ~ hl ol 1 to 4 blocks max_v 2 x Sees cOionA 142 max_cG oor~nI_id 2 x The values 0 to 3 indicau that 1 to 4 dfflerenl vldeo cc ;;~oneri~s are c~rrert~¦y rw being decoded See secoon A 14 2 Nt e x During JPEG oper~oon this r-9~st-r nOldS the pararneter Nl (nur~ e~ ot imaSe nv cv ~n_ tS in tr~) blocks_h_0 2 x For each o~ the 4 colour co ~ us the r-glslers blocks-n-n and blocks_h_1 ~v btocks_v_n hold th- number o~ blocks I ~o Iy anC vettically In a blocks_h_2 n~. .bte--k br the colow CG---j~-l It Wjth c~ vorehl ID n btocks_h_3 See sect~ion A 142 blocks_v_0 2 x blocks_v_1 ~w blocks_v_2 blocks_v_3 t~O 2 x The two bit value hetd by ttl regist-r tQ_n ~tescnbes wnlch Invetse tq_1 rw aur ntisaoon Ubb is to D us d wnen decoding da~a with co ~nen~ ID n.
IQ_2 ~a_3 Table A.1~.2 Video demux picture construction regist-rs (contd) 21~5221 A.l~ Regist-r loading and Token g-n-ration Many of the registers in the Video Demux hold values that relate directly to parameters normally communicated in the coded picture/video data. For example, the horiz_pels register corresponds to the MPEG sequence header information, horizontal size, and the JPEG frame header parameter, X. These registers are loaded by the Video Demux when the appropriate coded data is decoded. These registers are also associated with a Token. For example, the register, horiz_pels, is associated with Token, HORIZONTAL_SIZE. The Token is generated by the Video Demux when (or soon after) the coded data is decoded. The Token can also be supplied directly to the input of the Spatial Decoder. In this case, the value carried by the Token will configure the Video Demux register associated with it.

- 21~5221 n~ rn r~
oc-hun-o 2 Th- two bit valu~ neld by tn~ r~glst~r r~tc-hun-n rt~sctlbes whlcn Hunrr~an cc-hun-l ~w decoding able is to be used wh-n cecocing the DC oerc-!nt, ol Cata w~t~
dc_hun_2 co ~oncnl ID n dc-hun-3 Simibrty c_hutt_n descnbes the table to be used wren CecocirS AC
~c_hutt 0 2 c ,t~-ac_hun_1 rw ~aseline JPEG rerluires UD to two Hunman tables per scan The or Iy ~ab!es ac_hutt_2 ; n~ le _n~ ~ are O and 1 ~c_hutt_3 dc_Dits_0~15 0] 8 Each of th~# is a Uble d 16 ight bit v~lur~5 They crovide the 91TS
dc_bits_1~15 0] rw irt~ ~ ~#e JPEG Hunman table - ' ~ ~n) which torm par o~ t~e ac_bits_0[150] 8 ~ ; b~ottwoDCandtwoACHuttm nables ~c_bits 1[15 0] rw See section A 14 3 1 dc-hunval-olll o] 8 Each ol thes is a table ot 12 ~ight ba values They provide the HUFi~VA~
dc-hunval-l~ll 0] ~w ; ,tu ~ ;~ (see JPEG Hunman table se~ ) which torm par ol ~e J ~ ;r ' S 0~ tWO DC Hunman tables S- #cbon A 14 3 1 ac-hunval-oll6l 0] 8 E~ch ot th~ is a tabl- ot 162 ~ight bit values Th~y provide the HuFi-vAL
ac_hunval_1[161 0] n~ (see JPEG Huttman table se t ? ~) which ~orm pan o~ he ot two AC Hunman tables S-~ secbon A 14 3 1 dc_2ssss_0 8 Thes 8 bit registers hold values that are spec~al cased' to accelera~e~he dc_2ssss_1 rw decoding ot cenain tre~uently us d J~EG VLCs ac_ Oh_0 8 dc_ssss - rnagnitude ot DC codrlcient is 0 ~c_eob 1 r~v ac_eob - end ot block _~rt_0 8 ac_2rl - run ol 16 7eros ac_~rl_1 ~w Table A.1~.3 Video demux ~uffman table regi~ter~

21~5221 R gisl t nirine g ~ ~~ c lic buner_si2e 10 This register iS loaCed when decoding MpEG Cala wlth a value Inc,ca~ng ~ne rw size ol V9V bùner required in an ideal decoder This valu~ is not used by th- d coder chlps However the value It hoiCs rnal be usehl lo u#r so~vare when configunng the eoCed Cata butler sl2e anc U
detemin- wheth~r th- decoder is capable ol decoding a panicular lP^^ ~a a file pel_aspect 4 This register is loaded when decocing MpEG data wl~ a value InC:cat~ .~e rw pel aspect ratio The valu- is a 4 bit integer that is us d as an inde~ in(o a tabl- defined by MPEG
See th- MpEG standard lor a d-finition ol this table This value is not us d by th- decoder chips However the value it holCs may b us lul to U#r soltware wh-n configuring a display or output dev ce bit_rate 18 ~his r gister is baded when d coding MPEG data with a value inC ca -g ~e rw cod d data rate See the MpEG standard lor a definition ol this value This vtuu- is not us d by the decoder chips How ver the value Q holCs may b- t~lul to us r sot~re whrtn con 19 - 9 the doCer stan-uD reSis~ers pic_rate 4 This r gister is bad d when d coding MPEG data Wlth a value Incica Ing ~e rw p*ture rate Seo the MPEG st~nrCard ior a definiOon ol this value This vt lu- is not us d by the decoder chips However th- value it ho!Cs a~
t~ uselul to uS r Somvue wh-n con6guring a display or outDut device cors t _ ~e d l Th6 re~ister is badeC wh n decoCing MFEG dau to indicate il the cocec ~a u rw rneets MPEG s cor r~ l d Da~ s See rh- MPEG standard lor a definiDon ol thls nag Thi5 value is not usec by the decoCer chlps However .-e va!ue . ~r~5 1~12t t~e useful to user so~ware lo Ce~emlne whether the decocer 6 ;a:~ e r.f decoding a particular MPE G daU hle Table A 14 4 Other Video Demux registers Regis~ername ~ rn C 1~`i~
V~ G
picture_typ- 2 Dunng MPEG operaaon this reglster holds the plctwe type ot ;tle ,cic~ure Delng rw d coded.
h_261_pic_type 8 This r~gist~r is loaded when Cecoding H.261 Cata. It holCs lhtOlr~Dol~ at~out rw the picture Iormat.
¦ 7 ¦ 6 ¦ 5 ¦ 4 ¦ 3 ¦ 2 ¦ 1 ¦ O ¦
I r I r I s I C I ~ I q I r I r I
Flags:
s Splil Screen Indicator d Document Camer-~- Freeze Picture Release This valu~ is not used by the d cod-r chips. How-ves the i"to, ., IdCOIl should b used when configuting hork~lt, v-rt_p ls anC the display or cutput device.
broken_closerd 2 During MPE~i oper-tion this register hOlCs ~e Droken_link anc aosecsop rw i"l~.. at,on ~ot the group ot pictures being CecoCeC.

I 7 1 6 1 5 1 4 1 3 1 2 I t 1 1 1 1 1 1 1'1' 1 Flags:
c closeC_goP

T~ble A.~ Other Video Demux rogi~t-r~ (contd) ~ 2145221 i~gist~tn rn~ ~ , r l~iO~

prrtclclion_moC- S Durmg MPEG and H 2610peratlon Ihs reçlsler nolC,s tr~- currenl value ol rw pr diction moda 1716151413121 1 lol ¦ r ¦ r ¦ r ¦ h ¦ y ¦ ~t ¦ b ¦ ~ ¦
P,ags h - nabls iJi261 loop filter y nsel baci-cwud v ctor pr diction vbv_c'-lay 16 This n gis~er is load~ ~ ~ x' ,9 MPEG data wiah a value inaicaling tl~,e rw minimum staQ up deby ~iore d coding should stan See the MPEG standard lot a datinit;,on o~ this value This vatu- is not t~s d by the d cot'-r chi~A How ver the value it holes may be usehl to us r so~7,n wh n c~-n'i~ 9 th- d cod-r start up regisîers pic_numb r 9 This NgrSter holds ~ pictun nu~r br thie pktur is ~al is currenay being rw d coded by th- Vdeo D~DL This numb r was gen-ral-d by Che slan coCe det ctor wh-n this pktun utiwd t~rs Sff nble A 11 2 ~or a d scripoon o~ the picture numoer dummv_bst_pit,tute 1 0 T~regrst rs r-~,ovisbieatthietopi vel S-eTabl-A14 1 rw fi-ld_in10 1 0 rw continu- 1 0 rv~ .
rom_r vision e, ,~, coding_st~,nrCard 2 This register is loaCeC by thie CODING_S~ANDARD Toi~en ~o cc,r ~, e ro the Video Demu~s moCc, ol op rat,on Sff secron A 21 1 Table A.14.4 ~ther Video ~emux registers lcontc) ~ 2145~21 ..

Register n m~
as tr resur~_lnt rval 8 This r 9ist r is baded v~nen d cWmg JPEG dala Wlth a value mCica(lng ~ne r~ minimum stan up dalay t~tore d cooing should s;art Se th~ MPEG slandad ior a d-finition o~ this value Tabl- A. 14 . 4 Oth-r Vid-o D-mux r-gi~tt-r~ (contd) register Token sUtldud comment c~ or l _nama_n COMPONENT_NAME . JPEG in coded data MpEG not uSed in standarC

~oriz_pels HORIZONTAL_SIZE MPEG in coded data ven_p-ls VEFITICAL_SIZE JPEG
H261 ~ ~ " `1~ derivea Irom picture tn~
hotiz_ Jt~C :' HORIZONTAL_MBS MPEG control so~ware must ceme Irom vett_ - .t' VERTICAL_MBS JPEG honzontal and vertical Dlcture size H 261 au~ derived ~rom plcture type.
ma~ DEFINE_MAX_SAMPLING MPEG control so~ware must configure ma~_v Sampling suucture is fi~ed by standard JPE5 in coded data H 261 auto", ~z Iy configurec ~or 4 2 9 video T~bl- A. 14 . 5 Regi~ter to TOk-D cro9~ r-f-rence ~ 21~5221 regis~er Tokt n sW~d~rd comment max_c: Fsn~ ~l_id MAX_COMP_ID MPEG eonuolso~vu- mustconfigurc.
S-mpling structure Is fixea by standa-d.
JPEG in COded daU.
H261 ~ configured lor 4:2:0 video.
tr~_0 JPEG_TABLE_SELECT JPEG in coded dala.
tqL1 MPEG nol used in stanaud.

trL2 tr~_3 block~_h_0 DEFINE_SAMPLING MPEG control son~vare must configure.
blocks_h_1 Sampling structure ¢ fixed by blocks_h_2 st ndard.
blocks_h_3 JPEG in coded data.
H ~61 ~ tit~l~ configured lor 4:2:0 blocks_v_0 vldeo.
blocks_v_1 blocks_v_2 blocks_v_3 ac_hun o h c nh ~rdaUJPEG incode~d data.
rtc_hun_1 MPEG_DCH_TABLE MPEG control 50trvue musl configure.
H261 not us-d in sutndud.
~c_hun_2 oc - hun-3 ac-hun-o in s~n h ad r dUa JPEG in coCed data.
ac_hun_1 MPEG nol used in standard.
~ t.261 ~c_hutl_2 ac-hun-3 Table A. ~4 . 5 ~egi~ter to Tok-n Cro~st re f r-nc- ( contd ) DEMANDES OU BREVETS VOLUMINEUX

LA PRÉSENTE PARTIE DE ; I I t DEMANDE OU CE BREVET
COMPREND PLUS D'UN TOME.

CECI EST LE TOME DE

NOTE: Pour les tomes additionels, veuillez c~ntacter le Bureau canadien des breve~

2. ~

JlJMBO APPLICATIONS/PATENTS

THIS SECTION OF THE APPLlCATlON/iATENT CONTAINS MORE
THAN ONE VOLUME
-THIS IS VOLUME l OF -3 NOTE: For additional volumes please contact the Canadian Patent Office

Claims (5)

1. In a pipeline system, the improvement comprising: a fixed size, fixed width buffer; and means for padding said buffer to pass an arbitrary number of bits through said buffer.

2. A system as recited in claim 1, wherein said means for padding is a start code detector.

3. A system as recited in either claim 1 or 2, wherein said padding is performed only on the last word of a token.

4. A system as recited in any of claims 1-3, wherein said means for padding insures uniformity of word size.

5. A system as recited in claim 1, and further comprising: a reconfigurable processing stage as a spatial decoder; and said means for padding adds to picture data being handled by said spatial decoder sufficient additional bits such that each decompressed picture at the output of said spatial decoder is of the same length in bits.