Cooperative Subspace Demultiplexing in Communication Networks

• US 20140140189A1
• Filed: 01/27/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,270,421 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 receiving nodes for cooperatively receiving a transmission from at least one source node, each of the plurality of receiving nodes providing an insufficient number of independent equations for recovering a plurality of original data components encoded in the transmission;

collecting a plurality of coded components and a corresponding code matrix from the plurality of receiving nodes to provide a destination node with a sufficient number of independent equations for recovering the plurality of original data components; and

decoding the plurality of coded components, wherein decoding comprises calculating a solution for a system of collected independent equations, the independent equations being generated from the plurality of coded components and the corresponding code matrix, and containing a plurality of independent variables comprising the plurality of original data components.

2. The method recited in claim 1, wherein at least one of selecting, collecting, and decoding comprises performing adaptive array processing.

3. The method recited in claim 1, wherein selecting the plurality of receiving nodes comprises at least one of providing the corresponding code matrix with sufficient rank to enable the destination node to solve the collected independent equations, and ensuring the corresponding code matrix is sufficiently well-conditioned to permit the destination node to solve the collected independent equations.

4. The method recited in claim 1, further comprising transmitting at least one acknowledgement to the at least one source node upon at least one of receiving a coded component and decoding the plurality of coded components.

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

6. The method recited in claim 1, wherein the code matrix comprises at least one of a channel matrix and a pre-coding matrix.

7. A non-transitory computer readable medium comprising instructions for:

selecting a plurality of receiving nodes for cooperatively receiving a plurality of subspace coded data components and corresponding subspace codes, each of the plurality of receiving nodes having an insufficient rank to decode the plurality of subspace coded data components;

gathering the plurality of subspace coded data components and corresponding subspace codes collected by the plurality of receiving nodes for providing a destination node with sufficient rank to decode the plurality of subspace coded data components; and

decoding the subspace coded data components to retrieve a plurality of original data components.

8. The non-transitory computer readable medium recited in claim 7, wherein at least one of selecting, gathering, and decoding comprises performing adaptive array processing.

9. The non-transitory computer readable medium recited in claim 7, wherein at least one of selecting and gathering comprises at least one of providing the destination node with a code matrix comprising the corresponding subspace codes, the code matrix having sufficient rank for decoding the plurality of subspace coded data components;

and ensuring the code matrix is sufficiently well-conditioned to enable the destination node to decode the plurality of subspace coded data components.

10. The non-transitory computer readable medium recited in claim 7, wherein at least one of selecting and gathering is performed until the destination node decodes the plurality of subspace coded data components.

11. The non-transitory computer readable medium recited in claim 7, further comprising transmitting at least one acknowledgement to at least one source node upon at least one of receiving a subspace coded data component and decoding the plurality of subspace coded data components.

12. The non-transitory computer readable medium recited in claim 7, wherein the subspace codes comprise at least one of a channel matrix and a matrix representing a code employed at one or more nodes for encoding the original data components.

13. A processing method, comprising:

selecting a plurality of network nodes to perform cooperative subspace reception of a subspace coded transmission from a source node;

selecting a first network channel and an at least second network channel for receiving a plurality of subspace coded components at a destination node;

receiving a first set of the subspace coded components on the first network channel and an at least second set of the subspace coded components on the at least second network channel, wherein each of the first set and the at least second set comprises an insufficient number of linearly independent combinations of original data components to permit subspace decoding;

combining the first set and the at least second set to produce a combined set of subspace coded components, the combined set comprising a sufficient number of linearly independent combinations of the original data components to permit subspace decoding; and

performing subspace decoding of the combined set of subspace coded components.

14. The method recited in claim 13, 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.

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

and providing feedback to the source node based on the monitoring.

16. The method recited in claim 13, further comprising providing feedback to the destination node upon at least one of receiving a coded component and decoding the combined set of subspace coded components.

17. The method recited in claim 13, wherein at least one of selecting the plurality of network nodes, selecting the first network channel and the at least second network channel, and receiving are performed until combining can provide the combined set with the sufficient number of linearly independent combinations.

18. The method recited in claim 13, wherein decoding comprises employing at least one of a channel matrix and a matrix representing a code employed at one or more nodes for encoding the original data components.

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

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