Cooperative subspace multiplexing in communication networks
First Claim
1. A processing method, comprising:
- selecting a plurality of original electronic data components to transfer to a destination node;
selecting a plurality of transmitting nodes in a communication network to perform cooperative subspace encoding;
coordinating the plurality of transmitting nodes to cooperatively encode the original electronic 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 electronic data components and the plurality of independent equations provides a sufficient number of degrees of freedom for the destination node to calculate a solution for the system of linear equations; and
from the plurality of transmitting nodes, transmitting data-bearing signals comprising the plurality of subspace coded components and corresponding code matrix to the destination node, such that the data-bearing signals provide at least the sufficient number of degrees of freedom to enable the destination node to recover the original electronic data components, whereas at least one of the data-bearing signals provides less than the sufficient number.
3 Assignments
0 Petitions
Accused Products
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.
116 Citations
20 Claims
-
1. A processing method, comprising:
-
selecting a plurality of original electronic data components to transfer to a destination node; selecting a plurality of transmitting nodes in a communication network to perform cooperative subspace encoding; coordinating the plurality of transmitting nodes to cooperatively encode the original electronic 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 electronic data components and the plurality of independent equations provides a sufficient number of degrees of freedom for the destination node to calculate a solution for the system of linear equations; and from the plurality of transmitting nodes, transmitting data-bearing signals comprising the plurality of subspace coded components and corresponding code matrix to the destination node, such that the data-bearing signals provide at least the sufficient number of degrees of freedom to enable the destination node to recover the original electronic data components, whereas at least one of the data-bearing signals provides less than the sufficient number. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method, comprising:
-
selecting a plurality of nodes in a communication network to cooperatively function in a subspace multiplexing process; separating a set of electronic data 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; generating a plurality of signals comprising the plurality of subspace coded components and a plurality of associated subspace code vectors; and distributing the plurality of signals to the plurality of nodes to be retransmitted to a destination node 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, and wherein the destination node is provided with a number of coded components at least equal to the number of required degrees of freedom to enable recovery of the electronic data. - View Dependent Claims (10, 11, 12, 13, 14)
-
-
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 electronic 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 electronic data components, the number of the linearly independent combinations sufficient to permit decoding of the subspace coded components to recover the original electronic data components; 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 transmitting a first signal over the first network channel and at least a second signal over the at least second network channel, wherein the first signal comprises a first set of the plurality of subspace coded components and the at least second signal comprises an at least second set of the plurality of subspace coded components, and wherein each of the first signal and the at least second signal comprises an insufficient number of the linearly independent combinations to permit the decoding, and wherein a combined set comprising the first set and the second set comprises the number of the linearly independent combinations sufficient to permit the decoding. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification