Systems and Methods for Transmitting Data Using Encoder Cooperation in the Presence of State Information

Abstract

Systems and methods for utilizing cooperation facilitators to achieve joint message and network state cooperation in accordance with various embodiments of the invention are disclosed. One embodiment of the invention includes: a plurality of transmitters; a receiver that has access to at least partial network state information and that includes a decoder configured to decode signals received via a multiple terminal channel from the plurality of transmitters using the at least partial network state information; and a cooperation facilitator. In addition, at least some of the plurality of transmitters are configured to transmit message information to the cooperation facilitator and the cooperation facilitator is configured to generate cooperation parameters based upon the message information and the manner in which state information is utilized by the receiver to decode signals received via the multiple terminal channel. In addition, the cooperation facilitator is configured to transmit cooperation parameters to the plurality of transmitters that select codewords based at least in part upon the received cooperation parameters.

Claims

1. A communication system, comprising: a plurality of transmitters; a receiver that has access to at least partial network state information and that includes a decoder configured to decode signals received via a multiple terminal channel from the plurality of transmitters using the at least partial network state information; a cooperation facilitator; wherein at least some of the plurality of transmitters are configured to transmit message information to the cooperation facilitator; wherein the cooperation facilitator is configured to generate cooperation parameters based upon the message information received from the plurality of transmitters and the manner in which the at least partial network state information by the receiver to decode signals received via the multiple terminal channel; wherein the cooperation facilitator is configured to transmit cooperation parameters the plurality of transmitters; wherein an encoder at least one of the plurality of transmitters selects at least one codeword from a plurality of codewords based at least in part upon a cooperation parameter received from the cooperation facilitator; and wherein the plurality of transmitters are configured to transmit selected codewords via the multiple terminal channel to the receiver.

2. The communication system of claim 1, wherein: at least some of the plurality of transmitters have access to at least partial network state information; at least some of the plurality of transmitters are configured to transmit message and network state information to the cooperation facilitator; and the cooperation facilitator is configured to generate cooperation parameters based upon the message and network state information received from the plurality of transmitters.

3. The communication system of claim 2, wherein selection east one codeword from the plurality of codewords by an encoder based at least in part upon a cooperation parameter received from the communication facilitator results in selection of at least one codeword in a manner that is dependent upon network state.

4. The communication system of claim 3, wherein selection of at least one codeword from the plurality of codewords by an encoder based at least in part upon a cooperation parameter received from the communication facilitator results in selection of at least one codeword in a manner that is also dependent upon codewords transmitted by other transmitters via the multiple terminal channel.

5. The communication system of claim 3, wherein selection of at least one codeword from the plurality of codewords by an encoder based at least in part upon a cooperation parameter received from the communication facilitator results in selection of at least one codeword in a manner that is also dependent upon message information transmitted to the cooperation facilitator by at least one of the plurality of transmitters.

6. The communication system of claim 2, wherein a first value of a network performance metric of the communication system achieved using codewords selected at least in part based upon the cooperation parameters received from the cooperation facilitator is greater than a second value of the network performance metric of the communication system achieved where each of the plurality of encoders encodes data without communicating with the cooperation facilitator.

7. The communication system of claim 6, wherein the first value of the network performance metric is a first sum-capacity of the communication system and the second value of the network performance metric is a second sum-capacity of the communication system.

8. The communication system of claim 6, wherein the first value of the network performance metric is a first reliability of the communication system and the second value of the network performance metric is a second reliability of the communication system.

9. The communication system of claim 2, wherein at least some of the plurality of transmitters have access to partial network state information.

10. The communication system of claim 2, wherein the network state information is selected from the group consisting of strictly causal state information and causal state information.

11. The communication system of claim 2, wherein the network state information is non-causal.

12. The communication system of claim 2, wherein: at least some of the plurality of transmitters are configured to transmit message and network state information to the cooperation facilitator while at least one of the plurality of transmitters is transmitting symbols via the multiple terminal channel to the receiver; an encoder in at least one of the plurality of transmitters receives at least one cooperation parameter from the cooperation facilitator while at least one of the plurality of transmitters is transmitting symbols via the multiple terminal channel to the receiver; and the encoder that receives the at least one cooperation parameter from the cooperation facilitator selects a next symbol of a codeword based upon the received at least one cooperation parameter.

13. The communication system of claim 2, wherein at least some of the plurality of transmitters are configured to transmit message and network state information to the cooperation facilitator that is selected from the group consisting of: partial raw message information and partial raw network state information; complete raw message information and partial raw network state information; partial raw message information and complete raw network state information; complete raw message information and complete raw network state information; partial encoded message information and partial raw network state information; complete encoded message information and partial raw network state information; partial encoded message information and complete raw network state information; complete encoded message information and complete raw network state information; partial raw message information and partial encoded network state information; complete raw message information and partial encoded network state information; partial raw message information and complete encoded network state information; complete message information and complete encoded network state information; partial encoded message information and partial encoded network state information; complete encoded message information and partial encoded network state information; partial encoded message information and complete encoded network state information; and complete encoded message information and complete encoded network state information

14. The communication system of claim 1, wherein the multiple terminal channel is a multiple access channel.

15. The communication system of claim 14, wherein the multiple access channel is a shared wireless channel.

16. The communication system of claim 14, wherein the multiple access channel is a Gaussian multiple access channel with binary fading.

17. The communication system of claim 1, wherein the plurality of transmitters is two transmitters.

18. The communication system of claim 1, wherein the plurality of transmitters is at least three transmitters.

19. The communication system of claim 1, wherein cooperation parameters are transmitted by the cooperation facilitator by a first channel to the plurality of transmitters separate from the multiple terminal channel.

20. A cooperation comprising: a transmitter; a receiver; and a cooperation facilitator controller; wherein the cooperation facilitator controller is configured to receive message information from a plurality of transmitter nodes via the receiver; wherein the cooperation facilitator is configured to generate cooperation parameters based upon the message information received from the plurality of transmitter nodes and the manner in which a receiver node utilizes at least partial network state information to decode signals received via a multiple terminal channel; and wherein the cooperation facilitator controller is configured to transmit cooperation parameters via the transmitter to the plurality of transmitter nodes, where the cooperation parameters enable encoders in each of the plurality of transmitter nodes to select a codeword from a plurality of codewords for transmission in a manner that is dependent upon network state.

21. The cooperation facilitator of claim 20, wherein the cooperation facilitator controller is configured to: receive message and network state information from the plurality of transmitter nodes via the receiver; generate cooperation parameters based upon the message and network state information received from the plurality of transmitter nodes; and transmit cooperation parameters via the transmitter to the plurality of transmitter nodes, where the cooperation parameters enable encoders in each of the plurality of transmitter nodes to select a codeword from a plurality of codewords for transmission in a manner that is dependent upon network state.

