Multiplexing and demultiplexing data

• US 8,593,951 B2
• Filed: 04/29/2008
• Issued: 11/26/2013
• Est. Priority Date: 04/29/2008
• Status: Expired due to Fees

• Current Assignee: NXP USA, Inc. (NXP Semiconductors NV)
• Original Assignee: Freescale Semiconductor, Inc. (NXP Semiconductors NV)
• Inventors: Nistor, Adrian Ioan, Pelly, Jason
• Primary Examiner(s): Rutkowski, Jeffrey M
• Assistant Examiner(s): FAYED, RASHA K
• Application Number:
  US12/936,965
• Publication Number:
  US 20110032954A1
• Time in Patent Office: 2,037 Days
• Field of Search: 370/221, 370412-418, 370/535, 711/133, 711/159, 711/171, 711/173
• US Class Current: 370/230
• CPC Class Codes: H04J 3/02 Details electronic switching or gating H03K17/00
• CPC Class Codes: H04J 3/047 Distributors with transistors or integrated circuits

Abstract

A method of demultiplexing data, the method comprising: during each of a series of time-units, receiving multiplexed data, wherein the multiplexed data comprises, for each of a plurality of channels, a corresponding quantity of channel data of a corresponding data size; and during each of the series of time-units, for each of the plurality of channels, storing the corresponding quantity of channel data received during that time-unit in a contiguous region of a memory associated with that channel; wherein each of the plurality of channels has a corresponding time-unit-number such that, for each of the plurality of channels, the channel data stored in the corresponding region of the memory for that channel is to be processed after a number of time units equal to the time-unit-number for that channel has passed since channel data for that channel was last processed; characterized in that the method comprises: determining the locations of the regions of the memory based on the data sizes and the time-unit-numbers corresponding to one or more channels from the plurality of channels such that the step of storing will not store channel data at a location in the memory that is currently storing channel data that has not yet been processed.

Claims

1. A method of demultiplexing data, the method comprising:

during each of a series of time-units, receiving multiplexed data, wherein the multiplexed data comprises, for each of a plurality of channels, a corresponding quantity of channel data of a corresponding data size; and

during each of the series of time-units, for each of the plurality of channels, storing the corresponding quantity of channel data received during that time-unit in a contiguous region of a memory associated with that channel;

wherein each of the plurality of channels has a corresponding time-unit-number such that, for each of the plurality of channels, the channel data stored in the corresponding region of the memory for that channel is to be processed after a number of time units equal to the time-unit-number for that channel has passed since channel data for that channel was last processed;

determining the locations of the regions of the memory based on the data sizes and the time-unit-numbers corresponding to one or more channels from the plurality of channels such that the step of storing will not store channel data at a location in the memory that is currently storing channel data that has not yet been processed.

3. A method according to claim 1, in which determining the locations of the regions of the memory comprises determining the location of the region of the memory for a first channel prior to determining the location of the region of the memory for a second channel if the time-unit-number corresponding to the first channel is greater than the time-unit-number corresponding to the second channel.

4. A method according claim 1, in which the locations of the regions of the memory are determined so that there are substantially no gaps between the regions of the memory within the memory.

5. A method according to claim 1, in which at least two of the determined regions of the memory overlap.

6. A method according to claim 1, comprising the step of:

repeating the step of determining to update the location of one or more of the regions of the memory.

7. A method according to claim 6, comprising the step of:

determining whether the location of one or more of the regions of the memory should be updated during the current time-unit.

8. A method according to claim 7, in which it is determined that the location of the region of the memory corresponding to a channel should be updated during a time-unit in which channel data stored in the memory for that channel is processed, the location of that region of the memory then being updated after that channel data is processed.

9. A method according to claim 7, in which it is determined that the location of the region of the memory corresponding to a channel should be updated during a time-unit in which channel data is stored in the memory for that channel, the location of that region of the memory then being updated before that channel data is stored in the memory.

10. A method according to claim 1, in which, for each of the plurality of channels, the time-unit-number for that channel is a positive integer multiple of the time-unit-number for each of the other channels.

2. A method of multiplexing data, the method comprising:

during each of a series of time-units, forming multiplexed data by outputting, for each of a plurality of channels, a corresponding quantity of channel data of a corresponding data size that is being stored in a memory;

wherein each of the plurality of channels has a corresponding time-unit-number, the method comprising, for each of the plurality of channels, storing channel data in a corresponding region of the memory for that channel after a number of time units equal to the time-unit-number for that channel has passed since channel data for that channel was last stored in the memory;

characterised in that the method comprises;

determining the locations of the regions of the memory based on the data sizes and the time-unit-numbers corresponding to the one or more channels from the plurality of channels such that the step of storing will not store channel data at a location in the memory that is currently storing channel data that has not yet been output.

11. A method according to claim 2, in which determining the locations of the regions of the memory comprises determining the location of the region of the memory for a first channel prior to determining the location of the region of the memory for a second channel if the time-unit-number corresponding to the first channel is greater than the time-unit-number corresponding to the second channel.

12. A method according claim 2, in which the locations of the regions of the memory are determined so that there are substantially no gaps between the regions of the memory within the memory.

13. A method according to claim 2, in which at least two of the determined regions of the memory overlap.

14. A method according to claim 2, comprising the step of:

repeating the step of determining to update the location of one or more of the regions of the memory.

15. A method according to claim 14, comprising the step of:

determining whether the location of one or more of the regions of the memory should be updated during the current time-unit.

16. A method according to claim 15, in which it is determined that the location of the region of the memory corresponding to a channel should be updated during a time-unit in which channel data stored in the memory for that channel is processed, the location of that region of the memory then being updated after that channel data is processed.

17. A method according to claim 15, in which it is determined that the location of the region of the memory corresponding to a channel should be updated during a time-unit in which channel data is stored in the memory for that channel, the location of that region of the memory then being updated before that channel data is stored in the memory.

18. A method according to claim 2, in which, for each of the plurality of channels, the time-unit-number for that channel is a positive integer multiple of the time-unit-number for each of the other channels.

19. A method according claim 11, in which the locations of the regions of the memory are determined so that there are substantially no gaps between the regions of the memory within the memory.

20. A non-transitory computer readable media comprising a computer program which, when executed by a computer, carries out a method of demultiplexing data, the method comprising:

during each of a series of time-units, receiving multiplexed data, wherein the multiplexed data comprises, for each of a plurality of channels, a corresponding quantity of channel data of a corresponding data size; and

during each of the series of time-units, for each of the plurality of channels, storing the corresponding quantity of channel data received during that time-unit in a contiguous region of a memory associated with that channel;

wherein each of the plurality of channels has a corresponding time-unit-number such that, for each of the plurality of channels, the channel data stored in the corresponding region of the memory for that channel is to be processed after a number of time units equal to the time-unit-number for that channel has passed since channel data for that channel was last processed;

determining the locations of the regions of the memory based on the data sizes and the time-unit-numbers corresponding to one or more channels from the plurality of channels such that the step of storing will not store channel data at a location in the memory that is currently storing channel data that has not yet been processed.