Claims
- 1. A method of processing plural MPEG input data streams, the input streams each comprising a series of data packets and an associated PID, each data stream being transported to one or more target destinations, comprising:
generating a PID alias table which comprises plural PID aliases for each of the input data streams; removing at least one PID from each input data stream to thereby produce filtered data streams; determining a target destination for each of the filtered data streams; and buffering the filtered data streams such that the filtered data streams can be read and transported to respective determined target destinations.
- 2. The method of claim 1 wherein
the PID table covers the entire range of PIDs, there are 10 input data streams; and there are 12 filtered data streams.
- 3. The method of claim 1, wherein there are N filtered data streams and wherein populating a wagon wheel memory structure comprises:
providing a wagon wheel memory structure having 2N time slots to thereby accommodate corresponding write and read cycles for each of the N filtered data streams; and sequentially populating write-cycle time slots of the wagon wheel memory structure with respective ones of the N filtered data streams.
- 4. The method of claim 3, further comprising maintaining a pointer for each read-cycle time slot and for each write-cycle time slot of the memory structure.
- 5. The method of claim 4, further comprising: recovering the filtered data streams from the memory structure; and
serially transporting the recovered data streams from a first board to a second board at the master clock rate via the backplane.
- 6. The method of claim 5, wherein recovering the filtered data streams comprises reading the filtered data streams from respective read-cycle time slots of the memory structure such that N data streams are recovered from the memory structure.
- 7. A method of transporting MPEG input data streams comprising digital data packets to at least one of M target destinations, the method comprising:
receiving plural input streams of data packets, each of the input streams having an associated PID; providing the input streams to a round robin memory scheme having first and second memory modules; using the first memory modules to associate plural PID aliases with each of the input streams; using the second memory module to buffer the input data streams; reading the buffered data streams from the second memory module; and transmitting the data streams read from the second memory module to at least one of the M target destinations
- 8. The method of claim 6, wherein each of the input streams is provided at its own data rate, and wherein the method further comprises synchronizing the input streams to a common clock frequency.
- 9. The method of claim 8, wherein the common clock frequency is 27 MHz,
- 10. The method of claim 8, further comprising:
filtering at least one PID from the input data streams; and determining a target destination for each remaining PID, wherein the target destination may be any of five processors on any of eleven boards.
- 11. The method of claim 10, wherein:
recovering comprises reading the filtered data streams from respective read-cycle time slots of the memory structure such that N data streams are recovered from the memory structure; and transmitting comprises serially transporting the N recovered data streams to at least one of to M target destinations.
- 12. The method of claim 10, wherein using the second memory module comprises providing the filtered input streams to a buffering wagon wheel memory structure after the target destinations have been determined for each PID for N transport streams.
- 13. The method of claim 12, wherein
there are N input data streams; the second memory module is a wagon wheel memory structure having 2N time slots capable of accommodating corresponding write and read cycles for each of the N input data streams; and using the second memory module further comprises populating write-cycle time slots of the wagon wheel memory structure with respective ones of the N input data streams.
- 14. The method of claim 13, further comprising maintaining a pointer for each read cycle and for each write cycle of the N data streams.
- 15. The method of claim 14, further comprising:
converting the recovered data streams into a low voltage differential signals; and serially transmitting the low voltage differential signals to the M target destinations.
- 16. An apparatus for transporting plural MPEG input data streams with associated PIDs to multiple target destinations communicatively linked together, the apparatus comprising:
means for generating a PID alias table which comprises plural PID aliases for each of the input data streams; means for removing at least one PID from each input data stream to thereby produce filtered data streams; means for determining a target destination for each of the filtered data streams” and means for buffering the filtered data streams such that the filtered data streams can be read and transported to respective determined target destinations.
- 17. The apparatus of claim 16 wherein the means for buffering comprises a wagon wheel memory structure.
- 18. The apparatus of claim 16, wherein
there are N filtered data streams; and the wagon wheel memory structure comprises 2N time slots capable of accommodating corresponding write and read cycles for each of the N filtered data streams.
- 19. The apparatus of claim 18, wherein the wagon wheel memory structure further comprises pointers for each read-cycle time slot and for each write-cycle time slot of the memory structure.
- 20. The apparatus of claim 19, further comprising:
means for recovering the filtered data streams from the memory structure; and means for serially transporting the recovered data streams.
- 21. The apparatus of claim 16 wherein the apparatus is a transport multiplexer capable of routing the input data streams to any one or more target destinations within a chassis.
- 22. The apparatus of claim 21 wherein the destinations are on a single processing board.
- 23. The apparatus of claim 21 wherein the destinations are on different boards that are communicatively linked together via a backplane.
CROSS REFERENCE TO RELATED APPLICATION
[0001] This application claims the benefit under 35 U.S.C. § 119(e) of co-pending U.S. Provisional Application, Ser. No. 60/322,077, filed Sep.. 13, 2001 and entitled “HIGH RATE SERIAL DIFFERENTIAL PROTOCOL FOR PACKETIZED DATA ROUTING”; which Provisional Application is hereby incorporated by reference.
Provisional Applications (1)
|
Number |
Date |
Country |
|
60322077 |
Sep 2001 |
US |