Data processing device and method for the same

• US 6,456,782 B1
• Filed: 08/26/1999
• Issued: 09/24/2002
• Est. Priority Date: 12/27/1997
• Status: Expired due to Fees

• Current Assignee: Sony Corporation (Sony Group Corp.)
• Original Assignee: Sony Corporation (Sony Group Corp.)
• Inventors: Kubota, Tatsuya, Matsumura, Youichi
• Primary Examiner(s): Tran, Thai
• Assistant Examiner(s): ONUAKU, CHRISTOPHER O
• Application Number:
  US09/367,959
• Time in Patent Office: 1,125 Days
• Field of Search: 386/20, 386/68, 386/33, 386/81-82, 386/84, 386/95, 386/98, 386/111-112, 348/423.1, 375/240.26, 375/240.28, 370/394, 370/389, 370/468, 370/473, 370/474, 370/516-517
• US Class Current: 386/211
• CPC Class Codes: H04N 21/23608 Remultiplexing multiplex streams, e.g. involving modifying time stamps or remapping the packet identifiers
• CPC Class Codes: H04N 21/2362 Generation or processing of Service Information [SI]

Abstract

Even the case where the transmission rate for packets is varied in forming a sequence of packets from the packets, time information previously added to each packet is corrected based on absolute time information added to each of the packets forming the sequence of packets, thereby making it possible to realize a data processing apparatus and method capable of significantly improving the transmission efficiency for packetized data.

Claims

1. A data processing apparatus for adding redundant data to supplied data every predetermined unit and packetizing them, and for outputting said data packetized in said predetermined unit as a sequence of packets, comprising:

data eliminating means for eliminating said redundant data from each of said packets;

time information adding means for adding a time stamp to each of said packets from which said redundant data is eliminated;

packet sequence forming means for forming said sequence of packets based on said packets sequentially supplied and then, for correcting, based on said time stamp previously added to each of said packets, a program clock reference previously added to said corresponding packet;

time information eliminating means for eliminating said tme stamp from each of said packets having said program clock reference corrected; and

data adding means for adding said redundant data to each of said packets from which said time stamp is eliminated.

2. The data processing apparatus according to claim 1, wherein:

said packet sequence forming means comprising

first count means for counting a system clock based on said each time stamp, and second count means for loading said count value of said first count means to count said system clock; and

when a count value of said second count means matches to the time based on said program clock reference previously added to said corresponding packet, said program clock reference is corrected.

3. The data processing apparatus according to claim 1, wherein said time stamp is formed by at least 3 [byte].

4. The data processing apparatus according to claim 1 wherein

said packet sequence forming means comprising

storage means for storing said packets sequentially supplied in the supplying order and reading means for reading said packets stored in said storage means, in the storing order.

5. The data processing apparatus according to claim 4, wherein:

said packet sequence forming means comprising

null packet generating means for generating a null packet for dummy formed in the same format as each of said packets stored in said storage means; and

said reading means, when said storage means storing said packets is empty, switches the connection to said null packet generating means from said storage means to have said null packet transmitted.

6. The data processing apparatus according to claim 4, wherein

in the case where other packets having program specific information different from each of said packets stored in said storage means,

said packet sequence forming means assigns, so as not to overlap with a program number assigned to each of said packets stored in said storage means, on the program association table, a program number different from the program number to each of said other packets.

7. A data processing method of adding redundant data to supplied data every predetermined unit and packetizing them, and of outputting said data packetized in said predetermined unit as a sequence of packets, comprising:

a first step of eliminating said redundant data from each of said packets;

a second step of adding a time stamp to each of said packets from which said redundant data is eliminated;

a third step of forming said sequence of packets based on said packets sequentially supplied and then, of correcting, based on said time stamp previously added to each of said packets, a program clock reference previously added to said corresponding packet;

a forth step of eliminating said time stamp from each of said packets having said program clock reference corrected; and

a fifth step of adding said redundant data to each of said packets from which said time stamp is eliminated.

8. The data processing method according to claim 7, wherein:

said third step wherein;

a system clock based on said each time stamp is counted with a first count means and then, the count value is loaded and said system clock is counted with a second count means; and

when said count value of said second count means matches to a time based on a program clock reference previously added to said corresponding packet, said program clock reference is corrected.

9. The data processing method according to claim 7, wherein said time stamp is formed by at least 3 [byte].

10. The data processing method according to claim 7, wherein

said third step stores said packets sequentially supplied in the supplying order and reads said packets stored in said storage means, in the storing order.

11. The data processing method according to claim 10, wherein:

said third step wherein;

a null packet for dummy formed in the same format as each of said packets stored is generated; and

when there is no stored packet, said null packet is transmitted.

12. The data processing method according to claim 10, wherein

in the case where other packets having program specific information different from each of said packets stored are plied,

said third step, so as not to overlap with a program number assigned to each of said packets stored, on the program association table, assigns a program number different from the ram number to each of said other packets.