CA2062200A1 - Decompression processor for video applications - Google Patents

Abstract

DECOMPRESSION PROCESSOR FOR VIDEO APPLICATIONS
Stephen C. Purcell David E. Galbi Frank H. Liao Yvonne C. Tse ABSTRACT OF THE DISCLOSURE
A method and a structure are provided to decode intra-frame and interframe coded compressed video data.
In one embodiment of the present invention, a decompression structure having a processor is provided with a global bus over which a decoder coprocessor, an inverse discrete cosine transform coprocessor and a motion compensation coprocessor communicate. The decompression structure in accordance with the present invention communicates with a host computer over a host bus and with an external dynamic random access memory over a memory bus. The processor in the decompression structure of the present invention provides overall control to the decoder, IDCT and motion compensation coprocessors by reading and writing into a plurality of data and control registers, each register associated with one of the decoder, the IDCT
and the motion compensation coprocessors.
The 2-dimensional display space is mapped into the external DRAM addresses by embedding in the address space X and Y vectors of the display space. The mapping of the X and Y vectors allows a macroblock of pixels to be stored in one DRAM memory page, so that an access to a macroblock can be efficiently accomplished under a page mode access to the DRAM page. By providing control to one address bit, data of four pixels can be obtained at one time in one of 2 pixel X 2 pixel "quad pixel" configuration, or in a 4 pixel X 1 pixel horizontal "scan" configuration.
A structure including four of the decompression structures and a method are provided for decoding high definition television (HDTV) signal. In this HDTV
decompression structure, each decompression structure decodes a 480 X 1088-pixel picture area with access to up to two additional 240 X 1088-pixel picture area. A method using a divide-by-15 divisor is provided in the HDTV
decompression structure to map the display space into the external DRAM with efficient use of the DRAM physical address space.
A decoder logic unit having a plurality of decode tables and a method are provided in the decoder coprocessor to decode coded video data. Each coded datum to be decoded is provided to all of the decode tables.
The decoded datum is selected by a finite-state machine from among the output data of all the decoded tables.
The processor of the decompression structure is provided with a structure and a method for reducing the computation of a product into the computation of a sum, using ternary arithmetic and either zeroing, negating or leaving unchanged the operands of the sum.
A block memory structure and a method are provided for receiving 8 X 8-pixel blocks column by column in a 6 X 16-pixel picture area, such that the 16 X 16-pixel picture area can be output column by column simultaneously as the 8 X 8-pixel blocks are received, without double-buffering.
A motion compensation structure and a method are provided for interpolating interframe coded video data using motion vectors. The motion compensation structure comprises a filter for resampling the pixel data in both vertical and horizontal directions, a prediction memory structure and a weighted adder structure. In one embodiment of the present invention, a weighted adder structure and a method are provided for performing bilinear interpolation of two values using multiplexers and an multiple-input adder.
A structure and a method are provided for accessing a 16 X 16-pixel picture area in two parts, in order that the number of DRAM page boundary crossed during access of the 16 X 16-pixel picture area is minimized, thereby increasing the efficiency of memory access by reducing the overhead cost of initial accesses under page mode access to DRAMs.

Description

~22~

