Hughes Electronics Corporation

The Directv Group, Inc.

Robert Jeff Heath

John Leonard Border

Robert James Torres

Stephanie Demers

Matthew Mario Butehorn

Sreenivas Ramaswamy

A method, system and computer program product for encoding and decoding data over a communications channel, including receiving input data to be encoded; generating compressed codes from the input data using a Lempel-Ziv-Jeff-Heath (LZJH) data compression algorithm; and applying a minimum redundancy coding algorithm on the compressed codes to generate compressed data.

Method, system and computer program product for LZJH data compression with minimum redundancy coding

An approach for allocating bandwidth in a satellite communication system is disclosed. The system includes a set of global queues that store bandwidth requests, which are received from a number of satellite terminals. The received bandwidth request include a high priority rate request, a low priority rate request, a high priority volume request, and a low priority volume request. A bandwidth control processor determines bandwidth request type and priority of the received bandwidth requests and places the bandwidth requests in the appropriate global queues based upon the determined bandwidth request type and priority. Each of the global queues corresponds to a data rate associated with of each a plurality of channels. The system also utilizes a set of local queues that correspond to the channels. The BCP moves the bandwidth requests from the global queues to the local queues. The BCP then allocates the transmission slots in response to the bandwidth requests stored in the local queues.

Method and system for providing satellite bandwidth on demand using multi-level queuing

A method of transmitting time division multiplexed data from a satellite terminal to a satellite wherein the satellite terminal receives a command indicating to transmit data during a frame comprising a plurality of timeslots in accordance with a timeslot reordering scheme. The timeslot reordering scheme is selected to spread data from respective satellite terminals to different timeslots throughout the frames. A processor monitors the use of channels by the satellite terminals, stores bandwidth requests using queues, allocates channels in accordance with bandwidth requests and a bandwidth allocation algorithm, and transmits the channel allocations in a frame. Timeslots not allocated to any of the satellite terminals are contention channels. The number of contention channels changes dynamically, depending on demand for the plurality of channels by the satellite terminals. Queues are provided for each channel for storing high and low priority rate requests and high and low priority volume requests. The bandwidth allocation algorithm determines the preemption of the queues, and allocation priorities.

System for providing satellite bandwidth on demand employing uplink frame formatting for smoothing and mitigating jitter and dynamically changing numbers of contention and data channels

A method, apparatus and computer program product for encoding data transmitted over a communications channel, including pre-loading an encoder dictionary with a set of character strings expected to appear in input data to be encoded; and encoding the input data with the set of expected character strings pre-loaded in the encoder dictionary. In another aspect, there is provided a method, apparatus and computer program product for decoding encoded data received over a communications channel, including pre-loading a decoder dictionary with a set of character strings expected to appear in the encoded data; and decoding the encoded data with the set of expected character strings pre-loaded in the decoder dictionary.

Method and system for data compession with dictionary pre-load of a set of expected character strings

A method, and apparatus for accomplishing the method, of compressing data for transmission over a communications channel by receiving one or more data symbols comprising a current data string and at least one subsequent symbol, matching a longest previous data string with the current data string, the previous data string being defined by a code word, placing the code word into a compressed data stream, attempting to extend the current data string by a plurality of symbols, placing, in the event the current data string is extended, a string-extension length indicative of the plurality of symbols into the compressed data stream, and transmitting the compressed data stream though the communications channel.

Data compression for use with a communications channel

A method, and apparatus for accomplishing the method, of compressing data for transmission over a communications channel involves receiving one or more data symbols comprising a current data string and at least one subsequent symbol; matching a longest previous data string with the current data string, the longest previous data string being defined by a code word; placing the code word into a compressed data stream; and extending the current data string by a plurality of symbols. Additional steps include: placing, in the event the current data string is the second occurrence of a two symbol string, a length field indicative of the plurality of symbols into the compressed data stream; placing, in the event the current data string is not the second occurrence of the two symbol string, a multi-symbol extension string signaling code word indicative of the plurality symbols into the compressed data stream; and transmitting the compressed data stream through the communications channel.

A method of compressing data involves receiving a symbol, and a subsequent symbol; determining in a compression dictionary whether the symbol has a valid extension pointer; using, in the event the symbol does have a valid extension pointer, the valid extension pointer to access string extension symbols; determining, in the event the symbol does have a valid extension pointer, whether the string extension symbols equal the at least one subsequent symbol; determining in the compression dictionary, in the event the string extension symbols do not equal the at least one subsequent symbol, whether the symbol has a valid parallel extension; repeating, in the event the symbol has a valid parallel extension, the using step; repeating, in the event the string extension symbols do not equal the at least one subsequent symbol, the determining of whether the symbol has a valid extension pointer; inserting, in the event the symbol does not have a valid extension pointer or in the event the symbol does not have a valid parallel extension, a code word indicative of a longest string found into a compressed data stream; determining whether the longest string was a single symbol; extending, in the event the longest string was a single symbol, the longest string by one symbol; extending, in the event the longest string was not a single symbol, the longest string by a plurality of symbols; inserting a string extension signalling code word if the string is extended by multiple symbols and transmitting the compressed data stream through the communications channel.

Growing community of inventors

San Diego, CA, United States of America

Robert Jeff Heath