Abstract: A method for providing ciphertext data by a first computing device having memory includes obtaining, from the memory, plaintext data having a structure; providing the plaintext data to a structure preserving encryption network (SPEN) to generate the ciphertext data, where the structure of the plaintext data corresponds to a structure of the ciphertext data; and communicating, from the first computing device to a second computing device, the ciphertext data to permit analysis on the ciphertext data.

Abstract: Modulus operation is performed by a system in an efficient manner taking into account the system's processor and memory architecture. Other features are also provided.

Abstract: Modulus operation is performed by a system in an efficient manner taking into account the system's processor and memory architecture. Other features are also provided.

Abstract: A method for providing ciphertext data by a first computing device having memory includes obtaining, from the memory, plaintext data having a structure; providing the plaintext data to a structure preserving encryption network (SPEN) to generate the ciphertext data, where the structure of the plaintext data corresponds to a structure of the ciphertext data; and communicating, from the first computing device to a second computing device, the ciphertext data to permit analysis on the ciphertext data.

Abstract: Apparatus having corresponding methods and tangible computer-readable media comprise: an input module to receive a bitstream representing data words encoded according to a variable-length code; a peek module to select a peek block comprising a predetermined number of consecutive bits in the bitstream; and a decoder to provide a plurality of the data words based on the peek block.

Abstract: Inverse transforms used in video and image compression/decompression, such as DCT/IDCT used in MPEG-2 and MPEG-4, or the integer transforms used in H.264, are usually calculated with fast algorithms, which only take advantage of the symmetry existing in the transform matrix but ignores the peculiarities in the input data. While these kind of fast algorithms can apply to both forward and inverse transforms, they tend to be inefficient in calculating inverse transforms. In inverse transforms, most of the coefficients become zero after quantization, this invention takes advantage of this fact to further simplify the general fast algorithm and speed up the calculation.

Abstract: Apparatus having corresponding methods and tangible computer-readable media comprise: an input module to receive a bitstream representing data words encoded according to a variable-length code; a peek module to select a peek block comprising a predetermined number of consecutive bits in the bitstream; and a decoder to provide a plurality of the data words based on the peek block.

Abstract: The present invention addresses the issue of jitter and clock drifting in streaming media applications. The present invention utilizes the Real Time Transaction Protocol (RTP) to embed MPEG packets within RTP packets in a Multiple Program Transport Stream (MPTS). Each MPEG packet in an MPTS stream is tagged at a gateway with: an arrival timestamp, a per-flow index and internal index to identify where the packet resides in an RTP packet and within a stream. After demultiplexing, this information is utilized in conjunction with the sending timestamp of each RTP packet to create a sending time for each MPEG packet to aid in the reduction of jitter and clock drifting.

Abstract: Inverse transforms used in video and image compression/decompression, such as DCT/IDCT used in MPEG-2 and MPEG-4, or the integer transforms used in H.264, are usually calculated with fast algorithms, which only take advantage of the symmetry existing in the transform matrix but ignores the peculiarities in the input data. While these kind of fast algorithms can apply to both forward and inverse transforms, they tend to be inefficient in calculating inverse transforms. In inverse transforms, most of the coefficients become zero after quantization, this invention takes advantage of this fact to further simplify the general fast algorithm and speed up the calculation.

Abstract: This invention describes methods for pre-computing neighboring locations for partitions in a video stream and for placing those pre-computed neighboring locations into a table for later retrieval and later use. The redundancy in the information of the pre-computed neighboring locations can be used to reduce the number entries in the table of neighboring locations, thus effectively reducing the amount of memory needed to store this table. Further, indexing schemes are used for non-MBAFF coded video streams and MBAFF coded video streams to further minimize memory usage.

Abstract: The present invention relates to methods for synchronizing the transmission and the reception of a media stream over a network, such as the Internet, comprising of a receiver clock having an adjustable reset value, where the adjustable reset value may be a function of the reference time for a receiver clock and the reference time for a sender clock.

Abstract: This invention relates to methods for the parallel deblocking of macroblocks of a compressed media frame, such as a frame from a compressed video stream, to smooth out artifacts and discontinuities caused by the compression of the media. These methods for parallel deblocking of a frame having a plurality of tiles wherein each tile having a data dependency on zero or more of said tiles, comprising the steps of: constructing a reference deblocking sequence for the processing of said tile as a function of the data dependency of each respective tile; calculating scheduling indices for said tiles as a function of said reference deblocking sequence; and deblocking said tiles in accordance with said scheduling indices.

Abstract: An encapsulation method and an apparatus for encapsulating compressed media packet into IP packets. The encapsulating method includes accepting a compressed media data stream that may include null packets. The method further includes identifying any null packets in the accepted stream and the null packets' relative position in the stream, encapsulating the non-null compressed media data packets into a set of IP packets; and adding information to each IP packet sufficient to reconstruct a reconstructed compressed media data stream from the set of IP packets. The reconstructed stream may include null packets that were not present in the set of IP packets. The encapsulating includes discarding at least some of the null packets in the case that the compressed media data stream contains null packets.

Abstract: The present invention addresses the issue of jitter compounded by clock drifting in streaming media applications. In addressing jitter, the present invention attempts to recover the desired (de-jittered) arrival time at a gateway even if there is a frequency difference between the clocks of the original media source and the gateway. The desired arrival time is used with the addition of a constant to schedule the packet delivery time for delivery to a user via a network. Each packet arriving at the gateway contains an arrival timestamp. Using packets, which also contain sending time stamps, the invention determines the delivery time for each packet.

Abstract: A method and system of configuring an array of data is disclosed. The method and system comprise generating an array of data an order and reconfiguring the array of data into a plurality sub arrays of data, the plurality of sub arrays of data being in a desired order. By utilizing the method and system in accordance with the present invention, a converted data array can be processed in a parallel fashion thereby increasing the overall processing speed of the computer system. The present invention has particular utility when converting data either from a bit reverse order to a natural order or from a natural order to a bit reverse order. In accordance with the present invention, the array of data is reconfigured utilizing a swap operation to allow for conversion of the data array from either a bit reverse order to a natural order or from a natural order to a bit reversed order.