DECOMPRESSION PROCESSOR FOR VIDEO APPLICATIONS
Stephen C. Purcell David E. Galbi Frank H. Liao Yvonne C. Tse BACKGROUND OF THE INVENTION
Field of the invention This invention relates to the field of digital signal processing, and in particular relates to the processing of 10 digital video signals.
.. ... . ... .
Description of Related Arts Motion pictures are provided at thirty frames per second to create the illusion of continuous motion. Since each picture is made up of thousands of pixels, the amount 15 of storage necessary for storing even a short motion sequence is enormous. As higher definition is desired, the number of pixels in each picture is expected to grow also. Fortunately, taking advantage of special properties of the human visual system, lossy compression techniques 20 have been developed to achieve very high data compression without loss of perceived picture quality. (A lossy compression technique involves discarding information not essential to achieve the target picture quality).
Nevertheless, the decompression processor is required to 25 reconstruct in real timQ every pixel of the stored motion sequence.
The Motion Picture Experts Group (MPEG) is charged with providing a standard (hereinbelow 'IMPEG standard"~
for achieving compatibility between compression and 30 decompression equipment. This standard specifies both the coded digital representation of video signal for the storage media, and the method for decoding. The representation supports normal speed play~ack, as well as other play modes of color motion pictures, and 35 reproduction of still pictures. The standard covers the .

2~22~0 2 - ~
common 525 and 625-line television, personal computer and workstation di~play formats. The MPEG standard is intended for equipment supporting continuous transfer rate of up to 1.5 Mbits per second, such as compact disks, 5 digital audio tapes, or magnetic hard disks. The MPEG
standard is intended to support picture frames of approximately 288 X 352 pixels each at a rate between 24Hz and 3OHz.
Under the MPEG standard, the picture frame is divided 10 into a series of "Macroblock slices'l (MBS), each MBS
containing a number of picture areas (called 'imacroblocks") each covering an area of 16 X 16 pixels.
Each of these picture areas is represented by one or more 8 X 8 matrices which elements are the spatial luminance 15 and chrominance values. In one representation (4:2:2) of the macroblock, a luminance value ~Y type) is provided for every pixel in the 16 X 16 pixels picture area (in four 8 X 8 "Y" matrices), and chrominance values of the U and V
(i.e., blue and red chrominance) types, each covering the 20 same 16 X 15 picture area, are respectively provided in two 8 X 8 "U" and two 8 X 8 "V" matrices. That is, each 8 X 8 U or V matrix covers an area of 8 X 16 pixels. In another representation (4:2:0), a luminance value is provided for every pixel in the 16 X 16 pixels picture 25 area, and one 8 X 8 matrix for each of the U and V types is provided to represent the chrominance values of the 16 X 16 pixels picture area. A group of four contiguous pixels in a 2 X 2 configuration is called a "quad pixel";
hence, the macroblock can also be thought of as comprising 30 64 quad pixels in an 8 X 8 con~iguration.
The MPEG standard adopts a model of compression and decompression shown in Figure 1. As shown in Figure 1, interframe redundancy (represented by block 101) is first removed from the color motion picture frames. To achieve 35 interframe redundancy removal, each frames is designated either "intra", "predicted", or "interpolated" for coding purpose. Intra frames are least frequently provided, the 2~22~ -predicted frames are provided more frequently than the intra frames, and all the remaining frames are interpolated frames. The values of every pixels in an intra frame ("I-picture") is independently provided. In a 5 prediction frame ("P-picture"), only the incremental changes in pixel valu~s~from the last I- picture or P-picture are coded. In an interpolation frame ("B-picture"), the pixel values are coded with respect to both an earlier frame and a later ~rame. Note that the MPEG
10 standard does not require frames to be stored in strict time sequence, such that the intraframe from which a predicted frame is coded can be provided in the picture sequence either earlier or later in time as the predicted frame. By coding frames incrementally, using predicted 15 and interpolated frames, much interframe redundancy can be eliminated to result in tremendous savings in storage.
Motion of an entire macro~lock can be coded by a motion vector, rather than at the pixel level, thereby providing further data compression.
The next steps in compression under the MPEG standard remove intraframe redundancy~ In the first step, represented by block 102 of Figure 1, a 2-dimensional discrete cosine transform (DCT) is performed on each of the 8 X 8 values matrices to map the spatial luminance or 25 chrominance values into the frequency domain.
Next, represented by block 103 of Figure 1, a process called "quantization" weights each element of the 8 X 8 matrix in accordance with it~ chrominance or luminance type and its frequency. In an I-picture, the quantization 30 weights are intended to reduce to one many high frequency components to which th~ h~man eye is not sensitive. In P-and B- pictures, which contain mostly higher frequency components, the weights are not related to visual perception. Having created many zero elements in the 35 8 X 8 matrix, each matrix can now be represented without information loss as an ordered list of a 'IDC'' value, and alternating pairs of a non-zero ''ACIl value and a length of 20~22~0 zero elements following the non-zero value. The list is ordered such that the elements of the matrix are presented as if the matrix is read in a zig_zag manner (i.e., the elements of a matrix A are read in the order A00, A01, 5 A10, A02, A11, A20 Ptc.). This representation is space efficient because zero elements are not represented individually.
Finally, an entropy encoding scheme, represented by block 104 in Figure 1, is used to further compress the 10 representations of the DC block coefficients and the AC
value-run length pairs using variable length codes. Under the entropy encoding scheme, the more frequently occurring symbols are represented by shorter codes. Further efficiency in storage is thereby achieved.
Decompression under MPEG is shown by blocks 105-108 in Figure 1. In decompression, the processes of entropy encoding, quantization and DCT are reversed, as shown respectively in blocks 105-107. The final step, called "absolute pixel generation" (block 108~, provides the 20 actual pixels for reproduction, in accordance to the play mode (forward, reverse, slow motion e.g.), and the physical dimensions and attributes of the display used.
Further, since the MPEG standard is provided only for noninterlaced video signal, in order to display the output 25 motion picture on a conventional NTSC or PAL television set, the decompressor must provide the output video signals in the conventional interlaced fields. Guidelines for decompression for interlaced television signals have been proposed as an extension to the NP~G standard. This 30 extended standard is compatible with the International Radio Consultative Committee (CCIR) recommendation 601 (CCIR-601). The process of converting from a picture to the two interlaced fields of a frame is discussed in ANNEX
C of the MPEG publication "Coding for Moving Pictures and 35 Associated Audio for digital storage medium at 1.5Mbit/s"
incorporated by reference above.
Since the steps involved in compression and 2~622~

decompression, such as illustrated for the MPEG standard discussed above, are very computationally intensive, ~or such a compression scheme to be practical and widely accepted, the decompression processor must be designed to 5 provide decompression in real time, and allow economical implementation using today's computer or integrated circuit technology.

SUMMARY OF THE INVENTION
In accordance with the present invention, a method 10 and a structure are provided for decoding intraframe and interframe coded compressed video data. In one embodiment of the present invention, a decompression structure includes a processor, a decoder coprocessor, an inverse discrete cosine transform coprocessor and a motion 15 compensation coprocessor, and a global bus for communication. The decompression structure in accordance with the present invention can also communicate with a host computer over a host bus and with an external dynamic random access memory (DRAM) over a memory bus.
The processor in the decompression structure of the present invention provides overall control to the decoder, IDC'r and motion compensation coprocessors by reading and writing into a plurality of data and control registers each associated with one of the decoder, the IDCT and the 25 motion compensation coprocessors.
In one embodiment of the present invention, the 2-dimensional display space is mapped intn the linear address space of the external ~RAM by embedding in the linear DRAM addresses X and Y vectors of the display 30 space. Further, the mapping of the X and Y vectors in accordance with the present invention allows a macroblock of pixels to be stored in one DRAM memory page, so that access to a macroblock can be effici~ntly accomplished under page mode access to the DRAM page. In o-~e 35 embodiment, timing of *he CAS signal is satisfied by delaying the falling edge of the clock signal. By looping , . . ............ .
- :. :

2~22~

the CAS signal back into the chip from an output pin, timing of data arrival from the external DRAM is better controlled. By providing special control to one address bit, data of four pixels can be obtained at one time in a 5 2 X 2-pixel ("quad pixel") configuration, or in a 4 X 1-pixel ("scan") configuration.
In one embodiment of the present invention, an HDTV
decompression structure, including four of the decompression structures mentioned above, and a method are 10 provided for decoding high de~inition television (HDTV) signals. In this HDTV decompression structure, each decompression strjuc~ture decodes a 480 X 1088-pixel picture area with access to two 240 X 1088-pixel picture area. A
method using a divide-by-15 divisor is provided in the 15 HDTV decompression structure to map the display space into the external DRAM with efficient use o~ the DRAM physical address space.
In one embodiment of the present invention, a decoder logic unit, including a plurality of decode tables, and a 20 method are provided in the decoder coprocessor to decode coded video data. Each coded datum to be decoded is provided to all of th~ decode tables. The decoded datum is selected by a finite-state machine from among the output data of all the decoded tables.
In one embodiment of the present invention, the processor of the decompression ~tructure is provided with a structure and a method for minimizing the cost of computinq a product by reducing the computation to a sum of modified operands obtained by using ternary arithmetic 30 and either zeroing, negating or leaving unchanged precomputed constants.
In one embodiment of the current invention, a block memory structure and a method are provided for receiving 8 X 8-pixel blocks column by column in a 16 X 16-pixel 35 picture area, such that the 16 X 16-pixel picture area can be output column by column simultaneously as the 8 X 8-pixel blocks are received, without double-buffering.

.

~, , .
' 20~220~

In one embodiment Qf the current invention, a motion compensation structure and a method are provided for interpolating intarframe coded video data using motion vectors. The motion compensation structure comprises a 5 filter for resampling the pixel data in both vertical and horizontal directions, a prediction memory structure and a weighted adder structure. In one embodiment of the present invention, a weighted adder structure and a method are provided for performing bilinear interpolation of two 10 values using a plurality of multiplexers and an multiple-input adder.
In one embodiment of the present invention, a structure and a method are provided for accessing a 16 X
16-pixel picture area in two parts, in order that the 15 number of DRAM page boundaries crossed during such access of the 16 X 16-pixel picture area is minimized, thereby increasing the efficiency of memory access by reducing the overhead cost associated with initial accesses of DRAMs under page access mode.

Figure 1 is a model of the compression and decompression processes under the MPEG standard.
Figure 2 is a block diagram of an embodiment of the present invention in a video decompression circuit 200.
Figure 3 is a more detailed block diagram of the video compression circuit 200 shown in Figure 2.
Figure 4 is an instruction format of processor 201 in the video decompression circuit 200 of Figure 2.
Fiqure 5 illustrates movement of data in a 30 coprocessor module having SRAM and a control register to and from external DRAM.
Figure 6 shows the interface between the global bus 205 and the memory data bus 208b in the memory controller 304 of Figure 3.
Figure 7a shows the control and data signals of a page mode access to a conventional dynamic random access 2~622~

memory.
Figure 7b shows the delayed CAS falling edge to meet CAS high requirement, in accordance with the present invention.
Figure 7c is a schematic diagram of a circuit 700 to implement the delaye~ S signal in accordance with the present invention.
Figure 8a show the mapping of the 2-dimensional display space to the 24-bit linear address space of the 10 external DRAM.
Figure 8b shows the byte addresses (lower 9 bits) of a 16 X 16-pixel macroblock.
Figure 8c is a logic circuit which implements the control logic for bit E[6] in the byte address, so as to 15 allow accessing memory in the quad pixel mode or in scan mode.
Figure 9a shows the display space seen by one of four video decompression circuits under HDTV mode in accordance with the present invention.
Figure 9b shows both the display space and the linear physical address space under HDTV mode.
Figure 9c is a functional block diagram of a circuit which implements the mapping of DRAM byte address to the linear physical address space.
Figure 9d shows that the operation of fetching reference macroblocks 981 and 986 requires crossing one and four DRAM page boundaries respectively.
Fi~ure ge shows a circuit implementation of the mapping scheme shown in Figure 9c.
Figure 9f shows the mapping of the DRAM byte address I space into the physical D~.address space under HDTV
mode.
Figure lOa is a schematic diagram of the decoder logic unit 307 of the video decompression circuit 200 35 shown in Figure 2.
Figure lOb is a syntax state machine showing the par~ing of macroblock level variable length codes~
. ~ -, . ,~

,:
, 2~2~0 Figure lOc shows the data representation of a differential motion vector in accordance with the present invention.
Figure lOd is a schematic diagram of a circuit 1000 5 for reconstructing a motion vector from the decoded V and r components.
Figure lla is a schematic diagram of a circuit 1200 for generating the control signals to multiply the Y-component of the motion vector and the screen width.
Figure llb shows non-contiguous buffer and ring buffer implementations of a video memory.
Figure 12a-d shows the four patterns of memory access in bankO of th~ block memory 314.
Figure 12e shows the address bit patterns generated 15 to access bankO of block memory 314 in each of the four memory access patterns 0-3 of Figures 12a-d.
Figure 12f shows a counter for generating the addresses for implementing the memory access patterns 0-3 of the present invention.
Figure 13a shows the data flow path through the motion compensation units 315-317.
Figure 13b is a schematic diagram of pixel filter unit 316.
Figure 13c shows a motion vector mvl yielding a 25 predictor macroblock which maps into an area in the external DRAM spanning DRAM page boundaries.
Figure 13d shows the content of the row memory 1306 and the two-part memory access pattern in which the pixels of a macroblock are fetched.
Figure 14 shows a circuit 1400 for implementing the bilinear interpolator in the weighted adder 316 of the present embodiment.

DETAILED DESCRIPTION OF THE PREFE~RED EMBODIMENTS
Figure 2 shows an embodiment of the present invention 35 in a video decompression circuit 200. This embodiment of the present invention is provided in ~he CL950 MPEG Video .
,, .

Deco~pression Processor (the "C~950 chip"), available from C-Cube Microsystems, San Jose CA.
As shown in Figure 2, a video decompression circuit 200 has a processor 201, a decoder coprocessor 202, an 5 IDCT coprocessor 203, and a motion compensation coprocessor 204 connected by a global bus 205. Video decompression circuit 200 has four interfaces: a 49-bit host bus 206, a 10-bit code bus 207, a 82~bit memory bus 208, and a 15-bit video bus 209.
The glo~al bus 205 provides the conduit of communication amongst the processor 201, and the coprocessors 202-204. The global bus comprises a 32-bit data bus and a 7-bit address bus, with the least significant bit of the 7-bit address bus indicating 15 whether the 7-bit address is a read address or a write address. Selected modules in the coprocessors 202-204 are each assigned ~our coprocessor addresses: a "read data"
address (base address), a "write data" address (base+1 address), a "read control" address (base+2 address), and a 20 "write control" address (base~3 address). In addition, processor 201 is assigned sixty four addresses to read and write thirty two registers in processor 201. As will be explained below, processor 201 monitors and controls the operations of the modules in coprocessors 202-204 by 25 reading and writing into each module's control and data addresses.
The host bus 206 communicates with a conventional host computer using a standard communication protocol such as the ANSI/IEEE Standard 1196-1987 ("NuBus" Standard).
30 The type o~ host computer and the communication protocol used are not consequential to the present invention. In this embodiment, the host bus 206 has a bidirectional 32-bit bus for data input and output purposes, an 8-bit address bus which includes "host request" (Hreq) and 35 "read/write" (Hwrite) signals, 4 control input ~nd output pins, a host clock, a global clock pin, a reset pin, an interrupt pin, and a test pin. Host bus 206 is a module ~22~

given access to the global bus. The 7-bit address bus of the global bus 205 corresponds to the 7-bit address bus of the host bus 206.
The code bus 207 receives a 1-bit "code valid"
5 (CVALID) signal indicating arrival of compressed video data ("code") in a byte stream CBUS[7:0] and provides a "ready" (CRDY) signal when code bus 207 is ready for the next byte of code.
The memory bus 208 connects up to three banks of 10 dynamic random access memory (DRAM) external to circuit 200. Memory bus 208 has a bidirectional 64-bit data bus (208b) mdata[63:0~ and an ll-bit address bus (208a) for multiplexing column and row addresses, consisting of bus maddr[9:1] and leads maddrOH and maddrOL. The mapping of 15 the bits in the memory address bus 208a to row and the column addresses are discussed in a later section. Memory bus 208 can access the external DRAM under a fast page mode, which is discussed in further detail below. Three 1-bit "row address strobe" (RAS[1:0], RAS2) signals and a 20 l-bit "column address strobe" (CAS) signal are provided.
The CAS signal is looped back as a "data ready" (MCASIN) signal. Because of clock skews and other factors, such as output loading, it is very difficult to control when the column address strobe signal actually arrives at the 25 external DRAM, and hence when data are ready from the external DRAN. }Iowever, by looping back the CAS signal on the output pin, this embodiment can monitor the time at which the CAS signal is asserted at the external DRAII.
Therefore, the unc~rtainty as to when the external DRAM
30 receives the column address is removed, and hence the data arrival time, which is within a specified time from the assertion of the CAS signal, is known. Read or write operation is indicated by two bits of the write enable signal (MWE[1:0]).
The video bus 209 is a byte serial bus in CCIR-601 format operating synchronously with a video clock. The present embodiment supports both interlaced and 2 0 ~ 0 non-interlaced applications. The video bus 209 has a 8-hit data bus (VBUS~7:0]). The VSYNC signal, which indicates the beginning of a frame, can be generated by video bus 209 as an output signal, or can be provided by 5 the external display equipment as input signal to the video bus 209. A signal VPOP is provided to the video bus 209 when the external display equipment requests a byte of video data to be transferred in the next clock period. In addition, in this embodiment, five pins are reserved for 10 future enhancement, such as for expanding the VBUS [7:0]
bus to support direct output to an RGB type display.
Processor 201 is a 32-bit processor unit that provides overall control to the coprocessors 202-204, controls access to the external memory system, and 15 generally handles exceptions and low frequency tasks.
Decoder 202 is a coprocessor which receives from code bus 206 a byte stream of variable length entropy-encoded codes. Decoder 202 performs decoding and dequantization of the entropy-encoded codes. The decoded code is 20 provided to the IDCT unit 203 to be mapped from frequency space into the display space using an 8X8 2-dimensional inversed discrete cosine transform.
Motion compensation coprocessor 204 reconstructs P-pictures and B-pictures from motion vectors and past 25 and/or future frames.
Figure 3 is a more detailed block diagram of Figure 2's circuit 200, showing the functional blocks in processor 201, and coprocessors 202-204. As shown in Figure 3, the processor 201 comprises a 64 X 32-bit 30 instruction memory 301, a register file 302, which consists o~ 32 general-purpose 32-bit registers, an ALU
303, and a DRAM controller unit 304, which comprises both the DRAM address generation unit 304a and the "Pads and FF" or global bus interface unit 304b.
The de~oder coprocessor 202 is shown in Figure 3 to comprise a 32 X 32-bit code memory unit 305, a 32 X 32-bit decode memory unit 306, decode logic unit 307, zig-zag 20~2200 logic unit 308, 128 X 8-bit zig_zag memory 309, a 2 X 64 X
8-bit quantizer memory 310, and quantizer logic unit 311.
The IDCT coprocessor 203 comprises a transform logic unit 312, and transform memory 313. The motion compensation 5 unit 204 comprises a block memory unit 314, a pixel filter unit 316, a weighted ~der/ALU unit 315, a pixel or prediction memory 317, consisting of a 128 X 16-bit and a 64 X 16-bit memory, a 64 X 32-bit video memory 319, and a horizontal resampler circuit 318.

10 Processor 201 As discussed above, the processor 201 controls the overall operation of circuit 200, including the operations of the coprocessors 202-204 and access to the external DRAM. The instructions of processor 201 have the general 15 format shown in Figure 4.
As shown in Figure 4, the opcode field (combination of "op", "opcl' fields) in an instruction of processor 201 consists of five bits, in which a 2-bit field "op"
indicates the "major operation," which is either an 20 arithmetic operation, a shift operation, a load operation, or a store operation. A typical instruction specifies two sources "A" and l'B" of operands and provides the result at a destination register ~'C~. An instruction of processor 201 specifies in a 2 bit field "SRC" the "A" operand's 25 source type, which can be either a register, a 5-bit immediate value, or a 14-bit immediate value. The "B"
source of the instruction of processor 201 is always a 5-bit register, including a globally addressable register (see below), or a local register in regist~r file 302. A
30 bit "d" speci~ies whether t~:destination is a local register in register file 302, or a globally addressable register. The execution of an instruction in processor 201 sets a number of ~lags, which are tested by the next instruction to determine if a branch condition is 35 satisfied. The condition to be tested is speci~ied in a 4-bit branch control field "br". Upon a successful test ..
~ ' '' ' -- 2~22~0 of the branch condition, control is transferred to the instruction which address is contained in the register specified in the 5-bit jump target field "J". When the "A" source specifies a 14-bit immediate value, the "br", 5 "J" and "A" fields are not available.
Prior to executing an instructi~, the instruction must be loaded in the 64 X 32-bit instruction memory 301, which includes a 32-word instruction cache. The instruction cache holds one block of 32 instructions from 10 the DRAM, and 32 always-resident instructions provided for cache management and for responding to the interrupts of the coprocessors 202-204 (see belo~. The instructions are fetched in a pipeline. To increase performance, the next sequential instruction and the instruction at the 15 potential branch target are both fetched.
Thirty two general purpose registers are provided in register file 302. Register file 302 is provided with two read ports and one write port, to allow fetching of the two source operands and writing the result into the 20 destination register, if required in the instruction format discussed above. Bypass multiplexers are provided for simultaneous read and write into the same register.
Each instruction of the processor 201 is executed in one clock cycle, excluding overhead or stall cycles. In 25 memory load instructions, depending on whether a 32-bit or a 64-bit datum is loaded, an additional one or two cycles may be required before the destination register is updated. Because a special DRAM page access method is used (see below), successive accesses to DRAM locations in 30 the same row can be initiated every other instruction.
For the initial access to a new row, the access time can be four to six clock cycles. This period is hidden from the user by stalling the execution of the fourth instruction the requisite number of cycles. Hence, a load 35 instruction latency of four instructions is maintained.
In certain time critical instructions, where there are no branch condition specified (i.e., the "branch 2~220~

-- lS --never" condition), the field ~7JIl (branch target address) is used to enhance performance by providing control signals to special circuits. These controls signals specify operations such as RAS precharge, video line 5 access, memory refresh, and the special operations used in computing addresses of the motion compensated reference blocks. These special operations are discussed belo~ in conjunction with the motion compensation coprocessor 204.
As discussed above, processor 201 controls the 10 operations in each of the coprocessors 202-204 by writing into the control and data registers of modules in each of the coprocessor 202-204 over the global bus 205. The globally addressable registers are: the hCntl register in the host bus 205, the iCntl and iData registers in the 15 processor 201, the cCntl register associated with code memory unit 305, the dCntl register associated with decode memory 306, the kCntl, dDataO, dDatal, dDiag, dMV1 and dMV2 registers associated with decode logic 307, fCntl register associated with pixel filter unit 316, the sCntl 20 and tCntl registers associated with IDCT unit 203, the zCtl register associated with zigzag unit 308, bCntl register associated with block memory uni~ 314, the qCntl register associated with quantizer unit 311, the pCntl register associated with pixel memory 317, the vCntl 25 register associated with Video memory 318, and the mCntl register associated with memory controller 304.
Under the control scheme o the c:urrent invention, each coprocessor, after initialization by processor 201, is controlled internally by a finite state machine.
30 Processor 201 controls each of the coprocessors 202-204 is an independent process running in parallel other control processes. Four of these control processes are the code input, the decompression (both the code input and the decompression tasks are directed at decoder coprocessor 35 202), the motion compensation and the video out~ut tasks (both motion compensation and video output are directed at the motion compensatioll coprocessor 204). These tasks are ~22~0 given priority to access the external DRAM in the order:
a) video output, b) code input, c) decompression, and ¦ d) motion compensation. Some modules are initialized after reset, and some registers are updated after every 5 frame. The filter control register in motion compensation coprocessor 204 is updated once every macroblock.
Processor 201 assists the host computers' or the modules' access to the external DRAM. For example, modules, such as decode memory 306 implements part of its 10 first-in first-out memory (FIFO) in static random access memory (SRAM) on-chip, and overflows the FIFO into the external DRAM. The process of moving data into and out of the external DRAM is assisted by processor 201. Figure 5 illustrates a scheme by which data in the external DRAM
15 are loaded with the assistance of processor 201 into the SRAM 501 in a module having a control register 507. This scheme is illustrative generally of the manner in which processor 201 provides overall control for the coprocessors 202-204. As shown in Fiyure 5, a module is 20 assigned a base address, which is the "read data" address for reading data in a specified register in the module or at an SRAM location which address is specified in the control register 507 (placed by a previous "write control"
access), a "write data" address (base+1) for writing into 25 a specified data register or an 5RAM location specified in the control register, a "write control" address (base+3) for writing into control register 507, and a "read control" address (base+2) for readiny the control register 507. In this instance, the control register contains also 30 a field for specifying an SRAM address. The data and control registers are readable and writable on the ylobal bus 205, which comprises global addrPss bus 205a and global data bus 205b. As an example of processor 201 assisting access to external DR~M memory by the module, 35 when a predetermined level of "fullness" in the SRAM part of the FIFO is reached, an in~errupt request by the module is sent to processor 201 by setting a bit in the module's " 2~2~

