This relates to video compression.
A video compression system and algorithm are disclosed herein that use a compression scheme based on the directional algorithm concepts previously disclosed in application Ser. No. 10/260,534 (“DVC encoding”) and the delta encoding concepts previously disclosed in application Ser. No. 11/790,994 with some newly added enhancements to compress frames of video. Its specific application here is to reduce the bandwidth used in transmitting a video frame across a LAN, for example an Ethernet LAN. The so-called “DVC encoding,” and “DVC delta encoding” are employed herein with some modifications including newly added extensions as described below. The contents of U.S. application Ser. No. 10/260,534 and U.S. application Ser. No. 11/790,994 are assumed to be known to the reader. Products employing the “DVC encoding” described in U.S. application Ser. No. 10/260,534 have been commercialized and should be considered prior art.
In the “DVC encoding” and the “DVC delta encoding” algorithms each side of the link has a version of the previous frame to use as a reference. This allows each pixel in subsequent frames to be defined in one of the following several ways:
Only the make pixel option requires that a complete RGB bit-encoded pixel be sent across the link. The first three commands listed above (“directional commands”) require that only a short command message be sent indicating which type of encoding is used and how many consecutive pixels are encoded according to that encoding type. During encoding, the pixel data for a current pixel to be compressed is compared to reference pixel values read from memory. A full frame of pixel data is kept for doing a NO-CHANGE comparison, a full line of pixel data is kept for doing a COPY_ABOVE comparison, and a single copy of the previous pixel is kept for doing the COPY_LEFT comparison. For each of the three directional commands, if the command is active and the associated comparison matches, then the command remains active and the prospective set increases by one more pixel. When all directional commands have terminated, due to either failure, inapplicability, or end conditions, then the last active command is chosen as the encoding for that set of pixels.
In the event of a tie between command types, then priority can be assigned in the following example order: NO_CHANGE, COPY_LEFT, COPY_ABOVE. Under some circumstances, this is the order that provides the greatest ease of decoding. However, other orders can be used. With double or triple buffering on each end, all three commands require similar effort by the decoder and thus alternative priorities are equally viable.
The MAKE_SERIES encoding type takes advantage of a sequence of pixels all being from a subset of immediately preceding unique pixel colors. The standard mode is to use a two-color subset, which is ideal for text windows. In standard mode, there is a single data bit for each pixel represented that specifies whether that pixel is the first or the second of two different colors. The two colors are defined automatically as the two most recent and different colors seen. A subset register stores the pixel color of each preceding unique pixel color. A current pixel is then compared against each of the pixels. in the current series subset registers. All of the comparisons are done in parallel, with the Boolean result sent to a command process. As long as any one (and it should be no more than one) of the subset comparators is true, then the series command is valid and continues.
Because NEW_PIXEL is the least efficient compression method, it is least favored and used only when the other compression types do not apply to a current pixel. Thus, a NEW_PIXEL determination always terminates a pixel encoding stream and sends the preceding command string for transmission and decoding. Then, NEW_PIXEL commands are accomplished on a pixel-by-pixel basis until another encoding type will again apply to a current pixel.
These first five command types listed above are, in general, referred to as the DVC-based commands which are described in greater detail in U.S. application Ser. No. 10/260,534.
Delta commands are another alternative to sending the full precision color. Delta commands send a much smaller value which is the difference (delta) between the real color and one of the neighboring colors used as a reference. The delta commands attempt to limit the number of bits transmitted when the directional commands fail or are no longer applicable and a pixel has to be sent. The delta commands are based on the assumption that the pixel to be encoded may be close in color to one of its neighbors. For example, in the case of 24-bit color, the delta can be either 4 bits or 12 bits. There are several different types of delta commands that could be implemented. Some types of delta commands include a unique delta value for each color channel, while others contain a uniform delta that is applied to all color channels. The size (in terms of bits) of each delta can also vary according to the configuration. Delta commands typically use the same reference pixels as the directional commands.
The last three command types listed above are, in general, referred to as the DVC-Delta commands which are described in greater detail in application Ser. No. 11/790,994.
The NEW_PIXEL command is shown in
In addition to color mode, application Ser. No. 11/790,994 discloses changing comparison depth. Comparison depth specifies how many bits of two pixel value are compared to each other. Changing comparison depth involves masking the least significant bits of a current pixel and a reference pixel to increase the likelihood that the pixels appear to be equal. In application Ser. No. 11/790,994 the user can set the comparison depth explicitly by specifying the comparison depth per channel or implicitly by setting a bandwidth threshold. When a bandwidth threshold is set the comparison depth changes dynamically to meet the defined bandwidth constraint. When comparison depth is reduced, pixels copied using a reduced comparison depth may have a slightly different color than their actual color value. Further, when comparison depth is reduced, the NEW_PIXEL command still requires all the bits of a pixel value to be sent.
The video compression unit described herein adds the following additional commands to the eight commands described above:
The video compression unit described herein is able to add the new commands within an eight-bit packet structure by using a variable length opcode portion and by eliminating the extension bit.
The video compression engine described herein also allows the user to set the comparison depth as a function of video frames. This is referred to as reference-intermediate mode. Reference-intermediate mode includes two types of frames, a reference frame. (R-frame) and an intermediate frame (I-frame). An R-frame is a frame with a relatively high comparison depth (e.g. 24-bits of comparison depth). An I-frame is a frame with a comparison depth less than the R-frame (e.g. an I-frame has a comparison depth of 12 bits). The user sets the comparison depth for each type of frame and a ratio of R to I frames (e.g. 1 R-frame for every 3 I-frames). Once these values are set, the encoder will automatically vary the rMask accordingly.
The video compression engine described herein also adds a compression-rate limit function. When the compression rate falls below a certain level the video compression engine can do any combination of the following: (1) drop frames, (2) change color depth, and (3) adjust the comparison depth. Frame dropping decreases video latency by allowing a larger range of frames to be processed by the system in a given amount of time. A color depth drop and/or a comparison depth adjustment helps increase the compression rate until the compression rate returns to a minimum target level. Increasing the compression ratio reduces video latency by reducing the average number of bits needed to represent a frame, thereby allowing more frames to be transmitted across the system at given data rate (e.g. Mb/s). Hysteresis is used with the compression-rate limit function to minimize impacts to a user that would occur from rapidly switching compression parameters, as would be the case when the compression rate fluctuated about the minimum target level.
The following description, given with respect to the attached drawings, may be better understood with reference to the non-limiting examples set forth with the drawings which are as follows:
a: exemplary short make pixel command;
b: exemplary short make pixel command;
a: diagram illustrating frame dropping;
b: diagram illustrating reference-intermediate comparison depth; and
The exemplary embodiment of the video compression algorithm described herein is a 24-bit color video compression protocol. The video packets of the compression protocol are based on 8-bit cells.
Video compression engine 300 performs the encoding algorithm described herein. Video compression engine 300 is configured with specified compression parameters that are described in greater detail in accordance with the compression algorithm. Video compression engine 300 receives digital video from video source 500 and outputs video packets to network engine 200. Video source 500 is a device that outputs digital video by either generating digital video natively or by converting analog video from another device into digital video. In the exemplary embodiment, digital video represents each pixel with a 24-bit RGB value. In alternative embodiments pixels can be represented using another color space and/or a different number of bits.
Video decompression engine 600, receives the video packets generated by video compression engine 300 and outputs analog or digital video for display 800 by decoding the received packets. Video decompression engine 600 also monitors the compression rate and transmits the compression rate to video compression engine 300.
There are several types of header packets defined. The format of the header packet depends on the command encoded. For example, short delta commands have a 2-bit opcode in the header packet, whereas other delta and copy commands have a 4-bit opcode.
As shown in
As shown in
a and 10b show short make pixel commands which are unique to the present video compression algorithm. Short make pixel is a truncated version of the make pixel command. That is, some number of least significant bits are removed from the R, G, and B payloads. If, for example, a red value is seven bits (0111010, for example), then some number of least significant bits (for example three) are truncated (leaving in this example, a red value of 0111XXX). Short make pixel allows a reduced version of a pixel to be transmitted to the video decompression unit 600 using less packets than the make pixel command. In this example, a short make pixel command provides a data-reduced (and thus an information lossy) version of a pixel color value for one frame only—whereupon the lost information is again recovered in the next subsequent frame, as described in greater detail below. When a short make pixel command is received at video decompression unit 600, video decompression unit 600 fills in the missing least significant bits with arbitrary values (in this example, the unit 600 may always fill red with “111” making the decoded red value: 0111111). Short make pixel is unique from previously described reduced color mode make pixel command (e.g. 15-bit make pixel), because short make pixel can coexist with make pixel commands. That is, color mode does not need to be changed for the video decompression unit to properly interpret a short make pixel command. Further, a short make pixel command can be generated after the full color data of the current pixel and a reference pixel have been compared.
Short make pixel is particularly useful with delta commands. In the case where the pixel value remains the same for the subsequent frame after the short make pixel command is used, the complete pixel value can be retrieved using a delta command. That is, if the video compression engine 300 knows the arbitrary values that the decoder will be using to fill in the missing least significant bits, then on the next frame, the encoder can identify a change/delta value from the value with the arbitrary LSBs rather than the true LSBs, thereby recovering the lost information at the video decompression engine 300 within one frame. When the video compression engine 300 creates a short make pixel command, the modified pixel data is written away to the video memory, before the next set of comparisons. Thus, pixel data that is lost for one frame can be retrieved in the subsequent frame. In most cases, depending on the frame rate and how many color bits are truncated, the user probably will not be able to perceive that a short make pixel command is somewhat lossy.
The short make pixel in
The short make pixel in
A current pixel is processed as it is received to see if it can be encoded in one of the compressed message types. The goal is to choose the compression type that can be applied to the longest string of consecutive pixels. Pixel processing continues, therefore, with types being continuously ruled out until either none remain or the end of a line is reached. A consecutive string can stop in any of the following circumstances: the type chosen is the last type to have failed, the maximum run length has been reached, or multiple commands failed at once.
The block header specifies the video mode, line number, frame number, and whether it is an end of frame or start of frame. The video decompression engine 300 uses this information on a block-by-block basis as it decodes. The videoMode[7:0] bus is 8 bits wide allowing for up to 256 different resolutions. Exemplary video modes are shown with respective codes in
The system can monitor the video latency across the system and adjust the compression parameters of the video compression engine 300 to maintain an acceptable latency. Video latency affects the user at the decoder end. For example, too much video latency can adversely affect the user's mouse performance. Frame number and line number are used to monitor the video latency across the system. After video latency is measured, video latency can be adjusted by adjusting the compression parameters.
Video decompression engine 600 generates an explicit acknowledgement for each memory block received. The acknowledgement contains the current frame number and line number received by the video decompression engine 600 for processing. The acknowledgement is sent across network 100 to video compression engine 300. Video compression engine 300 uses the acknowledgment to understand how many lines the video decompression engine 600 is behind, this is a measure of the latency of the video between the video compression engine 300 and the video decompression engine 600, and is a measure of the latency caused by each ends' network engine 200. Video compression engine 300 monitors the frame number and line number within the frame being processed by the video decompression engine 600 with respect to the current frame number and line number it is currently processing. If the number of lines between the frame number and line number at the video compression engine 300 and the frame number and line number at the video decompression engine 600 exceeds a configurable watermark, compression parameters are changes to effectively allow a larger span of video frames to be processed by the video decompression engine 600. It should be noted that exemplary video decompression engine 600 is typically passive and processes all video data sent to it. Thus, video decompression engine 600 typically does not have an independent mechanism for reducing video latency.
a and 18b illustrate two ways in which video compression engine 300 allows a larger span of frames to be processed by video decompression engine 600 in a shorter period of time.
a illustrates frame dropping by the video compression engine 300. As shown in
b illustrates another way video latency can be reduced.
In
When the latency difference between the line being processed by the video compression engine 300 and the line being processed by the video decompression engine 600 is greater than a configurable watermark then a frame will be dropped by video compression engine 300, effectively reducing the frame rate until the latency is below the defined watermark.
A user can also configure the color depth to be used by video compression engine 300 to manage the video experience and associated network bandwidth. Further, the management of bandwidth can be maximized by the use of reference and intermediate frames from the perspective of color depth, where user can specify a number of frames (intermediate frames) between core references frames that carry a specified lower color depth.
While the invention has been described in connection with what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention is not to be limited to the disclosed embodiment, but on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
The present application claims priority to U.S. Provisional Application Ser. No. 60/774,186, filed Feb. 17, 2006, U.S. Provisional Application Ser. No. 60/836,649, filed Aug. 10, 2006, Ser. No. 60/836,930, filed Aug. 11, 2006, and Ser. No. 60/848,488, filed Sep. 29, 2006 the entire contents of which are incorporated herein by reference. The present application is also related to the following co-pending U.S. Patent Applications that are herein incorporated by reference in their entirety: 1. U.S. application Ser. No. 11/707,863, entitled “Device and Method for Configuring a Target Device,” filed Feb. 20, 2007. 2. U.S. application Ser. No. 11/707,880, entitled “Power Cycling,” filed Feb. 20, 2007. The present application is also related to U.S. application Ser. No. 10/260,534 entitled “Video Compression System” filed on Oct. 1, 2002 and U.S. application Ser. No. 11/790,994, entitled “DVC Deltas Delta Commands” filed Apr. 30, 2007. The contents of each of the above identified applications are also incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
3710011 | Altemus et al. | Jan 1973 | A |
3935379 | Thornburg et al. | Jan 1976 | A |
4005411 | Morrin, II | Jan 1977 | A |
4134133 | Teramura et al. | Jan 1979 | A |
4142243 | Bishop et al. | Feb 1979 | A |
4369464 | Temime | Jan 1983 | A |
4667233 | Furukawa | May 1987 | A |
4855825 | Santamaki et al. | Aug 1989 | A |
4873515 | Dickson | Oct 1989 | A |
5046119 | Hoffert et al. | Sep 1991 | A |
5300949 | Rodriquez et al. | Apr 1994 | A |
5325126 | Keith | Jun 1994 | A |
5339164 | Lim | Aug 1994 | A |
5379071 | Parikh et al. | Jan 1995 | A |
5465118 | Hancock et al. | Nov 1995 | A |
5497434 | Wilson | Mar 1996 | A |
5519874 | Yamagishi et al. | May 1996 | A |
5526024 | Gaglianello et al. | Jun 1996 | A |
5572235 | Mical et al. | Nov 1996 | A |
5630036 | Sonohara et al. | May 1997 | A |
5664029 | Callahan et al. | Sep 1997 | A |
5757973 | Wilkinson | May 1998 | A |
5796864 | Callahan | Aug 1998 | A |
5805735 | Chen et al. | Sep 1998 | A |
5812169 | Tai et al. | Sep 1998 | A |
5828848 | MacCormack et al. | Oct 1998 | A |
5835791 | Goff et al. | Nov 1998 | A |
5864681 | Proctor et al. | Jan 1999 | A |
5867167 | Deering | Feb 1999 | A |
5898861 | Emerson et al. | Apr 1999 | A |
5937176 | Beasley et al. | Aug 1999 | A |
5946451 | Soker | Aug 1999 | A |
5968132 | Tokunaga et al. | Oct 1999 | A |
6008847 | Bauchspies | Dec 1999 | A |
6038346 | Ratnakar | Mar 2000 | A |
6040864 | Etoh | Mar 2000 | A |
6088395 | Wang et al. | Jul 2000 | A |
6094453 | Gosselin et al. | Jul 2000 | A |
6097368 | Zhu et al. | Aug 2000 | A |
6124811 | Acharya | Sep 2000 | A |
6154492 | Araki et al. | Nov 2000 | A |
6195391 | Hancock et al. | Feb 2001 | B1 |
6233226 | Gringeri | May 2001 | B1 |
6243496 | Wilkinson | Jun 2001 | B1 |
6304895 | Schneider et al. | Oct 2001 | B1 |
6327307 | Brailean et al. | Dec 2001 | B1 |
6360017 | Chiu et al. | Mar 2002 | B1 |
6373890 | Freeman | Apr 2002 | B1 |
6418479 | Houssein et al. | Jul 2002 | B1 |
6453120 | Takahashi | Sep 2002 | B1 |
6470050 | Ohtani et al. | Oct 2002 | B1 |
6496601 | Migdal et al. | Dec 2002 | B1 |
6512595 | Toda | Jan 2003 | B1 |
6539418 | Schneider et al. | Mar 2003 | B2 |
6542631 | Ishikawa | Apr 2003 | B1 |
6574364 | Economidis et al. | Jun 2003 | B1 |
6584155 | Takeda et al. | Jun 2003 | B2 |
6640145 | Hoffberg et al. | Oct 2003 | B2 |
6661838 | Koga et al. | Dec 2003 | B2 |
6664969 | Emerson et al. | Dec 2003 | B1 |
6701380 | Schneider et al. | Mar 2004 | B2 |
6754241 | Krishnamurthy et al. | Jun 2004 | B1 |
6829301 | Tinker et al. | Dec 2004 | B1 |
6871008 | Pintz et al. | Mar 2005 | B1 |
6898313 | Li et al. | May 2005 | B2 |
6940900 | Takamizawa | Sep 2005 | B2 |
6978335 | Lee | Dec 2005 | B2 |
7006700 | Gilgen | Feb 2006 | B2 |
7013255 | Smith, II | Mar 2006 | B1 |
7031385 | Inoue et al. | Apr 2006 | B1 |
7085319 | Prakash et al. | Aug 2006 | B2 |
7093008 | Agerholm et al. | Aug 2006 | B2 |
7143432 | Brooks et al. | Nov 2006 | B1 |
7222306 | Kaasila et al. | May 2007 | B2 |
7272180 | Dambrackas | Sep 2007 | B2 |
7321623 | Dambrackas | Jan 2008 | B2 |
7336839 | Gilgen | Feb 2008 | B2 |
7373008 | Clouthier et al. | May 2008 | B2 |
7457461 | Gilgen | Nov 2008 | B2 |
7515632 | Dambrackas | Apr 2009 | B2 |
7515633 | Dambrackas | Apr 2009 | B2 |
7542509 | Dambrackas | Jun 2009 | B2 |
7941634 | Georgi et al. | May 2011 | B2 |
20010043273 | Herrod et al. | Nov 2001 | A1 |
20030048643 | Lin et al. | Mar 2003 | A1 |
20030184960 | Ferguson | Oct 2003 | A1 |
20030202594 | Lainema | Oct 2003 | A1 |
20040062305 | Dambrackas | Apr 2004 | A1 |
20040064198 | Reynolds et al. | Apr 2004 | A1 |
20040122931 | Rowland et al. | Jun 2004 | A1 |
20040228526 | Lin et al. | Nov 2004 | A9 |
20040268012 | Ferguson | Dec 2004 | A1 |
20050025248 | Johnson et al. | Feb 2005 | A1 |
20050057777 | Doron | Mar 2005 | A1 |
20050069034 | Dambrackas | Mar 2005 | A1 |
20050089091 | Kim et al. | Apr 2005 | A1 |
20050108582 | Fung | May 2005 | A1 |
20050135480 | Li et al. | Jun 2005 | A1 |
20050198245 | Burgess et al. | Sep 2005 | A1 |
20050249207 | Zodnik | Nov 2005 | A1 |
20050286790 | Gilgen | Dec 2005 | A1 |
20060039404 | Rao et al. | Feb 2006 | A1 |
20060092271 | Banno et al. | May 2006 | A1 |
20060120460 | Gilgen | Jun 2006 | A1 |
20060126718 | Dambrackas et al. | Jun 2006 | A1 |
20060126720 | Dambrackas | Jun 2006 | A1 |
20060126721 | Dambrackas | Jun 2006 | A1 |
20060126722 | Dambrackas | Jun 2006 | A1 |
20060126723 | Dambrackas | Jun 2006 | A1 |
20060161635 | Lamkin et al. | Jul 2006 | A1 |
20060203460 | Aviv | Sep 2006 | A1 |
20060236347 | Holovacs | Oct 2006 | A1 |
20070018407 | Shoemaker | Jan 2007 | A1 |
20070019743 | Dambrackas | Jan 2007 | A1 |
20070036303 | Lee et al. | Feb 2007 | A1 |
20070165035 | Duluk et al. | Jul 2007 | A1 |
20070206497 | Plamondon et al. | Sep 2007 | A1 |
20070248159 | Dambrackas | Oct 2007 | A1 |
20070253492 | Shelton et al. | Nov 2007 | A1 |
20090290647 | Shelton et al. | Nov 2009 | A1 |
Number | Date | Country |
---|---|---|
0495490 | Jul 1992 | EP |
0899959 | Mar 1999 | EP |
64-077374 | Sep 1987 | JP |
63-108879 | May 1988 | JP |
01-162480 | Jun 1989 | JP |
01-303988 | Dec 1989 | JP |
H03-130767 | Apr 1991 | JP |
08-033000 | Feb 1996 | JP |
08-263262 | Oct 1996 | JP |
09-233467 | Sep 1997 | JP |
10-257485 | Sep 1998 | JP |
11-203457 | Jul 1999 | JP |
11-308465 | Nov 1999 | JP |
11-313213 | Nov 1999 | JP |
2001-169287 | Jun 2001 | JP |
2002-165105 | Jun 2002 | JP |
200423738 | Nov 2004 | TW |
WO 9826603 | Jun 1998 | WO |
WO 0011559 | Mar 2000 | WO |
WO 0108017 | Feb 2001 | WO |
WO 0115130 | Mar 2001 | WO |
WO 0184291 | Nov 2001 | WO |
WO 02062050 | Aug 2002 | WO |
WO 2006102613 | Sep 2006 | WO |
Entry |
---|
Chinese Appln. No. 03816346.2—Jun. 12, 2009 SIPO Office Action (Translation). |
CN Appln. No. 200710167085.2—Jun. 26, 2009 SIPO Office Action. |
EP Appln. No. 03818864.5—Aug. 24, 2009 EPO Office Action. |
EP Appln. No. 06758646.7—May 8, 2009 EPO Office Action. |
IL Appln. No. 171878—Apr. 28, 2009 Translation of Office Action. |
Matsui et al., “High-speed Transmission of Sequential Freeze-pictures by Exchanging Changed Areas”, IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ, vol. COM-29, No. 12, Dec. 1, 1981, XP002089584, ISSN: 0090-6778. |
Thyagarajan K. S. et al., “Image Sequence Coding Using Interframe VDPCM and Motion Compensation”, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing—proceedings 1989 Publ. By IEEE, vol. 3, 1989, pp. 1858-1861, XP010082957. |
U.S. Appl. No. 11/790,994—Jun. 2, 2009 PTO Office Action. |
U.S. Appl. No. 11/819,047—Aug. 26, 2009 PTO Office Action. |
U.S. Appl. No. 12/318,074—Sep. 14, 2009 PTO Office Action. |
U.S. Appl. No. 60/795,577, filed Apr. 28, 2006, Shelton, Gary. |
Chrysafis et al., “Line-Based, Reduced Memory, Wavelet Image Compression,” Mar. 2000 [retrieved on Aug. 20, 2008], Retrieved from the internet: <http://sipi.usc.edu/˜ortega/Students/chrysafi/doc/ChristosChrysafis—line—based—l—P2000.pdf>. |
International Preliminary Examination Report in PCT Application No. PCT/US2003/030650, mailed Aug. 25, 2006. |
International Search Report and Written Opinion mailed Sep. 4, 2008 in PCT/US07/10376. |
Office Action Issued Aug. 5, 2008 in Japanese Patent Application No. 2006-271932. |
Office Action Issued Jul. 11, 2006, in Japanese Patent Application No. 2006-024444. |
Office Action issued Jul. 31, 2007 in Japanese Patent Application No. 2006-024444 (with English translation). |
Office Action Issued Jul. 4, 2006, in Japanese Patent Application No. 2006-024442. |
Office Action Issued Jul. 4, 2006, in Japanese Patent Application No. 2006-024443. |
Office Action Issued Mar. 7, 2006, in Japanese Patent Application No. 2004-541433. |
Office Action Issued Mar. 7, 2006, in Japanese Patent Application No. 2006-024442. |
Office Action Issued Mar. 7, 2006, in Japanese Patent Application No. 2006-024443. |
Office Action Issued Mar. 7, 2006, in Japanese Patent Application No. 2006-024444. |
Official Action issued Dec. 9, 2008 in JP Appln. No. 2005-510478 [with English translation]. |
PCT International Search Report and Written Opinion mailed Jan. 3, 2006 in PCT/US05/17626, International filing date Jan. 3, 2006. |
PCT International Search Report and Written Opinion mailed Oct. 25, 2005 in PCT/US05/19256, International filing date Oct. 25, 2005. |
PCT International Search Report for PCT/US03/10488, mailed Jul. 28, 2003. |
PCT International Search Report in PCT Application No. PCT/US2003/030650 mailed Apr. 20, 2006. |
Search Report and Written Opinion mailed Aug. 26, 2008 in PCT Appln. No. PCT/US2006/021182. |
U.S. Appl. No. 11/339,537—May 13, 2009 PTO Office Action. |
U.S. Appl. No. 10/260,534, filed Oct. 1, 2002, Dambrackas. |
U.S. Appl. No. 10/434,339, filed May 9, 2003, Dambrackas. |
U.S. Appl. No. 10/629,855, filed Jul. 30, 2003, Johnson et al. |
U.S. Appl. No. 10/875,678, filed Jun. 25, 2004, Gilgen. |
U.S. Appl. No. 10/875,679, filed Jun. 25, 2004, Gilgen. |
U.S. Appl. No. 11/282,688, filed Nov. 21, 2005, Dambrackas et al. |
U.S. Appl. No. 11/339,537, filed Jan. 26, 2006, Dambrackas. |
U.S. Appl. No. 11/339,541, filed Jan. 26, 2006, Dambrackas. |
U.S. Appl. No. 11/339,542, filed Jan. 26, 2006, Dambrackas. |
U.S. Appl. No. 11/340,476, filed Jan. 27, 2006, Dambrackas. |
U.S. Appl. No. 11/528,569, filed Sep. 28, 2006, Dambrackas et al. |
U.S. Appl. No. 11/707,863, filed Feb. 20, 2007, Hickey et al. |
U.S. Appl. No. 11/707,880, filed Feb. 20, 2007, Hickey et al. |
U.S. Appl. No. 11/819,047, filed Jun. 25, 2007, Dambrackas. |
U.S. Appl. No. 11/889,268, filed Aug. 10, 2007, Hickey et al. |
U.S. Appl. No. 60/774,186, filed Feb. 17, 2006, Hickey. |
U.S. Appl. No. 60/836,649, filed Aug. 10, 2006, Hickey. |
U.S. Appl. No. 60/836,930, filed Aug. 11, 2006, Hickey. |
U.S. Appl. No. 60/848,488, filed Sep. 29, 2006, Hickey. |
“Avocent Install and Discovery Protocol Specification,” Version 1.3, Avocent Corporation Jul. 9, 2003 [30 pages]. |
“Avocent Secure Management Protocol Specification,” Version 1.8, Avocent Corporation Apr. 8, 2005 [64 pages]. |
McCloghrie, K., “Management Information Base for Network Management of TCP/IP-based internets: MIB II,” Network Working Group, Performance Systems International, Mar. 1991 [60 pages]. |
U.S. Appl. No. 11/707,879, filed Feb. 20, 2007, Hickey et al. |
CA Appln. No. 2,524,001—Nov. 30, 2009 CIPO Office Action. |
CA Appln. No. 2,524,001—Aug. 30, 2010 CIPO Office Action. |
CA Appin. No. 2,627,037—Sep. 9, 2010 CIPO Office Action. |
CN Appln. No. 200710167085.2—Aug. 6, 2010 SIPO Office Action. |
IL Appln. No. 167787—Jul. 21, 2009 Office Action. |
International Search Report and Written Opinion mailed Jul. 29, 2008 in PCT Application PCT/US07/17700. |
International Search Report and Written Opinion mailed Sep. 14, 2010 in PCT Appln. No. PCT/US2010/001941. |
JP Appln. No. 2005-510478—Jul. 7, 2009 Notice of Reasons for Rejection [English translation]. |
JP Appln. No. 2005-510478—Jul. 6, 2010 Decision of Rejection (English translation). |
JP Appln. No. 2006-271932—Oct. 6, 2009 Office Action with English summary. |
JP Appln. No. 2007-098267—Jul. 27, 2010 JPO Notice of Reasons for Rejection with translation. |
Search Report and Written Opinion mailed Jul. 16, 2008 in PCT Appln. No. PCT/US2007/17699. |
U.S. Appl. No. 11/282,688—Apr. 28, 2010 PTO Office Action. |
U.S. Appl. No. 11/790,994—Feb. 2, 2010 PTO Office Action. |
EP 07836655.6 Extended Search Report of Nov. 15, 2013. |
EP Appln. No. 07836654.9—Jan. 8, 2013 EPO Extended European Search Report. |
EP Appln. No. 07872608.0—Feb. 6, 2013 EPO Extended European Search Report. |
Search Report and Written Opinion mailed Apr. 24, 2008 in International Application No. PCT/US2007/017701. |
Search Report and Written Opinion mailed Jul. 14, 2008 in PCT Application No. PCT/US2007/017799. |
TW Appln. No. 96127270—Apr. 19, 2013 Patent Office Official Letter. |
U.S. Appl. No. 11/889,268—Nov. 17, 2009 PTO Office Action. |
U.S. Appl. No. 11/889,268—Aug. 20, 2010 PTO Office Action. |
U.S. Appl. No. 11/889,268—Sep. 15, 2010 PTO Office Action. |
U.S. Appl. No. 11/889,268—Apr. 6, 2011 PTO Office Action. |
U.S. Appl. No. 11/889,268—Feb. 1, 2012 PTO Office Action. |
U.S. Appl. No. 11/889,268—Aug. 21, 2012 PTO Office Action. |
U.S. Appl. No. 11/889,268—Apr. 2, 2013 PTO Office Action. |
Number | Date | Country | |
---|---|---|---|
20070274382 A1 | Nov 2007 | US |
Number | Date | Country | |
---|---|---|---|
60774186 | Feb 2006 | US | |
60836649 | Aug 2006 | US | |
60836930 | Aug 2006 | US | |
60848488 | Sep 2006 | US |