Cooperative Subspace Multiplexing in Communication Networks

• US 20140140188A1
• Filed: 01/26/2014
• Published: 05/22/2014
• Est. Priority Date: 05/14/2002
• Status: Active Grant

• Current Assignee: Genghiscomm Holdings, LLC
• Original Assignee: Genghiscomm Holdings, LLC
• Inventors: Shattil, Steve J.
• Granted Patent: US 9,225,471 B2
• Time in Patent Office: Days
• US Class Current: 370/208
• CPC Class Codes: H04B 7/026 Co-operative diversity, e.g. using fixed or mobile stations as relays
• CPC Class Codes: H04J 13/0003 Code application, i.e. aspects relating to how codes are applied to form multiplexed channels
• CPC Class Codes: H04J 13/004 Orthogonal
• CPC Class Codes: H04J 13/12 Generation of orthogonal codes
• CPC Class Codes: H04L 1/0077 Cooperative coding
• CPC Class Codes: H04L 2001/0097 Relays
• CPC Class Codes: H04L 27/2601 Multicarrier modulation systems
• CPC Class Codes: H04L 27/2602 Signal structure
• CPC Class Codes: H04L 27/2614 Peak power aspects
• CPC Class Codes: H04L 45/24 Multipath
• CPC Class Codes: H04L 5/0021 in which codes are applied as a frequency-domain sequences, e.g. MC-CDMA
• CPC Class Codes: H04W 52/346 distributing total power among users or channels
• CPC Class Codes: H04W 72/046 the resource being in the space domain, e.g. beams

Abstract

A source node selects a plurality of transmitting nodes to cooperatively encode a set of original packets to transfer to a destination node. Encoding produces a plurality of coded packets and a corresponding code matrix of coefficients. The coded packets and the corresponding code matrix comprise a set of independent equations of independent variables in a system of linear equations, wherein the independent variables comprise the original packets. A destination node may select a set of receiving nodes to cooperatively receive the transmissions. The destination node collects the coded packets and code matrix from the receiving nodes, which provide a sufficient number of independent equations for decoding the original packets. Decoding comprises calculating a solution for the system of linear equations.

Claims

1. A processing method, comprising:

selecting a plurality of original data components to transfer to a destination node;

selecting a plurality of transmitting nodes to perform cooperative encoding;

cooperatively encoding the original data components to generate a plurality of subspace coded components and provide a corresponding code matrix of coefficients, the subspace coded components and the corresponding code matrix comprising a plurality of independent equations having a plurality of independent variables in a system of linear equations, wherein the independent variables comprise the original data components and the plurality of independent equations provides a sufficient number of degrees of freedom for a destination node to calculate a solution for the system of linear equations; and

transmitting the plurality of subspace coded components and corresponding code matrix to a destination node.

2. The processing method recited in claim 1, wherein cooperatively encoding comprises:

generating a plurality of subspace coefficients to produce the code matrix;

generating the plurality of subspace coded components by employing the plurality of subspace coefficients to produce linearly independent combinations of the original data components; and

distributing the subspace coefficients and the subspace coded components to the plurality of transmitting nodes.

3. The method recited in claim 1, wherein cooperatively encoding comprises at least one of providing the code matrix with sufficient rank to enable the destination node to estimate the plurality of independent variables, and ensuring the code matrix is sufficiently well-conditioned to permit the destination node to estimate the plurality of independent variables.

4. The method recited in claim 1, wherein selecting the plurality of transmitting nodes comprises selecting at least one intermediate node to provide linear coding to the subspace coded components and the code matrix.

5. The method recited in claim 1, wherein the corresponding code matrix comprises at least one of a matrix of randomly generated coefficients, a matrix of coefficients generated from measurements of a random process, a matrix of coefficients generated deterministically, and a CI code matrix.

6. The method recited in claim 1, wherein transmitting comprises transmitting subspace coded components until an acknowledgement from the destination node is received.

7. The method recited in claim 1, wherein the coefficients comprise at least one of a set of codes, the set comprising block codes and sliding transform codes.

8. A non-transitory computer readable storage medium having computer readable code thereon, the medium comprising instructions for implementing the method recited in claim 1.

9. A method for distributing subspace-encoded data for transmission to a destination node, comprising:

selecting a plurality of nodes to cooperatively function in a subspace multiplexing process;

separating a data set into a plurality N of original components;

generating a plurality of subspace coded components by generating at least N linearly independent combinations of the original components; and

distributing the plurality of subspace coded components and a plurality of associated subspace code vectors to the plurality of nodes, such that at least one of the plurality of nodes has a number of coded components that is less than a number of required degrees of freedom to decode the plurality of subspace-coded components.

10. The method recited in claim 9, wherein generating the plurality of subspace coded components comprises ensuring that a code matrix corresponding to the linearly independent combinations of the original components is sufficiently well conditioned to permit decoding of the plurality of subspace coded components.

11. The method recited in claim 9, wherein at least one of the plurality of nodes is configured to encode received subspace coded components and associated subspace code vectors.

12. The method recited in claim 9, wherein selecting and distributing are performed to enable the destination node to collect at least N linearly independent combinations of the original components from the plurality of nodes.

13. The method recited in claim 9, wherein the plurality of nodes comprises at least one of a set of nodes, the set comprising edge servers in a content delivery network and peers in a peer-to-peer network.

14. A non-transitory computer readable storage medium having computer readable code thereon, the medium comprising instructions for implementing the method recited in claim 9.

15. A non-transitory computer readable storage medium having computer readable code thereon, the medium comprising instructions for:

generating a plurality of subspace coefficients to encode a plurality of original data components;

generating a plurality of subspace coded components by employing the plurality of subspace coefficients to produce a number of linearly independent combinations of the original data components, the number of the linearly independent combinations being sufficient to permit decoding;

selecting a plurality of transmitting nodes to perform cooperative subspace transmission of the subspace coded components to a destination node;

selecting a first network channel and an at least second network channel for transmitting the subspace coded components to the destination node; and

distributing the plurality of subspace coded components over the first network channel and the at least second network channel, wherein each of the first network channel and the at least second network channel is configured to transport an insufficient number of the linearly independent combinations to permit decoding.

16. The storage medium recited in claim 15, wherein the first network channel and the at least second network channel comprise at least one of a set of network channels, the set comprising a plurality of different multiple access channels on one network;

and a plurality of network channels each residing on a different network.

17. The storage medium recited in claim 15, further comprising monitoring at least one real-time property of the first network channel and the at least second network channel;

and wherein at least one of generating a plurality of subspace coded components and distributing is adjusted based on the monitoring to provide network load balancing.

18. The storage medium recited in claim 15, wherein generating the plurality of subspace coded components comprises at least one of block coding and sliding window coding.

19. The storage medium recited in claim 15, wherein at least one of generating the plurality of subspace coefficients, generating the plurality of subspace coded components, selecting the plurality of transmitting nodes, selecting the first network channel and the at least second network channel, and distributing is responsive to feedback from the destination node.

20. The storage medium recited in claim 15, wherein generating the plurality of subspace coded components employs a code matrix comprising at least one of a matrix of randomly generated coefficients, a matrix of coefficients generated from measurements of a random process, a matrix of coefficients generated deterministically, and a CI code matrix.