Patents by Inventor William C. Lynch
William C. Lynch has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20150245076Abstract: A system, method and computer program product having optimal matching to a known or measured probability distribution encodes data without the use of an excessively large lookup table. An encoder uses two or more different encoding methods in combination. In one embodiment, Huffman coding by table lookup is combined with computational generation, such as by using an exponential Golomb equation. The most commonly occurring elements are looked up in a small Huffman table, while the remaining elements are coded with the equation. In another embodiment, data is encoded using two or more equations. In yet another embodiment, data is encoded using multiple tables in conjunction with one or more equations.Type: ApplicationFiled: January 30, 2015Publication date: August 27, 2015Inventors: William C. Lynch, Krasimir D. Kolarov, Steven E. Saunders
-
Patent number: 8947271Abstract: A system, method and computer program product having optimal matching to a known or measured probability distribution encodes data without the use of an excessively large lookup table. An encoder constructed according to the present invention uses two or more different encoding methods in combination. In one embodiment, Huffman coding by table lookup is combined with computational generation, such as by using an exponential Golomb equation. The most commonly occurring elements are looked up in a small Huffman table, while the remaining elements are coded with the equation. In another embodiment, data is encoded using two or more equations. In yet another embodiment, data is encoded using multiple tables in conjunction with one or more equations.Type: GrantFiled: June 7, 2011Date of Patent: February 3, 2015Assignee: Soryn Technologies, LLCInventors: William C. Lynch, Krasimir D. Kolarov, Steven E. Saunders
-
Patent number: 8279098Abstract: A system, method and computer program product provide finer rate control in data compression by processing a data stream through a plurality of parallel subbands, wherein a first subband processes the data differently than a second subband. Separate shift quantization parameters for each separate run-of-zeros compressed storage area or pile can be provided, instead of a single common shift parameter for every coefficient as in the prior art. The parameter value for each such area or pile can be recorded in the compressed output file. The separate shift quantization parameters can also be adjusted dynamically as data is being compressed.Type: GrantFiled: April 10, 2009Date of Patent: October 2, 2012Assignee: Vivox, Inc.Inventors: Steven E. Saunders, William C. Lynch, Krasimir D. Kolarov
-
Publication number: 20120106621Abstract: A system and method are provided for compressing data. In use, luminescence data of a frame is updated at a first predetermined rate, while chrominance data of the frame is updated at a second predetermined rate that is less than the first predetermined rate. Moreover, pause information may be inserted with the compressed data, where the pause information may be used when the video data is paused during the playback thereof to increase the quality of a still frame.Type: ApplicationFiled: November 29, 2010Publication date: May 3, 2012Applicant: Droplet Technology, Inc.Inventors: Steven E. Saunders, Krasimir D. Kolarov, William C. Lynch
-
Patent number: 8116377Abstract: An entropy efficient video coder for wavelet pyramids approaches the entropy-limited coding rate of video wavelet pyramids, is fast in both hardware and software implementations, and has low complexity (no multiplies) for use in ASICs. It uses a modified Z-coder to code the zero/non-zero significance function and Huffman coding for the non-zero coefficients themselves. The encoding unit includes a significance function generator that receives coefficients and outputs a single significance bit. A zero coefficient eliminator receives coefficients in parallel with the significance function generator and outputs coefficients if non-zero. Output from the significance function generator is coded using the modified Z-coder. Output from the zero coefficient eliminator is coded using Huffman coding. Both outputs are combined to form the resulting compressed stream.Type: GrantFiled: November 6, 2009Date of Patent: February 14, 2012Assignee: Interval Licensing LLCInventors: William C. Lynch, Krasimir D. Kolarov, William J. Arrighi
-
Publication number: 20110307928Abstract: A system, method and computer program product provide finer rate control in data compression by processing a data stream through a plurality of parallel subbands, wherein a first subband processes the data differently than a second subband. Separate shift quantization parameters for each separate run-of-zeros compressed storage area or pile can be provided, instead of a single common shift parameter for every coefficient as in the prior art. The parameter value for each such area or pile can be recorded in the compressed output file. The separate shift quantization parameters can also be adjusted dynamically as data is being compressed.Type: ApplicationFiled: April 10, 2009Publication date: December 15, 2011Applicant: Droplet Technology, Inc.Inventors: Steven E. Saunders, William C. Lynch, Krasimir D. Kolarov
-
Publication number: 20110255609Abstract: A system, method, and computer program product are provided for temporal video compression. In use, portions of video are buffered in a first order. Further, the portions of video are at least partially temporally compressed in a second order. Another system, method, and computer program product are further provided for compressing video from a plurality of sources. In use, video is received from a plurality of sources. Such video from the sources is then compressed. Such compression is carried out using a plurality of rate controls. In various embodiments, the video may be received by way of a single video stream, and/or the compression may be carried by way of a single compression module.Type: ApplicationFiled: June 26, 2009Publication date: October 20, 2011Applicant: Droplet Technology, Inc.Inventors: William C. Lynch, Steven E. Saunders, Krasimir D. Kolarov
-
Publication number: 20110234431Abstract: A system, method and computer program product having optimal matching to a known or measured probability distribution encodes data without the use of an excessively large lookup table. An encoder constructed according to the present invention uses two or more different encoding methods in combination. In one embodiment, Huffman coding by table lookup is combined with computational generation, such as by using an exponential Golomb equation. The most commonly occurring elements are looked up in a small Huffman table, while the remaining elements are coded with the equation. In another embodiment, data is encoded using two or more equations. In yet another embodiment, data is encoded using multiple tables in conjunction with one or more equations.Type: ApplicationFiled: June 7, 2011Publication date: September 29, 2011Applicant: DROPLET TECHNOLOGY, INC.Inventors: William C. Lynch, Krasimir D. Kolarov, Steven E. Saunders
-
Publication number: 20110072251Abstract: A system, method and computer program product are provided for processing exceptions. Initially, computational operations are processed in a loop. Moreover, exceptions are identified and stored while processing the computational operations. Such exceptions are then processed separate from the loop.Type: ApplicationFiled: April 22, 2010Publication date: March 24, 2011Applicant: DROPLET TECHNOLOGY, INC.Inventors: William C. Lynch, Krasimir D. Kolarov, Steven E. Saunders
-
Patent number: 7844122Abstract: A system and method are provided for compressing data. In use, luminescence data of a frame is updated at a first predetermined rate, while chrominance data of the frame is updated at a second predetermined rate that is less than the first predetermined rate. Moreover, pause information may be inserted with the compressed data, where the pause information may be used when the video data is paused during the playback thereof to increase the quality of a still frame.Type: GrantFiled: May 28, 2003Date of Patent: November 30, 2010Assignee: Droplet Technology, Inc.Inventors: Steven E. Saunders, Krasimir D. Kolarov, William C. Lynch
-
Publication number: 20100128795Abstract: An entropy efficient video coder for wavelet pyramids approaches the entropy-limited coding rate of video wavelet pyramids, is fast in both hardware and software implementations, and has low complexity (no multiplies) for use in ASICs. It uses a modified Z-coder to code the zero/non-zero significance function and Huffman coding for the non-zero coefficients themselves. The encoding unit includes a significance function generator that receives coefficients and outputs a single significance bit. A zero coefficient eliminator receives coefficients in parallel with the significance function generator and outputs coefficients if non-zero. Output from the significance function generator is coded using the modified Z-coder. Output from the zero coefficient eliminator is coded using Huffman coding. Both outputs are combined to form the resulting compressed stream.Type: ApplicationFiled: November 6, 2009Publication date: May 27, 2010Inventors: William C. Lynch, Krasimir D. Kolarov, William J. Arrighi
-
Patent number: 7634008Abstract: An entropy efficient video coder for wavelet pyramids approaches the entropy-limited coding rate of video wavelet pyramids, is fast in both hardware and software implementations, and has low complexity (no multiplies) for use in ASICs. It uses a modified Z-coder to code the zero/non-zero significance function and Huffman coding for the non-zero coefficients themselves. The encoding unit includes a significance function generator that receives coefficients and outputs a single significance bit. A zero coefficient eliminator receives coefficients in parallel with the significance function generator and outputs coefficients if non-zero. Output from the significance function generator is coded using the modified Z-coder. Output from the zero coefficient eliminator is coded using Huffman coding. Both outputs are combined to form the resulting compressed stream.Type: GrantFiled: November 29, 2005Date of Patent: December 15, 2009Assignee: Vulcan Patents LLCInventors: William C. Lynch, Krasimir D. Kolarov, William J. Arrighi
-
Patent number: 7525463Abstract: A system, method and computer program product provide finer rate control in data compression by processing a data stream through a plurality of parallel subbands, wherein a first subband processes the data differently than a second subband. Separate shift quantization parameters for each separate run-of-zeros compressed storage area or pile can be provided, instead of a single common shift parameter for every coefficient as in the prior art. The parameter value for each such area or pile can be recorded in the compressed output file. The separate shift quantization parameters can also be adjusted dynamically as data is being compressed.Type: GrantFiled: September 20, 2005Date of Patent: April 28, 2009Assignee: Droplet Technology, Inc.Inventors: Steven E. Saunders, William C. Lynch, Krasimir D. Kolarov
-
Publication number: 20090080788Abstract: A system, method and computer program product having optimal matching to a known or measured probability distribution encodes data without the use of an excessively large lookup table. An encoder constructed according to the present invention uses two or more different encoding methods in combination. In one embodiment, Huffman coding by table lookup is combined with computational generation, such as by using an exponential Golomb equation. The most commonly occurring elements are looked up in a small Huffman table, while the remaining elements are coded with the equation. In another embodiment, data is encoded using two or more equations. In yet another embodiment, data is encoded using multiple tables in conjunction with one or more equations.Type: ApplicationFiled: September 19, 2008Publication date: March 26, 2009Applicant: Droplet Technology, Inc.Inventors: William C. Lynch, Krasimir D. Kolarov, Steven E. Saunders
-
Patent number: 7436329Abstract: A system, method and computer program product having optimal matching to a known or measured probability distribution encodes data without the use of an excessively large lookup table. An encoder constructed according to the present invention uses two or more different encoding methods in combination. In one embodiment, Huffman coding by table lookup is combined with computational generation, such as by using an exponential Golomb equation. The most commonly occurring elements are looked up in a small Huffman table, while the remaining elements are coded with the equation. In another embodiment, data is encoded using two or more equations. In yet another embodiment, data is encoded using multiple tables in conjunction with one or more equations.Type: GrantFiled: September 21, 2005Date of Patent: October 14, 2008Assignee: Droplet Technology, Inc.Inventors: William C. Lynch, Krasimir D. Kolarov, Steven E. Saunders
-
Patent number: 7130351Abstract: Decompressing compressed video information using relatively less temporary storage is disclosed. A compressed bit stream of video information including a compressed portion is received. A reverse combination in the transform domain is performed on the compressed portion to produce two corresponding portions of video information, where the two portions represent the compressed portion in a less compressed form. The two portions of video information are temporarily stored as a reverse combination is being performed. One of said two portions of video information is transformed, decoded, and decompressed to produce a decompressed portion of video information. The decompressed portion of video information is output.Type: GrantFiled: May 14, 1998Date of Patent: October 31, 2006Assignee: Vulcan Patents LLCInventors: William C. Lynch, Krasimir D. Kolarov, D. Robert Hoover, William J. Arrighi
-
Patent number: 7016416Abstract: Encoding/decoding a stream of bits is disclosed. An encoding unit uses a modified Z-coder to code the zero/non-zero significance function and Huffman coding for the non-zero coefficients themselves. The encoding unit includes a significance function generator that receives coefficients and outputs a single significance bit. A zero coefficient eliminator receives coefficients in parallel with the significance function generator and outputs coefficients if non-zero. Output from the significance function generator is coded using the modified Z-coder. Output from the zero coefficient eliminator is coded using Huffman coding. Both outputs are combined to form the resulting compressed stream. The modified Z-coder is similar to a standard Z-coder but uses a different technique for the LPS (least probable symbol) case during encoding and decoding that results in a Z-coder that functions appropriately.Type: GrantFiled: March 25, 2003Date of Patent: March 21, 2006Assignee: Vulcan Patents LLCInventors: William C. Lynch, Krasimir D. Kolarov, William J. Arrighi
-
Patent number: 6934609Abstract: Spacecraft network and communication method thereof. A spacecraft network includes a first server spacecraft disposed in a first server orbit, a first client spacecraft disposed in a first client orbit, and a wireless local area network formed between at least the first server spacecraft and the first client spacecraft. The wireless local area network includes at least one communication channel to transmit and receive spatial information, at least one receiver to receive a first communication signal including at least routing information, at least one routing system to determine a desired route, and one transmitter to transmit the first communication signal. The first client spacecraft is free from the at least one routing system, and the first server spacecraft includes one of the at least one routing system.Type: GrantFiled: July 10, 2003Date of Patent: August 23, 2005Assignee: Lockheed Martin CorporationInventors: Larry H. Capots, William C. Lynch
-
Patent number: 6847317Abstract: A coder and/or decoder system and method are provided including a variable modulus. As an option, the modulus may reflect a steepness of a probability distribution curve associated with a compression algorithm (i.e. a negative exponential of the probability distribution). Moreover, the modulus may depend on a context of a previous set of data, while avoiding increasing as a function of a run length (i.e. a plurality of identical bits in a sequence).Type: GrantFiled: May 28, 2003Date of Patent: January 25, 2005Assignee: Droplet Technology, Inc.Inventors: William C. Lynch, Krasimir D. Kolarov, Steven E. Saunders
-
Patent number: RE39503Abstract: A space-based server network architecture (1) which permits on demand transfer of mission and control data between client satellites (14) in an orbit about earth and an earth station (20, 22, 24, 26) irrespective of the location of the client satellite (14) relative to the earth station (20, 22, 24, 26). The architecture includes a plurality of server satellites (10) located spaced apart in a earth orbit above the orbit of the client satellites (14). The server satellites (10) provide substantially total world-wide communications coverage to and connectivity with designated and authorized earth stations (20, 22, 24, 26) and the plurality of client satellites (14).Type: GrantFiled: November 14, 2001Date of Patent: March 6, 2007Assignee: Lockheed Martin CorporationInventor: William C. Lynch