control register 507. Processor 201 responds by clearing the module's "run flag" in control register 507. When responding to the interrupt, processor 201 reads and saves the current state of the module's control register. The 5 amount of data to be transferred and the beginning address of the location in SRAM 501 from which data is to be transferred to the external DRAM are then written into control register 507. The memory controller 304 in processor 201 is set up for transferring data to the 10 corresponding locations in the external DRAM. Data are read from SRAM 501 into data register 503, onto the global data bus 205, and thsn transferred into the external DRAM
over memory bus 208 (64-bit wide). As each 32-bit datum is transferred, the data count in control register 507 is 15 decremented and the SRAM address is correspondingly incremented by incrementor circuit 505 after every word transferred. Finally, when the data count reaches zero, processor 201 restores the state of the module's control register 507, with the run flag set.
Processor ~01 also includes an arbitration unit (not shown) for allocation of the global bus 205. The global bus 205 can be allocated to one of four "clients":
a) completion of load instruction (for storing data read from external DR~M into a destination register or SRAM
25 location); b) the address stage of the instruction unit (for 64-bit "store double"), c) the host bus interface;
and d) the execution phase of the instruction unit.
Instruction execution is stalled for any host bus cycles and memory access conflict.
Processor 201 spends most of its time executing the task which controls decoding of a macroblock slice (i.e., a group of macroblocks, defined in the MPE5 standard).
This macroblock slice firmware can fit at the same time in the instruction memory 301 with the interrupt firmware.
35 In between the executions of the macroblock slice task, the macroblock slice firmware is swapped out to make room for execution of higher level routines, such as sequence -- 2~622~0 initialization, picture initialization, error handling etc.
ALU 303 comprises input multiplexers, an input complementor, a 32-bit adder and logic unit, and a 32-bit 5 barrel shifter. These circuits are generally known in the art and are therefore ~ot repeated here.

DRAM Controller DRAM Controller 304 supports both HDTV ("High Definition TV") and non-HDTV modes. Non-HDTV includes 10 support for "enhanced definition TV" (EDTV). Under the non-HDTV mode, the memory controller 304 supports three banks of DRAM directly, providing the conventional DRAM
control signals RAS (row address strobe), CAS (column address stro~e) and WE (write enable). Under HDTV mode, 15 the RAS signal is generated by an external circuit. DRAM
controller 304 also provides refresh cycles. DRAM
controller 304 comprises the functional units "dg_ms"
(state machine), "dg ma" (address block), "dg_mr" (refresh block) and "dg_mc" (control logic block).
The external DRAM memory houses the rate buffer (also called the "code buffer"), reference frames and the current frame decoded. The code buffer is a FIF0 ring that holds compressed data before decoding. An intracoded frame typically uses 3 to 17 times more data than 25 predicted or interpolated frames. Therefore, if compressed data are arriving at a constant rata, the rate buffer accumulates data when predicted or interpolated frames are decoded, and depletes data when intra coded frames are decoded.
To implement the MPEG,~t~ndard, the present embodiment holds two reference frames in the external DRAM. The DRAM may also hold all or part of the frame currently being decoded. If each macroblock can be output after it is processed, such as when an external frame 35 buffer exists, then the current frame need not be stored.
In another instance, when a line of pixeI is displayed as 2~62~

soon as it i5 decoded, and displayed only once, then the DRAM need only hold two rows of macroblocks. However, up to a full frame of storage is required when the input code is not interlaced and the output signal is interlaced.

5 Non-HDTV Mode The present embodiment supports 256K X 16-bit, 256K X 4-bit or 64K X 16-bit DRAM chips using different pin connections to the row and column address inputs of these chips. Table 1 shows the pin connections for these 10 supported DRAM chips. Regardless of the particular chips used in the external DRAM, the external DRAM can be viewed as a byte-addressable memory having a 24-bit address space (E[23.0]). In the embodiment shown in Figure 3, under non-HDTV mode, each memory word is 64-bit wide, allowing 15 the memory to be organized as 256K X 64-bit or 64K X 64-bit. In the 256K X 64-bit configuration, bits E[22:21] select one of the three memory banks, and bits E[20:3] are provided as row and column addresses in accordance with the chips used in the implementation of 20 the external DRAM (see Table 2). In the 64K X 64-bit configuration, bits E[22:19] select the memory bank, and bits E[1803] selects the row and column addresses~

maddr output~ 9 8 7 6 5 4 OLtOH 3 2 25 addre~s bit~ output aa column address 10 11 lO 9 8 7 6 5 4 3 addre~ bit~ output a~ row addres~ 11 20 19 18 17 16 15 14 13 12 bit~ u~ed for 256Rx4 30 colu~n addr~s~C C C C C C C C C

bit~ u~ed for 256Xx4 row addre~.R R R R R R R R R

bita u3ed for 256Kx16 column addre3~C C C C C C C C

35 bit~ u~ed for 256Xx16 :~ row addre~sR R R R R R R R R R

bit~ u~ed for 64Xx16 column addre~ C C C C C C C C

bit~ u~ed for 64Xx16 40 row addr~ R R R R R R R R

_ ~ ~ .
.

2~62~0 Figure 6 is a schematic diagram of the global bus and memory bus interface unit 304b of the present embodiment.
As shown in Figure 6, the memory data bus 208b comprises two 32-bit busses mdata~63:32] (bus 601) and mdata[31:0]
5 (bus 602, comprising busses 602a and 602b), respectively referred to as the "higher" and the "lower" 32-bit busses.
The lower 32-bit bus can be further divided into two 16-bit busses for 16-bit operations. Re~isters 603a, 603b and 603c latch the 64-bit data Erom the external DRAM on 10 bus 208b (busses 601 and 602) for loading onto the 32-bit global bus 205. In the other direction of data flow, registers 606a, 606b and 606c latch the 32-bit data from the global bus 205 to the 64-bit memory data bus 208b.
Because 64-bit data arrive from the global bus 205 15 over two clock periods, the first (higher) 32 bits are temporarily stored in register 608. These 32 bits are then written at the same time with the lower 32 bits into respectively the registers 606a, 606b and 606c for simultaneous output on memory bus 208b. Multiplexers 20 607a, 607b and 607c can be used to bypass register 608 and to channel a 32 bit datum from the host data bus 612 (through multiplexor 611) to either the high 32-bit or the low 32-bit of the memory data bus 208b. Since each datum from the external DRAM on bus 208b is 64-bit wide and the 25 global bus 205 is 32-bit wide, the 64-bit datum is ~irst loaded into the registers 603a, 603b and 603c, when the "data ready" signal MCAS~N is received. The higher 32-bit datum in register 603a is sent to the global bus 205, while the 32-bit datum in registers 603b and 603c is 30 temporarily stored in register 609 for output to global bus 205 in the next clock period. Storing the lower 32-bit datum in register 609 instead of letting it remain in registers 603b and 603c is necessary to avoid it bsing overwritten by the next datum arriving on busses 602a and 35 602b in the next clock period, in the event whe~- ~he signal MCASIN is received during the same clock period as the corresponding "column address strobe" signal (MCAS) is 2~22~

sent, when operating in burst mode during which memory read requests are s~nt every other clock period.
In order to initiate a memory request every other clock period, page access mode is used. Figure 7a shows 5 the data and control signals for the conventional page access mode. As shown in Figure 7a, the RAS signal goes to logic low state at time tO, indicating that row address is ready. The CAS signal then goes to logic low state at time t2 indicating the column strobe address is ready.
10 The initial read access is completed at time t3 when the data read (represented by the signal "ReadData") arrive from the DRAM. U~de~ pa~e mode, the second read after the initial access can begin at time t3 by bringing CAS high again and providing only the column address, while the RAS
15 signal remains low. Thereafter, the second read access is completed at time t5, when the second datum arrives from - the DRAM. The third read access can likewise be initiated by bring CAS to logic high state again at time t5.
Since most commercially available DRAM components 20 require unequal hold times of "CAS low" and "CAS high"
(e.g., for some 80ns DRAMs with minimum page mode cycles of 55ns, the minimum hold times for CAS low and CAS high are respectively lOns and 30ns), a convenient timing scheme for implementing the page mode access of Figure 7a 25 is by synchronizing the rising and falling edges of the CAS signal with the global clock, so that, in the first clock period, the CAS signal is high during the time when the global clock is high, and changing state to CAS low when the clock changes to low state. In the next clock 30 period, CAS remains low. For a 45-55 duty cycle clock, this timing scheme requires that 1.55 clock periods must be long enough to satisfy the CAS low hold time requirement, and 0.45 clock period must be long enough to satisfy the CAS high time requirement. Under this sch~me, 35 for CAS high hold time, the margin allowed fvr timing variation due to fluctuations in the manufacturing process is very small. For example, if the timing scheme ~6~2~'3 described above is used in the present embodiment, which has a 45-55 duty cycle global clock of 36 MHz (27.8ns per clock period), the C~S high time for the 80ns DRAM above is not met. This is because the global clock has a logic 5 high period for only 12.5ns, and the transition times for the CAS signal can be greater than 2.5ns, leaving less than 10ns to satisfy the CAS high hold time requirement.
One solution will be to extend the global clock period in order to meet the CAS high hold time requirement. This 10 method is very wasteful.
Noting that there is a margin in the CAS low time (e.g. in the 80ns DRAM discussed above, the minimum CAS
high time is 30ns, and i.55 clock period is 40.3ns), the above CAS high hold time problem can be overcome by 15 delaying the high to low transition of the CAS signal without requiring a longer global clock period. Figure 7b shows the CAS signal being delayed by a time period td after the global clock assumes a logic low state at tl in the first clock period (between t0 and t2). The delayed 20 CAS signal can be generated by the circuit 700 shown in Figure 7c. In Figure 7c, the global clock signal is provided on lead 704, which is ~ed into a number of serially connected delay elements 701.1 to 701.n. Edge detector 702 detects, when the global clock transitions, 25 whether the transition is a logic high to logic low or a logic low to logic high transition. When the edge detector 702 detects a logic low to logic high transition, a control signal is sent over lead(s~ 705 to set multiplexer 703 to select the clock signal; otherwise, the 30 control signal on lead(s) 705 sets multiplexer 703 to select one of th~ delayed output signals of delay elements 701.1 to 701.n. The control signal in lead 705 select the amount of delay according to a user parameter. The CAS
signal is held to logic low during the next clock period.
35 While other circuit el~ments can be used, in the present implementation, ~ach delay element is a 3-input NOR gate.
The 2-dimensional space of a display is mapped into 2~6220~

thP 24-bit linear address space. One such mapping from screen space to the DRAM address space is shown in Figure 8a. Since luminance and chrominance data of two pixels adjacent each other in the vertical direction can be 5 represented in 32 bits (YY W) for both the 4:2:2 and the 4:2:0 formats, two p~,e~s can be stored in a 32-bit half-word in the present embodiment. In the present embodiment, the 24-bit address space is used to represent a 2-dimensional screen space of 2~ (X) by 2~3 (Y)-pixel 10 picture area. Figure 8a shows a mapping of the 2-dimensional screen space to the byte address space E[23:0] of the DRAM. As shown in Figure 8a, the Y vector Y[13:0] can ~e represented by E[23:15,5:2,0] and the X
vector X[10:0] can ba represented by E[14:6,1,0]. Bit 15 E[O] can be used to represent sub-pixel space, if necessary. This representation allows the bits E[8:1] to represent the a 2-dimensional space inside the macroblock, with bits E[8:6,1] and bits E[5:2] as the x and y vectors respectively. In this macroblock space, the address 20 (E[8:6], E[5:3]) specifies one o~ the 64 quad pels, with bits (E[lJ, E[2]) specifying one of the four pixels in the ; quad pel.
In this embodiment, the address genera~ion unit 304a of the memory controller 304 receives from processor 201 25 the byte address E~23:0]. As shown in Table 1 above, the bits of the memory address bus 208b (maddr[9:1], maddrOH, maddrOL) are given by (E[11], E[20:16], E[14:12], E[15], E[15]) for providing the row address, and (E[10], E[11:7], E[6:3], ~[6], E[6]) for providing the column addressO The 30 pixels are stored in the DRAM at byte addresses shown in Figure 8b. When a "load d~uble" (~DDA) instruction is executed, four pixels in a 64-bit word are fetched from the DRAM memory~ In the present embodiment, two modes of pixel access are allowed. Depending on whether "quad 35 pixel" or "scan" mode is selected, these four pixels correspond either to a quad pixel (2 X 2), or four pixels in the same horizontal scan line ("scan order"). To allow . . . ..

,' ., ,' , ~ . .
.
.. ' :, .

2~2200 such access, quad pixels must be stored into the DRAM over the memory data bus 208b in accordance with the following rule:

address(E[6:3]) mdata[63:32] mdata~31:0]
OXXX UT VT YT YT ,,~,UB VB YB YB
lXXX UB VB YB YB UT VT YT YT

