Shuffling segments in a data stream for transmission for an optimized response time of a receiver

摘要

Data pages (305,310,315,320,325,330,335) of an interactive program guide (IPG) for television are transmitted according to a shuffle function which allows different television receivers to retrieve particular segments of the data pages based on the day and time of program listings which a viewer wishes to see. A page of data, which corresponds to a full-screen image, is divided into segments and retrieved by the receivers over time. The segments are shuffled to provide an optimal separation in the data stream. The optimal separation corresponds to the receiver's input buffer size and processing speed. The pages may be arranged sequentially, or with the even-numbered pages separated from the odd-numbered pages. The pages are partitioned into a number of subsets, and, within the pages of each subset, the segments are shuffled according to a perfect shuffle function such that respective adjacent segment pairs are arranged in an order which maximizes a minimum of their inter-segment distance after shuffling. The minimum inter-segment distance of all the subsets is used to determine a characteristic inter-segment arrival time, which must be large enough to correspond to the receiver's processing capability. The required input buffer size and processing speed of the receivers is reduced, yet data page acquisition speed is increased for all viewers.