Systems and methods for updating a frame buffer based on...

Computer graphics processing and selective visual display system – Computer graphics display memory system – Frame buffer

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C345S556000, C345S530000

Reexamination Certificate

active

07746351

ABSTRACT:
A method for dividing a display into zones at system initialization for tracking which zones have any pixels revised so that, when the time comes to update the display, only the zones requiring revision (that is, those zones in which any pixel has been revised) are copied from shadow memory to the frame buffer for display on the display device. The memory for tracking these zones can be allocated at initialization and held since it is relatively small. Consequently, a significant performance gain may be achieved by avoiding the shortcomings of the existing methods in the art notwithstanding the fact that some “clean” pixels in each zone having even a single changed pixel are also rewritten to the frame buffer.

REFERENCES:
patent: 4814756 (1989-03-01), Chauvel
patent: 4831368 (1989-05-01), Masimo et al.
patent: 5224210 (1993-06-01), Pinedo et al.
patent: 5561780 (1996-10-01), Glew et al.
patent: 5613103 (1997-03-01), Nobutani et al.
patent: 5630075 (1997-05-01), Joshi et al.
patent: 5670984 (1997-09-01), Robertson et al.
patent: 5772297 (1998-06-01), Loo et al.
patent: 5844569 (1998-12-01), Eisler et al.
patent: 5877779 (1999-03-01), Goldberg et al.
patent: 5986672 (1999-11-01), Groezinger et al.
patent: 6016151 (2000-01-01), Lin
patent: 6072507 (2000-06-01), Balatsos et al.
patent: 6188385 (2001-02-01), Hill et al.
patent: 6252612 (2001-06-01), Jeddeloh
patent: 6278434 (2001-08-01), Hill et al.
patent: 6339426 (2002-01-01), Lui et al.
patent: 6342890 (2002-01-01), Shetter
patent: 6356270 (2002-03-01), Pentkovski et al.
patent: 6356278 (2002-03-01), Stamm et al.
patent: 6384839 (2002-05-01), Paul
patent: 6392655 (2002-05-01), Migdal et al.
patent: 6560657 (2003-05-01), Gandhi et al.
patent: 6633685 (2003-10-01), Kusama et al.
patent: 6675239 (2004-01-01), Van Hook et al.
patent: 6734873 (2004-05-01), Herf et al.
patent: 6958757 (2005-10-01), Karlov
patent: 7027056 (2006-04-01), Koselj et al.
patent: 7116339 (2006-10-01), Wada
patent: 7145566 (2006-12-01), Karlov
patent: 7298782 (2007-11-01), Kuriakin et al.
patent: 7307634 (2007-12-01), Karlov
patent: 7376286 (2008-05-01), Locker et al.
patent: 2002/0196256 (2002-12-01), Hoppe et al.
patent: 2004/0199798 (2004-10-01), Whelan et al.
patent: 2005/0012751 (2005-01-01), Karlov
patent: 2005/0012753 (2005-01-01), Karlov
“VRAM”, http://www.webopedia.com/TERM/V/BRAM.html, Apr. 6, 2001.
“Static Allocation”, http://www.memorymanagement.org/glossarys/.html, Dec. 4, 2001.
United States Patent and Trademark Office: Non-Final Office Action dated Dec. 7, 2005, U.S. Appl. No. 10/622,749 filed Jul. 18, 2003.
United States Patent and Trademark Office: Final Office Action dated Apr. 20, 2006, U.S. Appl. No. 10/622,749 filed Jul. 18, 2003.
United States Patent and Trademark Office: Notice of Allowance dated Sep. 6, 2006, U.S. Appl. No. 10/622,749 filed Jul. 18, 2003.
United States Patent and Trademark Office: Non-Final Office Action dated Feb. 7, 2005, U.S. Appl. No. 10/622,597 filed Jul. 18, 2003.
United States Patent and Trademark Office: Final Office Action dated Aug. 11, 2005, U.S. Appl. No. 10/622,597 filed Jul. 18, 2003.
United States Patent and Trademark Office: Non-Final Office Action dated Jan. 11, 2006, U.S. Appl. No. 10/622,597 filed Jul. 18, 2003.
United States Patent and Trademark Office: Final Office Action dated May 3, 2006, U.S. Appl. No. 10/622,597 filed Jul. 18, 2003.
United States Patent and Trademark Office: Non-Final Office Action dated Nov. 22, 2006, U.S. Appl. No. 10/622,597 filed Jul. 18, 2003.
United States Patent and Trademark Office: Final Office Action dated Mar. 23, 2007, U.S. Appl. No. 10/622,597 filed Jul. 18, 2003.
United States Patent and Trademark Office: Non-Final Office Action dated Jun. 7, 2005, U.S. Appl. No. 10/778,724 filed Feb. 13, 2004.
United States Patent and Trademark Office: Non-Final Office Action dated Oct. 13, 2005, U.S. Appl. No. 10/778,724 filed Feb. 13, 2004.
United States Patent and Trademark Office: Non-Final Office Action dated Apr. 5, 2006, U.S. Appl. No. 10/778,724 filed Feb. 13, 2004.
United States Patent and Trademark Office: Final Office Action dated Aug. 24, 2006, U.S. Appl. No. 10/778,724 filed Feb. 13, 2004.
United States Patent and Trademark Office: Non-Final Office Action dated Nov. 29, 2006, U.S. Appl. No. 10/778,724 filed Feb. 13, 2004.
United States Patent and Trademark Office: Notice of Allowance dated Apr. 27, 2005, U.S. Appl. No. 10/623,220 filed Jul. 18, 2003.
United States Patent and Trademark Office: Non-Final Office Action dated Oct. 6, 2006, U.S. Appl. No. 11/189,609 filed Jul. 26, 2005.
United States Patent and Trademark Office: Non-Final Office Action dated Mar. 20, 2007, U.S. Appl. No. 11/189,609 filed Jul. 26, 2005.
United States Patent and Trademark Office: Notice of Allowance dated Aug. 23, 2007, U.S. Appl. No. 11/189,609 filed Jul. 26, 2005.
Johnson, S.P., “Direct3D Revealed: Microsoft's 3-D API provides device-independent access to acceleration hardware. Here's how it works,” Core Technologies, http://byte.com/art9612/sec5/art4.thm, Dec. 1996, 5 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Systems and methods for updating a frame buffer based on... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Systems and methods for updating a frame buffer based on..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods for updating a frame buffer based on... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4167148

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.