where "T" denotes data corresponding to the top two pixels of the quad pixel, and "B" denote that the data corresponding to the bottom two pixels of the quad pixel.
10 Storing top and bottom pixels alterrat.ely according to the parity of bit E[~] (i.e., changing the top and bottom pixel store order every 8 column addresses) allows fetchiny either ~our top or four bottom pixels (i.e., four pixels on the same horizontal line) simultaneously. This 15 ability to fetch pixels in scan order is efficient in providing pixels to the video memory 318 for output. On the other hand, the ability to fetch pixel in quad pixel order facilitates the resamplin~ step in motion compensation (see below~.
To fetch a quad pixel, the maddrOH and maddrOL are each given the value of E[6~, so that the word address (i.e., E[23:3]) of the higher 32-bit halfword fetched in mdata[63:31] is the ~ame as the word address of the lower 32-bit hal~word of fetched in mdata[31:0]. However, when 25 fetching in the scan mode, the following rule is ~ollowed when providing the word column address to the external DRA~:

maddrOH maddrOL
even srans ~i.e., E[6]=0) 0 30 odd scans (i.e., E[6]=1) 1 0 Recalling that the column word address for the higher 32-bit halfword ~etched by mdata[63:32] is specified by (maddr~9:4], maddrOH, maddr[3 1]) and the column word , 20~2~0 address for the lower 32-bit halfword fetched in mdata[31:0] is specified by (maddr[9:4], maddrOL, maddr[3:1]), the column word addresses of the higher 32-bit and lower 32-bit of mdata[63:0] are offset by 8 5 column word addresses under scan mode access. Because there are eight quad pixels in each column, the pixels fetched under scan mode are in adjacent quad pixels.
Since the pixels are stored accordance to parity of E[6], as specified above, the pixels fetched are either both the 10 top pixels of each quad pixel, or both bottom pixels of each quad pixel.
In this embodiment, a separate logic circuit is provided to decode bit E[6] of the DRAM address. One implementation is provided in Figure 8d. In Figure 8d, 15 the signal "scan" is at logic high for scan mode and at logic low for quad pixel mode, and the signal "word order"
indicates in quad pixel mode whether the top pixels are found in the higher 32-bit halfword (word order = 0) or the lower 32-bit halfword (word order = 1) of the memory 20 data bus mdata[63:o].

HDTV Mode HD1~ applications are supported in accordance with the present invention hy configuring, as shown in Figure 9a, four of the video decompression circuit 200 of Figure 25 2. In Figure 9a~ four of the video compression circuit 200, 200a-200d, are provided with eight memory banks - 901a-9Olh. Video compression circuits 200a-200d each communicate with two banks of memory, in addition to one memory bank from each of its left and right neighbors, if 30 any. In HDTV, the display space is 1920 X 1080 pixels.
In the present embodiment, the H~TV display space is divided into four vertical sections of 480 by 1080 pixels, with each section contained in two banks of memory.
Figure 9b shows the display space 920 for one a~the four 35 video decompression circuit 200a-d. As shown in Figur~
9b, the display space seen by each of the four video 20622~0 decompression circuits 200a-d is a display area of 960 X 1080 pixels, in which the middle 480 X 960-pixel picture area is stored in the video decompression circuit's own memory banks 921 and 922, and the two 5 240 X 480-pixel picture areas on each side of the middle 480 by X 1080-pixel picture area are stored in the memory banks 923 and 924 of its neighbors to the left and to the right respectively. Video compression circuits 200a and 200d (Figure 9a) each have a 240 X 1080-pixel picture area 10 not mapped to the display space, since video compression circuit 200a and 200d each have only one neighbor. Access to a neighbor's me~Qr~ bank is necessary only when motion compensation requires access across the boundaries of ths vertical sections. Because motion vectors are of limited 15 range, the problem arising from the same bank of memory being accessed by more than one video compression circuit can be avoided by requiring that the video decompression circuits 200a-d decode the vertical sections in lock-step.
Such synchronization can be provided by tying the VSYNC
20 pin of the video decompression circuits 200a-d together.
Further, since a reference macroblock needs to fetch an 18xl8-pixel picture area, and four 8x8-quad pixel macroblocks are typically stored in one page of DRAM
memory, dependant upon the position of the reference 25 macroblock, a macroblock fetch can cross 1-4 DRAM paper boundaries. Figure 9d illustrates the number of DRAM page boundary crossings for kwo reference blocks 981 and 986.
In Figure 9d, the reference macroblock 981 spans two DRAM
pages 990 and 991. DRAM page 990 stores four 8x8-quad 30 pixel picture areas 982-985. Fetching thi~ reference block 981 requires crossing the DRAM page boundary between DRAM pages 990 and 991. However, reference block 986 spans four DRAM pages 990, 991, 992 and 993 requiring four crossings of DRAM page boundaries to complete a fetch 35 operation of the entire reference macroblock 986.
Therefore, in accordance with the prasent invention, in order to maintain the lock-step relationship amongst each 2~22~

- ~7 -video decompression circuits 200a-200d, each paye mode access is limited to fetching only an 8x8 quad pixel picture area, so that regardless of the number of DRAM
page boundaries required to be crossed, four page mode 5 access cycles are required ~or each reference block ~etched. In this manner, since the number of pixels processed by each video decompression circuit 200a-d are the same, the lock-step relationship is always maintained.
Under the HDTV mode, the mapping of DRAM byte 10 addresses onto the linear physical address space is different from the mapping under non-HDTV mode described above. Since the size of the each vertical section is not a power of 2 in the x-dimension and each section is separately processed by up to three video compression 15 circuits, a straightforward mapping of byte address space to the linear physical address space, such as that used in the non-HDTV msde (physical addresses obtained by rearranging the bit pattern of the DRAM byte address E[23:0]), will lead to inefficiency. For exampls, such 20 allocation o~ the display space leads to video compression circuits 200a-c each processing a picture area of 256 pixel~ X 1080 pix~ls, and video compression circuit 200d processing a 192 X 1080-pixel picture area. Coupled with the requirement that video decompression circuits 200a-d 25 decode in lockstep, the speed of decompression under HDTV
mode will be degraded because the uneven distribution of load leads to frequent wait cycles. Therefore, a mapping is desired such that the load on each video compression circuit 200, and hence its associated memory banks also, 30 are balanced.
In accordance with the present invention, a mapping scheme ~rom the DRAM byte address space to the physical address space is adopted which equally divides the display space among the video decompression circuit 200a-d. In 35 addition, the mapping leaves very few locations in the linear physical address space which do not correspond to a pixel in the di~play space. The present invention 2~22~

minimizes such gaps in the linear physical address space with some added complexity. Nevertheless, eliminating the waste due to having memory locations never accessed is desirableO Figure 9c shows in block diagram form this 5 mapping of the DRAM byte address space E~23:0] to the physical memory address space.
Under the scheme of the present invention, bits E[23:3] of the DRAM byte address E[23:0] are mapped into the row and column addresses of the linear physical 10 address space. The display address space (X, Y vectors) are also provided in Figure 9c for reference. The linear physical address space is assumed to be specified by the bank b[1:0], row[9:0] and column col[9:0] addresses. As in the non-HDTV mode, dependent upon the type of DRAM type 15 chosen, not all of thPse bits are connected. Bits E[8:3], which correspond to the addresses sf quad pixels within a macroblock, are provided directly to the column address bits Col[5:0]. Bits E[14:9], which specify the macroblock in the "strip" specified by the X vector (a "strip" is a 20 one macroblock-high picture area spanning the horizontal extent of the display space), are mapped into one of the 60 macroblocks in the four memory banks accessible by the video decompression circuit. This mapping is performed by a divider represented by block 931, dividing the value of 25 E[14:9] by 15, so that the remainder via a multiplexer 932 is provided as the row address bits row[3:0], and the quotient is provided as the bank address bits b[1:0].
~his method allows the elements of the macroblock to be stored at the same row addre~s in the same memory bank, 30 thereby allowing page mode access to the elements of the macroblock. Also, the division result only affects the row and bank portions of the DRAM address and does not affect the column address. As a result, the extra computation time required to per~orm the division is not 35 critical to affect ~ast page mode access.
Since the division scheme above generates a remainder between 0 and 14 inclusive, a value of 15 ('FH) in bits : : :

2~6220~

-- 2g row~3:0] cannot be generated, and so leaving a gap in the physical address space. In accordance with the present invention, such gaps ar~ filled by mapping into them the macroblock strips corresponding to higAer Y vectors. In 5 the 1024 lines (Y ~= 1024) counting from the top of the display space, the value of the bit Et23] is zero, the bits E[22:15] are respectively provided via multiplexers 933-936 as the value in bits (rowt9:8], col[7:6], row~7:4]). However, if the bit E~23] equals 1 and 10 E~19]=0, corresponding to a Y vector between 1024 and 1088, a value 15 is ~orced by multiplexer 932 into row[4:0] and the remainder rout provided by divider 931 is provided by multi~lexers 933 and 935 as row address row~7:4], and bits E~18:15] are provided via multiplexers 15 934 and 936 respectively as the bits (rowtg:8], col[7:6]).
Hence, the bits E~22:19] are now mapped into the gap represented by value 15 in row~3:0] of the physical address space.
This approach is taken one step further when bits 20 E[23] and E~19] are both 1. In that situation, values of 15 are forced by multiplexers 932 and 335 into both row address bits row[7:4] and row[3:0], and the value of DRAM
byte address bits E[18:15] is provided via multiplexers 934 adn 936 respectively to the bits (row~9:8] and 25 col~7:6]), mapping these DRAM byte addresses into the gap corresponding to a value 'FFH in rowt7:0] of the physical address.
Figure 9e is a circuit for implementing the mapping mechanis~ described above in conjunction with the block 30 diagram of Figure 9c. The corresponding structures in Figures 9c and 9e are given the same reference numerals.
Note that multiplexers 932 and 935 are implemented by OR-gates in Figure 9e. This is because when the control (e.g. bit EC23] in multiplexer/OR-gate 932) is 1, the 35 output bits desired are all l's. In addition, the concept illustrated by Figure 9c is taken even one step furthex in OR-gate 937, corresponding to the situation when E[23], 20622~0 E[l9] and E[18~ are all l's. OR-gate 937 provides mapping into a further 1/16 of a row of memory.
Figure 9f shows in the shaded areas the mapping E[23:0~ to the physical address space for Y vectors having 5 a valuo at and above 1024, as described above.
Hence, the 1920 pixels X 1080 pixels address space is mapped into a 8 banks of 256K X 64 physical address space.
Each processor maps 960 x 1080 pixels into 4 banks of 256K
by 64-bit memory.

10 Decoder Coprocessor_202 Referring back to Figure 3, the decoder 202 comprises the code memory 305, decode memory 306, decode logic 307, zigzag logic unit 308, zigzag memory 309, quantizer unit 311 and quantizer memory 310. The zig_zag logic unit 308, 15 zig_zag memory 309, quantizer unit 311 and quantizer memory 310 can be implemented by the structures disclosed in either of the following copending applications: a) U.S.
Patent Application entitled "System for Compression and Decompression of Video Data using Discrete Cosine 20 Transform and Coding Techniques," by A. Balkanski et al., serial no. 07/492,242, filed March 14, 1990, and assigned to C-Cube Microsystems, which is also the assignee of the present application; and k) u. s. Patent Application entitled "System for Compression and Decompression of 25 Video Data Using Discrete Cosine Transform and Coding Techniques," by A. Balkanski et al., serial no.
07/572,198, filed August 23, 1~90, assigned to C~Cube Microsystems, which is also the assignee of the present application. The above copending Applications a) and b) 30 are hereby incorporated by reference in its entirety.
The code memory 305 and the Decoder memory 306 implements FIFO memory which overflows into the external DRAM. As coded data arrive on the code bus 207, they are pushed on the FIFO. The coded data in cod~ memory 305 are 35 trans~erred 64 bytes at a time, assisted by processsr 201 using an interrupt mechanism. The coded data are provided 2 ~