22. The cooperation facilitator of claim 21, wherein the cooperation facilitator is configured to transmit cooperation parameters to the plurality of transmitter nodes that enable an encoder to select a codeword from a plurality of codewords for transmission in a manner that is dependent upon network state and at least one message transmitted via a multiple terminal channel that is encoded by another encoder.

23. The cooperation facilitator of claim 21, wherein a first value of a network performance metric of the cooperation facilitator achieved using codewords selected at least in part based upon the cooperation parameters received from the cooperation facilitator is greater than a second value of the network performance metric of the cooperation facilitator achieved with each of the plurality of encoders in the plurality of transmitter nodes encodes data without communicating with the cooperation facilitator.

24. The cooperation facilitator of claim 21, wherein the first value of the network performance metric is a first sum-capacity of the cooperation facilitator and the second value of the network performance metric is a second sum-capacity of the cooperation facilitator.

25. The cooperation facilitator of claim 21, wherein the first value of the network performance metric is a first reliability of the cooperation facilitator and the second value of the network performance metric is a second reliability of the cooperation facilitator.

26. The cooperation facilitator of claim 21, wherein the received network state information is partial network state information.

27. The cooperation facilitator of claim 20, wherein the network state information is selected from the group consisting of strictly causal state information and causal state information.

28. The cooperation facilitator of claim 20, wherein the network state information is non-causal.

29. The cooperation facilitator of claim 20, wherein the plurality of nodes is two nodes.

30. The cooperation facilitator of claim 20, wherein the plurality of nodes is at least three nodes.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0059] FIG. 1 is a diagram illustrating a system incorporating a cooperation facilitator for at least two other transmitters sharing a multiple access channel in accordance with an embodiment of the invention.

[0060] FIG. 2 is a diagram illustrating a cooperation facilitator system exchange message and network state information with multiple encoders/transmitters that share a multiple access channel in accordance with an embodiment of the invention.

[0061] FIG. 3 is a block diagram illustrating a cooperation facilitator controller in accordance with an embodiment of the invention.

[0062] FIG. 4 is a flow chart illustrating a coordinated data transmission process in accordance with an embodiment of the invention.

[0063] FIG. 5 is a flow chart illustrating cooperation facilitator process in accordance with an embodiment of the invention.

[0064] FIG. 6 is a flow chart illustrating an encoding process in accordance with embodiment of the invention.

DETAILED DESCRIPTION

[0065] Turning now to the drawings, systems and methods for transmitting data using encoder cooperation based upon shared network state information in accordance with various embodiments of the invention are illustrated. In many embodiments, cooperation between encoders that communicate via a MAC is achieved using a cooperation facilitator. The term cooperation facilitator (CF) can be used to describe any network node that enables other nodes to cooperate. By sharing message information and/or state information via a cooperation facilitator, encoders can work together to increase transmission rates.

[0066] The use of cooperation facilitators in the absence of state information is disclosed in U.S. Patent Publication No. 2016/0365940, which details conditions under which the sum-capacity gain of cooperation has an infinite slope in the limit of small cooperation rate. Specifically, U.S. Patent Publication No. 2016/0365940 describes single-letter conditions on the channel transition matrix of the MAC that provide an infinite slope in sum-capacity as a function of the capacities of the CF output edges. For example, the additive Gaussian MAC provides an important example of a scenario where the infinite slope phenomenon can occur in the absence of network state information. The disclosure of U.S. Patent Publication No. 2016/0365940 including the disclosure related to network configurations involving cooperation facilitators that achieve a sum-capacity gain of cooperation that has an infinite slope in the limit of small cooperation rate is incorporated herein by reference in its entirety. Systems and methods in accordance with many embodiments of the invention utilize a new type of CF in network scenarios where distributed state information is available at multiple encoders and at least partial or full state information is available at at least one decoder. Systems and methods in accordance with a number of embodiments communicate via MACS for which the cooperation gain can have an infinite slope in the presence of state information, interestingly, this includes channels for which the infinite slope phenomenon is not observed as arising in the absence of state information. Encoders in accordance with a number of embodiments of the invention can transmit raw message and state information available at the encoders to the CF and/or an encoded version of partial message and/or state information as appropriate to the requirements of a given application. Therefore, references to message and/or state information should be understood as encompassing raw message and/or state information and/or at least partially encoded message and/or state information as appropriate to the requirements of a given application. In a number of embodiments, the channel state information is distributed across encoders; that is, different encoders have potentially different partial channel state information regarding the channel state. In many embodiments, one or more encoders can possess partial channel state information that is the same and/or complete channel state information.

[0067] While much of the discussion that follows relates to systems in which two encoders communicate with a cooperation facilitator, in many other embodiments more than two encoders communicate with a cooperation facilitator. In addition, communication can be between multiple transmitters and a single receiver or between multiple transmitters and multiple receivers or between transmitters and/or receivers and devices that are both transmitters and receivers in accordance with various embodiments of the invention. Cooperation facilitators and networks incorporating cooperation facilitators that exchange message and/or network state information (that may be encoded) between encoders that share a MAC in accordance with various embodiments of the invention discussed further below.

Networks with State Information

[0068] Many applications involve the use of a network where state information is available to at least some nodes, including (but not limited to) wireless channels with fading, cognitive radios, and computer memory with defects. Depending on the application at hand, channel state information may be either fully available at all network nodes or available in a distributed manner.

[0069] Practical application of a CF in a network 100 in which state information is available to at least some nodes is conceptually illustrated in FIG. 1 in which a cell phone handset 102 is shown positioned at the edge of a cell boundary between two cell phone towers 104, 106. In the illustrated embodiment, the transmitters on the downlink channels between each of the cell phone towers 104, 106 and the cell phone handset 102 represent two encoders that can simultaneously transmit to the decoder on the cell phone handset. As can readily be appreciated, a real world cellular telephone network includes many more cellular towers and involves a very large number of MACs and other communication components shared by the cellular subscriber devices that utilize the network. However, the example shown in FIG. 1 is illustrative of the potential for a CF placed within a network such as (but not limited to) the illustrated cell phone network can receive message and/or state information from multiple transmitters within the network and use this information to facilitate cooperation between the transmitters. In this way, the CF can facilitate the transmitters transmitting in ways that work well together instead of creating interference. Cooperation strategies can be as simple as time division multiplexing the transmitted signals so that they don't interfere with each other and can extend to more complex strategies including (but not limited to) providing the encoders with cooperation parameters that enable the encoding of a message based at least partially upon network state information. In very complex scenarios, a CF can facilitate multiple transmitters cooperating to generate an ad-hoc multiple input multiple output (MIMO) transmissiona signal that neither transmitter could generate alone. As can readily be appreciated, the specific ways in which a CF in accordance with various embodiments of the invention can facilitate cooperation between transmitters that share a MAC is only limited by the requirements of a given communication system.

