US6034674A - Buffer manager - Google Patents

Buffer manager Download PDF

Info

Publication number
US6034674A
US6034674A US08/876,720 US87672097A US6034674A US 6034674 A US6034674 A US 6034674A US 87672097 A US87672097 A US 87672097A US 6034674 A US6034674 A US 6034674A
Authority
US
United States
Prior art keywords
buffers
state
data
buffer
allocating
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
US08/876,720
Inventor
Martin William Sotheran
Helen R. Finch
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chartoleaux KG LLC
Original Assignee
Discovision Associates
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from EP92306038A external-priority patent/EP0576749B1/en
Priority claimed from GB9405914A external-priority patent/GB9405914D0/en
Priority claimed from GB9415387A external-priority patent/GB9415387D0/en
Priority claimed from GB9503964A external-priority patent/GB2287808B/en
Priority to US08/876,720 priority Critical patent/US6034674A/en
Application filed by Discovision Associates filed Critical Discovision Associates
Priority to US09/323,627 priority patent/US6417859B1/en
Publication of US6034674A publication Critical patent/US6034674A/en
Application granted granted Critical
Assigned to DISCOVISION ASSOCIATES reassignment DISCOVISION ASSOCIATES ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: FINCH, HELEN ROSEMARY
Assigned to COASES INVESTMENTS BROS. L.L.C. reassignment COASES INVESTMENTS BROS. L.L.C. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: DISCOVISION ASSOCIATES
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09G—ARRANGEMENTS OR CIRCUITS FOR CONTROL OF INDICATING DEVICES USING STATIC MEANS TO PRESENT VARIABLE INFORMATION
    • G09G5/00—Control arrangements or circuits for visual indicators common to cathode-ray tube indicators and other visual indicators
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/234—Processing of video elementary streams, e.g. splicing of video streams, manipulating MPEG-4 scene graphs
    • H04N21/23406—Processing of video elementary streams, e.g. splicing of video streams, manipulating MPEG-4 scene graphs involving management of server-side video buffer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/44—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream, rendering scenes according to MPEG-4 scene graphs
    • H04N21/44004—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream, rendering scenes according to MPEG-4 scene graphs involving video buffer management, e.g. video decoder buffer or video display buffer