to decoder logic unit 307 for decoding. Decoder logic unit 307 generates a "pop" request when it is ready to receive the next coded datum. In one mode of the present embodiment, the code memory 305 and the decoder memory 306 5 are connected together. In this mode, no part of the FIFO
memory reside in the ~x~.ernal DRAM.
The low level coded data stream consists of variable length codes.

Decode Logic Unit Figure lOa is a schematic diagram showing the structure of decoder logic unit 307. As shown in Figure lOa, a coded data stream is provided to register 1002b, which selectably receives as input data either the output data of multiplexer 1001 or register 1002b's own output 15 data. Multiplexer 1001 selects between two 32-bit busses, respectively the global bus 205 and the output bus of decode memory 306. The output datum of register 1002b is provided to register 1002a as well as the lower 32-bit input bus o~ a barrel shifter 1003. Register 1002a 20 receives as input data either the output data of register 1002b or register 1002a's own output data, which are provided as the higher 32-bit input data of barrel shifter 1003. The registers 1002b and 1002a respectively form the "front" and "back" register~ for inputting data into 25 barrel shifter 1003.
A parser of the coded data stream, represented by finite state machine 1017, is implemented in accordanc with the MPEG standard to provide control to decoder logic unit 307. Decoder logic unit 307 decodes the macroblock 30 level variable length code.iThe firmware in processor 201 decodes higher level coded data (e.g. picture level).
Figure lOb is a syntax state machine showing the parsing of macroblock level variable codes. Hence, data from the higher levels, such a5 frame distance and frame type are 35 provided as input from processor 201 to decoder 307. As shown in Figure lOa, seven types of variable codes are '': . ` , ~ ' 2~2~

decoded in decoder logic unit 307 by the following decode table units: the mba (macroblock address) unit 1006, the mtype (macroblock type) unit 1007, the mv (motion vector V
component) decode unit 1008, the mr (motion vector r 5 component) decode unit 1009, the cbp (coded block pattern) decode unit 1011, the DC decode unit 1010 and the AC
decode unit 1012. The last two decode units (1010 and 1012) decode block level datum, i.e. DCT coefficients.
Each decode table unit examines the 13-bit output bus d_mb 10 of the barrel shifter 1003 and provides the value and the length of the variable code decoded. Because the sizes of the tables in cbp unit 1011 and AC decode unit 1012 are larger than the tables in the other decode table units, these two table decode units 1011 and 1012 each generate, 15 as the first step of a two-step decoding process, instead 6-bit read-only memory addresses to respectively read-only memories cbp rom 1013 and AC rom 1014. The cbp rom 1013 then outputs the requisite cbp value and the length of the cbp variable length code decoded from the 13-bit output 20 bus d_mb of the barrel shifter 1003. Likewise, the output datum of AC rom 1014 is used to derive the AC level value and the run length in AC level unit 1016. The DC_level signal is also provided to AC level unit 1016 in order that the DC level and the AC_level can be multiplexed in 25 the same data stream for output. Although shown in Figure lOa outside of AC decode unit 1012, wh~n referring to the AC decode unit in the following discussion, AC rom 1014 and AC decode unit 1016 are considered to be included in the AC decode unit 1012. Likewise, cpb unit 1011 includes 30 cpb rom 1013.
The finite state machine 1017 keeps track of the syntax state and provides control signals to a multiplexer unit 1018 to select from amongst the output data of the decode table units 1006-1012 and forward to the appro-35 priate destinations one of the output data and the lengthof the variable length code decoded. For example, the ; DC_decode unit 1010 provides a value indicating a size and , 2~22~0 the sign of the DC value. The sign and the value are then used in the DC_level unit 1004 to extract the DC_level differential following the variable length code. The length of the variable length code decoded is provided to 5 an accumulator 1022, which keeps track of the number of decoded bits in the front and back registers 1002a and 1002b. A pop request is generated to obtain the next 32-bit datum from the Decode memory 306 and to transfer a 32-bit datum from register 1002b to register 1002a, when 10 necessary.
The decoded cbp value, which indicates the blocks for which transform coefficients are coded, is used for sequenciny in decoding the rest of the macroblock. This sequencing is provided by block_count/cbp unit 1015. A
15 "coeff-count" unit 1019 is provided for counting the sequence of 63 AC coefficients and 1 DC coefficient in the decoded block data stream. Thus decoder coprocessor 202 provides a bit stream in a form suitable for the IDCT unit 203. The unpacker unit 1026 expands run lengths into 20 strings of zeroes.
The "V" and "r" components of each motion vector are decoded by the mv and mr units 1008 and 1009, and provided to the mv processing unit 1020, which is discussed next.
The mv processing unit 1020 provides the motion vector in 25 the differential motion vector format used in the motion compensation coprocessor 204.
Figure lOc shows the data representation of the motion vector in the present embodiment. As shown in Figure lOc, a motion vector is stored in a 32-bit data 30 word D[31:0] comprising a 8-bit horizontal component Xt7:0] provided by (D[11:6],D[28:27]), an 8-bit vertical component Y[7:0] provided by (D[31:29],Dr5:~],D[26:24]) if the image data is interlaced, and provided by (D[31:29],D[5:3],D[25:24~) if the image data is 35 non-int~rlaced. D[3] is a parity bit indicating the field of the interlace. D[0] indicates a valid motion vector.
Motion vectors are coded differentially within a 20~22~

group of macroblocks, with every forward or backward motion vector coded relative to the previous motion vector of the same type. Each motion vec~or has a range between -16~ and 15f, where f is the "frame distance", which is S provided in the header of the picture group accordi~g to the MPEG syntax. A motion vector is coded in two parts, the V and the r components (see below), respectively decoded by mv decode unit 1008 and mr decode unit 1009.
The decoded motion vector is reconstructed by:
m = p + s*[f*(V-l)+l+r]
where s is the sign of the motion vector f is the,frame distance p is the previous motion vector V and r are the two coded components of the motion vector but if m < -16f or m > 15f, m = p + s*[f*(V-l~+l+r] + s*(31f+1) Figure lOd is a schematic diagram of a circuit 1050 included in mv processing unit 1020, for reconstructing 20 the motion vector from decoded V and r components. As shown in Figure lOd, the frame distance f, provided as a 3-bit value, is multiplied in multiplier 1051 by the 4-bit decoded value (V-1) from the mv decode unit 1008. In this embodiment, the frame distance f used is between 1 to 8, 25 inclusive. The 8-bit result in the multiplication of the frame distance f and the V component is then added by adder 1052 to the 3-bit r value from the mr decode unit 1009, with the carry-in bit of adder 1052 set. The 8-bit result of this addition in adder 1052 is then added to or 30 subtracted from, according to whether the sign (provided by mv decode unit 1008) of the motion vector is positive or negative, from the previous motion vector p of the same type in adder 1053. The previous motion vector p is stored in a 4 X 8-bit motion vector register fils 1061. Register 35 1061 contains the X and Y components (8 bits each) of the previous forward and backward motion vectors.
The 9-bit signed output datum t of adder 1053 is the ' ' ' :

20~22~0 resulting current motion vector, provided t is in the ranye ~-16f, l5f]. Otherwise, an adjustment is necessary.
To test if t is within the requisite range, if t is positive, t is added in adder 1055 to -15f; otherwise, t 5 is added in adder 1055 to -16~. The adjustment to t, if the value of t is not within the requisite range, is provided in adder 1060 by adding 8-bit value 31f+1 to the t value. Adjustment is enabled by AND gates 1057 and 1056, when the requisite condition occurs, as indicated by 10 the output of Exclusive-OR gate 1062. The new motion vector m is then stored in the motion vector register fil~
1061, replacing the last motion vector p.

IDCT
As mentioned above, the dequantiæed DCT coefficients 15 from the quantizer 311 are provided in 8 X 8-pixel blocks in row or column order to the IDCT unit 203 and stored in the transform memory 313 (Figure 3). A 2-dimensional inverse discrete cosine transform is performed on each 8 X 8-pixels block by first performing an 8-point IDCT on 20 each row of eight coefficients, followed by an 8-point IDCT on each column of eight coefficients to complete the 2-dimensional IDCT on the block. After clipping, the IDCT
coefficients are each represented in 9 bits, and range between -256 and 255.
Both copending Applications serial nos. 07/492,242 and 07/572,198, incorporated by reference above, describe structures for performing IDCT also suitable for use, and in fact used, in IDCT coprocessor 203 of the present embodiment.

30 Motion Compensation Coprocessor 204 The motion compensation Coprocessor 204 reconstructs ; predicted and interpolated pictures using motion vectors and reference frames cons*ructed from previous intra or predicted pictures. Motion compensation is directed by 35 the firmware in processor 205 by a motion compensation 2~622~

task. The motion compensation task in processor 205 operates in five phases. The first and second phases respectively fetch from the external DRAM into the pixel memory 317 the upper and lower parts of a motion 5 compensated reference macroblock in the previous predicted or intra frame (forw~-* motion vector). Then, in the third and fourth phases, the upper and lower parts of a reference macroblock from the next predicted or intra frame (backward motion vector) are fetched from the 10 external DRAM into khe pixel memory 317 and interpolated with the macroblock of the previous frame fetched in the first and second phases. In the final phase, the current macroblock is fetched from block memory 314 and added to the macroblock in pixel memory.
In order to compute addresses of the motion compensated reference macroblocks, the higher order four bits (Y[7:4]) of the Y-component in the motion vector must be multiplied by the width of the screen. To facilitate this multiplication, as mentioned above, the decoding of 20 the "jump target" field in processor 205's instruction set is modified when the "branch never" condition (i.e. no branch) is specified. The next section explains four instructions MV_LOAD, MVl, MV2 and MV3 in the jump target field designed to facilitate the multiplication of the 25 width of the screen to the higher order four bits of the Y
motion vector.

Special Instructions In 2's complement representation, a multiplication by four bits, performed one bit at a time, requires ~our sum 30 operations. However, if the Qne-bit multiplication is performed in ternary (base 3) arithmetic, only three sum operations are n~cessary. The four bits of the Y-component of the motion vector have a value which ranges ~rom -8 to 7, and can be represented by three ternary digits (~ach 35 ternary digit can take one of three values: -1, 0, 1).
The ternary digit multiplication of the motion vector can ..

.

~22~

be seen by the following formulation (the 4-bit value Val represented by ternary digits D9,D3,D~, where Val =
D9*9+D3*3~DI):
base + width*Val - Base ~ Width*Dg*9 + Width*D3*3 +
Width*DI
= Base + (Widt~*9)*D9 + (Width*3)*D3 + Width*D~
Since multiplying a value by -1, 0, or 1 i5 respectively negating the value, zeroing and or leaving 10 the value unchanged, which are relatively trivial operations to implement. That is, the above computation can be implemented in three summin~ s!_eps if the multiplication is achieved in the operand fetch phase, i.e. the fetching ~tep either negates, zeroes or leaving lS unchanged the precomputed operands of (width*g), (width*3) or width. Thexefore, the address computation above can be performed in the following code segment ~specifically, by the ADD instructions):
~any instruction> BN MVLOAD /* specifying "branch ~ 20 never" and setting - up the ternary digits of the Y_motion vector */

NOOP BN MV1 /* set up first phase of mv multiply */
ADD ADDR,width,ADDR BN MV2 /* add ternary-digit modified "width"
to content of ADDR
and set up second phase */
ADD ADDR,width3,ADDR BN MV3 /* add ternary-digit modified "width3"
to content of ADDR
and set up third ; phase */

~' ", 2~62200 ADD ADDR,width9,ADDR /~ add ternary-digit modified "width9"
and done! */
It will be appreciated that the special instructions MVLOAD, MV1, MV2 and MV3 modifies the execution of not the immediate instruction, but the instruction following.
Figure lla shows a circuit for providing the control signals "O", "-" and "*" for implementing the three phases 10 of the special motion vector computation using instructions MV1, ~V2 and MV3. The control signal "O"
indicates that the "width" ("width3," or "width9") operand should be zeroed, the control signal "-" indicates that the "width" operand should be negated. (Hence, "O" and 15 "-" cannot both be asserted at the same time). The "*"
control signal further specifies that, under certain conditions explained below, the value of the appropriate "width9," "width3" or "width" should be fetched from an alternative register.
As shown in Figure lla, a decode circuit 1101 detects in the current instruction both the "branch never"
condition and one of the special instructions MVLOAD, MVl, MV2, or MV3 for modification of the next instruction.
When MVLOAD is detected (control signal MVSEL=ooj, the 25 higher order 4 bits (Y[7:4]) of the ALU 303's output bus is latched into the register MVYH. When either MVl, MV2 or MV3 (MVSEL=O1, 10 or 11 respectively) is detected, the control signals MVSEL, together with the content of register MVYH indexes into a table 1103 containing 3-bit 30 values. The 3 bits in each 3-bit value are respectively the values of the "O", "-", "*" control signals.
In the present embodiment~ if the computation of the motion vector yields an address beyond the current macroblock, as indicated by the overflow circuit 1104 and 35 exclusive OR gate 1106, the "*" control signal is propagatsd by AND gate 1107. The "*" control signal is explained below.

' ' ' '' ~ ' : ' ,, 2~2~0~

The ~o~ 1 and "*" control signals are propagated by register 1105 to ef~ectuate the operand modification.
The contents of table 1103 are tabulated in table 1150.
In the present embodiment, macroblocks in a field or 5 frame may not be stored contiguously in memory. This condition arises if adjacent slices of macroblocks are stored in buffers separated by a "gap", or in a ring buffer (both conditions are shown in Figure llb). When the current motion vector reaches outside of the current 10 macroblock slice, as detected by the overflow circuit 1104 and exclusive-OR gate 1106, the "*" control signal directs the operand fetch to an alternate register (physically, the alternate register is also a register in register file 302 of Figure 3 but having an address one greater than the 15 specified register). The content of the alternate register is ths value of the width to be fetch augmented by the size of the gap.

Block Memory The block memory unit 314 stores and reorders each 20 macroblock of data. Data arrives in 8 X 8-pixel blocks of one luminance (Y) or Chrominance (U or V) type. However, for video output purpose, the pixels are provided in pixel pairs, consisting of two Y pixels and the U and V pixels in the same picture area. Data arrives from IDCT
25 coprocessor 203 one byte per clock on the average, at four-clock bursts during which two bytes are transferred per clock period. In the present embodiment, three banks of SRAM are provided. BankO, which is 128 X 16-bit, is d~signed to contain four blocXs of Y data, and banks Bankl 30 and Bank2, each 64 X 8-bit, are designed for storing one block of U or V data.
In the present embodiment, as data of the current macroblock arrive~ and are written into the block memory 314, the data of the previous macroblock are read out. In 35 accordance with the present invention, block m~mory unit 314 is written and read out in cycles of the four patterns 2~22~

described below. Under this four-pattern scheme, data in the current macroblock is always written into a location at which data of the last macroblock have already been read. Therefore, double-buffering to prevent writing into S a memory location before the last datum is read out is not necessary under this scheme. As a result, a 50% reduction in memory requirement is achieved.
Figures 12a-d illustrate the memory access pattern in accordance with the present invention. In each of Figures 10 12a-d, each vertical column 00-17 (octal) represents one column of a 8 X 8-pixel block, each column being a picture area of 2 pixels X 8 pixels. The numbering of these vertical columns represents the order in which the pixels are received from the IDCT coprocessor 203 (2 bytes per 15 clock period over 4-clock period bursts).
Figure 12a shows the "pattern 0" access pattern. The columns 01-04 in the first quadrant represents the first 8 X 8-pixels block of Y data. Likewise, the other three Y
blocks are represented by columns 04-07, 10-13, and 14-17.
20 In pattern 0, the vertical columns are stored at sequential memory addresses (each column being offset by 8 16-bit words, hence sequential in the address bits specifying eighth words). However, the macroblock written under pattern 0 has to be read in the order 00, 10, 01, 25 11, ..., 07, 17, in order that the 1~ X 16-pixel macroblocX can be read out in column order. Hence, as pattern 0 data are read out, the incoming data ("pattern 1") are directed to occupy the locations vacated by pattern 0. For example, the first four pattern 0 columns 30 to be read out are 00, 10, 01, 11, which are replaced respectively by columns 00, 01, 02, and 03 o~ the next macroblock ("pattern 1").
The distribution of pattern 1 columns is shown in Figure 12b. As in pattern 0 columns, after pattern 1 35 columns are completely written, pattern ~ columns are read in the order 00, lO, 01, 11, 02, 12, .O~ 07, 17 and respectively replaced by the next macroblock's ("pattern 2~2~

2") columns 00, 01, 02, 03, ..., 16, 17. Pattern 2 is shown in Figure 12c. Likewise, the columns o~ pattern 2 gives way to the columns of the next macroblock ("pattern 3"), which is shown in Figure 12d. The columns of pattern 5 3 are read in the order in which the columns of pattern 0 are written. Hence, ~uch memory access patterns can continue indefinitely in cycles of patterns 0-3. Because, in each of the memory access patterns 0-3, every memory location is read before it is written, block memory unit 10 314 need only be the size of one macroblock, and reordering is accomplished without double buffering.
The memory addresses for memory access patterns 0-3 can be generated by a counter which counts in sequential order during pattern 0 access, in the order 15 (0,8,1,9,2,10,3,11,4,12,5,13,6,14, 7,15) during pattern 1 access, in the order (0,4,8,12,1,5,9,13, 2,6,10,14, 3,7,13,17) during pattern 2 access, and in the order (0,2,4,6,8,10,12,14,1,5,3,7,11,15) during pattern 3 access. The counts in patterns 0, 1, 2, and 3 can be 20 generated by a 4-bit counter which counts by: 1) rotating to the left the four count bits in a wrap-around fashion `- 0, 1, 2 or 3 bits, in accordance with whether memory access pattarn 0, 1, 2 or 3 is desired; 2) incrementing by 1 the 4-bit counter in its rotated position; and 3) 25 rotating to the right the number of bits rotated in step 1) (i.e. returning to original bit positions)O
Figure 12~ shows a counter 1274 ~or implementing the bit rotation function. As shown in Figure 12f, four bits of the pixel address or pixel count arP provided in a 30 4-bit bus 1272 as an input datum to counter 1274. A 2-bit control directs counter 1~74~to generate the count for each of the patterns 0~3. The 4-bit output bus 1273 provides the rotated 4-bit bit patterns. The bit patterns of the counts corresponding to memory access patterns 0, 35 1, and 2 are shown in Figure 12e.