[0070] In a number of embodiments, network state information is available in a distributed manner, such that each node can access a component or a function of the network state sequence. Furthermore, the network state information may be available non-causally, or alternatively, may be subject to causality constraints. For example, when state information models fading effects experienced during wireless communication, the transmitters' knowledge of network state information can be strictly causal or causal. On the other hand, when the network state sequence models a signal that the transmitter sends to another receiver, then the state sequence is available non-causally at the transmitter.

[0071] While cooperation facilitation based upon message and/or network state information is discussed above with respect to a variety of examples, the applications in which CFs in accordance with various embodiments of the invention be utilized are not limited to any specific example. Indeed, CFs can be utilized in a variety of other circumstances including (but not limited to) multiple cell phone handsets transmitting on a congested MAC (e.g., at a stadium or crowded public event) and/or multiple radios on a cell phone handset transmitting via different networks (e.g., 5G and WiFi). Particular characteristics of CFs and channels in which use of CFs can achieve increases in capacity, reliability and/or performance in accordance with several embodiments of the invention are discussed further below.

Cooperation Facilitates in Networks with State Information

[0072] The presence of distributed state information in a network can provide an opportunity for cooperation. In many embodiments, cooperation between network nodes such as (but not limited to) encoders that share a MAC is achieved using a CF. In this network architecture, encoders can cooperate indirectly, rather than directly. The CF can enable both message and network state cooperation, which can prove crucial to the cooperation gain obtained through the activities of the CF within the network.

[0073] A network 200 incorporating a CF that receives message and/or network state information from multiple encoders that share a MAC in accordance with an embodiment of the invention is illustrated in FIG. 2. In the illustrated embodiment, a pair of encoders 202, 204 communicate with a decoder 206 via a state-dependent MAC 20. Communications between the encoders 202, 204 and the decoder 206 as facilitated by a CF 210.

[0074] In the illustrated embodiment, the state information available at the encoders 202, 204 is distributed; that is, S=(S.sub.1,S.sub.2) is assumed, where for i{1,2}, S.sub.i is available at encoder i. Throughout the discussion that follows, no assumptions are made regarding the dependence between S.sub.1 and S.sub.2 and the results apply to the limiting cases of independent states (i.e., independent S.sub.1 and S.sub.2) and common state (i.e., S.sub.1=S.sub.2).

[0075] Since the decoder starts the decoding process only after receiving all the output symbols in a given transmission block, causality constraints at the decoder do not impose limitations on the availability of network state information. Thus the decoder can be assumed to have at least partial, full state information, or no state information. In the illustrated embodiment, full state information is available at the decoder. At time t[n], partial state information .sub.i.sup.t is available encoder i{1,2}.

[0076] In order to analyze the network 100, S.sub.1, S.sub.2, X.sub.1, X.sub.2, and can be modeled as discrete or continuous alphabets. A MAC with input alphabet X.sub.1X.sub.2, output alphabet , and state alphabet S:=S.sub.1S.sub.2 can be represented by the sequence

[00001]${\left\{p\left(s^n\right).Math.p\left(y^n|s^n,x_1^n,x_2^n\right)\right\}}_{n=1}^{}.$

The MAC is said to be memoryless and stationary if for some p(s)p(y|s,x.sub.1,x.sub.2) and all positive integers n.

[00002]$p\left(s^n\right).Math.p\left(y^n|s^n,x_1^n,x_2^n\right)=\underset{t=1}{\overset{n}{.Math.}}.Math.p\left(s_t\right).Math.p\left(y_t|s_t,x_{1.Math..Math.t},x_{2.Math..Math.t}\right).$

Comparison between Message Only and Message and Network State Cooperation

[0077] The capacity region of a MAC with a CF that enables message cooperation can be defined with respect to four scenarios based on the availability of state information at the encoders: (i) no state information, (ii) strictly causal state information, (iii) causal state information, and (iv) non-causal state information. In case (i), the CF is used for sharing message information (a strategy here called message cooperation) since no state information is available at the encoders. The term strictly causal state information refers to the situation in which at each time t, to the extent that an encoder has access to state information, the encoder has access to state information only up to time t1. The term causal state information refers to the situation in which at each time t, to the extent that an encoder has access to state information, the encoder has access to state information only up to time t. The term non-causal state information refers to the situation in which, to the extent that an encoder has access to state information, at each time t the encoder has access to state information of all times. In cases (ii)-(iv), the CF enables both message and state cooperation. The discussion that follows considers message and state cooperation only in case (iv), but it can readily be appreciated that message and state cooperation can be utilized in these other scenarios. Use of joint message and state cooperation can lead to a weaker sufficient condition an infinite-slope gain compared to the sole use of message cooperation. Whether in cases (ii) and (iii), the use of joint message and state cooperation likewise leads to a weaker sufficient condition for an infinite-slope gain compared to message cooperation alone, remains an open problem. The impact of cooperation based upon joint message and network state information in accordance with various embodiments of the invention discussed further below.

[0078] Referring again to FIG. 2, full state information is assumed available at the decoder 206 (although decoders in marry embodiments only have access to partial state information). In the definition below, for any real number x1, [x] denotes the set {1, . . . , x}.

[0079] A (2.sup.nR.sup.1,2.sup.nR.sup.2,n)-code can be defined for the MAC 208 with (C.sub.in,C.sub.out)-CF, cost functions b.sub.i:X.sub.i.fwdarw..sub.0 for i{1,2}, and cost constraints B.sub.1,B.sub.20. The pairs C.sub.in=(C.sub.in.sup.1,C.sub.in.sup.2) and C.sub.out=(C.sub.out.sup.1,C.sub.out.sup.2) denote the CF input and output channel capacities, respectively.

[0080] Each encoder i, for i{1,2} (202, 204), can be represented by (.sub.in.sup.i, (f.sub.it).sub.t=1.sup.n), the CF 210 can be represented by (.sub.out.sup.1,.sub.out.sup.2) and the decoder 206 can be represented by g. These mappings are defined in the order of their use below.

[0081] For i{1,2}, the transmission from encoder i (202, 204) to the CF 210 can be represented by the mapping

.sub.in.sup.i:[2.sup.nR.sup.i].fwdarw.[2.sup.nC.sup.in.sup.i](1)

and the transmission from the C 210 to encoder i (202, 204) can be represented by