Definitions

  • the present invention is directed to a decompression circuit which operates to decompress or decode a plurality of differently encoded input signals, and, more particularly, to a method of controlling the buffering of encoded video data in said circuit.
  • Previous buffer manager systems were hardwired to implement certain predetermined conversions, for example, 3-2 pulldown systems.
  • the present buffer manager does not use a predefined sequence of replication or skipping of frames, as in conventional 3-2 pulldown systems, and thus any ratio of encoded frame rate and display frame rate can be accommodated.
  • the present buffer manager is thus more flexible with respect to its strategy for dropping or duplicating frames in order to account for differences in the encoded data frame rate and the display frame rate.
  • the invention provides a method for buffering encoded video data organized as frames comprising determining the picture number of a frame, determining the desired presentation number of a frame and marking the buffer as ready when the picture number is on or after the desired presentation number.
  • FIG. 1 is a block diagram of an image formatter.
  • FIG. 2 is a diagram of the buffer manager state machine.
  • FIG. 3 illustrates the main loop of the state machine in FIG. 2.
  • FIG. 1 An image formatter is shown in FIG. 1.
  • Tokens arriving at the input to the image formatter are buffered in the FIFO 40 and transferred into the buffer manager 30.
  • This block detects the arrival of new pictures and determines the availability of a buffer in which to store each one. If there is a buffer available, it is allocated to the arriving picture and its index is transferred to the write address generator 10. If there is no buffer available, the incoming picture will be stalled until one does become free. All tokens are passed on to the write address generator 10. This operation is described in greater detail in U.K. Serial No. 9405914.4 filed on Mar. 24, 1994, which is incorporated herein by reference.
  • External DRAM is used for the buffers, which can be either two or three in number. Three are necessary if frame-rate conversion is to be effected.
  • the purpose of the buffer manager 30 is to supply the address generators with indices indicating any of either two or three external buffers for writing and reading of picture data.
  • the allocation of these indices is influenced by three principal factors, each representing the effect of one of the timing regimes in operation: the rate at which picture data arrives at the input to image formatter (coded data rate), the rate at which data is displayed (display data rate), and the frame rate of the encoded video sequence (presentation rate).
  • a three-buffer system enables the presentation rate and the display rate to differ (e.g. 2-3 pulldown), so that frames are either repeated or skipped as necessary to achieve the best possible sequence of frames given the timing constraints of the system.
  • Pictures which present some difficulty in decoding may also be accommodated in a similar way, so that if a picture takes longer than the available display time to decode, the previous frame will be repeated while everything else ⁇ catches up ⁇ .
  • the three timing regimes must be locked--it is the third buffer which provides the flexibility for taking up slack.
  • the buffer manager operates by maintaining certain status information associated with each external buffer--this includes flags indicating if the buffer is in use, full of data, or ready for display, and the picture number within the sequence of the picture currently stored in the buffer.
  • the presentation number is also recorded, this being a number which increments every time a picture clock pulse is received, and represents the picture number which is currently expected for display based on the frame rate of the encoded sequence.
  • An arrival buffer (a buffer to which incoming data will be written) is allocated every time a PICTURE -- START token is detected at the input, and this buffer is then flagged as IN -- USE; on PICTURE -- END, the arrival buffer will be de-allocated (reset to zero) and the buffer flagged as either FULL or READY depending on the relationship between the picture number and the presentation number.
  • the display address generator requests a new display buffer, once every vsync, via a two-wire-interface. If there is a buffer flagged as READY, then that will be allocated to display by the buffer manager. If there is no READY buffer, the previously displayed buffer will be repeated.
  • TEMPORAL -- REFERENCE tokens in H261 cause a buffer's picture number to be modified if skipped pictures in the input stream are indicated.
  • TEMPORAL -- REFERENCE tokens in MPEG have no effect.
  • a FLUSH token causes the input to stall until every buffer is either EMPTY or has been allocated as the display buffer; presentation number and picture number are then reset and a new sequence can commence.
  • All data is input to the buffer manager from the input fifo, bm -- front. This transfer takes place via a two-wire interface, the data being 8 bits wide plus an extension bit. All data arriving at the buffer manager is guaranteed to be complete tokens, a necessity for the continued processing of presentation numbers and display buffer requests in the event of significant gaps in the data upstream.
  • Tokens (8 bit data, 1 bit extension) are transferred to the write address generator via a two-wire interface.
  • the arrival buffer index is also transferred on the same interface, so that the correct index is available for address generation at the same time as the PICTURE -- START token arrives at waddrgen.
  • the interface to the read address generator comprises two separate two-wire interfaces which can be considered to act as ⁇ request ⁇ and ⁇ acknowledge ⁇ signals respectively--single wires are not adequate, however, because of the two two-wire-based state machines at either end.
  • dispaddr invokes a request, in response to a vsync from the display device, by asserting the drq -- valid input to the buffer manager; when the buffer manager reaches an appropriate point in its state machine it will accept the request and go about allocating a buffer to be displayed; the disp -- valid wire is then asserted, the buffer index is transferred, and this will normally be accepted immediately by dispaddr.
  • rst -- fld There is an additional wire associated with this last two-wire-interface (rst -- fld) which indicates that the field number associated with the current index must be reset regardless of the previous field number.
  • the buffer manager block uses four bits of microprocessor address space, together with the 8-bit data bus and read and write strobes. There are two select signals, one indicating user-accessible locations and the other indicating test locations which should not require access under normal operation conditions.
  • the buffer manager is capable of producing two different events: index found and late arrival. The first of these is asserted when a picture arrives whose PICTURE -- START extension byte (picture index) matches the value written into the BU -- BM -- TARGET -- IX register at setup. The second event occurs when a display buffer is allocated whose picture number is less than the current presentation number, i.e. the processing in the system pipeline up to the buffer manager has not managed to keep up with the presentation requirements.
  • Picture clock is the clock signal for the presentation number counter and is either generated on-chip or taken from an external source (normally the display system).
  • the buffer manager accepts both of these signals and selects one based on the value of pclk -- ext (a bit in the buffer manager's control register). This signal also acts as the enable for the pad picoutpad, so that if the Image Formatter is generating its own picture clock this signal is also available as an output from the chip.
  • the reset state is PRES0, with flags set to zero such that the main loop is circulated initially.
  • the main loop of the state machine comprises the states shown in FIG. 3 (highlighted in the main diagram--FIG. 2).
  • States PRES0 and PRES1 are concerned with detecting a picture clock via the signal presflg. Two cycles are allowed for the tests involved since they all depend on the value of rdytst. If a presentation flag is detected, all of the buffers are examined for possible ⁇ readiness ⁇ , otherwise the state machine just advances to state DRQ.
  • a buffer is deemed to be ready for display when any of the following is true:
  • State DRQ checks for a request for a display buffer (drq -- valid -- reg && disp -- acc -- reg). If there is no request the state advances (normally to state TOKEN--more on this later), otherwise a display buffer index is issued as follows: if there is no ready buffer, the previous index is re-issued or, if there is no previous display buffer, a null index (zero) is issued; if a buffer is ready for display, its index is issued and its state is updated--if necessary the previous display buffer is cleared. The state machine then advances as before.
  • State TOKEN is the usual option for completing the main loop: if there is valid input and the output is not stalled, tokens are examined for strategic values (described in later sections), otherwise control returns to state PRES0.
  • any previous ready buffer needs to be vacated because only one buffer can be designated ready at any time.
  • State VACATE -- RDY clears the old ready buffer by setting its state to VACANT, and it resets the buffer index to 1 so that when control returns to the PRES0 state, all buffers will be tested for readiness. The reason for this is that the index is by now pointing at the previous ready buffer (for the purpose of clearing it) and there is no record of our intended new ready buffer index--it is necessary therefore to re-test all of the buffers.
  • Allocation of the display buffer index takes place either directly from state DRQ (state USE -- RDY) or via state VACATE -- DISP which clears the old display buffer state.
  • the chosen display buffer is flagged as IN -- USE, the value of rdy -- buf is set to zero, and the index is reset to 1 to return to state DRQ.
  • disp -- buf is given the required index and the two-wire interface wires (disp -- valid and drq -- acc) are controlled accordingly. Control returns to state DRQ only so that the decision between states TOKEN, FLUSH and ALLOC does not need to be made in state USE -- RDY.
  • the en -- full signal is supplied by the write address generator to indicate that the swing buffer has swung, i.e. the last block has been successfully written and it is therefore safe to update the buffer status.
  • the just-completed buffer is tested for readiness and given the status either FULL or READY depending on the result of the test. If it is ready, rdy -- buf is given the value of its index and the set -- la -- ev signal (late arrival event) is set high (indicating that the expected display has got ahead in time of the decoding). The new value of arr -- buf now becomes zero, and, if the previous ready buffer needs its status clearing, the index is set to point there and control moves to state VACATE -- RDY; otherwise index is reset to 1 and control returns to the start of the main loop.
  • State ALLOC is concerned with allocating an arrival buffer (into which the arriving picture data can be written), and cycles through the buffers until it finds one whose status is VACANT. A buffer will only be allocated if out -- acc -- reg is high, since it is output on the data two-wire-interface, so cycling around the loop will continue until this is the case. Once a suitable arrival buffer has been found, the index is allocated to arr -- buf and its status is flagged as IN -- USE.
  • Index is set to 1, the flag from -- ps is reset, and the state is set to advance to NEW -- EXP -- TR.
  • a check is made on the picture's index (contained in the word following the PICTURE -- START) to determine if it the same as targ -- ix (the target index specified at setup) and, if so, set -- if -- ev (index found event) is set high.
  • a FLUSH token in the data stream indicates that sequence information (presentation number, picture number, rst -- fld) should be reset. This can only happen when all of the data leading up to the FLUSH has been correctly processed and so it is necessary, having received a FLUSH, to monitor the status of all of the buffers until it is certain that all frames have been handed over to the display, i.e. all but one of the buffers have status EMPTY, and the other is IN -- USE (as the display buffer). At that point a ⁇ new sequence ⁇ can safely be started.
  • state TOKEN When a FLUSH token is detected in state TOKEN, the flag from -- fl is set, causing the basic state machine loop to be changed such that state FLUSH is visited instead of state TOKEN.
  • State FLUSH examines the status of each buffer in turn, waiting for it to become VACANT or IN -- USE as display. The state machine simply cycles around the loop until the condition is true, then increments its index and repeats the process until all of the buffers have been visited. When the last buffer fulfils the condition, presentation number, picture number and all of the temporal reference registers assume their reset values; rst -- fld is set to 1. The flag from -- fl is reset and the normal main loop operation is resumed.
  • State TOKEN passes control to state OUTPUT -- TAIL in all cases other than those outlined above. Control remains here until the last word of the token is encountered (in -- extn -- reg is low) and the main loop is then re-entered.
  • a typical sequence of states may be PRES0, PRES1, DRQ, TOKEN, OUTPUT -- TAIL, each, with the exception of OUTPUT -- TAIL, lasting one cycle.
  • This number may occasionally increase to up to 13 cycles overhead when auxiliary branches of the state machine are executed under worst-case conditions. Note that such large overheads will only apply on a once-per-frame basis.
  • Presentation number free-runs during upi accesses if presentation number is required to be the same when access is relinquished as it was when access was gained, this can be effected by reading presentation number after access is granted, and writing it back just before it is relinquished. Note that this is asynchronous, so it may be necessary to repeat the accesses several times to be sure they are effective.
  • the write address generator 10 receives tokens from the buffer manager 30 and detects the arrival of each new DATA token. As each arrives, it calculates a new address for the DRAM interface 50 in which to store the arriving block. The raw data is then passed to the DRAM interface 50 where it is written in to a swing buffer.
  • DRAM addresses are block addresses, and pictures in the DRAM are organised as rasters of blocks. Incoming picture data, however, is organised as sequences of macroblocks, so the address generation algorithm must take account of this.

Abstract

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

Description

REFERENCE TO RELATED APPLICATIONS
This application is related to British Patent Application entitled "Video Decompression" as U.K. Serial No. 9405914.4 filed on Mar. 24, 1994 and British Patent Application entitled "Method and Apparatus for Interfacing with RAM" as U.K. Serial No. (not yet known) filed on Feb. 28, 1995.
This application is a continuation of application Ser. No. 08/399,801, filed Mar. 7, 1995, now abandoned, which is a continuation-in-part of U.S. application Ser. No. 08/400,397 filed on Mar. 7, 1995, which is a continuation-in-part of U.S. application Ser. No. 08/382,958 filed on Feb. 2, 1995, now abandoned, which is a continuation of U.S. application Ser. No. 08/082,291 filed on Jun. 24, 1993 (now abandoned).
The following U.S. patent applications have subject matter related to this Application: application Ser. Nos. 08/382,958, filed Feb. 02, 1995; 08/400,397, filed Mar. 07, 1995; 08/399,851 filed Mar. 07, 1995; 08/482,296, filed Jun. 07, 1995; 08/486,396, filed Jun. 07, 1995; 08/484,730, filed Jun. 07, 1995; 08/479,279, filed Jun. 07, 1995; 08/483,020, filed Jun. 07, 1995; 08/487,224, filed Jun. 07, 1995; 08/400,722, filed Mar. 07, 1995; 08/400,723, filed Mar. 07, 1995; 08/404,067, filed Mar. 14, 1995; 08/567,555, filed Dec. 05, 1995; 08/396,834, filed Mar. 01, 1995; 08/473,813, filed Jun. 07, 1995; 08/484,456, filed Jun. 07, 1995; 08/476,814, filed Jun. 07, 1995; 08/481,561, filed Jun. 07, 1995; 08/482,381, filed Jun. 07, 1995; 08/479,910, filed Jun. 07, 1995; 08/475,729, filed Jun. 07, 1995; 08/484,578, filed Jun. 07, 1995; 08/473,615, filed Jun. 07, 1995; 08/487,356, filed Jun. 07, 1995; 08/487,134, filed Jun. 07, 1995; 08/481,772, filed Jun. 07, 1995; 08/481,785, filed Jun. 07, 1995; 08/486,908, filed Jun. 07, 1995; 08/486,034, filed Jun. 07, 1995; 08/487,740, filed Jun. 07, 1995; 08/488,348, filed Jun. 07, 1995; 08/484,170, filed Jun. 07, 1995; 08/516,038, filed Aug. 17, 1995; 08/399,810, filed Mar. 07, 1995; 08/400,201, filed Mar. 07, 1995 (now U.S. Pat. No. 5,603,012); 08/400,215, filed Mar. 07, 1995; 08/400,072, filed Mar. 07, 1995; 08/402,602, filed Mar. 07, 1995; 08/400,206, filed Mar. 07, 1995; 08/400,151, filed Mar. 07, 1995; 08/400,202, filed Mar. 07, 1995; 08/400,398, filed Mar. 07, 1995; 08/400,161, filed Mar. 07, 1995; 08/400,141, filed Mar. 07, 1995; 08/400,211, filed Mar. 07, 1995; 08/400,331, filed Mar. 07, 1995; 08/400,207, filed Mar. 07, 1995; 08/399,898, filed Mar. 07, 1995; 08/399,665, filed Mar. 07, 1995; 08/400,058, filed Mar. 07, 1995; 08/399,800, filed Mar. 07, 1995; 08/399,799, filed Mar. 07, 1995; 08/474,222, filed Jun. 07, 1995; 08/486,481, filed Jun. 07, 1995; 08/474,231, filed Jun. 07, 1995; 08/474,830, filed Jun. 07, 1995; 08/474,220, filed Jun. 07, 1995; 08/473,868, filed Jun. 07, 1995; 08/474,603, filed Jun. 07, 1995; 08/485,242, filed Jun. 07, 1995; 08/477,048, filed Jun. 07, 1995; and 08/485,744, filed Jun. 07, 1995.
BACKGROUND OF THE INVENTION
The present invention is directed to a decompression circuit which operates to decompress or decode a plurality of differently encoded input signals, and, more particularly, to a method of controlling the buffering of encoded video data in said circuit.
Previous buffer manager systems were hardwired to implement certain predetermined conversions, for example, 3-2 pulldown systems. The present buffer manager does not use a predefined sequence of replication or skipping of frames, as in conventional 3-2 pulldown systems, and thus any ratio of encoded frame rate and display frame rate can be accommodated. The present buffer manager is thus more flexible with respect to its strategy for dropping or duplicating frames in order to account for differences in the encoded data frame rate and the display frame rate.
SUMMARY OF THE INVENTION
The invention provides a method for buffering encoded video data organized as frames comprising determining the picture number of a frame, determining the desired presentation number of a frame and marking the buffer as ready when the picture number is on or after the desired presentation number.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of an image formatter.
FIG. 2 is a diagram of the buffer manager state machine.
FIG. 3 illustrates the main loop of the state machine in FIG. 2.
Before one embodiment of the invention is explained in detail, it is to be understood that the invention is not limited in its application to the details of construction and the arrangement of components set forth in the following description or illustrated in the drawings. The invention is capable of other embodiments and of being practiced or carried out in various ways. Also, it should be understood that the phraseology and terminology used herein is for the purpose of description and should not be regarded as limiting.
DETAILED DESCRIPTION OF THE INVENTION
An image formatter is shown in FIG. 1. There are two address generators, one for writing 10 and one for reading 20, a buffer manager 30 which supervises the two address generators 10 and 20 and provides frame-rate conversion, a data processing pipeline including vertical and horizontal upsamplers, colour-space conversion and gamma correction, and a final control block which regulates the output of the processing pipeline.
Tokens arriving at the input to the image formatter are buffered in the FIFO 40 and transferred into the buffer manager 30. This block detects the arrival of new pictures and determines the availability of a buffer in which to store each one. If there is a buffer available, it is allocated to the arriving picture and its index is transferred to the write address generator 10. If there is no buffer available, the incoming picture will be stalled until one does become free. All tokens are passed on to the write address generator 10. This operation is described in greater detail in U.K. Serial No. 9405914.4 filed on Mar. 24, 1994, which is incorporated herein by reference.
Each time the read address generator 20 receives a VSYNC signal from the display system, a request is made to the buffer manager 30 for a new display buffer index. If there is a buffer containing complete picture data, and that picture is deemed to be ready for display, that buffer's index will be passed to the display address generator. If not, the buffer manager sends the index of the last buffer to be displayed. At start-up, zero is passed as the index until the first buffer is full. A picture is deemed to be ready for display if its number (calculated as each picture is input) is greater than or equal to the picture number which is expected at the display (presentation number) given the encoding frame rate. The expected picture number is determined by counting picture clock pulses, where picture clock can be generated either locally by the clock dividers, or externally. This technology allows frame-rate conversion (e.g.2-3 pull-down).
External DRAM is used for the buffers, which can be either two or three in number. Three are necessary if frame-rate conversion is to be effected.
The purpose of the buffer manager 30 is to supply the address generators with indices indicating any of either two or three external buffers for writing and reading of picture data. The allocation of these indices is influenced by three principal factors, each representing the effect of one of the timing regimes in operation: the rate at which picture data arrives at the input to image formatter (coded data rate), the rate at which data is displayed (display data rate), and the frame rate of the encoded video sequence (presentation rate).
A three-buffer system enables the presentation rate and the display rate to differ (e.g. 2-3 pulldown), so that frames are either repeated or skipped as necessary to achieve the best possible sequence of frames given the timing constraints of the system. Pictures which present some difficulty in decoding may also be accommodated in a similar way, so that if a picture takes longer than the available display time to decode, the previous frame will be repeated while everything else `catches up`. In a two-buffer system the three timing regimes must be locked--it is the third buffer which provides the flexibility for taking up slack.
The buffer manager operates by maintaining certain status information associated with each external buffer--this includes flags indicating if the buffer is in use, full of data, or ready for display, and the picture number within the sequence of the picture currently stored in the buffer. The presentation number is also recorded, this being a number which increments every time a picture clock pulse is received, and represents the picture number which is currently expected for display based on the frame rate of the encoded sequence.
An arrival buffer (a buffer to which incoming data will be written) is allocated every time a PICTURE-- START token is detected at the input, and this buffer is then flagged as IN-- USE; on PICTURE-- END, the arrival buffer will be de-allocated (reset to zero) and the buffer flagged as either FULL or READY depending on the relationship between the picture number and the presentation number.
The display address generator requests a new display buffer, once every vsync, via a two-wire-interface. If there is a buffer flagged as READY, then that will be allocated to display by the buffer manager. If there is no READY buffer, the previously displayed buffer will be repeated.
Each time the presentation number changes this is detected and every buffer containing a complete picture is tested for READY-ness by examining the relationship between its picture number and the presentation number. Buffers are considered in turn, and when any is deemed to be READY this automatically cancels the READY-ness of any which was previously flagged as READY, this then being flagged as EMPTY. This works because later picture numbers are stored, by virtue of the allocation scheme, in the buffers that are considered later.
TEMPORAL-- REFERENCE tokens in H261 cause a buffer's picture number to be modified if skipped pictures in the input stream are indicated. TEMPORAL-- REFERENCE tokens in MPEG have no effect.
A FLUSH token causes the input to stall until every buffer is either EMPTY or has been allocated as the display buffer; presentation number and picture number are then reset and a new sequence can commence.
All data is input to the buffer manager from the input fifo, bm-- front. This transfer takes place via a two-wire interface, the data being 8 bits wide plus an extension bit. All data arriving at the buffer manager is guaranteed to be complete tokens, a necessity for the continued processing of presentation numbers and display buffer requests in the event of significant gaps in the data upstream.
Tokens (8 bit data, 1 bit extension) are transferred to the write address generator via a two-wire interface. The arrival buffer index is also transferred on the same interface, so that the correct index is available for address generation at the same time as the PICTURE-- START token arrives at waddrgen.
The interface to the read address generator comprises two separate two-wire interfaces which can be considered to act as `request` and `acknowledge` signals respectively--single wires are not adequate, however, because of the two two-wire-based state machines at either end.
The sequence of events normally associated with the dispaddr interface is as follows: dispaddr invokes a request, in response to a vsync from the display device, by asserting the drq-- valid input to the buffer manager; when the buffer manager reaches an appropriate point in its state machine it will accept the request and go about allocating a buffer to be displayed; the disp-- valid wire is then asserted, the buffer index is transferred, and this will normally be accepted immediately by dispaddr. There is an additional wire associated with this last two-wire-interface (rst-- fld) which indicates that the field number associated with the current index must be reset regardless of the previous field number.
The buffer manager block uses four bits of microprocessor address space, together with the 8-bit data bus and read and write strobes. There are two select signals, one indicating user-accessible locations and the other indicating test locations which should not require access under normal operation conditions.
The buffer manager is capable of producing two different events: index found and late arrival. The first of these is asserted when a picture arrives whose PICTURE-- START extension byte (picture index) matches the value written into the BU-- BM-- TARGET-- IX register at setup. The second event occurs when a display buffer is allocated whose picture number is less than the current presentation number, i.e. the processing in the system pipeline up to the buffer manager has not managed to keep up with the presentation requirements.
Picture clock is the clock signal for the presentation number counter and is either generated on-chip or taken from an external source (normally the display system). The buffer manager accepts both of these signals and selects one based on the value of pclk-- ext (a bit in the buffer manager's control register). This signal also acts as the enable for the pad picoutpad, so that if the Image Formatter is generating its own picture clock this signal is also available as an output from the chip.
There are 19 states in the buffer manager's state machine. These interact as shown in FIG. 2. The reset state is PRES0, with flags set to zero such that the main loop is circulated initially.
The main loop of the state machine comprises the states shown in FIG. 3 (highlighted in the main diagram--FIG. 2). States PRES0 and PRES1 are concerned with detecting a picture clock via the signal presflg. Two cycles are allowed for the tests involved since they all depend on the value of rdytst. If a presentation flag is detected, all of the buffers are examined for possible `readiness`, otherwise the state machine just advances to state DRQ. Each cycle around the PRES0-PRES1 loop examines a different buffer, checking for full and ready conditions: if these are met, the previous ready buffer (if one exists) is cleared, the new ready buffer is allocated and its status is updated. This process is repeated until all buffers have been examined (index==max buf) and the state then advances. A buffer is deemed to be ready for display when any of the following is true:
(pic-- num>pres-- num)&&((pic-- num-pres-- num)>=128)
or
(pic-- num<pres-- num)&&((pres-- num-pic-- num)<=128)
or
pic-- num==pres-- num
State DRQ checks for a request for a display buffer (drq-- valid-- reg && disp-- acc-- reg). If there is no request the state advances (normally to state TOKEN--more on this later), otherwise a display buffer index is issued as follows: if there is no ready buffer, the previous index is re-issued or, if there is no previous display buffer, a null index (zero) is issued; if a buffer is ready for display, its index is issued and its state is updated--if necessary the previous display buffer is cleared. The state machine then advances as before.
State TOKEN is the usual option for completing the main loop: if there is valid input and the output is not stalled, tokens are examined for strategic values (described in later sections), otherwise control returns to state PRES0.
Control only diverges from the main loop when certain conditions are met. These are described in the following sections.
If during the PRES0-PRES1 loop a buffer is determined to be ready, any previous ready buffer needs to be vacated because only one buffer can be designated ready at any time. State VACATE-- RDY clears the old ready buffer by setting its state to VACANT, and it resets the buffer index to 1 so that when control returns to the PRES0 state, all buffers will be tested for readiness. The reason for this is that the index is by now pointing at the previous ready buffer (for the purpose of clearing it) and there is no record of our intended new ready buffer index--it is necessary therefore to re-test all of the buffers.
Allocation of the display buffer index takes place either directly from state DRQ (state USE-- RDY) or via state VACATE-- DISP which clears the old display buffer state. The chosen display buffer is flagged as IN-- USE, the value of rdy-- buf is set to zero, and the index is reset to 1 to return to state DRQ. disp-- buf is given the required index and the two-wire interface wires (disp-- valid and drq-- acc) are controlled accordingly. Control returns to state DRQ only so that the decision between states TOKEN, FLUSH and ALLOC does not need to be made in state USE-- RDY.
On receipt of a PICTURE-- END token control transfers from state TOKEN to state PICTURE-- END where, if the index is not already pointing at the current arrival buffer, it is set to point there so that its status can be updated. Assuming both out-- acc-- reg and en-- full are true, status can be updated as described below; if not, control remains in state PICTURE-- END until they are both true. The en-- full signal is supplied by the write address generator to indicate that the swing buffer has swung, i.e. the last block has been successfully written and it is therefore safe to update the buffer status.
The just-completed buffer is tested for readiness and given the status either FULL or READY depending on the result of the test. If it is ready, rdy-- buf is given the value of its index and the set-- la-- ev signal (late arrival event) is set high (indicating that the expected display has got ahead in time of the decoding). The new value of arr-- buf now becomes zero, and, if the previous ready buffer needs its status clearing, the index is set to point there and control moves to state VACATE-- RDY; otherwise index is reset to 1 and control returns to the start of the main loop.
When a PICTURE-- START token arrives during state TOKEN, the flag from-- ps is set, causing the basic state machine loop to be changed such that state ALLOC is visited instead of state TOKEN. State ALLOC is concerned with allocating an arrival buffer (into which the arriving picture data can be written), and cycles through the buffers until it finds one whose status is VACANT. A buffer will only be allocated if out-- acc-- reg is high, since it is output on the data two-wire-interface, so cycling around the loop will continue until this is the case. Once a suitable arrival buffer has been found, the index is allocated to arr-- buf and its status is flagged as IN-- USE. Index is set to 1, the flag from-- ps is reset, and the state is set to advance to NEW-- EXP-- TR. A check is made on the picture's index (contained in the word following the PICTURE-- START) to determine if it the same as targ-- ix (the target index specified at setup) and, if so, set-- if-- ev (index found event) is set high.
The three states NEW-- EXP-- TR, SET-- ARR-- IX and NEW-- PIC-- NUM set up the new expected temporal reference and picture number for the incoming data--the middle state just sets the index to be arr-- buf so that the correct picture number register is updated (note that this-- pnum is also updated). Control then goes to state OUTPUT-- TAIL which outputs data (assuming favourable two-wire interface signals) until a low extension is encountered, at which point the main loop is re-started. This means that whole data blocks (64 items) are output, within which there are no tests for presentation flag or display request.
A FLUSH token in the data stream indicates that sequence information (presentation number, picture number, rst-- fld) should be reset. This can only happen when all of the data leading up to the FLUSH has been correctly processed and so it is necessary, having received a FLUSH, to monitor the status of all of the buffers until it is certain that all frames have been handed over to the display, i.e. all but one of the buffers have status EMPTY, and the other is IN-- USE (as the display buffer). At that point a `new sequence` can safely be started.
When a FLUSH token is detected in state TOKEN, the flag from-- fl is set, causing the basic state machine loop to be changed such that state FLUSH is visited instead of state TOKEN. State FLUSH examines the status of each buffer in turn, waiting for it to become VACANT or IN-- USE as display. The state machine simply cycles around the loop until the condition is true, then increments its index and repeats the process until all of the buffers have been visited. When the last buffer fulfils the condition, presentation number, picture number and all of the temporal reference registers assume their reset values; rst-- fld is set to 1. The flag from-- fl is reset and the normal main loop operation is resumed.
When a TEMPORAL-- REFERENCE token is encountered, a check is made on the H261 bit and, if set, the four states TEMP-- REF0 to TEMP-- REF3 are visited. These perform the following operations:
TEMP-- REF0: temp-- ref=in-- data-- reg;
TEMP-- REF1: delta=temp-- ref-exp-- tr; index=arr-- buf;
TEMP-- REF2: exp-- tr=delta+exp-- tr;
TEMP-- REF3: pic-- num[i]=this-- pnum+delta;index=1;
State TOKEN passes control to state OUTPUT-- TAIL in all cases other than those outlined above. Control remains here until the last word of the token is encountered (in-- extn-- reg is low) and the main loop is then re-entered.
The requirement to repeatedly check for the `asynchronous` timing events of picture clock and display buffer request, and the necessary to have the buffer manager input stalled during these checks, means that when there is a continuous supply of data at the input to the buffer manager there will be a restriction on the data rate through the buffer manager. A typical sequence of states may be PRES0, PRES1, DRQ, TOKEN, OUTPUT-- TAIL, each, with the exception of OUTPUT-- TAIL, lasting one cycle. This means that for each block of 64 data items, there will be an overhead of 3 cycles during which the input is stalled (during states PRES0, PRES1 and DRQ) thereby slowing the write rate by 3/64 or approximately 5%. This number may occasionally increase to up to 13 cycles overhead when auxiliary branches of the state machine are executed under worst-case conditions. Note that such large overheads will only apply on a once-per-frame basis.
Presentation number free-runs during upi accesses; if presentation number is required to be the same when access is relinquished as it was when access was gained, this can be effected by reading presentation number after access is granted, and writing it back just before it is relinquished. Note that this is asynchronous, so it may be necessary to repeat the accesses several times to be sure they are effective.
The write address generator 10 receives tokens from the buffer manager 30 and detects the arrival of each new DATA token. As each arrives, it calculates a new address for the DRAM interface 50 in which to store the arriving block. The raw data is then passed to the DRAM interface 50 where it is written in to a swing buffer. Note that DRAM addresses are block addresses, and pictures in the DRAM are organised as rasters of blocks. Incoming picture data, however, is organised as sequences of macroblocks, so the address generation algorithm must take account of this.

Claims (16)

We claim:
1. A method of formatting images comprising frames of video data comprising the steps of:
receiving video data as tokens having a frame rate and an arrival rate;
defining at least three buffers for storage of the data, one of said buffers being a display buffer, and another of said buffers being an arrival buffer;
generating write addresses for storing data in said buffers;
generating read addresses for reading data stored in said buffers;
responsive to said step of generating read addresses, displaying data from said display buffer at a display rate; and
responsive to said arrival rate, said display rate, and said frame rate, allocating said buffers to accommodate said steps of generating write addresses and generating read addresses;
defining a plurality of 2-wire interfaces each comprising: a sender, a receiver, and a clock connected to said sender and said receiver, said clock having transitions from a first state to a second state, wherein data is transferred from said sender to said receiver upon a clock transition only when said sender is ready and said receiver is ready;
providing control signals for controlling said steps of generating write addresses, generating read addresses, and allocating said buffers, wherein said control signals are communicated via said 2-wire interfaces.
2. The method according to claim 1, wherein said video data is received via a said 2-wire interface.
3. The method according to claim 1, wherein said tokens each comprise a plurality of data words, said data words each including an extension bit which indicates a presence of additional words in said token.
4. The method according to claim 1, further comprising the steps of:
maintaining a setup register having a picture index stored therein;
asserting a first signal when received encoded data represents a picture having an index corresponding to said picture index; and
asserting a second signal when said display buffer has a picture number that is less than a current presentation number.
5. A method of formatting images comprising frames of video data comprising the steps of:
receiving video data as tokens having a frame rate and an arrival rate;
defining at least three buffers for storage of the data, one of said buffers being a display buffer, and another of said buffers being an arrival buffer;
generating write addresses for storing data in said buffers;
generating read addresses for reading data stored in said buffers;
responsive to said step of generating read addresses, displaying data from said display buffer at a display rate; and
responsive to said arrival rate, said display rate, and said frame rate, allocating said buffers to accommodate said steps of generating write addresses and generating read addresses;
counting presentation numbers of said frames; and
responsive to said arrival rate, said display rate, and said frame rate, allocating said buffers to accommodate said steps of generating write addresses and generating read addresses by the steps of:
in a first state PRES0, and in a second state PRES1, evaluating conditions of said buffers;
in a third state DRQ evaluating a pending request for said display buffer; and
in a fourth state TOKEN, examining tokens of received data.
6. The method according to claim 5, wherein said step of allocating said buffers further comprises the step of:
in a fifth state VACATE-- RDY, clearing a ready state of a said buffer.
7. The method according to claim 5, wherein said step of allocating said buffers further comprises the step of:
in a sixth state VACATE-- DISP, clearing a state of said display buffer.
8. The method according to claim 5, wherein said step of allocating said buffers further comprises the step of:
in a seventh state USE-- RDY, allocating a display buffer.
9. The method according to claim 5, wherein said step of allocating said buffers further comprises the step of:
in an eighth state PICTURE-- END, setting an index to a current arrival buffer.
10. The method according to claim 5, wherein said step of allocating said buffers further comprises the step of:
in a ninth state ALLOC, allocating an arrival buffer for new data.
11. The method according to claim 5, wherein said step of allocating said buffers further comprises the step of:
in a tenth state NEW-- EXP, and in an eleventh state NEW-- PIC-- NUM, setting up an expected temporal reference and picture number for incoming data.
12. The method according to claim 5, wherein said step of allocating said buffers further comprises the step of:
in a twelfth state SET-- ARR-- IX, updating a picture number register.
13. The method according to claim 5, wherein said step of allocating said buffers further comprises the step of:
in a thirteenth state OUTPUT-- TAIL, outputting data from said display buffer.
14. The method according to claim 5, wherein said step of allocating said buffers further comprises the step of:
in a fourteenth state FLUSH, delaying until said buffers become vacant or enter a state of use for display.
15. The method according to claim 5, further comprising the steps of:
defining a plurality of 2-wire interfaces each comprising: a sender, a receiver, and a clock connected to said sender and said receiver, said clock having transitions from a first state to a second state, wherein data is transferred from said sender to said receiver upon a clock transition only when said sender is ready and said receiver is ready;
providing control signals for controlling said steps of generating write addresses, generating read addresses, and allocating said buffers, wherein said control signals are communicated via said 2-wire interfaces.
16. The method according to claim 5, wherein said tokens each comprise a plurality of data words, said data words each including an extension bit which indicates a presence of additional words in said token.
US08/876,720 1992-06-30 1997-06-16 Buffer manager Expired - Lifetime US6034674A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US08/876,720 US6034674A (en) 1992-06-30 1997-06-16 Buffer manager
US09/323,627 US6417859B1 (en) 1992-06-30 1999-06-01 Method and apparatus for displaying video data

Applications Claiming Priority (13)

Application Number Priority Date Filing Date Title
EP92306038A EP0576749B1 (en) 1992-06-30 1992-06-30 Data pipeline system
EP92306038 1992-06-30
US8229193A 1993-06-24 1993-06-24
GB9405914 1994-03-24
GB9405914A GB9405914D0 (en) 1994-03-24 1994-03-24 Video decompression
GB9415387A GB9415387D0 (en) 1994-07-29 1994-07-29 Method and apparatus for addressing memory
GB9415387 1994-07-29
US38295895A 1995-02-02 1995-02-02
GB9503964 1995-02-28
GB9503964A GB2287808B (en) 1994-03-24 1995-02-28 Method and apparatus for interfacing with ram
US39980195A 1995-03-07 1995-03-07
US40039795A 1995-03-07 1995-03-07
US08/876,720 US6034674A (en) 1992-06-30 1997-06-16 Buffer manager

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US39980195A Continuation 1992-06-30 1995-03-07

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US09/323,627 Division US6417859B1 (en) 1992-06-30 1999-06-01 Method and apparatus for displaying video data

Publications (1)

Publication Number Publication Date
US6034674A true US6034674A (en) 2000-03-07

Family

ID=27570930

Family Applications (1)

Application Number Title Priority Date Filing Date
US08/876,720 Expired - Lifetime US6034674A (en) 1992-06-30 1997-06-16 Buffer manager

Country Status (1)

Country Link
US (1) US6034674A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020085000A1 (en) * 2000-12-18 2002-07-04 Alan Sullivan Rasterization of three dimensional images
US20070190686A1 (en) * 2006-02-13 2007-08-16 Advanced Semiconductor Engineering, Inc. Method of fabricating substrate with embedded component therein
US20090214175A1 (en) * 2003-07-03 2009-08-27 Mccrossan Joseph Recording medium, reproduction apparatus, recording method, integrated circuit, program, and reproduction method

Citations (108)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4107780A (en) * 1976-01-28 1978-08-15 National Research Development Corporation Display apparatus
US4135242A (en) * 1977-11-07 1979-01-16 Ncr Corporation Method and processor having bit-addressable scratch pad memory
US4225920A (en) * 1978-09-11 1980-09-30 Burroughs Corporation Operator independent template control architecture
US4236228A (en) * 1977-03-17 1980-11-25 Tokyo Shibaura Electric Co., Ltd. Memory device for processing picture images data
US4251864A (en) * 1979-01-02 1981-02-17 Honeywell Information Systems Inc. Apparatus and method in a data processing system for manipulation of signal groups having boundaries not coinciding with boundaries of signal group storage space
US4302776A (en) * 1979-03-22 1981-11-24 Micro Consultants Limited Digital still picture storage system with size change facility
GB2039106B (en) 1979-01-02 1983-03-23 Honeywell Inf Systems Number format conversion in computer
US4598372A (en) * 1983-12-28 1986-07-01 Motorola, Inc. Apparatus and method of smoothing MAPS compressed image data
US4617657A (en) * 1984-12-28 1986-10-14 Northern Telecom Limited Transmitting sequence numbers of information in a packet data transmission system
US4630198A (en) * 1984-02-21 1986-12-16 Yuan Houng I Intelligent stand-alone printfile buffer with paging control
US4646151A (en) * 1985-02-01 1987-02-24 General Electric Company Television frame synchronizer with independently controllable input/output rates
US4689823A (en) * 1984-01-04 1987-08-25 Itek Corporation Digital image frame processor
US4726019A (en) * 1986-02-28 1988-02-16 American Telephone And Telegraph Company, At&T Bell Laboratories Digital encoder and decoder synchronization in the presence of late arriving packets
US4747070A (en) * 1984-01-09 1988-05-24 Wang Laboratories, Inc. Reconfigurable memory system
GB2171578B (en) 1985-02-22 1988-10-05 Mitsubishi Electric Corp A still picture transmission apparatus
US4799056A (en) * 1986-04-11 1989-01-17 International Business Machines Corporation Display system having extended raster operation circuitry
US4807028A (en) * 1986-11-10 1989-02-21 Kokusai Denshin Denwa Co., Ltd. Decoding device capable of producing a decoded video signal with a reduced delay
US4814978A (en) * 1986-07-15 1989-03-21 Dataflow Computer Corporation Dataflow processing element, multiprocessor, and processes
US4823201A (en) * 1987-11-16 1989-04-18 Technology, Inc. 64 Processor for expanding a compressed video signal
US4866637A (en) * 1987-10-30 1989-09-12 International Business Machines Corporation Pipelined lighting model processing system for a graphics workstation's shading function
US4875196A (en) * 1987-09-08 1989-10-17 Sharp Microelectronic Technology, Inc. Method of operating data buffer apparatus
US4887224A (en) * 1986-08-28 1989-12-12 Canon Kabushiki Kaisha Image data processing apparatus capable of high-speed data encoding and/or decoding
US4891784A (en) * 1988-01-08 1990-01-02 Hewlett-Packard Company High capacity tape drive transparently writes and reads large packets of blocked data between interblock gaps
US4903018A (en) * 1985-07-19 1990-02-20 Heinz-Ulrich Wiebach Process for compressing and expanding structurally associated multiple-data sequences, and arrangements for implementing the process
US4910683A (en) * 1988-12-20 1990-03-20 Sun Microsystems, Inc. Method and apparatus for fractional double buffering
GB2194085B (en) 1986-07-24 1990-07-04 Gec Avionics Bus
US4949280A (en) * 1988-05-10 1990-08-14 Battelle Memorial Institute Parallel processor-based raster graphics system architecture
US4985766A (en) * 1987-09-23 1991-01-15 British Telecommunications Public Limited Company Video coder
US4991112A (en) * 1987-12-23 1991-02-05 U.S. Philips Corporation Graphics system with graphics controller and DRAM controller
US5010401A (en) * 1988-08-11 1991-04-23 Mitsubishi Denki Kabushiki Kaisha Picture coding and decoding apparatus using vector quantization
US5021947A (en) * 1986-03-31 1991-06-04 Hughes Aircraft Company Data-flow multiprocessor architecture with three dimensional multistage interconnection network for efficient signal and data processing
US5027212A (en) * 1989-12-06 1991-06-25 Videologic Limited Computer based video/graphics display system
US5036475A (en) * 1987-11-02 1991-07-30 Daikin Industries, Ltd. Image memory data processing control apparatus
US5035624A (en) * 1989-03-06 1991-07-30 Hitachi, Ltd. Presentation apparatus
US5038209A (en) * 1990-09-27 1991-08-06 At&T Bell Laboratories Adaptive buffer/quantizer control for transform video coders
US5050166A (en) * 1987-03-17 1991-09-17 Antonio Cantoni Transfer of messages in a multiplexed system
US5091721A (en) * 1988-12-22 1992-02-25 Hughes Aircraft Company Acoustic display generator
US5129059A (en) * 1988-09-13 1992-07-07 Silicon Graphics, Inc. Graphics processor with staggered memory timing
US5134697A (en) * 1987-11-16 1992-07-28 Prime Computer Remote memory-mapped display with interactivity determination
US5148524A (en) * 1988-11-29 1992-09-15 Solbourne Computer, Inc. Dynamic video RAM incorporating on chip vector/image mode line modification
US5151997A (en) * 1989-08-10 1992-09-29 Apple Computer, Inc. Computer with adaptable video circuitry
US5161221A (en) * 1988-12-12 1992-11-03 Eastman Kodak Company Multi-memory bank system for receiving continuous serial data stream and monitoring same to control bank switching without interrupting continuous data flow rate
US5174641A (en) * 1990-07-25 1992-12-29 Massachusetts Institute Of Technology Video encoding method for television applications
US5179372A (en) * 1990-06-19 1993-01-12 International Business Machines Corporation Video Random Access Memory serial port access
US5182642A (en) * 1991-04-19 1993-01-26 General Dynamics Lands Systems Inc. Apparatus and method for the compression and transmission of multiformat data
US5184124A (en) * 1991-01-02 1993-02-02 Next Computer, Inc. Method and apparatus for compressing and storing pixels
US5200925A (en) * 1988-07-29 1993-04-06 Mitsubishi Denki Kabushiki Kaisha Serial access semiconductor memory device and operating method therefor
US5221966A (en) * 1990-01-17 1993-06-22 Avesco Plc Video signal production from cinefilm originated material
US5227863A (en) * 1989-11-14 1993-07-13 Intelligent Resources Integrated Systems, Inc. Programmable digital video processing system
US5229863A (en) * 1990-12-24 1993-07-20 Xerox Corporation High speed CCITT decompressor
US5233690A (en) * 1989-07-28 1993-08-03 Texas Instruments Incorporated Video graphics display memory swizzle logic and expansion circuit and method
US5233545A (en) * 1989-09-19 1993-08-03 Hewlett-Packard Company Time interval triggering and hardware histogram generation
US5241222A (en) * 1991-12-20 1993-08-31 Eastman Kodak Company Dram interface adapter circuit
US5247612A (en) * 1990-06-29 1993-09-21 Radius Inc. Pixel display apparatus and method using a first-in, first-out buffer
US5257350A (en) * 1989-08-10 1993-10-26 Apple Computer, Inc. Computer with self configuring video circuitry
US5261047A (en) * 1991-10-29 1993-11-09 Xerox Corporation Bus arbitration scheme for facilitating operation of a printing apparatus
US5263136A (en) * 1991-04-30 1993-11-16 Optigraphics Corporation System for managing tiled images using multiple resolutions
US5267334A (en) * 1991-05-24 1993-11-30 Apple Computer, Inc. Encoding/decoding moving images with forward and backward keyframes for forward and reverse display
EP0572262A2 (en) 1992-05-28 1993-12-01 C-Cube Microsystems, Inc. Decoder for compressed video signals
US5276681A (en) * 1992-06-25 1994-01-04 Starlight Networks Process for fair and prioritized access to limited output buffers in a multi-port switch
GB2268036A (en) 1992-06-25 1994-01-05 John Gough Dutch hoe riddle.
US5287193A (en) * 1991-04-10 1994-02-15 Industrial Technology Research Institute Parallel processing architecture of run-length codes
US5287182A (en) * 1992-07-02 1994-02-15 At&T Bell Laboratories Timing recovery for variable bit-rate video on asynchronous transfer mode (ATM) networks
US5289577A (en) * 1992-06-04 1994-02-22 International Business Machines Incorporated Process-pipeline architecture for image/video processing
US5301242A (en) * 1991-05-24 1994-04-05 International Business Machines Corporation Apparatus and method for motion video encoding employing an adaptive quantizer
US5300949A (en) * 1992-10-22 1994-04-05 International Business Machines Corporation Scalable digital video decompressor
US5303342A (en) * 1990-07-13 1994-04-12 Minnesota Mining And Manufacturing Company Method and apparatus for assembling a composite image from a plurality of data types
US5307449A (en) * 1991-12-20 1994-04-26 Apple Computer, Inc. Method and apparatus for simultaneously rendering multiple scanlines
US5311309A (en) * 1990-06-01 1994-05-10 Thomson Consumer Electronics, Inc. Luminance processing system for compressing and expanding video data
US5319460A (en) * 1991-08-29 1994-06-07 Canon Kabushiki Kaisha Image signal processing device including frame memory
US5321806A (en) * 1991-08-21 1994-06-14 Digital Equipment Corporation Method and apparatus for transmitting graphics command in a computer graphics system
US5341371A (en) * 1990-05-25 1994-08-23 Inmos Limited Communication interface
US5343218A (en) * 1985-12-13 1994-08-30 Canon Kabushiki Kaisha Method and apparatus for forming synthesized image
EP0572263A3 (en) 1992-05-28 1994-09-14 C Cube Microsystems Variable length code decoder for video decompression operations
US5351047A (en) * 1992-09-21 1994-09-27 Laboratory Automation, Inc. Data decoding method and apparatus
US5357606A (en) * 1992-02-25 1994-10-18 Apple Computer, Inc. Row interleaved frame buffer
US5367494A (en) * 1991-05-20 1994-11-22 Motorola, Inc. Randomly accessible memory having time overlapping memory accesses
US5369418A (en) * 1988-12-23 1994-11-29 U.S. Philips Corporation Display apparatus, a method of storing an image and a storage device wherein an image has been stored
US5369405A (en) * 1992-05-19 1994-11-29 Goldstar Co., Ltd. Coefficient generation apparatus for variable length decoder
US5384598A (en) * 1992-10-20 1995-01-24 International Business Machines Corporation System and method for frame differencing video compression and decompression with frame rate scalability
US5384745A (en) * 1992-04-27 1995-01-24 Mitsubishi Denki Kabushiki Kaisha Synchronous semiconductor memory device
US5386537A (en) * 1991-03-28 1995-01-31 Minolta Camera Kabushiki Kaisha System with reduced instruction set processor accessing plural memories at different speeds using bank interleaving
US5396592A (en) * 1991-05-30 1995-03-07 Sony Corporation Image signal interpolating circuit for calculating interpolated values for varying block sizes
US5396497A (en) * 1993-02-26 1995-03-07 Sony Corporation Synchronization of audio/video information
US5414813A (en) * 1990-02-13 1995-05-09 Kabushiki Kaisha Toshiba Direct transfer from a receive buffer to a host in a token-passing type network data transmission system
US5421028A (en) * 1991-03-15 1995-05-30 Hewlett-Packard Company Processing commands and data in a common pipeline path in a high-speed computer graphics system
US5420801A (en) * 1992-11-13 1995-05-30 International Business Machines Corporation System and method for synchronization of multimedia streams
US5426606A (en) * 1993-04-02 1995-06-20 Nec Corporation Semiconductor memory device synchronous with external clock signal for outputting data bits through a small number of data lines
US5430488A (en) * 1991-09-27 1995-07-04 Sony United Kingdom, Ltd. Image signal processing apparatus for converting to frame format rastered image data which is supplied in field format but which originated in frame format
US5446866A (en) * 1992-01-30 1995-08-29 Apple Computer, Inc. Architecture for transferring pixel streams, without control information, in a plurality of formats utilizing addressable source and destination channels associated with the source and destination components
US5448568A (en) * 1994-04-28 1995-09-05 Thomson Consumer Electronics, Inc. System of transmitting an interactive TV signal
US5450599A (en) * 1992-06-04 1995-09-12 International Business Machines Corporation Sequential pipelined processing for the compression and decompression of image data
US5452006A (en) * 1993-10-25 1995-09-19 Lsi Logic Corporation Two-part synchronization scheme for digital video decoders
US5457482A (en) * 1991-03-15 1995-10-10 Hewlett Packard Company Method and apparatus for utilizing off-screen memory as a simultaneously displayable channel
US5457780A (en) * 1991-04-17 1995-10-10 Shaw; Venson M. System for producing a video-instruction set utilizing a real-time frame differential bit map and microblock subimages
US5461679A (en) * 1991-05-24 1995-10-24 Apple Computer, Inc. Method and apparatus for encoding/decoding image data
US5467137A (en) * 1993-05-13 1995-11-14 Rca Thomson Licensing Corporation Method and apparatus for synchronizing a receiver as for a compressed video signal using differential time code
US5481307A (en) * 1992-04-01 1996-01-02 Intel Corporation Method and apparatus for compressing and decompressing a sequence of digital video images using sync frames
US5481689A (en) * 1990-06-29 1996-01-02 Digital Equipment Corporation Conversion of internal processor register commands to I/O space addresses
US5495291A (en) * 1994-07-22 1996-02-27 Hewlett-Packard Company Decompression system for compressed video data for providing uninterrupted decompressed video data output
US5502494A (en) * 1993-10-25 1996-03-26 Lsi Logic Corporation Management of channel buffer in video decoders
US5502573A (en) * 1992-12-18 1996-03-26 Sony Corporation Apparatus for reproducing and decoding multiplexed data from a record medium with means for controlling data decoding as a function of synchronization errors
US5553005A (en) * 1993-05-19 1996-09-03 Alcatel N.V. Video server memory management method
US5572691A (en) * 1993-04-21 1996-11-05 Gi Corporation Apparatus and method for providing multiple data streams from stored data using dual memory buffers
US5574933A (en) * 1991-07-25 1996-11-12 Tandem Computers Incorporated Task flow computer architecture
US5579052A (en) * 1993-05-27 1996-11-26 Sgs-Thomson Microelectronics S.A. Picture processing system
EP0468480B1 (en) 1990-07-25 1997-01-02 Oki Electric Industry Co., Ltd. Synchronous burst-access memory and word-line driving circuit therefor
EP0576749B1 (en) 1992-06-30 1999-06-02 Discovision Associates Data pipeline system

Patent Citations (109)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4107780A (en) * 1976-01-28 1978-08-15 National Research Development Corporation Display apparatus
US4236228A (en) * 1977-03-17 1980-11-25 Tokyo Shibaura Electric Co., Ltd. Memory device for processing picture images data
US4135242A (en) * 1977-11-07 1979-01-16 Ncr Corporation Method and processor having bit-addressable scratch pad memory
US4225920A (en) * 1978-09-11 1980-09-30 Burroughs Corporation Operator independent template control architecture
GB2039106B (en) 1979-01-02 1983-03-23 Honeywell Inf Systems Number format conversion in computer
US4251864A (en) * 1979-01-02 1981-02-17 Honeywell Information Systems Inc. Apparatus and method in a data processing system for manipulation of signal groups having boundaries not coinciding with boundaries of signal group storage space
US4302776A (en) * 1979-03-22 1981-11-24 Micro Consultants Limited Digital still picture storage system with size change facility
US4598372A (en) * 1983-12-28 1986-07-01 Motorola, Inc. Apparatus and method of smoothing MAPS compressed image data
US4689823A (en) * 1984-01-04 1987-08-25 Itek Corporation Digital image frame processor
US4747070A (en) * 1984-01-09 1988-05-24 Wang Laboratories, Inc. Reconfigurable memory system
US4630198A (en) * 1984-02-21 1986-12-16 Yuan Houng I Intelligent stand-alone printfile buffer with paging control
US4617657A (en) * 1984-12-28 1986-10-14 Northern Telecom Limited Transmitting sequence numbers of information in a packet data transmission system
US4646151A (en) * 1985-02-01 1987-02-24 General Electric Company Television frame synchronizer with independently controllable input/output rates
GB2171578B (en) 1985-02-22 1988-10-05 Mitsubishi Electric Corp A still picture transmission apparatus
US4903018A (en) * 1985-07-19 1990-02-20 Heinz-Ulrich Wiebach Process for compressing and expanding structurally associated multiple-data sequences, and arrangements for implementing the process
US5343218A (en) * 1985-12-13 1994-08-30 Canon Kabushiki Kaisha Method and apparatus for forming synthesized image
US4726019A (en) * 1986-02-28 1988-02-16 American Telephone And Telegraph Company, At&T Bell Laboratories Digital encoder and decoder synchronization in the presence of late arriving packets
US5021947A (en) * 1986-03-31 1991-06-04 Hughes Aircraft Company Data-flow multiprocessor architecture with three dimensional multistage interconnection network for efficient signal and data processing
US4799056A (en) * 1986-04-11 1989-01-17 International Business Machines Corporation Display system having extended raster operation circuitry
US4814978A (en) * 1986-07-15 1989-03-21 Dataflow Computer Corporation Dataflow processing element, multiprocessor, and processes
GB2194085B (en) 1986-07-24 1990-07-04 Gec Avionics Bus
US4887224A (en) * 1986-08-28 1989-12-12 Canon Kabushiki Kaisha Image data processing apparatus capable of high-speed data encoding and/or decoding
US4807028A (en) * 1986-11-10 1989-02-21 Kokusai Denshin Denwa Co., Ltd. Decoding device capable of producing a decoded video signal with a reduced delay
US5050166A (en) * 1987-03-17 1991-09-17 Antonio Cantoni Transfer of messages in a multiplexed system
US4875196A (en) * 1987-09-08 1989-10-17 Sharp Microelectronic Technology, Inc. Method of operating data buffer apparatus
US4985766A (en) * 1987-09-23 1991-01-15 British Telecommunications Public Limited Company Video coder
US4866637A (en) * 1987-10-30 1989-09-12 International Business Machines Corporation Pipelined lighting model processing system for a graphics workstation's shading function
US5036475A (en) * 1987-11-02 1991-07-30 Daikin Industries, Ltd. Image memory data processing control apparatus
US5134697A (en) * 1987-11-16 1992-07-28 Prime Computer Remote memory-mapped display with interactivity determination
US4823201A (en) * 1987-11-16 1989-04-18 Technology, Inc. 64 Processor for expanding a compressed video signal
US4991112A (en) * 1987-12-23 1991-02-05 U.S. Philips Corporation Graphics system with graphics controller and DRAM controller
US4891784A (en) * 1988-01-08 1990-01-02 Hewlett-Packard Company High capacity tape drive transparently writes and reads large packets of blocked data between interblock gaps
US4949280A (en) * 1988-05-10 1990-08-14 Battelle Memorial Institute Parallel processor-based raster graphics system architecture
US5200925A (en) * 1988-07-29 1993-04-06 Mitsubishi Denki Kabushiki Kaisha Serial access semiconductor memory device and operating method therefor
US5010401A (en) * 1988-08-11 1991-04-23 Mitsubishi Denki Kabushiki Kaisha Picture coding and decoding apparatus using vector quantization
US5129059A (en) * 1988-09-13 1992-07-07 Silicon Graphics, Inc. Graphics processor with staggered memory timing
US5148524A (en) * 1988-11-29 1992-09-15 Solbourne Computer, Inc. Dynamic video RAM incorporating on chip vector/image mode line modification
US5161221A (en) * 1988-12-12 1992-11-03 Eastman Kodak Company Multi-memory bank system for receiving continuous serial data stream and monitoring same to control bank switching without interrupting continuous data flow rate
US4910683A (en) * 1988-12-20 1990-03-20 Sun Microsystems, Inc. Method and apparatus for fractional double buffering
US5091721A (en) * 1988-12-22 1992-02-25 Hughes Aircraft Company Acoustic display generator
US5369418A (en) * 1988-12-23 1994-11-29 U.S. Philips Corporation Display apparatus, a method of storing an image and a storage device wherein an image has been stored
US5035624A (en) * 1989-03-06 1991-07-30 Hitachi, Ltd. Presentation apparatus
US5233690A (en) * 1989-07-28 1993-08-03 Texas Instruments Incorporated Video graphics display memory swizzle logic and expansion circuit and method
US5151997A (en) * 1989-08-10 1992-09-29 Apple Computer, Inc. Computer with adaptable video circuitry
US5257350A (en) * 1989-08-10 1993-10-26 Apple Computer, Inc. Computer with self configuring video circuitry
US5233545A (en) * 1989-09-19 1993-08-03 Hewlett-Packard Company Time interval triggering and hardware histogram generation
US5227863A (en) * 1989-11-14 1993-07-13 Intelligent Resources Integrated Systems, Inc. Programmable digital video processing system
US5027212A (en) * 1989-12-06 1991-06-25 Videologic Limited Computer based video/graphics display system
US5221966A (en) * 1990-01-17 1993-06-22 Avesco Plc Video signal production from cinefilm originated material
US5414813A (en) * 1990-02-13 1995-05-09 Kabushiki Kaisha Toshiba Direct transfer from a receive buffer to a host in a token-passing type network data transmission system
US5341371A (en) * 1990-05-25 1994-08-23 Inmos Limited Communication interface
US5311309A (en) * 1990-06-01 1994-05-10 Thomson Consumer Electronics, Inc. Luminance processing system for compressing and expanding video data
US5179372A (en) * 1990-06-19 1993-01-12 International Business Machines Corporation Video Random Access Memory serial port access
US5247612A (en) * 1990-06-29 1993-09-21 Radius Inc. Pixel display apparatus and method using a first-in, first-out buffer
US5481689A (en) * 1990-06-29 1996-01-02 Digital Equipment Corporation Conversion of internal processor register commands to I/O space addresses
US5303342A (en) * 1990-07-13 1994-04-12 Minnesota Mining And Manufacturing Company Method and apparatus for assembling a composite image from a plurality of data types
EP0468480B1 (en) 1990-07-25 1997-01-02 Oki Electric Industry Co., Ltd. Synchronous burst-access memory and word-line driving circuit therefor
US5174641A (en) * 1990-07-25 1992-12-29 Massachusetts Institute Of Technology Video encoding method for television applications
US5038209A (en) * 1990-09-27 1991-08-06 At&T Bell Laboratories Adaptive buffer/quantizer control for transform video coders
US5229863A (en) * 1990-12-24 1993-07-20 Xerox Corporation High speed CCITT decompressor
US5184124A (en) * 1991-01-02 1993-02-02 Next Computer, Inc. Method and apparatus for compressing and storing pixels
US5457482A (en) * 1991-03-15 1995-10-10 Hewlett Packard Company Method and apparatus for utilizing off-screen memory as a simultaneously displayable channel
US5421028A (en) * 1991-03-15 1995-05-30 Hewlett-Packard Company Processing commands and data in a common pipeline path in a high-speed computer graphics system
US5386537A (en) * 1991-03-28 1995-01-31 Minolta Camera Kabushiki Kaisha System with reduced instruction set processor accessing plural memories at different speeds using bank interleaving
US5287193A (en) * 1991-04-10 1994-02-15 Industrial Technology Research Institute Parallel processing architecture of run-length codes
US5457780A (en) * 1991-04-17 1995-10-10 Shaw; Venson M. System for producing a video-instruction set utilizing a real-time frame differential bit map and microblock subimages
US5182642A (en) * 1991-04-19 1993-01-26 General Dynamics Lands Systems Inc. Apparatus and method for the compression and transmission of multiformat data
US5263136A (en) * 1991-04-30 1993-11-16 Optigraphics Corporation System for managing tiled images using multiple resolutions
US5367494A (en) * 1991-05-20 1994-11-22 Motorola, Inc. Randomly accessible memory having time overlapping memory accesses
US5267334A (en) * 1991-05-24 1993-11-30 Apple Computer, Inc. Encoding/decoding moving images with forward and backward keyframes for forward and reverse display
US5301242A (en) * 1991-05-24 1994-04-05 International Business Machines Corporation Apparatus and method for motion video encoding employing an adaptive quantizer
US5461679A (en) * 1991-05-24 1995-10-24 Apple Computer, Inc. Method and apparatus for encoding/decoding image data
US5396592A (en) * 1991-05-30 1995-03-07 Sony Corporation Image signal interpolating circuit for calculating interpolated values for varying block sizes
US5574933A (en) * 1991-07-25 1996-11-12 Tandem Computers Incorporated Task flow computer architecture
US5321806A (en) * 1991-08-21 1994-06-14 Digital Equipment Corporation Method and apparatus for transmitting graphics command in a computer graphics system
US5319460A (en) * 1991-08-29 1994-06-07 Canon Kabushiki Kaisha Image signal processing device including frame memory
US5430488A (en) * 1991-09-27 1995-07-04 Sony United Kingdom, Ltd. Image signal processing apparatus for converting to frame format rastered image data which is supplied in field format but which originated in frame format
US5261047A (en) * 1991-10-29 1993-11-09 Xerox Corporation Bus arbitration scheme for facilitating operation of a printing apparatus
US5241222A (en) * 1991-12-20 1993-08-31 Eastman Kodak Company Dram interface adapter circuit
US5307449A (en) * 1991-12-20 1994-04-26 Apple Computer, Inc. Method and apparatus for simultaneously rendering multiple scanlines
US5446866A (en) * 1992-01-30 1995-08-29 Apple Computer, Inc. Architecture for transferring pixel streams, without control information, in a plurality of formats utilizing addressable source and destination channels associated with the source and destination components
US5357606A (en) * 1992-02-25 1994-10-18 Apple Computer, Inc. Row interleaved frame buffer
US5481307A (en) * 1992-04-01 1996-01-02 Intel Corporation Method and apparatus for compressing and decompressing a sequence of digital video images using sync frames
US5384745A (en) * 1992-04-27 1995-01-24 Mitsubishi Denki Kabushiki Kaisha Synchronous semiconductor memory device
US5369405A (en) * 1992-05-19 1994-11-29 Goldstar Co., Ltd. Coefficient generation apparatus for variable length decoder
EP0572262A2 (en) 1992-05-28 1993-12-01 C-Cube Microsystems, Inc. Decoder for compressed video signals
EP0572263A3 (en) 1992-05-28 1994-09-14 C Cube Microsystems Variable length code decoder for video decompression operations
US5450599A (en) * 1992-06-04 1995-09-12 International Business Machines Corporation Sequential pipelined processing for the compression and decompression of image data
US5289577A (en) * 1992-06-04 1994-02-22 International Business Machines Incorporated Process-pipeline architecture for image/video processing
US5276681A (en) * 1992-06-25 1994-01-04 Starlight Networks Process for fair and prioritized access to limited output buffers in a multi-port switch
GB2268036A (en) 1992-06-25 1994-01-05 John Gough Dutch hoe riddle.
EP0576749B1 (en) 1992-06-30 1999-06-02 Discovision Associates Data pipeline system
US5287182A (en) * 1992-07-02 1994-02-15 At&T Bell Laboratories Timing recovery for variable bit-rate video on asynchronous transfer mode (ATM) networks
US5351047A (en) * 1992-09-21 1994-09-27 Laboratory Automation, Inc. Data decoding method and apparatus
US5384598A (en) * 1992-10-20 1995-01-24 International Business Machines Corporation System and method for frame differencing video compression and decompression with frame rate scalability
US5300949A (en) * 1992-10-22 1994-04-05 International Business Machines Corporation Scalable digital video decompressor
US5420801A (en) * 1992-11-13 1995-05-30 International Business Machines Corporation System and method for synchronization of multimedia streams
US5502573A (en) * 1992-12-18 1996-03-26 Sony Corporation Apparatus for reproducing and decoding multiplexed data from a record medium with means for controlling data decoding as a function of synchronization errors
US5396497A (en) * 1993-02-26 1995-03-07 Sony Corporation Synchronization of audio/video information
US5426606A (en) * 1993-04-02 1995-06-20 Nec Corporation Semiconductor memory device synchronous with external clock signal for outputting data bits through a small number of data lines
US5572691A (en) * 1993-04-21 1996-11-05 Gi Corporation Apparatus and method for providing multiple data streams from stored data using dual memory buffers
US5467137A (en) * 1993-05-13 1995-11-14 Rca Thomson Licensing Corporation Method and apparatus for synchronizing a receiver as for a compressed video signal using differential time code
EP0624983B1 (en) 1993-05-13 1999-11-03 RCA Thomson Licensing Corporation Synchronization arrangement for a compressed video signal
US5553005A (en) * 1993-05-19 1996-09-03 Alcatel N.V. Video server memory management method
US5579052A (en) * 1993-05-27 1996-11-26 Sgs-Thomson Microelectronics S.A. Picture processing system
US5452006A (en) * 1993-10-25 1995-09-19 Lsi Logic Corporation Two-part synchronization scheme for digital video decoders
US5502494A (en) * 1993-10-25 1996-03-26 Lsi Logic Corporation Management of channel buffer in video decoders
US5448568A (en) * 1994-04-28 1995-09-05 Thomson Consumer Electronics, Inc. System of transmitting an interactive TV signal
US5495291A (en) * 1994-07-22 1996-02-27 Hewlett-Packard Company Decompression system for compressed video data for providing uninterrupted decompressed video data output

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
Chong, Y.M.: "A Data-Flow Architecture for Digital Image Processing," Wescon '84 Conference Record, Anaheim, CA, USA, Oct. 30, 1984-Nov. 1, 1984, pp. 4.6.1-4.6.10.
Chong, Y.M.: A Data Flow Architecture for Digital Image Processing, Wescon 84 Conference Record, Anaheim, CA, USA, Oct. 30, 1984 Nov. 1, 1984, pp. 4.6.1 4.6.10. *
Kinuhata, K. and Hideo Yamamoto. "Analysis of Field Correspondence and Field Memory Capacity in TV Standard Conversion." Electronics and Communications in Japan, Oct. 1974 USA vol. 57 No. 10 pp. 56-63 XP002047538.
Kinuhata, K. and Hideo Yamamoto. Analysis of Field Correspondence and Field Memory Capacity in TV Standard Conversion. Electronics and Communications in Japan, Oct. 1974 USA vol. 57 No. 10 pp. 56 63 XP002047538. *
Yamamoto, Hideo and K. Kinuhata. "Analysis of Field Correspondence and Field Memory Capacity in TV Standard Conversion." Abstracts--Transactions of the Institute of Electronics and Communications Engineers of Japan, vol. 57 No. 10 Oct. 1974 pp. 14-15 XP002047539.
Yamamoto, Hideo and K. Kinuhata. Analysis of Field Correspondence and Field Memory Capacity in TV Standard Conversion. Abstracts Transactions of the Institute of Electronics and Communications Engineers of Japan, vol. 57 No. 10 Oct. 1974 pp. 14 15 XP002047539. *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020085000A1 (en) * 2000-12-18 2002-07-04 Alan Sullivan Rasterization of three dimensional images
US7256791B2 (en) 2000-12-18 2007-08-14 Lightspace Technologies, Inc. Rasterization of three dimensional images
US20090214175A1 (en) * 2003-07-03 2009-08-27 Mccrossan Joseph Recording medium, reproduction apparatus, recording method, integrated circuit, program, and reproduction method
US20090220211A1 (en) * 2003-07-03 2009-09-03 Mccrossan Joseph Recording medium, reproduction apparatus, recording method, integrated circuit, program, and reproduction method
US8280230B2 (en) 2003-07-03 2012-10-02 Panasonic Corporation Recording medium, reproduction apparatus, recording method, integrated circuit, program and reproduction method
US8369690B2 (en) 2003-07-03 2013-02-05 Panasonic Corporation Recording medium, reproduction apparatus, recording method, integrated circuit, program, and reproduction method
US8682146B2 (en) 2003-07-03 2014-03-25 Panasonic Corporation Recording medium, reproduction apparatus, recording method, integrated circuit, program, and reproduction method
US20070190686A1 (en) * 2006-02-13 2007-08-16 Advanced Semiconductor Engineering, Inc. Method of fabricating substrate with embedded component therein

Similar Documents

Publication Publication Date Title
CA2145361C (en) Buffer manager
US5689313A (en) Buffer management in an image formatter
US6097401A (en) Integrated graphics processor having a block transfer engine for automatic graphic operations in a graphics system
US6271866B1 (en) Dual port memory system for buffering asynchronous input to a raster scanned display
US6523100B2 (en) Multiple mode memory module
US4884069A (en) Video apparatus employing VRAMs
US5339442A (en) Improved system of resolving conflicting data processing memory access requests
JPH04165866A (en) Buffer memory circuit
EP0895167A2 (en) Method and apparatus for interfacing with ram
US5861894A (en) Buffer manager
US5943504A (en) System for transferring pixel data from a digitizer to a host memory using scatter/gather DMA
JPH1091136A (en) Electronic computer
US6034674A (en) Buffer manager
US6247104B1 (en) Memory access control circuit
US4603383A (en) Apparatus for direct data transfer among central processing units
US5657055A (en) Method and apparatus for reading ahead display data into a display FIFO of a graphics controller
US5371518A (en) Video timing and display ID generator
US6417859B1 (en) Method and apparatus for displaying video data
US4807028A (en) Decoding device capable of producing a decoded video signal with a reduced delay
US20060245265A1 (en) Memory control system
US5229758A (en) Display device controller and method
US6020900A (en) Video capture method
EP4270197A1 (en) Data processing system having a memory controller with inline error correction code (ecc) support
EP0613087A1 (en) Apparatus and method for achieving high-speed data read access to memory
US5778196A (en) Method and device for identifying a bus memory region

Legal Events

Date Code Title Description
STCF Information on status: patent grant

Free format text: PATENTED CASE

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 4

FEPP Fee payment procedure

Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 8

REMI Maintenance fee reminder mailed
AS Assignment

Owner name: DISCOVISION ASSOCIATES, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:FINCH, HELEN ROSEMARY;REEL/FRAME:021081/0448

Effective date: 19981015

AS Assignment

Owner name: COASES INVESTMENTS BROS. L.L.C., DELAWARE

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:DISCOVISION ASSOCIATES;REEL/FRAME:022804/0021

Effective date: 20080402

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 12