2~2~0 Motion Compensation The motion compensation function is implemented in the present ~mbodiment in the pixel filter unit 316, the prediction or pixel memory unit 317 and the weighted adder S or ALU unit 315. The data flow path through the motion compensation units 315-317 is shown i~ Figure 13a.
As mentioned above, in the first and second phases of the motion compensation operation, first and second parts of a macroblock of the forward reference frame are fetched 10 from DRAM, provided over the global bus 205 at a rate of two Y pixels and two chrominance pixel per clock period, and placed in the pixel memory 317 ~n the non-interlaced 4:2:0 mode, since the chrominance data are subsampled in the Y direction, new chrominance data arrive every other 15 clock period ~the two chrominance values arriving at a clock period wh~n no new chrominance data are provided are duplicates of the previous two chrominance values). In fetching this macroblock from the external DRAM, processor 205 provides the first order motion compensation in the 20 computation of the macroblock address, which is computed in the manner discussed in conjunction with the special instructions MVLOAD, MV1, MV2 and MV3 discussed above.
Pixel Filter 316 provides the resampling of the pixels fetched to half-pixel or quarter-pixel locations, using 25 the lower order bits X[1:0] and Y[1:0] of the X and Y
components of the motion vector.
In the third and fourth phases of motion compensation, a macroblock in the backward reference frame is fetched in a similar manner as the macroblock from the 30 forward referenca frame, and likewise resampled in the Pixel Filter 316. As the pixels o~ the macroblock from the backward reference frame are resampled, they are forwarded to the weighted adder to linearly combine with corresponding pixels in the macroblock from the forward 35 reference frame fetched in the first and second phases to form the pixels of an interpolated prediction of the current macroblock. The pixels of the interpolated 20~2~