.sub.out.sup.i:[2.sup.nC.sup.in.sup.1][2.sup.nC.sup.in.sup.2].fwdarw.[2.sup.Nc.sup.out.sup.i].

[0082] For simplicity, the transmissions to and from the CF 210 are assumed to occur prior to the transmission of codewords over the MAC 208 by the encoders 202, 204.

[0083] At time t[n], for i{1,2}, the transmission of encoder i (202, 204) over the channel 208 can be represented by the mapping

f.sub.it:[2.sup.nR.sup.i][2.sup.nC.sup.out.sup.i].sub.i.sup.t.fwdarw.X.sub.i.(2)

[0084] Here .sub.i.sup.t represents any knowledge about the state gathered by encoder i (202, 204) in times {1, . . . , t}. Let * be a symbol not in S.sub.1S.sub.2. For i{1,2} and t[n], we have

[00003]${\hat{S}}_{\mathrm{it}}:=\{\begin{array}{cc}*& \mathrm{no}.Math..Math.\mathrm{state}.Math..Math.\mathrm{information}\\ S_{i\left(t-1\right)}& \mathrm{strictly}.Math..Math.\mathrm{causal}\\ S_{\mathrm{it}}& \mathrm{causal}\\ S_i^n& \mathrm{non}.Math.\text{-}.Math.\mathrm{causal}.\end{array}$

[0085] For every message pair (w.sub.1,w.sub.2), the codeword of encoder i (202, 204) can be required to satisfy the cost constraint

[00004]$\begin{array}{cc}\underset{t=1}{\overset{n}{.Math.}}.Math..Math..Math.b_i\left[f_{\mathrm{it}}\left(w_i,{}_{\mathrm{out}}^i\left({}_{i.Math..Math.n}^1\left(w_1\right),{}_{i.Math..Math.n}^2\left(w_2\right)\right),{\hat{S}}_i^t\right)\right]B_i.& \left(3\right)\end{array}$

[0086] As noted above, the decoder 206 is assumed to have full state information and can be represented by the mapping

g:S.sup.n.sup.n.fwdarw.[2.sup.nR.sup.1][2.sup.nR.sup.2].

[0087] The average probability of error is given by

P.sub.e.sup.(n)=Pr{g(S.sup.n,Y.sup.n)(W.sub.1,W.sub.2)},

where (W.sub.1,W.sub.2) is uniformly distributed over [2.sup.nR.sup.1][2.sup.nR.sup.2]. A rate pair (R.sub.1,R.sub.2) is achievable if there exists a sequence of (2.sup.nR.sup.1,2.sup.nR.sup.2,n)-codes with P.sub.e.sup.(n)=0 as n.fwdarw..

[0088] The subscript {0,T1,T,} can be used to specify the dependence of the capacity region and sum-capacity on the availability of state information at the encoders 202, 204. The following table makes this dependence clear.

TABLE-US-00001 encoder state information 0 none T 1 strictly causal T causal non-causal

[0089] The capacity region .sub.(C.sub.in,C.sub.out) can be given by the closure of all achievable rate pairs. The sum-capacity, denoted by C.sub.(C.sub.in,C.sub.out), can be defined as

[00005]$\begin{array}{cc}{C}_{}\left(C_{i.Math..Math.n},C_{\mathrm{out}}\right):=\underset{{}_{}.Math.\left(C_{i.Math..Math.n},C_{\mathrm{out}}\right)}{\max }.Math.\left(R_1+R_2\right).& \left(4\right)\end{array}$

[0090] For example, .sub.T(C.sub.in,C.sub.out) and C.sub.T(C.sub.in,C.sub.out) denote the capacity region and sum-capacity, respectively, of a MAC with a (C.sub.in,C.sub.out)-CF and distributed causal state information available at the encoders.

Message and State Cooperation

[0091] In the scenario where non-causal state information is available at the encoders, a CF in accordance with various embodiments of the invention can generate benefits within the network through joint message and state cooperation. A code for the case where non-causal state information is available at the encoders, for i{1,2} can be defined by replacing (1) and (3) above with

[00006]${}_{i.Math..Math.n}^i:\left[2^{{\mathrm{nR}}_i}\right]S_i^n.fwdarw.\left[2^{{\mathrm{nC}}_{i.Math..Math.n}^i}\right],\mathrm{and}$$\underset{t=1}{\overset{n}{.Math.}}.Math..Math..Math.b_i\left[f_{\mathrm{it}}\left(w_i,{}_{\mathrm{out}}^i\left({}_{i.Math..Math.n}^1\left(w_1,S_1^n\right),{}_{i.Math..Math.n}^2\left(w_2,S_2^n\right)\right),S_i^n\right)\right]B_i.$

[0092] The capacity region and sum-capacity can be denoted with .sub.,s(C.sub.in,C.sub.out) and C.sub.,s(C.sub.in,C.sub.out), respectively. The subscript s indicates the dependence of the cooperation strategy on the channel state information.

Coding Strategy

[0093] In a number of embodiments, coding strategies are utilized to encode data at multiple encoders that are based on random coding arguments. Since the aim, in many instances, is to determine conditions sufficient for an infinite slope cooperation gain, coding strategies can be used that specifically focus on achieving large gains for small cooperation rates. In particular, in the coding strategies discussed below, the CF does not simply use its rate for forwarding message or state information, since the gain of such a strategy is understood to be at most linear in the cooperation rate. Instead, more complex cooperation strategies involving the forwarding of cooperation parameters that achieve sum-capacity gains are considered. The analysis presented below first considers message cooperation and concludes with a discussion of message and state cooperation.

Inner Bounds for Message Cooperation

[0094] Referring again to FIG. 2, in some embodiments the CF 210 can be assumed to have access to both messages by setting C.sub.in=C*.sub.in=(C*.sub.in.sup.1,C*.sub.in.sup.2), where C*.sub.in.sup.1 and C*.sub.in.sup.2 are sufficiently large. In other embodiments, C.sub.in may be any positive vector (C.sub.in.sub.>0.sup.2). The main result regarding sum-capacity gain, Theorem 6, holds for any C.sub.in.sub.>0.sup.2, whether or not C.sub.in=C*.sub.in. This is proven by proving the result for C.sub.in=C*.sub.in and then using time-sharing, as stated in the lemma below, to obtain inner bounds for any C.sub.in.sub.>0.sup.2, from inner bounds for C*.sub.in. The relevant proof for this lemma appears in U.S. Provisional Patent Application Ser. No. 62/507,925, the relevant disclosure from which is incorporated herein by reference in its entirety.

Lemma 1. Consider a memoryless stationary MAC. For any (C.sub.in,C.sub.out).sub.>0.sup.2.sub.0.sup.2, there exists >0, depending only on C.sub.in, such that for all {0,T1,T,},

C.sub.(C.sub.in,C.sub.out)C.sub.(C.sub.in,0)(C.sub.(C*.sub.in,C.sub.out)C.sub.(C*.sub.in,0)).

[0095] The inner bound can be described for the case There the encoders 202, 204 do not have access to state information. In this case, even though the decoder 210 has access to full state information, a suitable inner bound can be found by applying results where state information is absent at both the encoders 202, 204 and the decoder 210 to a modified channel.

[0096] Specifically, applying the following description of the channel from US Patent Publication No. 2016/0365940 and entitled Communication Systems and Methods of Communicating Utilizing Cooperation Facilitators to Noorzad et al.

(X.sub.1X.sub.2,p(y,s|x.sub.1,x.sub.2),S),

where

p(y,s|x.sub.1,x.sub.2)=p(s)p(y|s,x.sub.1,x.sub.2),

gives an inner bound for the channel p(y|s,x.sub.1,x.sub.2) when full state information is available at the decoder. The relevant disclosure from US Patent Publication No. 2016/0365940 is hereby incorporated by reference in its entirety. Applying Lemma 2 together with the outer bound presented in the section Outer Bounds in the Absence of Cooperation below gives the capacity region in the absence of cooperation (C.sub.out=0) both in the case where no network state information is available at the encoders 202, 204 and in the case where the state information available at the encoders 202, 204 is strictly causal.
Lemma 2. The set of all rate pairs (R.sub.1,R.sub.2) satisfying

R.sub.1I(X.sub.1;Y|S.sub.1,S.sub.2,X.sub.2)

R.sub.2I(X.sub.2;Y|S.sub.1,S.sub.2,X.sub.1)

R.sub.1+R.sub.2I(X.sub.1;X.sub.2;Y|S.sub.1,S.sub.2)

for some distribution p(x.sub.1)p(x.sub.2) with

I(X.sub.1;X.sub.2)C.sub.out.sup.1+C.sub.out.sup.2

and [b.sub.i(X.sub.i)]B.sub.i for i{1,2}, is contained in .sub.0(C*.sub.in,C*.sub.out).

[0097] In the case where the encoders 202, 204 have access to causal state information, the codeword transmitted by an encoder can depend both on its message and the present state information. Lemma 3 provides an inner bound for the capacity region in this scenario. In this inner bound, for i{1,2}, U.sub.i encodes the message of encoder i (202, 204) in addition to the information it receives from the CF 210. Note that this inner bound is tight when C.sub.out=0, even if non-causal state information is available at the encoders 202, 204. As is discussed further below, X.sub.1 and X.sub.2 can be chosen to be deterministic functions of (U.sub.1,S.sub.1) and (U.sub.2,S.sub.2), respectively. A proof of this lemma can be found in U.S. Provisional Patent Application Ser. No. 62/507,925, the disclosure of which is incorporated by reference in its entirety above.

Lemma 3. The set of all rate pairs satisfying

R.sub.1I(U.sub.1;Y|S.sub.1,S.sub.2,U.sub.2)

R.sub.2I(U.sub.2;Y|S.sub.1,S.sub.2,U.sub.1)

R.sub.1+R.sub.2I(U.sub.1,U.sub.2;Y|S.sub.1,S.sub.2)

for some distribution p(u.sub.1,u.sub.2)p(x.sub.1|u.sub.1,s.sub.1)p(x.sub.2|u.sub.2,s.sub.2) with

I(U.sub.1;U.sub.2)C.sub.out.sup.1+C.sub.out.sup.2

and [b.sub.i(X.sub.i)]B.sub.i for i{1,2}, is contained in .sub.T(C*.sub.in,C*.sub.out).

Inner Bound Message and State Cooperation

[0098] As discussed above, message and state cooperation can be considered in the scenario where non-causal state information is available at the encoders 202, 204. In some embodiments, the assumption can be made that the state alphabet S=S.sub.1S.sub.2 is discrete and H(S.sub.1,S.sub.2) is finite. Furthermore, in several embodiments, the CF 210 can be assumed not only to have access to both messages, but also to know the state sequences S.sub.1.sup.n and S.sub.2.sup.n; equivalently, in a number of embodiments the assumption can be made that C.sub.in=C.sub.in=(C.sub.in.sup.1,C.sub.in.sup.2), where C.sub.in.sup.1 and C.sub.in.sup.2 are sufficiently large. A lemma analogous to Lemma 1 holds in this case.

Lemma 4. Fix a memoryless stationary MAC. For any (C.sub.in,C.sub.out).sub.>0.sup.2.sub.0.sup.2, there exists >0, depending only on C.sub.in, such that

C.sub.(,s)(C.sub.in,C.sub.out)C.sub.(,s)(C.sub.in,0)(C.sub.(,s)(C.sub.in,C.sub.out)C.sub.(,s)(C.sub.in,0)),

[0099] A coding strategy for the MAC can also be developed assuming message and state cooperation. In some embodiments, the code is designed using a random code design algorithm as follows.

Codebook Generation. Choose a distribution p(x.sub.1,x.sub.2|s.sub.1,s.sub.2). For i{1,2}, w.sub.i[2.sup.nR.sup.i], z.sub.i[2.sup.nC.sup.out.sup.i], s.sub.i.sup.nS.sub.i.sup.n, generate X.sub.i.sup.n(w.sub.i,z.sub.i|s.sub.i.sup.n) i.i.d. according to the distribution

[00007]$\mathrm{Pr}.Math.\left\{X_i^n\left(w_i,z_i|s_i^n\right)=x_1^n|S_i^n=s_i^n\right\}=\underset{t=1}{\overset{n}{.Math.}}.Math.p\left(x_{\mathrm{it}}|s_{\mathrm{it}}\right).$

Encoding. In some embodiments, the CF 210, having access to (w.sub.1,w.sub.2) and (S.sub.1.sup.n,S.sub.2.sup.n), looks for a pair of cooperation parameters (Z.sub.1,Z.sub.2)[2.sup.nC.sup.out.sup.1][2.sup.nC.sup.out.sup.2] satisfying

(S.sub.1.sup.n,S.sub.2.sup.n,X.sub.1.sup.n(w.sub.1,Z.sub.1|S.sub.1.sup.n),X.sub.2.sup.n(w.sub.2,Z.sub.2|S.sub.2.sup.n))A.sub..sup.(n),(5)

where A.sub..sup.(n) is the weakly typical set with respect to the distribution p(s.sub.1,s.sub.2)p(x.sub.1,x.sub.2|s.sub.1,s.sub.2). If there is more than one such pair, in several embodiments the CF can choose the smallest pair according to the lexicographical order. If there is no such pair, it can set the cooperation parameters (Z.sub.1,Z.sub.2)=(1,1). The CF can send Z.sub.i to encoder i for i{1,2}. Encoder i can then transmit X.sub.i.sup.n(w.sub.i,Z.sub.i|S.sub.i.sup.n) over n uses of the channel.

[0100] Using lemma. A.1.1 on p. 130 of P. Noorzad, Network effects in small networks: A study of cooperation, Ph.D. dissertation, California Institute of Technology, 2017, the disclosure of which including (but not limited to) the disclosure of lemma A.1.1. is hereby incorporated by reference in its entirety, it follows that as n goes to infinity, the probability that a pair (Z.sub.1,Z.sub.2) satisfying (5) exists goes to one if

C.sub.out.sup.1>H(X.sub.1|S.sub.1)H(X.sub.1|S.sub.1,S.sub.2)+24

C.sub.out.sup.2>H(X.sub.2|S.sub.2)H(X.sub.2|S.sub.1,S.sub.2)+24

C.sub.out.sup.1+C.sub.out.sup.2>H(X.sub.1|S.sub.1)+H(X.sub.2|S.sub.2)H(X.sub.1,X.sub.2|S.sub.1,S.sub.2)+6.

Decoding. Once the decoder 206 receives Y.sup.n, using (S.sub.1.sup.n,S.sub.2.sup.n), in several embodiments it can look for a pair (.sub.1,.sub.2) that satisfies

(S.sub.1.sup.n,S.sub.2.sup.n,X.sub.1.sup.n(.sub.1,{circumflex over (Z)}.sub.1|S.sub.1.sup.n),X.sub.2.sup.n(.sub.2,{circumflex over (Z)}.sub.2|S.sub.2.sup.n),Y.sup.n)A.sub..sup.(n).

[0101] Here A.sub..sup.(n) is the weakly typical set with respect to the distribution

p(s.sub.1,s.sub.2)p(x.sub.1,x.sub.2|s.sub.1,s.sub.2)p(y|s.sub.1,s.sub.2,x.sub.1,x.sub.2).

If there is no such pair, or there is such a pair but it is not unique, in a number of embodiments the decoder can set (.sub.1,.sub.2)=(1,1).

[0102] The error analysis of the above coding scheme leads to the following lemma, which provides an inner bound for .sub.,s(C.sub.in,C.sub.out).

Lemma 5. The set of all rate pairs satisfying

R.sub.1I(X.sub.1;Y|S.sub.1,S.sub.2,X.sub.2)

R.sub.2I(X.sub.2;Y|S.sub.1,S.sub.2,X.sub.1)

R.sub.1+R.sub.2I(X.sub.1,X.sub.2;Y|S.sub.1,S.sub.2)

for some distribution p(x.sub.1,x.sub.2|s.sub.1,s.sub.2) with

C.sub.out.sup.1H(X.sub.1|S.sub.1)H(X.sub.1|S.sub.1,S.sub.2)

C.sub.out.sup.2H(X.sub.2|S.sub.2)H(X.sub.2|S.sub.1,S.sub.2)

C.sub.out.sup.1+C.sub.out.sup.2H(X.sub.1|S.sub.1)+H(X.sub.2|S.sub.2)H(X.sub.1,X.sub.2|S.sub.1,S.sub.2)

and [b.sub.i(X.sub.i)]B.sub.i for i{1,2}, is contained in .sub.,s(C.sub.in,C.sub.out).

Multiple Access Channels that Experience Sum-capacity Gains Using Cooperation Facilitators

[0103] In light of the inner and outer bounds described above with respect to different availability of network state information and/or type of network state information, the following discussion identifies conditions on a MAC that, if satisfied, for every fixed C.sub.in.sub.>0.sup.2, guarantee an infinite slope in sum-capacity as a function of C.sub.out. As sum-capacity depends on the availability of state formation at the encoders 202, 204, so do the identified conditions. These conditions, here denoted by C.sub.(S,X.sub.1,X.sub.2,) are described in the sections below.

Theorem 6. Let S, X.sub.1, X.sub.2, and be finite sets. For any {0,T1,T,,(,s)}, any MAC in C.sub.(S,X.sub.1,X.sub.2,), and any (C.sub.in,v).sub.>0.sup.2.sub.>0.sup.2,

[00008]$\underset{h.fwdarw.0^{+}}{\lim }.Math.\frac{C_{}.Math.\left(C_{i.Math..Math.n},\mathrm{hv}\right)-C_{}\left(C_{i.Math..Math.n},0\right)}{h}=.$

[0104] The relevant proof for the above theorem appears in U.S. Provisional Patent Application Ser. No. 62/507,925, the relevant disclosure from which is incorporated herein by reference in its entirety.

[0105] C.sub.(S,X.sub.1,X.sub.2,) can be specifically defined for each subscript {0,T1,T,,(,s)}, where specifies the availability of state information at the encoders. Note that the definition of C.sub. provides sufficient conditions for a large cooperation gain; these conditions may not be necessary.

[0106] In the descriptions below, all mentioned distributions satisfy

[b.sub.i(X.sub.i)]B.sub.i for i{1,2}.

Non-CSI Cooperation

[0107] A number of classes of MACs, which exhibit a large message cooperation gain as described in Theorem 6, can be identified. In many embodiments, systems that operate with respect to these classes of MACs employ non-CSI (Channel-State-Information) cooperation.

No state information. A MAC is in C.sub.0(S,X.sub.1,X.sub.2,) if

[0108] (i) for some p.sub.0(x.sub.1)p.sub.0(x.sub.2) that satisfies

[00009]$I_0\left(X_1,X_2;Y|S\right)=\underset{p\left(x_1\right).Math.p\left(x_2\right)}{\max }.Math.I\left(X_1,X_2;Y|S\right),$

there exists p.sub.1(x.sub.1,x.sub.2) that satisifes

I.sub.1(X.sub.1,X.sub.2;Y|S)+[D(p.sub.1(y|S)p.sub.0(y|S))]>I.sub.0(X.sub.1,X.sub.2;Y|S); and

[0109] (ii) supp(p.sub.1(x.sub.1,x.sub.2)).Math.supp(p.sub.0(x.sub.1)p.sub.0(x.sub.2)), where supp denotes the support.

[0110] Intuitively, condition (i) ensures that a channel has the property that the dependence created through message cooperation increases sum-capacity. Condition (ii) allows the CF 210 to use a small rate (i.e., small C.sub.out) to help the encoders 202, 204, whose codewords are generated according to p.sub.0(x.sub.1)p.sub.0(x.sub.2), to transmit codewords whose distribution is sufficiently close to p.sub.1(x.sub.1,x.sub.2) to achieve a large gain in sum-capacity.

Strictly causal state information. As mentioned above, the availability of strictly causal state information at the encoders of a MAC without cooperation does not enlarge the capacity region, thus C.sub.T-1(S,X.sub.1,X.sub.2,):=C.sub.0(S,X.sub.1,X.sub.2,).
Causal state information. A MAC is in C.sub.T(S,X.sub.1,X.sub.2,) if

[0111] (i) for some p.sub.0(x.sub.1|s.sub.1)p.sub.0(x.sub.2|s.sub.2) that satisfies

[00010]$I_0\left(X_1,X_2;Y|S\right)=\underset{p\left(x_1|s_1\right).Math.p\left(x_2|s_2\right)}{\max }.Math.I\left(X_1,X_2;Y|S\right),$

there exists alphabets .sub.1, .sub.2, distributions p.sub.0(u.sub.1)p.sub.0(u.sub.2) and p.sub.1(u.sub.1,u.sub.2), and mappings f.sub.i:

[00011]$\begin{array}{cc}.Math.{}_i.fwdarw.{}_i.Math..Math.\mathrm{for}.Math..Math.i\left\{1,2\right\}.Math..Math.\mathrm{such}.Math..Math.\mathrm{that}& \\ .Math.p_0\left(x_1|s_1\right).Math.p_0\left(x_2|s_2\right)=\underset{u_1,u_2}{.Math.}.Math.p_0\left(u_1\right).Math.p_0\left(u_2\right).Math.1.Math..Math..Math.\left\{x_1=f_1\left(u_1,s_1\right)\right\}.Math.1.Math.\left\{x_2=f_2\left(u_2,s_2\right)\right\},& \left(6\right)\\ I_1\left(U_1,U_2;Y|S\right)+[D\left(p_1\left(y|S\right).Math..Math.p_0\left(y|S\right))\right]>I_0\left(U_1,U_2;Y|S\right),.Math..Math.\mathrm{and}& \left(7\right)\\ .Math.\left(\mathrm{ii}\right).Math.\mathrm{supp}\left(p_1\left(u_1,u_2\right)\right).Math.\mathrm{supp}\left(p_0\left(u_1\right).Math.p_0\left(u_2\right)\right).& \end{array}$

[0112] In (7), the expressions are calculated using the input distributions

p.sub.0(u.sub.0)p.sub.0(u.sub.2)1{x.sub.1=f.sub.1(u.sub.1,s.sub.1)}1{x.sub.2=f.sub.2(u.sub.2,s.sub.2)}, and

p.sub.1(u.sub.1,u.sub.2)1{x.sub.1=f.sub.1(u.sub.u,s.sub.1)}1{x.sub.2=f.sub.2(u.sub.2,s.sub.2)}.

Non-causal state information. In the absence of cooperation, the capacity region is the same regardless of whether the state information at the encoders is causal or non-causal. Thus, similar to the strictly causal case, C.sub.(S,X.sub.1,X.sub.2,):=C.sub.T(S,X.sub.1,X.sub.2,).

CSI Based Cooperation

[0113] Conditions can be expressed that are sufficient for a CF to achieve a large gain using joint message and state cooperation.

Non-causal state information. A MAC is in C.sub.,s(S,X.sub.1,X.sub.2,) if

[0114] (i) for some p.sub.0(x.sub.1/|s.sub.1)p.sub.0(x.sub.2|s.sub.2) that satisfies

[00012]$I_0\left(X_1,X_2;Y|S\right)=\underset{p\left(x_1|s_1\right).Math.p\left(x_2|s_2\right)}{\max }.Math.I\left(X_1,X_2;Y|S\right),$

there exists p.sub.1(x.sub.1,x.sub.2|s.sub.1,s.sub.2) that satisfies

I.sub.1(X.sub.1,X.sub.2;Y|S)+[D(p.sub.1(y|S)p.sub.0(y|S))]>I.sub.0(X.sub.1,X.sub.2;Y|S), and

[0115] (ii) for all (s.sub.1,s.sub.2)S, supp(p.sub.1(x.sub.1,x.sub.2|s.sub.1,s.sub.2)).Math.supp(p.sub.0(x.sub.1|s.sub.1)p.sub.0(x.sub.2|s.sub.2)).

Example: Gaussian MAC with Binary Fading

[0116] While Theorem 6 is stated only for finite alphabet MACs, the esu is not limited to such MACs. Specifically, for a given MAC, the inner bounds described above can be used to calculate an inner bound for sum-capacity and verify be result of Theorem 6 directly.

[0117] Assume for example, that the MAC 208 in FIG. 2 represents wireless communication between the two encoders 202, 204 and the decoder 206 in the presence of binary fading. The input-output relationship of this MAC 208 can be given by

Y=S.sub.1X.sub.1+S.sub.2X.sub.2+Z,

where (S.sub.1,S.sub.2) is uniformly distributed on {0,1}.sup.2, and Z is a Gaussian random variable with mean zero and variance N. In addition, for i{1,2} the cost function can be set to b.sub.i(x)=x.sup.2 subject to the cost constraint B.sub.i=P.sub.i, so that the cost constraints correspond to the usual power constraints of the Gaussian MAC.
Proposition 7. Consider the Gaussian MAC with binary fading. Fix (C.sub.in,v).sub.>0.sup.2.sub.>0.sup.2. Then for all {0,T1,T,,(,s)},

[00013]$\underset{h.fwdarw.0^{+}}{\lim }.Math.\frac{C_{}.Math.\left(C_{i.Math..Math.n},\mathrm{hv}\right)-C_{}\left(C_{i.Math..Math.n},0\right)}{h}=.$

[0118] The relevant proof for the above proposition appears in U.S. Provisional Patent Application Ser. No. 62/507,925, the relevant disclosure from which is incorporated herein by reference in its entirety

[0119] As the above proposition indicates, the use of a CF that facilitates joint message and network state cooperation can result in an increase in sum-capacity has infinite slope in the iiniit of small cooperation rate. Just as the analysis presented above in the content of the discussion of FIG. 2 establishes that utilization of a CF in a network in which network state is available through joint message and state cooperation can achieve significant benefits in a Gaussian MAC with binary fading, similar analysis can be utilized to demonstrate the benefit of joint message and state cooperation in a variety of MACs and network architectures including (but not limited to) MACs that are shared by more than two encoders. CFs and processes for performing joint message and network state cooperation within a network in which network state information is available in accordance with various embodiments of the invention are discussed further below.

Cooperation Facilitator Controllers

[0120] Cooperation Facilitator controllers which implement network state based cooperation applications in accordance with many embodiments of the invention arc described in FIG. 3. In several embodiments, Cooperation Facilitator (CF) controller 300 can coordinate the transmission of data among nodes in a network to improve performance including rate and/or reliability based upon message and/or network state information received from transmitters utilizing a MAC within the network. The CF controller can include at least one processor 302, an I/O interface 304, and memory 306. In many embodiments, the memory 306 includes software including a joint message and state cooperation application 308, as well as message information 310, network state information 312, and cooperation parameters 312. As noted above, the cooperation parameters are encoded, because simply forwarding message and/or network state information is unlikely to yield an increase in sum-capacity greater than the rate used to send those parameters. Processes that can be utilized to encode cooperation parameters in accordance with various embodiments of the invention are discussed above. As can readily be appreciated, the specific encoding process can depend upon whether the network state information is unavailable, is strictly causal, causal or non-causal and upon the requirements of a specific network.

[0121] Although a variety of CF controllers are described above with reference to FIG. 3, any of a variety of CF controllers for implementing joint message and network state cooperation can be utilized as appropriate to the requirements of specific applications in accordance with various embodiments of the invention. Processes for utilizing CFs to achieve joint message and network state cooperation are discussed further below.

Processes for Facilitating Joint Message and Network State Cooperation

[0122] An overview of a coordinated data transmission process 400 that utilizes a CF to encode cooperation parameters using message and network state information received from multiple transmitters that share a MAC in accordance with several embodiments of the invention is illustrated in FIG. 4. Message and/or at least partial network state information can be passed 402 from encoders to the cooperation facilitator. As noted above, messages received from an encoder can lack any state information or contain strictly causal state information, causal state information, or non-causal state information. Generally, message parameters are part of the messages being encoded by the system. In various embodiments two encoders are utilized. As can readily be appreciated, CFs can also be used with more than two encoders/transmitters. The CF determines 404 cooperation parameters by encoding the message and network state information. The cooperation parameters provided to the encoders enable the encoders to generate code words based both on their own message and the network state. The generation of cooperation parameters is discussed in greater detail below. The CF sends 406 cooperation parameters to encoders. Encoders encode 408 message data utilizing the cooperation parameters in a manner that results in the codewords being selected in a manner that is dependent both upon messages transmitted by other transmitters and network state information. In some embodiments, data is transmitted 410 over a multiple access channel (MAC) to one or more decoders. The decoder decodes 412 the data using network state information and the channel output.

[0123] In many embodiments, the use of a CF can improve data transmission. In some embodiments, for example in noisy environments, the rate of data transmission can be increased. In many other embodiments, the reliability of data transmissioncan be increased. Increase in data rate and increase in data reliability will be discussed in further detail below. Although a variety of data transmission processes are described above with reference to FIG. 4, any of a variety of processes for coordinated data transmission that achieve joint message and network state cooperation can be utilized as appropriate to the requirements of specific applications in accordance with embodiments of the invention. Processes that can be utilized by CFs to achieve joint message and network state cooperation in accordance with various embodiments of the invention are discussed further below.

Processes for Achieving Joint Message and State Cooperation

[0124] A process 500 for coordinating joint message and state cooperation that can be performed by a cooperation facilitator node in accordance with an embodiment of the invention is illustrated in FIG. 5. The CF receives 502 at least partial message and at least partial network state information from a number of encoders. Cooperation parameters are determined 504 from the message and network state information. In several embodiments, cooperation parameters are generated by the CF that enable encoders to select codewords that encode user data in a manner that is dependent upon messages transmitted by other transmitters via the MAC and network state information. Stated another way, they enable encoders within a system to create dependence among independently generated codewords, and specifically dependence that is a function of network state. Cooperation parameters are sent 506 to the encoders. In various embodiments, two encoders are utilized. In many embodiments, more than two encoders are utilized.

[0125] Although a variety of processes for achieving joint message and network state cooperation are described above with reference to FIG. 5, any of a variety of processes to coordinate cooperation in a data transmission network based upon network state can be utilized as appropriate to the requirements of specific applications in accordance with various embodiments of the invention. Processes for encoding data based upon cooperation parameters are discussed below.

Encoding Processes

[0126] An encoding process 600 that utilizes data from a CF to select codewords in a manner that makes the codewords dependent upon codewords selected by other encoders sharing a MAC and the network state in accordance with various embodiments of the invention is illustrated in FIG. 6. Data parameters are determined 602 from user data received by the encoder. User or input data generally is the message and/or messages to be encoded. As noted above, encoders can lack any state information or have access to strictly causal state information, causal state information, or non-causal state information. The encoder can pass 604 available message and network state information to a CF, which utilizes the received information in a cooperation facilitator process similar to any of the processes described above with respect to FIG. 5. Cooperation parameters are received 606 from the CF. In several embodiments, coordinating parameters are generated by the CF to enable coordinated data transmission within the system. Input data can be encoded 608 by the encoder using the cooperation parameters. In several embodiments, the cooperation parameters enable the encoder to encode 608 user data in a manner that is dependent upon messages transmitted by other transmitters via the MAC and network state information. As noted above, they enable encoders within a system to create dependence among independently generated codewords.

[0127] Although a variety of encoding processes are described above with reference to FIG. 6, any of a number of processes for encoding input data based upon cooperation parameters so that the encoded data is encoded in a manner that is dependent upon network state can be utilized as appropriate to the requirements of specific applications in accordance with various embodiments of the invention. For example, communication between the CF and encoders can happen in parallel with the transmission over the MAC. In many embodiments, the encoders can use a small part of the cooperation rate to communicate with the CF, then send a single symbol over the channel (instead of the entire codeword), then communicate with the CF again before sending their second symbol over the channel, and so on. Accordingly, the processes described herein should not be regarded as limiting and simply illustrative implementations of various embodiments of the invention.

[0128] Although the present invention has been described in certain specific aspects, many additional modifications and variations would be apparent to those skilled in the art. For example, the discussion provided above references use of cooperation facilitators in the context of Guassian MACs including binary fading. Cooperation facilitators that achieve joint message and network state cooperation in accordance with various embodiments of the invention can improve network performance in a variety of contexts involving shared resources including (but not limited to) other channel types. Furthermore, although specific techniques for building code books are described above, the processes presented herein can be utilized to generate code books that can be readily implemented in encoders used in typical communication devices to achieve low latency encoding of message data based upon data received from communication facilitators. It is therefore to be understood that the present invention can be practiced otherwise than specifically described without departing from the scope and spirit of the present invention. Thus, embodiments of the present invention should be considered in all respects as illustrative and not restrictive. Accordingly, the scope of the invention should be determined not by the embodiments illustrated, but by the appended claims and their equivalents.