prediction are then stored back to the Pixel Memory 317.
In the final phase, a macroblock of decompressed data is received from the block memory unit 314 and summed with the interpolated prediction macroblock to form the final 5 values of the current macroblock. This current macroblock is then written back into the external DRAM for video output. The Pixel Filter unit 316 is a 2 X 2 resampler.
Figure 13b is a schematic diagram of the circuit implementing the 2 X 2 resampl~r of the Pixel Filter unit 10 316. As shown in Figure 13b, the Pixel Filter unit 316 comprises a horizontal filter 316a and a vertical filter 316b. The horizontal filter 316a comprises a 16 X 32-bit column memory 1301, the input latch 1303, multiplexers 1302a and 1302b, an output latch 1305 and an adder 1304.
15 Multiplexers 1302a and 1302b, together with adder 1304 forms a weighted adder (hereinafter, collectively referred to as weighted adder 1304~. The weighted adder 1304 can provide in the resulting sum 1:0, %:~ or 0:1 weighting of its two input data a and b. The vertical filter unit 316b 20 comprises a 2 X 8 X 36-bit row memory unit 1306, multiplexers 1308a, 1308b and 1308c, and adder 1309, and an output register 1310. The row memory unit 1306 can be further divided into two planes 1306a and 1306b, each organized as 8 X 36-bit. Again, multiplexers 1308a-c and 25 adder 1309 forms a weighted adder (hereinafter, collectively referred to as weighted adder 1309~. The weighted adder 1309 can provide 1:0, ~ o%, %:~ or 0:1 weights of its two input data a and b, which are selected from the current pixel pair and either the pixel pair in 30 the previous row, or the pixel pair in the row a~ove the imme~iately previous row.
Every clock period, a pixel pair arrives in column order (each column is a 2 x 18 group of pixels, since a reference macro block needs a 18xl8-pixel picture area in 35 other to provide a complete context for the resampling in the pixel filter 316~ on the global bus 205 and is latched into the input latch 1303. Each pair of pixels are stored 20~22~

in one of 16 locations of the 16 X 32-bit column memory 1301 specified by the bits Y[5:2] in the Y component of the motion vector. As a pixel pair of a new column arrive at the column memory 1301, a pixel pair in the corres-5 ponding position in the previous column is read out. Thecurrent pixel pair and the corresponding pixel pair from the previous column are then combined at the weighted adder 1304, the weights accorded each pixel pair is determined by the lower order two bits (i.e. X[1:0]) of 10 the X component of the motion vector. The result of this weighted addition is a new pixel pair positioned between the input pixel pairs (i.e. horizontally resampled). The new pixel pair (9-bit precision) is then latched into register 1305 to be forwarded to the vertical filter unit 15 31~b. Hence, the column memory 1301 acts as the delay element of a 2-tap filter. The output data of the horizontal filter 316a are discarded during the time period when the data of the first column in each macroblock ara input at the Pixel Filter 316.
The row memory 1306 provide~ vertical resampling of the macroblock. The row memory 1306 is organized as two planes 130a and 130b each holding eight 36-bit words. The first plane 1306a contains one pixel pair per column, being the most recent pixel pair in the column prior to 25 the current pixel pair. The second plane 1306b also contains one pixel pair per column, being the second most recent pixel pair in the column prior to the current pixel pair~ As the current pixel pair arrives, memory planes 1306a and 1306b are each read for the pixel pair in the 30 same column. A new pixel pair is provided by weighted adder 1309 as a weighted sum of the current pixel pair and either the most recent pixel pair in the same column (delayed one clock period) or the second most recent pixel pair in the same column (delayed two clock periods). The 35 weights to accord the current pixel pair and the selected previous pixel pair are ~pecified by the lower two bits (Y[1:0]) of Y-component in the motion vector. In the ' ' .

20622~0 interlaced mode, resampling of the current pixel pair is performed with respect to the pixel pair delayed two clock periods. The new pair of pixels are then latched into the register 1310, for transfer into the Pixel Memory unit 5 317, via weighted adder 315.
A motion vector can provide a predicted macroblock not aligned to the page boundaries of the external DRAM.
Since the pixels are fetched in column order and there are 16 pixels in a row of pixels of a macroblock, fetching a 10 macroblock potentially requires crossing a DRAM page boundary sixteen times. Figure 13c shows a motion vector mvl yielding a predicted macroblock which is not aligned to the DRAM page boundaries. Recalling that the initial access to a DRAM page requires six to seven clock periods, 15 and subsequence accesses to the same page can be achieved in page mode every other clock period, much efficiency can be achieved if the sixteen DRAM page crossings can be reduced. Such efficiency is achieved, in accordance with the present invention, by fetching the macroblock in two 20 parts. This method i5 illustrated by Figure 13d.
Under the method illustrated in Figure 13d, the macroblock is fetched in two parts. In the first phase (the third phase, if the macroblock is coded with respect to a backward reference frame) of motion compensation, the 25 part of the macroblock above the horizontal DRAM boundary is fetched in column order. However, when the DRAM
boundary i5 reached in each column, instead of crossing the DRAM boundary to fetch the next pixel pair of the column, the first pixel pair of the next column is 30 fetched. The last two pixel pairs above the DRAM boundary are allowed to remain in row memory of the Pixel Filter unit 316 until the next phase of motion compensation. The ~irst phase is completed when the part of the macroblock above the horizontal boundary in all columns is fetched.
In the second phase (the fourth phase, if the macroblock is coded with respect to a backward reference frame), the second part (i.e. the part of the macroblock 20~220~

below the horizontal DRAM page boundary) of the macroblock is fetched, beginning with the first pixel pair below the DRAM page boundary in the first column. After the remaining pixel pairs in the first column are fetched, the 5 remaining pixel pairs of the second column are fetched, and so forth. The ss~o~d phase is completed when all remaining pixel pairs below the DRAM page boundary in all columns are ~etched. Figure 13d shows the memory access patterns for the first (above the horizontal DRAM page 10 boundary) and the second (below the horizontal D~AM page boundary) parts o~ the macroblock access, and in particular at the instance during the second phase at which ~ust over one half of the pixel pairs in the second part of the macroblock are fetched. As shown in Figure 15 13d, the row memory unit 1306 contains, for each of the last three columns of the macroblock, the last two pixel pairs (indicated by the shad~d box 1361) above the horizontal DRAM page boundary in the columns fetched during the first phase. Figure 13d also shows that the 20 row memory unit 1306 contains, for the first four columns, the last two pixel pairs (indicated by shaded box 1362) below the horizontal DRAM page boundary in each column.
In Figure 13d, the current content of the row memory unit 1306, for the fifth column of the macroblock, are the two 25 most recent pixel pairs received prior to the current pixel pair. Hence, by fetching the macroblock in two parts, with respect to horizontal page boundaries, only two initial access time costs are incurred, thereby resulting in a substantial saving of memory access time 30 per macroblock fetched.
The weighted adder 316 i~ a bilinear interpolator of two pairs of pixels (a,b), providing an output datum having a value (w*a ~ (16-w)*b + 8)/16. The third operand "8" is provided ~or rounding purpose. A circuit 1400 is 35 shown in Figure 14 to implement this bilinear inter-polator. As shown in Figure 14, circuit 1400 comprises 5-input adder 1401, and five multiplexers 1402a-e. Each 2~2~0 multiplexer 1402a-e, in addition to selecting one of the two input data A and B at its input terminals, provides to the output datum the weight indicated on the multiplexer, by shifting to the left the input datum a number of bits 5 equal to the base 2 logarithm (log2 w) of the weight. For example, multiplexer 1402a selects and shifts to the left three bits (log2 8) the 32-bit A input datum, if bit 3 of the 5-bit control value w'[4:0] is 1. (Control value w' equals w for 0 < w < 16 and equals 31 when w = 16) By so 10 shifting, multiplexer 1402a provides a weight of 8 to the A-input datum during the summing operation of adder 1401, and a weight of 0 to the B-input datum. Conversely, if bit 4 of the control value w' is 0,-the 32-bit B-input datum is given a weight of 8, and the ~-input datum o~
15 multiplexer 1402a is provided a weight of 0.
The operations of multiplexers 1402b-e are similar, with the weights accorded to the selected input data, respectively, 4, 2, 1 and 1, controlled by the bits 2, 1, 0 and 4 of the control value w'. Since multiplexers 20 1402a-e each accord a designated weight to either the A-input datum or the B-input datum, the total weight accorded by all the multiplexers 1402a-e to the A-input datum must equal to the total available weights (i.e. 16) minus the total weight accorded the B datum. Therefore, 25 the resulted weighted sum, before rounding, must equal w*a + (16-w)*b/16. The final division by 16 is accomplished by shifting the resulting sum to the right 4 bits.
There i5 a special casa when all the weights are assigned to the A-input datum. In that situation, where 30 w=16, 5-bit control value w' i5 given the value 31, which enables each multiplexer 14a-e select the A-input datum.

Video Output The video output unit comprises a 64 X 32-bit video memory 319 (Figure 3), for storing video output. The 35 video data are output in the order of the horizontal lines in a display. Hence, pixel data are fetched from the , ~6~2~

video memory of the external DRAM in scan format as discussed above. The data format follows the CCIR 601 standard (CbYCrY, i.e. UYVY). A horizontal resampler 318 is provided to interpolate horizontally by a factor of 2, 5 using a bilinear filter.
The above detailed description is intended to illustrate the specific embodiments provided herein and not intended to limit the present invention. One skilled in the art will be able to provide numerous variations and 10 modifications within the scope of the present invention upon consideration of the above detailed description and the accompanying drawings. The present invention is defined by the following claims.

Claims (60)

- 49 - We claim:

1. An apparatus for decompressing coded compressed video signal, comprising:
a bus;
means for retrieving from memory compressed video signals and for providing said compressed video signals on said bus;
means for decoding compressed video signals received from said bus, and for providing said decoded video signals on said bus;
means for receiving from said bus said decoded video signals, for performing an inverse discrete cosine transform on said decoded video signals, and for providing said transformed video signals on said bus;
means for receiving from said bus said transformed video signals, for providing said transformed video signals as output data signals.

2. An apparatus as in Claim 1, wherein said memory retrieving means, said decoding means, said transforming means and said output means are controlled by a processor.

3. An apparatus as in Claim 2, wherein said memory retrieving means, said decoding means and said transforming means each have control and data registers accessed by said processor.

4. An apparatus as in Claim 1, wherein said memory retrieving means further comprises:
means for receiving said coded compressed video signals from an external source and for providing said coded compressed video signals on said bus; and means for receiving said coded compressed video signals from said bus and for storing said coded compressed video signals in said memory.

5. An apparatus as in Claim 1, wherein said coded compressed video signals are both interframe and intraframe coded, and said decoding means provides motion vectors for reconstructing interframe coded pictures.

6. An apparatus as in Claim 5, wherein said apparatus further comprises means for receiving said motion vectors and for reconstructing said interframe coded pictures.

7. An apparatus as in Claim 1, wherein said apparatus further comprises a host bus for communication with a host computer.

8. A method for mapping a 2-dimensional space represented by x and y vectors (x, y) into a linear address space of a paged memory system, comprising the steps of:
dividing the binary representation of the vector x into higher order bits xh and lower order bits x1;
dividing the binary representation of the vector y into higher order bits yh and lower order bits yl, such that the number of memory addresses representable by combining the bits of xl and yl is less than a page of said memory; and providing as memory address of said paged memory system an address having higher order bits derived from said xh and yh bits and having lower order bits derived from said xl and yl bits.

9. A method as in Claim 8, wherein said 2-dimensional space is a video display space and the number of addresses representable by combining said bits xl and yl is not less than the number of pixels in a macroblock of video data.

10. A method for mapping a 2-dimensional space represented by x and y vectors (x, y) into a linear address space of a paged memory system, said paged memory system being organized into words, each word having individually addressable first and second portions, said method comprising the steps of:
designating a bit yu in the binary representation of vector y;
designating a bit xe in the binary representation of vector x; and mapping into (i) memory addresses of said first portion vectors having the values of xe and yu being respectively 1 and 0, and vectors having the values of xe and yu being 0 and 1, and (ii) memory addresses of said second portion vectors having the values of xe and yu being both 1, and vectors having the values of xe and yu both 0.

11. A method as in Claim 10, said paged memory system being addressable in one of first and second modes, wherein said first mode, said first and said second portions have memory addresses differing only in said yu bit, and wherein said second mode, said first and second portions have memory addresses differing only in said xe bit.

12. A structure for processing a picture area of m x n pixels, comprising:
2r memory banks, each memory bank storing the values of pixels in one non-overlapping group of m/2r X n pixels in said picture area; and r processors each capable of accessing a four of said 2r memory banks, said processor being responsible for processing the pixels associated with two of said four memory banks.

13. A structure as in Claim 12, wherein each processor is associated with two neighboring processors, each neighboring processors being one of said r processors, said four memory banks being associated with a contiguous picture area of 2m/r X n pixels, said processor being responsible for processing the pixels in the two memory banks associated with the middle portion of said 2m/r X n pixels picture area, and said neighboring processors being each responsible for processing one of the two groups of m/2r X n pixels on each side of said 2m/r X n picture area.

14. A structure for decoding variable length codes embedding in a bit stream, each variable code being of one of a plurality of code types, said structure comprising:
means for extracting from said bit stream a string of bits;
a plurality of logic circuits each associated with one code type for receiving said string of bits, for decoding a variable length code from said string of bits, and for providing the length of said variable length code decoded and a decoded datum;
means for identifying a code type in accordance with a syntax state machine;
means for selecting one datum from said decoded data in accordance with said code type identified;
and means for advancing the bit stream the number of bits equal to the length of the variable code decoded.

15. A method for computing the expression b * c using an accumulator, comprising the steps of:
expressing c into a ternary (1, 0, -1) representation having digits dn-1, ..., d2, d1 and d0;
computing the multiples of b having the form b*3i, where i = 0,1,2,..., n-1 and storing each multiple of b in a register; and for each i, where i=0,1,2,...,n-1, adding to said accumulator the content of the register corresponding to b*3i, when di = 1, the value 0 when di = 0, and the negated content of the register corresponding to b*3i.

16. A method as in Claim 15, wherein said expression computes a memory address under index mode, said method further comprising the step of adding to said accumulator a value a being the content of one of first and second registers selected in accordance with a signal indicating whether the sum of the content of said first register and b*c exceeds a predetermined value.

17. A method for reading and writing in place n2 words into a memory containing 4n2 words organized in a linear address space, comprising:
writing the first n2 words of said 4n2 words into memory locations according to memory addresses generated by a counter, said memory address being initially a base address, incremented after each of said first n2 words are written;
reading said first n2 words of said 4n2 words from, and simultaneously writing the second n2 words of said 4n2 words into, memory locations according to memory addresses generated by a counter, said memory address being initially said base address, and subsequently obtained by: (a) rotating four bits of the content in said counter by one bit, (b) incrementing said rotated four bits by 1; and (c) rotating said four bits by one bit in the opposite direction as said rotation in (a);
reading said second n2 words of said 4n2 words from, and simultaneously writing the third n2 words of said 4n2 words into, memory locations according to memory addresses generated by said counter, said memory address being initially said base address, and subsequently obtained by: (a) rotating four bits of the content in said counter by two bits, (b) incrementing said rotated four bits by 1; and (c) rotating said four bits by two bits in the opposite direction as said rotation in (a);
reading said third n2 words of said 4n2 words from, and simultaneously writing the fourth n2 words of said 4n2 words into, memory locations according to memory addresses generated by said counter, said memory address being initially said base address, and subsequently obtained by: (a) rotating four bits of the content in said counter by three bits, (b) incrementing said rotated four bits by 1; and (c) rotating said four bits by three bits in the opposite direction as said rotation in (a); and reading said fourth n2 of said 4n2 words from memory locations according to the memory addresses generated by a counter incremented after each of said fourth n2 words are written, said memory address being initially said base address.

18. An apparatus for providing motion compensation in interframe coded current video data, using motion vectors (x, y) coded with respect to reference video data, comprising:
means for receiving said current video data, means for receiving said reference video data;
a filter for resampling said video data in x and y directions;
weighted adder for interpolating said reference video data and for summing said interpolated reference video data with said decoded data; and a pixel memory for containing said summed video data.

19. An apparatus as in Claim 18, wherein said filter further comprises:

a 2-tap filter for resampling in the horizontal direction; and a 3-tap filter for resampling in the vertical direction.

20. An apparatus as in Claim 18, wherein said motion vector comprises first and second portions, said first portion being provided to said filter for resampling, said apparatus further comprising means for computing the sum of the screen locations of said reference data and the screen locations of said current video data, offset by said second portion of said motion vector.

21. An apparatus for performing bilinear interpolation of two values, said interpolation being of the form c = w*a + ((2n-1) w)*b, n being an integer and 0 ? w < 2n-1, said apparatus comprising:
means for generating signal w'[0:n-1] having value 2n-1 when w = 2n-1, and w otherwise;
multiplexer M0 having as input data said values a and b, said multiplexer M1 selecting as output datum input datum a when w'[0] = 1 and input datum b otherwise;
multiplexer M1 having as input data said values a and b, said multiplexer M1 selecting as output datum input datum a when w'[l] = 1 and input datum b otherwise;
n-2 multiplexers M2, M3,...,and Mn-1, each having as input data said values a and b, multiplexers Mi, i=2,...,n-1, selecting input datum a when w'[i] is 1, and selecting input datum b stherwise, and providing as output datum said selected datum shifted by i-1 bits; and means for adding said selected data.

22. A method for processing elements column by column in an n X n matrix stored in first and second pages of a memory capable of page mode access, wherein said processing requires as input data two neighboring elements in the same column, said method comprising the steps of:
processing said n X n matrix column by column, stopping in each column at the first element having an address in said second page and saving the last element in said column having an address in said first page; and processing said the elements of said n X n matrix in said second page column by column, beginning at each column said first element and using said saved last element.

23. A method for decompressing coded compressed video signal, comprising the steps of:
providing a bus;
providing means for retrieving from memory compressed video signals and for providing said compressed video signals on said bus;
providing means for decoding compressed video signals received from said bus, and for providing said decoded video signals on said bus;
providing means for receiving from said bus said decoded video signals, for performing an inverse discrete cosine transform on said decoded video signals, and for providing said transformed video signals on said bus;
providing means for receiving from said bus said transformed video signals, for providing said transformed video signals as output data signals.

24. A method as in Claim 23, wherein said memory retrieving means, said decoding means, said transforming means and said output means are controlled by a processor.

25. A method as in Claim 24, wherein said memory retrieving means, said decoding step and said transforming means each having control and data registers accessed by said processor.

26. A method as in Claim 23, wherein said step of providing said memory retrieving means comprises the steps of:
providing means for receiving said coded compressed video signals from an external source and for providing said coded compressed video signals on said bus; and providing means for receiving said coded compressed video signals from said bus and for storing said coded compressed video signals in said memory.

27. A method as in Claim 23, wherein said coded compressed video signals are both interframe and intraframe coded, and said decoding means provides motion vectors for reconstructing interframe coded pictures.

28. A method as in Claim 27, wherein said method further comprises the step of providing means for receiving said motion vectors and for reconstructing said interframe coded pictures.

29. A method as in Claim 23, wherein said method further comprises the step of providing a host bus for communication with a host computer.

30. An apparatus for mapping a 2-dimensional space represented by x and y vectors (x, y) into a linear address space of a paged memory system, comprising:
means for dividing the binary representation of the vector x into higher order bits xh and lower order bits x1;
means for dividing the binary representation of the vector y into higher order bits yh and lower order bits y1, such that the number of memory addresses representable by combining the hits of x1 and y1 is less than a page of said memory; and means for providing as memory address of said paged memory system an address having higher order bits derived from said xh and yh bits and having lower order bits derived from said x1 and y1 bits.

31. An apparatus as in Claim 30, wherein said 2-dimensional space is a video display space and the number of addresses representable by combining said bits x1 and y1 is not less than the number of pixels in a macroblock of video data.

32. An apparatus for mapping a 2-dimensional space represented by x and y vectors (x, y) into a linear address space of a paged memory system, said paged memory system being organized into words, each word having individually addressable first and second portions, said apparatus comprising:
means for designating a bit yu in the binary representation of vector y;
means for designating a bit xe in the binary representation of vector x, and means for mapping into (i) memory addresses of said first portion vectors having the values of xe and yu being respectively 1 and 0, and vectors having the values of xe and yu being 0 and 1, and (ii) memory addresses of said second portion vectors having the values of xe and yu being both 1, and vectors having the values of xe and yu both 0.

33. An apparatus as in Claim 32, said paged memory system being addressable in one of first and second modes, wherein said first mode, said first and said second portions have memory addresses differing only in said yu bit, and wherein said second mode, said first and second portions have memory addresses differing only in said xe bit.

34. A method for processing a picture area of m x n pixels, comprising the steps of:
providing 2r memory banks, each memory bank storing the values of pixels in one non-overlapping group of m/2r X n pixels in said picture area; and providing r processors each capable of accessing four of said 2r memory banks, said processor being responsible for processing the pixels associated with two of said four memory banks.

35. A method as in Claim 34, wherein said processor providing step further comprises the step of associating each processor with two neighboring processors, each neighboring processors being one of said r processors, said four memory banks being associated with a contiguous picture area of 2m/r X n pixels, said processor being responsible for processing the pixels in the two memory banks associated with the middle portion of said 2m/r X n pixels picture area, and said neighboring processors being each responsible for processing one of the two groups of m/2r X n pixels on each side of said 2m/r X n picture area.

36. A method for decoding variable length codes embedding in a bit stream, each variable code being of one of a plurality of code types, said method comprising the steps of:
extracting from said bit stream a string of bits;
providing a plurality of logic circuits each associated with one code type for receiving said string of bits, for decoding a variable length code from said string of bit , and for providing the length of said variable length code decoded and a decoded datum;
identifying a code type in accordance with a syntax state machine;
selecting one datum from said decoded data in accordance with said code type identified; and advancing the bit stream the number of bits equal to the length of the variable code decoded.

37. An apparatus for computing the expression a + b * c using an accumulator, comprising:
means for expressing c into a ternary (1, 0, -1) representation having digits dn-1, ..., d2, d1 and d0;
means for computing the multiples of b having the form b*3i, where i = 0,1,2,...n-1 and storing each multiple of b in a register; and means for adding to said accumulator, for each i, where i-0,1,2,...,n-1, the content of the register corresponding to b*3i, when di = 1, the value 0 when di = 0, and the negated value of the register corresponding to b*3i.

38. An apparatus as in Claim 37, wherein said expression computes a memory address under index mode, said apparatus further comprising means for adding to said accumulator a value a being the content of one of first and second registers selected in accordance with a signal indicating whether the sum of the content of said first register and b*c exceeds a predetermined value.

39. An apparatus for reading and writing in place n2 words into a memory containing 4n2 words organized in a linear address space, comprising:
means for writing the first n2 words of said 4n2 words into memory locations according to the memory addresses generated by a counter, said memory address being initially a base address, incremented after each of said first n2 words are written;

means for reading said first n2 words of said 4n2 words from, and simultaneously writing the second n2 words of said 4n2 words into, memory locations according to memory addresses generated by a counter, said memory address being initially said base address, and subsequently obtained by: (a) rotating four bits of the content in said counter by one bit, (b) incrementing said rotated four bits by 1; and (c) rotating said four bits by one bit in the opposite direction as said rotation in (a);
means for reading said second n2 words of said 4n2 words from, and simultaneously writing the third n2 words of said 4n2 words into, memory locations according to memory addresses generated by said counter, said memory address being initially said base address, and subsequently obtained by: (a) rotating four bits of the content in said counter by two bits, (b) incrementing said rotated four bits by 1; and (c) rotating said four bits by two bits in the opposite direction as said rotation in (a);
means for reading said third n2 words of said 4n2 words from, and simultaneously writing the fourth n2 words of said 4n2 words into, memory locations according to memory addresses generated by said counter, initially said base address, and subsequently obtained by: (a) rotating four bits of the content in said counter by three bits, (b) incrementing said rotated four bits by l; and (c) rotating said four bits by three bits in the opposite direction as said rotation in (a); and means for reading said fourth n2 of said 4n2 words from memory locations according to the memory addresses generated by a counter incremented after each of said fourth n2 words are written, said memory address being initially said base address.

40. A method for providing motion compensation in interframe coded current video data, using motion vectors (x, y) coded with respect to reference video data, comprising:
receiving said current video data;
receiving said reference video data;
providing a filter for resampling said video data in x and y directions;
providing a weighted adder for interpolating said reference video data and for summing said interpolated reference video data with said decoded data; and providing a pixel memory for containing said summed video data.

41. A method as in Claim 40, wherein said filter providing step further comprises:
providing a 2-tap filter for resampling in the horizontal direction; and providing a 3-tap filter for resampling in the vertical direction.

42. A method as in Claim 40, wherein said motion vector comprises first and second portions, said first portion being provided to said filter for resampling, said apparatus further comprising means for computing the sum of the screen locations of said reference data and the screen locations of said current video data, offset by said second portion of said motion vector.

43. A method for performing bilinear interpolation of two values, said interpolation being of the form c =
w*a + ((2na-1)-w)*b, n being an integer and 0 ? w < 2n-1, said method comprising the steps of:
generating signal w'[0:n-1] having value 2"-1 when w - 2n-1, and w otherwise;
providing multiplexer M0 having as input data said values a and b, said multiplexer M1 selecting as output datum input datum a when w'[0] = 1 and input datum b otherwise;
providing multiplexer M1 having as input data said values a and b, said multiplexer M1 selecting as output datum input datum a when w'[1] = 1 and input datum b otherwise;
providing n-2 multiplexers M2, M3,..., and Ma-1, each having as input data said values a and b, multiplexers mi, i=2,...,n-1, selecting input datum a when w'[i] is 1, and selecting input datum b otherwise, and providing as output datum said selected datum shifted by i-1 bits; and adding said selected data.

44. An apparatus for processing elements column by column in an n X n matrix stored in first and second pages of a memory capable of page mode access, wherein said processing requires as input data two neighboring elements in the same column, said method comprising:
means for processing said n X n matrix column by column, stopping in each column at the first element having an address in said second page and saving the last element having an address in said first page;
and means for processing said the elements of said n X n matrix in said second page column by column, beginning at each column said first element and using said saved last element.

45. An apparatus for meeting CAS low and CAS high times in a dynamic random access memory using a clock signal, comprising:
means for detecting a rising edge and a falling edge of said clock signal; and means for providing said CAS signal a rising edge transition substantially immediately when said detecting means detects said rising edge in said clock signal, and for providing said CAS signal a falling edge transition after a substantial delay when said detecting means detects a falling edge transition in said clock signal.

46. An apparatus as in Claim 45, wherein said CAS
providing means comprises:
a plurality of delay elements, each delay element providing a signal indicative of a transition in said clock signal after a delay; and multiplexer means for selecting the output signal of one said delay elements.

47. An apparatus as in Claim 46, wherein said CAS
providing means keeps said CAS signal at logic low after said falling edge transition of said CAS signal for at least one clock period.

48. A method for meeting CAS low and CAS high times in a dynamic random access memory using a clock signal, comprising the steps of:
detecting a rising edge and a falling edge of said clock signal; and providing a rising edge transition in said CAS
signal substantially immediately when said rising edge in said clock signal is detected, and providing a falling edge transition in said CAS signal after a substantial delay when said falling edge transition in said clock signal is detected.

49. A method as in Claim 48, wherein said CAS signal providing step comprises the steps of:
providing a plurality of delay elements, each delay element providing a signal indicative of a transition in said clock signal after a delay; and selecting the output signal of one said delay elements.

50. An method in Claim 49, wherein said CAS signal providing step further comprises the step of keeping said CAS signal at logic low after said falling edge transition of said CAS signal for at least one clock period.

51. A method for mapping a 2-dimensional display space addressable by vectors X, Y onto a linear physical address space of a memory system, comprising the steps of:
dividing the bits of said X vector into higher order vector Xh and lower order vector Xl;
dividing arithmetically said Xl vector by an integer 2n-1, n being an integer, to obtain a quotient and a remainder between 0 and 2n-2;
combining the bits of said vector Xh, said vector Y, said quotient and said remainder to form an address in said address space.

52. A method as in Claim 51, wherein said combining step comprises the steps of:
testing the magnitude of said Y vector;
combining, when said Y vector is less than a predetermined value, the bits of said vector Xh, said vector Y, said quotient and said remainder to form an address in said address space, and carrying out, when said Y vector is not less than said predetermined value, the steps of:
dividing the bits of said vector Y into higher order vector Yh and lower order vector Yl, said vector Yh being the same number of bits as said said vector Xl; and combining the bits of said vector Yl, said vector Xh, said quotient, said remainder and said value 2n-1 to form an address in said address space.

53. An apparatus for mapping a 2-dimensional display space addressable by vectors X, Y onto a linear physical address space of a memory system, comprising:

means for dividing the bits of said X vector into higher order vector Xh and lower order vector Xl;
means for dividing arithmetically said Xl vector by an integer 2n-1, n being an integer, to obtain a quotient and a remainder between 0 and 2n-2;
means for combining the bits of said vector Xh, said vector Y, said quotient and said remainder to form an address in said address space.

54. An apparatus as in Claim 53, wherein said combining means comprises:
means for testing the magnitude of said Y
vector;
means for combining, when said Y vector is less than a predetermined value, the bits of said vector Xh, said vector Y, said quotient and said remainder to form an address in said address space;
means for, when said Y vector is not less than said predetermined value, dividing the bits of said vector Y into higher order vector Yh and lower order vector Yl, said vector Yh being the same number of bits as said said vector Xl; and means for combining the bits of said vector Yl, said vector Xh, said quotient, said remainder and said value 2n-1 to form an address in said address space.

55. In a integrated circuit chip receiving data from off-chip dynamic random access memory (DRAM), said DRAM
receiving on an input terminal a CAS signal, a method for accurately timing data arrival from said DRAM, comprising the steps of:
providing means for detecting a logic state transition;
providing an input pin connected to said detecting means;

connecting said input pin with said CAS signal terminal of said DRAM;
detecting a logic state transition on said CAS
signal; and receiving said data a predetermined period time after detecting said logic state transition.

56. An apparatus for receiving data from off-chip dynamic random access memory (DRAM), said DRAM receiving on an input terminal a CAS signal, comprising:
means for detecting a logic state transition;
an input pin connected to said detecting means and said CAS signal terminal of said DRAM; and means for receiving said data a predetermined period time after detecting said logic state transition.

57. A structure as in Claim 12, wherein said r processors each process said contiguous picture area in lockstep.

58. A structure as in Claim 57, wherein each contiguous picture area is divided into an equal number of fixed-size picture areas, each processor further comprising means for ensuring that the time required for accessing each of said fixed-size areas is substantially constant.

59. A method as in Claim 34, further comprising the step of ensuring said r processors each process said contiguous picture area in lockstep.

60. A method as in Claim 59, wherein each contiguous picture area is divided into an equal number of fixed-size picture areas, said method further comprising the step of ensuring that the time required for accessing each of said fixed-size areas is substantially constant.