Method and apparatus for optimization of wireless multipoint electromagnetic communication networks

• US 7,248,841 B2
• Filed: 06/10/2001
• Issued: 07/24/2007
• Est. Priority Date: 06/13/2000
• Status: Expired due to Term

• Current Assignee: Comcast Cable Communications LLC (Comcast Corporation)
• Original Assignee: Brian G. Agee, Matthew C. Bromberg
• Inventors: Agee, Brian G., Bromberg, Matthew C.
• Primary Examiner(s): Vu, Huy D.
• Assistant Examiner(s): Wong, Blanche
• Application Number:
  US09/878,789
• Publication Number:
  US 20040095907A1
• Time in Patent Office: 2,235 Days
• Field of Search: 455/101, 455/132, 455/272, 455/273, 455/277.1, 455/277.2, 455/278.1
• US Class Current: 455/101
• CPC Class Codes: H04B 7/0408 using two or more beams, i.e. beam diversity
• CPC Class Codes: H04B 7/0417 Feedback systems
• CPC Class Codes: H04B 7/0443 utilizing "waterfilling" technique
• CPC Class Codes: H04B 7/0465 taking power constraints at power amplifier or emission constraints, e.g. constant modulus, into account
• CPC Class Codes: H04B 7/10 Polarisation diversity; Directional diversity
• CPC Class Codes: H04W 16/14 Spectrum sharing arrangements between different networks
• CPC Class Codes: H04W 24/02 Arrangements for optimising operational condition
• CPC Class Codes: H04W 28/06 Optimizing the usage of the radio link, e.g. header compression, information sizing , discarding information system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365
• CPC Class Codes: H04W 52/42 in systems with time, space, frequency or polarisation diversity

Abstract

Exploiting the substantive reciprocity of internode channel responses through dynamic, adaptive modification of receive and transmit weights, enables locally enabled global optimization of a multipoint, wireless electromagnetic communications network of communication nodes. Each diversity-channel-capable node uses computationally efficient exploitation of pilot tone data and diversity-adaptive signal processing of the weightings and the signal to further convey optimization and channel information which promote local and thereby network-global efficiency. The preferred embodiment performs complex digital signal manipulation that includes a linear combining and linear distribution of the transmit and receive weights, the generation of piloting signals containing origination and destination node information, as well as interference-avoiding pseudorandom delay timing, and both symbol and multitone encoding, to gain the benefit of substantive orthogonality at the physical level without requiring actual substantive orthogonality at the physical level.

Claims

1. A method for optimizing a wireless electromagnetic communications network, comprising:

organizing a wireless electromagnetic communications network comprising

a set of nodes, said set of nodes further comprising,

at least a first subset wherein each node is MIMO-capable, comprising;

a spatially diverse antennae array of M antennae, where M≧

one,

a transceiver for each antenna in said spatially diverse antennae array,

means for digital signal processing to convert analog radio signals into digital signals and digital signals into analog radio signals,

means for coding and decoding data, symbols, and control information into and from digital signals,

diversity capability means for transmission and reception of said analog radio signals,

and,

means for input and output from and to a non-radio interface for digital signals;

linking said set of nodes according to design rules that create and support a condition of network reciprocity by meeting the first of the following criteria, and at least two out of five of the remaining following criteria;

subdividing said set of nodes into two or more proper subsets of nodes, with a first proper subset being a transmit uplink/receive downlink subset, and a second proper subset being a transmit downlink/receive uplink subset;

allowing each node in said set of nodes to simultaneously belong to up to as many transmitting uplink or receiving uplink subsets as it has diversity capability means;

allowing each node in the transmit uplink/receive downlink subset to simultaneously link to up to as many nodes with which it will hold time and frequency coincident communications in its field of view, as it has diversity capability means;

allowing each node in the transmit downlink/receive uplink subset to simultaneously link to up to as many nodes with which it will hold time and frequency coincident communications in its field of view, as it has diversity capability means;

allowing each member of the transmit uplink/receive downlink subset to engage in simultaneous, time and frequency coincident communications with any other member of that transmit uplink/receive downlink subset only if both that other member also belongs to a different proper subset and the communication is between different proper subsets;

and,

allowing each member of the transmit downlink/receive uplink subset to engage in simultaneous, time and frequency coincident communications with any other member of that transmit downlink/receive uplink subset if both that other member also belongs to a different proper subset and the communication is between different proper subsets;

transmitting, in said wireless electromagnetic communications network, independent information from each node belonging to a first proper subset, to one or more receiving nodes belonging to a second proper subset that are viewable from the transmitting node;

processing independently, in said wireless electromagnetic communications network, at each receiving node belonging to said second proper subset, information transmitted from one or more nodes belonging to said first proper subset;

and,

dynamically adapting the diversity capability means and said proper subsets to optimize said network.

3. A method as in claim 1, wherein dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

using substantive null steering to minimize Signal-to-Interference-and-Noise-Ratio (SINR) between nodes transmitting and receiving information.

4. A method as in claim 1, wherein dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

using max-SINR null- and beam-steering to minimize intra-network interference.

5. A method as in claim 1, wherein dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

using MMSE null- and beam-steering to minimize intra-network interference.

6. A method as in claim 1, wherein dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

designing the network such that reciprocal symmetry exists for each pairing of uplink receive and downlink receive proper subsets.

7. A method as in claim 1, wherein dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

designing the network such that substantial reciprocal symmetry exists for each pairing of uplink receive and downlink receive proper subsets.

8. A method as in claim 1, wherein the network uses TDD communication protocols.

9. A method as in claim 1, wherein the network uses FDD communication protocols.

10. A method as in claim 3, wherein the network uses simplex communication protocols.

11. A method as in claim 1, wherein the network uses random access packets, and receive and transmit operations are all carried out on the same frequency channels for each link.

12. A method as in claim 1, wherein dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises

if the received interference is spatially white in both link directions, setting

g₂(q)∝

w₂*(q) and g₁(q)∝

w₁*(q) at both ends of the link,

where

{g₂(q), w₁(q)} are the linear transmit and receive weights used in the downlink;

but if the received interference is not spatially white in both link directions, constraining {g₁(q)} and [{g₂(q)} to preferentially satisfy;

$\begin{array}{c}\underset{q=1}{\overset{Q_{21}}{\sum <br><br>}}<br><br>g_1^T<br><br>\left(q\right)<br><br>R_{\mathrm{i1i1}}<br><br>\left[n_1<br><br>\left(q\right)\right]<br><br>g_1^{*}<br><br>\left(q\right)=\underset{n=1}{\overset{N_1}{\sum <br><br>}}<br><br>T<br><br><br><br>r<br><br>\left\{R_{\mathrm{i1i1}}<br><br>\left(n\right)\right\}=M_1<br><br>R_1\\ \underset{q=1}{\overset{Q_{12}}{\sum <br><br>}}<br><br>g_2^T<br><br>\left(q\right)<br><br>R_{\mathrm{i2i2}}<br><br>\left[n_2<br><br>\left(q\right)\right]<br><br>g_2^{*}<br><br>\left(q\right)=\underset{n=1}{\overset{N_2}{\sum <br><br>}}<br><br>T<br><br><br><br>r<br><br>\left\{R_{\mathrm{i2i2}}<br><br>\left(n\right)\right\}=M_2<br><br>R_2.\end{array}$

13. A method as in claim 1, wherein:

a proper subset may incorporate one or more nodes that are in a receive-only mode for every diversity capability means.

14. A method as in claim 1, wherein:

the network may dynamically reassign a node from one proper subset to another.

15. A method as in claim 1, wherein:

the network may dynamically reassign a proper subset of nodes from one proper subset to another.

16. A method as in claim 7, wherein the step of designing the network such that substantial reciprocal symmetry exists for the uplink and downlink channels further comprises:

if the received interference is spatially white in both link directions, setting g₂(q)∝

w₂*(q) and g₁(q)∝

w₁*(q) at both ends of the link, where {g₂(q),w₁(q)} are the linear transmit and receive weights used in the downlink;

but if the received interference is not spatially white in both link directions, constraining {g₁(q)} and {g₂(q)} to preferentially satisfy;

$\begin{array}{c}\underset{q=1}{\overset{Q_{21}}{\sum <br><br>}}<br><br>g_1^T<br><br>\left(q\right)<br><br>R_{\mathrm{i1i1}}<br><br>\left[n_1<br><br>\left(q\right)\right]<br><br>g_1^{*}<br><br>\left(q\right)=\underset{n=1}{\overset{N_1}{\sum <br><br>}}<br><br>T<br><br><br><br>r<br><br>\left\{R_{\mathrm{i1i1}}<br><br>\left(n\right)\right\}=M_1<br><br>R_1\\ \underset{q=1}{\overset{Q_{12}}{\sum <br><br>}}<br><br>g_2^T<br><br>\left(q\right)<br><br>R_{\mathrm{i2i2}}<br><br>\left[n_2<br><br>\left(q\right)\right]<br><br>g_2^{*}<br><br>\left(q\right)=\underset{n=1}{\overset{N_2}{\sum <br><br>}}<br><br>T<br><br><br><br>r<br><br>\left\{R_{\mathrm{i2i2}}<br><br>\left(n\right)\right\}=M_2<br><br>R_2.\end{array}$

17. A method as in claim 1, wherein dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises

using at each node the receive combiner weights as transmit distribution weights during subsequent transmission operations, so that the network is preferentially designed and constrained such that each link is substantially reciprocal, such that the ad hoc network capacity measure can be made equal in both link directions by setting at both ends of the link:

g₂(k,q)∝

w₂*(k,q) and g₁(k,q)∝

w₁*(k,q), where {g₂(k,q), w₁(k,q)} are the linear transmit and receive weights to transmit data d₂(k,q) from node n₂(q) to node n₁(q) over channel k in the downlink, and where {g₁(k,q),w₂(k,q)} are the linear transmit and receive weights used to transmit data d₁(k,q) from node n₁(q) back to node n₂(q) over equivalent channel k in the uplink.

18. A method as in claim 1, wherein the step of linking said set of nodes according to design rules further comprises:

designing the topological, physical layout of nodes to support the criteria within the node'"'"'s diversity capability means'"'"' limitations.

19. A method as in claim 1, wherein the step of linking said set of nodes according to design rules further comprises:

designing the topological, physical layout of nodes to support the criteria within the node'"'"'s diversity capability means'"'"' limitations.

20. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

allowing a proper subset to send redundant data transmissions over multiple frequency channels to another proper subset.

21. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

allowing a proper subset to send redundant data transmissions over multiple simultaneous or differential time slots to another proper subset.

22. A method as in claim 1, wherein the step of linking and substep of subdividing said set of nodes into two or more proper subsets of nodes, does so using as the diversity capability means for transmission and reception of said analog radio signals spatial diversity of antennae.

23. A method as in claim 1, wherein the step of linking and substep of subdividing said set of nodes into two or more proper subsets of nodes, does so using as the diversity capability means for transmission and reception of said analog radio signals polarization diversity of antennae.

24. A method as in claim 1, wherein the step of linking and substep of subdividing said set of nodes into two or more proper subsets of nodes, does so using as the diversity capability means for transmission and reception of said analog radio signals any combination of temporal, spatial, and polarization diversity of antennae.

25. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

incorporating network control and feedback aspects as part of the signal encoding process.

26. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

incorporating network control and feedback aspects as part of the signal encoding process and including said as network information in one direction of the signalling and optimization process, using the perceived environmental condition'"'"'s effect upon the signals in the other direction of the signalling and optimization process.

27. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

adjusting the diversity capability means use between any proper sets of nodes by rerouting any active link based on perceived unacceptable SINR experienced on that active link and the existence of an alternative available link using said adjusted diversity capability means.

28. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

switching a particular node from one proper subset to another due to changes in the external environment affecting links between that node and other nodes in the network.

29. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

dynamically reshuffling proper subsets to more closely attain network objectives by taking advantage of diversity capability means availability.

30. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

dynamically reshuffling proper subsets to more closely attain network objectives by accounting for node changes.

31. A method as in claim 30, wherein said node changes include any of:

adding diversity capability means to a node, adding a new node within the field of view of another node, removing a node from the network (temporarily or permanently), or losing diversity capability at a node.

32. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

suppressing unintended recipients or transmitters by the imposition of signal masking.

33. A method as in claim 32, wherein the step of suppressing unintended recipients or transmitters by the imposition of signal masking further comprises:

imposition of an origination mask.

34. A method as in claim 32, wherein the step of suppressing unintended recipients or transmitters by the imposition of signal masking further comprises:

imposition of any combination of origination and recipient masks.

35. A method as in claim 32, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

using signal masking to secure transmissions against unintentional, interim interception and decryption by the imposition of a signal mask at origination, the transmission through any number of intermediate nodes lacking said signal mask, and the reception at the desired recipient which possesses the correct means for removal of the signal mask.

36. A method as in claim 35, wherein the signal masking is shared by a proper subset.

37. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

heterogeneous combination of a hierarchy of proper subsets, one within the other, each paired with a separable subset wherein the first is a transmit uplink and the second is a transmit downlink subset, such that the first subset of each pair of subsets is capable of communication with the members of the second subset of each pair, yet neither subset may communicate between its own members.

38. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

using as many of the available diversity capability means as are needed for traffic between any two nodes from 1 to NumChannels, where NumChannels equals the maximal diversity capability means between said two nodes.

39. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

using a water-filling algorithm to route traffic between an origination and destination node through any intermediate subset of nodes that has available diversity capability means capacity.

41. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

optimizing at each node acting as a receiver the receive weights using a MMSE technique to adjust the multitone transmissions between it and other nodes.

42. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

optimizing at each node acting as a receiver the receive weights using the maximum SINR to adjust the multitone transmissions between it and other nodes.

43. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

optimizing at each node acting as a receiver the receive weights, then optimizing the transmit weights at that node by making them proportional to the receive weights, and then optimizing the transmit gains for that node by a max-min criterion for the link capacities for that node at that particular time.

44. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

including, as part of said network, one or more network controller elements that assist in tuning local node'"'"'s maximum capacity criteria and link channel diversity usage to network constraints.

45. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

characterizing the channel response vector a₁(f,t;

n₂,n₁) by the observed (possibly time-varying) azimuth and elevation {θ

₁(t;

n₂,n₁), φ

₁(f,t;

n₂, n₁)} of node n₂ observed at n₁.

46. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

characterizing the channel response vector a₁(f,t;

n₂,n₁) as a superposition of direct-path and near-field reflection path channel responses, e.g., due to scatterers in the vicinity of n₁, such that each element of a₁(f,t;

n₂,n₁) can be modeled as a random process, possibly varying over time and frequency.

47. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

presuming that a₁(f,t;

n₂,n₁) and a₁(f,t;

n₁,n₂) can be substantively time invariant over significant time durations, e.g., large numbers of OFDM symbols or TDMA time frames, and inducing the most significant frequency and time variation by the observed timing and carrier offset on each link.

48. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

in such networks, e.g., TDD networks, wherein the transmit and receive frequencies are identical (f₂₁(k)=f₁₂(k)=f(k)) and the transmit and receive time slots are separated by short time intervals (t₂₁(l)=t₁₂(l)+Δ

₂₁≈

t(l)), and H₂₁(k,l) and H₁₂(k,l) become substantively reciprocal, such that the subarrays comprising H₂₁(k,l) and H₁₂(k,l) satisfy H₂₁(k,l;

n₂,n₁)≈

δ

₂₁(k,l;

n₁,n₂) H^T₁₂(k,l;

n₁,n₂), where δ

₂₁(k,l;

n₁,n₂) is a unit-magnitude, generally nonreciprocal scalar, equalizing the observed timing offsets, carrier offsets, and phase offsets, such that λ

₂₁(n₂,n₁)≈

λ

₁₂(n₁,n₂), τ

₂₁(n₂,n₁)≈

τ

₁₂(n₁,n₂), and ν

₂₁(n₁,n₂)≈

ν

₁₂(n₁,n₂), by synchronizing each node to an external, universal time and frequency standard, obtaining δ

₂₁(k,l;

n₂,n₁)≈

1, and establishing network channel response as truly reciprocal H₂₁(k,l)≈

H^T₁₂(k,l).

49. A method as in claim 48, wherein the synchronization of each node is to Global Position System Universal Time Coordinates (GPS UTC).

50. A method as in claim 48, wherein the synchronization of each node is to a network timing signal.

51. A method as in claim 48, wherein the synchronization of each node is to a combination of Global Position System Universal Time Coordinates (GPS UTC) and a network timing signal.

52. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

for such parts of the network where the internode channel responses possess substantive multipath, such that H₂₁(k,l;

n₂,n₁) and H₁₂(k,l;

n₁,n₂) have rank greater than unity, making the channel response substantively reciprocal by;

(1) forming uplink and downlink transmit signals using the matrix formula

s₁(k,l;

n₁)=G₁(k,l;

n₁)d₁(k,l;

n₁)

s₂(k,l;

n₁)=G₂(k,l;

n₂)d₂(k,l;

n₂);

(2) reconstructing the data intended for each receive node using the matrix formula

y₁(k,l;

n₁)=W^H₁(k,l;

n₁)x₁(k,l;

n₁)

y₂(k,l;

n₂)=W^H₂(k,l;

n₂)x₂(k,l;

n₂);

(3) developing combiner weights that {w₁(k,l;

n₂,n₁)} and {w₂(k,l;

n₁,n₂)} that substantively null data intended for recipients during the symbol recovery operation, such that for n₁≠

n₂;

(4) developing distribution weights {g₁(k,l;

n₂,n₁)} and {g₂(k,l;

n₁,n₂)} that perform equivalent substantive nulling operations during transmit signal formation operations;

(5) scaling distribution weights to optimize network capacity and/or power criteria, as appropriate for the specific node topology and application addressed by the network;

(6) removing residual timing and carrier offset remaining after recovery of the intended network data symbols;

and

(7) encoding data onto symbol vectors based on the end-to-end SINR obtainable between each transmit and intended recipient node, and decoding that data after symbol recovery operations, using channel coding and decoding methods develop in prior art.

53. A method as in claim 1, wherein dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

forming substantively nulling combiner weights using an FFT-based least-squares algorithms that adapt {w₁(k,l;

n₂,n₁)} and {w₂(k,l;

n₁,n₂)} to values that minimize the mean-square error (MSE) between the combiner output data and a known segment of transmitted pilot data;

applying the pilot data to an entire OFDM symbol at the start of an adaptation frame comprising a single OFDM symbol containing pilot data followed by a stream of OFDM symbols containing information data;

wherein the pilot data transmitted over the pilot symbol is preferably given by

p₁(k;

n₂,n₁)=d₁(k,l;

n₂,n₁)

=p₀₁(k)p₂₁(k;

n₂)p₁₁(k;

n₁)

p₂(k;

n₁,n₂)=d₂(k,l;

n₁,n₂)

=p₀₂(k)p₁₂(k;

n₁)p₂₂(k;

n₂)

such that the “

pseudodelays”

δ

₁(n₁) and δ

₂(n₂) are unique to each transmit node (in small networks), or provisioned at the beginning of communication with any given recipient node (in which case each will be a function of n₁ and n₂), giving each pilot symbol a pseudorandum component;

maintaining minimum spacing between any pseudodelays used to communicate with a given recipient node that is larger than the maximum expected timing offset observed at that recipient node, said spacing should also being an integer multiple of 1/K, where K is the number of tones used in a single FFT-based LS algorithm;

and if K is not large enough to provide a sufficiency of pseudodelays, using additional OFDM symbols for transmission of pilot symbols, either lengthening the effective value of K, or reducing the maximum number of originating nodes transmitting pilot symbols over the same OFDM symbol;

also providing K large enough to allow effective combiner weights to be constructed from the pilot symbols alone;

then obtaining the remaining information-bearing symbols, which are the uplink and downlink data symbols provided by prior encoding, encryption, symbol randomization, and channel preemphasis stages, in the adaptation frame, by using

d₁(k,l;

n₂,n₁)=p₁(k;

n₂,n₁)d₀₁(k,l;

n₂,n₁)

d₂(k,l;

n₁,n₂)p₂(k;

n₁,n₂)d₀₂(k,l;

n₁,n₂);

removing at the recipient node, first the pseudorandom pilot components from the received data by multiplying each tone and symbol by the pseudorandom components of the pilot signals, using

d₂(k,l;

n₁,n₂)=p₂(k;

n₁,n₂)d₀₂(k,l;

n₁,n₂)

x₀₂(k,l;

n₂)=c₀₁(k;

n₂)x₂(k,l;

n₂);

thereby transforming each authorized and intended pilot symbol for the recipient node into a complex sinusoid with a slope proportional to the sum of the pseudodelay used during the pilot generation procedure, and the actual observed timing offset for that link, and leaving other, unauthorized pilot symbols, and symbols intended for other nodes in the network, untransformed and so appearing as random noise at the recipient node.

54. A method as in claim 52, wherein the FFT-Least Squares algorithm further comprises:

using a pilot symbol, which is multiplied by a unit-norm FFT window function;

passing that result to a QR decomposition algorithm and computing orthogonalized data {q(k)} and an upper-triangular Cholesky statistics matrix R;

then multiplying each vector element of {q(k)} by the same unit-norm FFT window function and passing it through a zero-padded inverse Fast Fourier Transform (IFFT) with output length PK, with padding factor P to form uninterpolated, spatially whitened processor weights {u(m)}, where lag index m is proportional to target pseudodelay δ

(m)=m/PK;

then using the spatially whitened processor weights to estimate the mean-square-error (MSE) obtaining for a signal received at each target pseudodelay, ε

(m)=1−

∥

u(m)∥

², yielding a detection statistic (pseudodelay indicator function), with an extreme at IFFT lags commensurate with the observed pseudodelay and designed to minimize interlag interference between pilot signal features in the pseudodelay indicator function;

using an extremes-finding algorithm to detect each extreme;

estimating the location of the observed pseudodelays to sub-lag accuracy;

determining additional ancillary statistics;

selecting the extremes beyond a designated MSE threshold;

interpolating spatially whitened weights U from weights near the extremes;

using the whitened combiner weights U to calculate both unwhitened combiner weights W=R<sup>−

1</sup>U to be used in subsequent data recovery operations, and to estimate the received channel aperture matrix A=R^HU, to facilitate ancillary signal quality measurements and fast network entry in future adaptation frames; and

, lastly,

using an estimated and optimized pseudodelay vector δ

_* to generate c₁(k)=exp{−

j2π

δ

_*k} (conjugate of {p₁₁(k;

n₁)} during uplink receive operations, and {p₂₂(k;

n₂)} during downlink receive operations), which is then used to remove the residual observed pseudodelay from the information bearing symbols.

55. A method as in claim 52, wherein the pseudodelay estimation is refined using a Gauss-Newton recursion using the approximation:

exp{−

j2π

Δ

(k−

k₀)/PK}≈

1−

j2π

Δ

(k−

k₀)/PK.

56. A method as in claim 1, wherein dynamically adapting the diversity [capability means and said proper subsets to optimize said network further comprises:

using the linear combiner weights provided during receive operations are construct linear distribution weights during subsequent transmit operations, by setting distribution weight g₁(k,l;

n₂,n₁) proportional to w*₁(k,l;

n₂,n₁) during uplink transmit operations, and g₂(k,l;

n₁,n₂) proportional to w*₂(k,l;

n₁,n₂) during downlink transmit operations;

thereby making the transmit weights substantively nulling and thereby allowing each node to form frequency and time coincident two-way links to every node in its field of view, with which it is authorized (through establishment of link set and transfer of network/recipient node information) to communicate.

57. A method as in claim 1, wherein the substep of dynamically adapting the diversity capability means and said proper subsets to optimize said network at each node in the first subset of nodes further comprises:

using a LEGO implementation element and algorithm.

58. A method as in claim 1, wherein dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

balancing the power use against capacity for each channel, link, and node, and hence for the network as a whole by;

establishing a capacity objective {β

(m)} for a user 2 node receiving from a user 1 node as the target to be achieved by the user 2 node;

solving, at the user 2 node the local optimization problem;

minΣ

_qπ

₁(q)=1^Tπ

₁, such that

Σ

<sub>qε

Q(m)</sub>log(1+γ

(q))≧

β

(m),

where π

₁(q) is the transmit power for link number q for the user 1 node,

γ

(q) is the signal to interference and noise ratio (SINR) seen at the output of the beamformer,

1 is a vector of all 1s,

and,

π

₁ is a vector whose q^th element is π

₁(q),

the aggregate set Q(m) contains a set of links that are grouped together for the purpose of measuring capacity flows through those links;

using at the user 2 node the local optimization solution to moderate the transmit and receive weights, and signal information, returned to [user 1 node;

and,

using said feedback to compare against the capacity objective {β

(m)} and incrementally adjust the transmit power at each of the user 1 node and the user 2 node until no further improvement is perceptible.

59. A method as in claim 1, wherein dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

using the downlink objective function

minΣ

_qπ

₂(q)=1^Tπ

₂ such that Σ

<sub>qε

Q(m)</sub>log(1+γ

(q))≧

β

(m)

at each node to perform local optimization;

reporting the required feasibility condition,

Σ

<sub>qε

Q(m)</sub>π

₁(q)≧

R₁(m);

and,

modifying β

(m) as necessary to stay within the constraint.

60. A method as in claim 58, wherein:

the capacity constraints β

(m) are determined in advance for each proper subset of nodes, based on known QoS requirements for each said proper subset.

61. A method as in claim 58, wherein said network further seeks to minimize total power in the network as suggested by

Σ

<sub>qε

Q(m)</sub>log(1+γ

(q))≧

/β

(m).

62. A method as in claim 58, wherein said network sets as a target objective for the network {β

(m)} the QoS for the network.

63. A method as in claim 58, wherein said network sets as a target objective for the network {β

(m)} a vector of constraints.

64. A method as in claim 58, wherein the local optimization problem is further defined such that:

the receive and transmit weights are unit normalized with respect to the background interference autocorrelation matrix;

the local SINR is expressed as

$\mathrm{\gamma <br><br>}<br><br><br><br>\left(q\right)=\frac{P_{\mathrm{rt}}<br><br>\left(q,q\right)<br><br>{\mathrm{\pi <br><br>}}_t<br><br>\left(q\right)}{1+\underset{j\ne <br><br>q}{\sum <br><br>}<br><br><br><br>P_{\mathrm{rt}}<br><br>\left(q,j\right)<br><br>{\mathrm{\pi <br><br>}}_t<br><br>\left(j\right)};<br><br>$

and the weight normalization

Σ

<sub>qε

Q(m)</sub>log(1+γ

(q))≧

β

(m)

is used to enable D₁₂(W,G)=D₂₁(G*,W*), where (W₂,G₁) and (W₁,G₂) represent the receive and transmit weights employed by all nodes in the network during uplink and downlink operations, respectively, at that node, thereby allowing the uplink and downlink function to be presumed identical rather than separately computed.

65. A method as in claim 58, wherein:

very weak constraints to the transmit powers are approximated by using a very simple approximation for γ

(q).

66. A method as in claim 58, for the cases wherein all the aggregate sets contain a single link and non-negligible environmental noise is present, wherein the transmit powers are computed as Perron vectors from

$\begin{array}{c}{D}_{21}=\log \end{array}$

( 1 + 1 ρ

⁡

( P 21 ) - 1 ) = log ⁡

( 1 + 1 ρ

⁡

( P 12 T ) - 1 ) ;

= D 12

and a simple power constraint is imposed upon the transmit powers.

67. A method as in claim 66, wherein the optimization is performed in alternating directions and repeated.

68. A method as in claim 58, wherein each node presumes the post-beamforming interference energy remains constant for the adjustment interval and so solves

$\underset{{\pi }_{}}{\min }$

1 ⁡

( q ) ⁢

∑

q ⁢

⁢

π

1 ⁡

( q ) = 1 T ⁢

π

1 ,

subject to the constraint of

Σ

<sub>qε

Q(m)</sub>log(1+γ

(q))≧

β

(m)

using classic water filling arguments based on Lagrange multipliers, and then uses a similar equation for the reciprocal element of the link.

69. A method as in claim 58, wherein at each node the constrained optimization problem stated in

$\underset{m}{\max }$

∑

q ∈

Q ⁡

( m ) ⁢

⁢

log ⁡

( 1 + γ

⁡

( q ) ) ,

such that

$\underset{q\in <br><br>Q<br><br>\left(m\right)}{\sum <br><br>}<br><br><br><br>{\mathrm{\pi <br><br>}}_1<br><br>\left(q\right)\le <br><br>R_1<br><br>\left(m\right),\mathrm{\gamma <br><br>}<br><br>\left(q\right)\ge <br><br>0$

is solved using the approximation

$\mathrm{\gamma <br><br>}<br><br>\left(q\right)=\frac{P_{21}<br><br>\left(q,q\right)<br><br>{\mathrm{\pi <br><br>}}_1<br><br>\left(q\right)}{i_2<br><br>\left(q\right)}$

and the network further comprises at least one high-level network controller that controls the power constraints R₁(m), and drives the network towards a max-min solution.

70. A method as in claim 58, wherein each node:

is given an initial γ

₀;

generates the model expressed in

L(γ

,g,β

)=g^Tγ

, Σ

<sub>qε

Q(m)</sub>log(1+γ

(q))≧

β

(m)

g=∇

_γ

f(γ

₀);

updates the new γ

_α

from

γ

_*=arg min_γ

L(γ

,g,β

), γ

_α

=γ

₀+α

(γ

_*−

γ

₀);

determines a target SINR to adapt to; and

,

updates the transmit power for each link q according to

π

₂(q)=γ

_α

i₁(q)/|h(q)|²

π

₁(q)=γ

_α

i₂(q)/|h(q)|².

71. A method as in claim 58, for each node wherein the transmit power relationship of

π

₂(q)=γ

_α

i₁(q)/|h(q)|²

π

₁(q)=γ

_α

i₂(q)/|h(q)|²

is not known, that;

uses a suitably long block of N samples is used to establish the relationship, where N is either 4 times the number of antennae or 128, whichever is larger;

uses the result to update the receive weights at each end of the link;

optimizes the local model as in

γ

_*=arg min_γ

L(γ

,g,β

)

γ

_α

=γ

₀+α

(γ

_*−

γ

₀);

and then applies

π

₂(q)=γ

_α

i₁(q)/|h(q)|²

π

₁(q)=γ

_α

i₂(q)/|h(q)|².

72. A method as in claim 58 that, for an aggregate proper subset m:

for each node within the set m, inherits the network objective function model given in

L_m(γ

,g,β

)=Σ

<sub>qε

Q(m)</sub>g_qγ

(q)

Σ

<sub>qε

Q(m)</sub>log(1+γ

(q))≧

β

(m)

g(q)=i₁(q)i₂(q)/|h(q)|²;

eliminates a step of matrix channel estimation, transmitting instead from that node as a single real number for each link to the other end of said link an estimate of the post beamforming interference power;

and,

receives back for each link a single real number being the transmit power.

73. A method as in claim 71, that for each pair of nodes assigns to the one presently possessing the most processing capability the power management computations.

74. A method as in claim 72 that estimates the transfer gains and the post beamforming interference power using simple least squares estimation techniques.

75. A method as in claim 72 that, for estimating the transfer gains and post beamforming interference power:

instead solves for the transfer gain h using

y(n)=hgs(n)+ε

(n);

uses a block of N samples of data to estimate h using

$h=\frac{\underset{n=1}{\overset{N}{\sum <br><br>}}<br><br><br><br>s*\left(n\right)<br><br>y<br><br>\left(n\right)}{\underset{n=1}{\overset{N}{\sum <br><br>}}<br><br><br><br>{<br><br>s<br><br>\left(n\right)<br><br>}^2<br><br>g}$

obtains an estimation of residual interference power [R_ε

] using

$\begin{array}{c}{R}_{\mathrm{\varepsilon <br><br>}}=\langle <br><br>{<br><br>\mathrm{\varepsilon <br><br>}<br><br>\left(n\right)<br><br>}^2\rangle <br><br>\\ =\frac{1}{N}<br><br>\underset{n=1}{\overset{N}{\sum <br><br>}}<br><br><br><br>\left({<br><br>y<br><br>\left(n\right)<br><br>}^2-{<br><br>g<br><br><br><br>h<br><br><br><br>s<br><br>\left(n\right)<br><br>}^2\right);<br><br>\end{array}$

and,

obtains knowledge of the transmitted data symbols s(n) from using remodulated symbols at the output of the codec.

76. A method as in claim 75 wherein, instead of obtaining knowledge of the transmitted data symbols s(n) from using remodulated symbols at the output of the codec, the node uses the output of a property restoral algorithm used in a blind beamforming algorithm.

77. A method as in claim 75 wherein, instead of obtaining knowledge of the transmitted data symbols s(n) from using remodulated symbols at the output of the codec, the node uses a training sequence explicitly transmitted to train beamforming weights and asset the power management algorithms.

78. A method as in claim 75 wherein, instead of obtaining knowledge of the transmitted data symbols s(n) from using remodulated symbols at the output of the codec, the node uses any combination of:

the output of a property restoral algorithm used in a blind beamforming algorithm;

a training sequence explicitly transmitted to train beamforming weights and asset the power management algorithms;

and,

other means known to the art.

79. A method as in claim 58, wherein each node incorporates a link level optimizer and a decision algorithm.

80. A method as in claim 79, wherein the decision algorithm is a Lagrange multiplier technique.

81. A method as in claim 58, wherein the solution to

$\underset{{\pi }_{}}{\min }$

1 ⁡

( q ) ⁢

∑

q ⁢

⁢

π

1 ⁡

( q ) = 1 T ⁢

π

1

is implemented by a penalty function technique.

82. A method as in claim 81, wherein the penalty function technique:

takes the derivative of γ

(q) with respect to π

₁;

and,

uses the Kronecker-Delta function and the weighted background noise.

83. A method as in claim 81, wherein the penalty function technique neglects the noise term.

84. A method as in claim 81, wherein the penalty function technique normalizes the noise term to one.

85. A method as in claim 58, wherein the approximation uses the receive weights.

86. A method as in claim 58, wherein adaptation to the target objective is performed in a series of measured and quantized descent and ascent steps.

87. A method as in claim 58, wherein the adaptation to the target objective is performed in response to information stating the vector of change.

88. A method as in claim 58, which uses the log linear mode

${\beta }_{}$

q ≈

log ⁡

( a ⁢

⁢

π

1 ⁡

( q ) + a 0 b ⁢

⁢

π

1 ⁡

( q ) + b 0 ) = β

^ q ⁡

( π

1 ⁡

( q ) )

and the inequality characterization {circumflex over (β

)}_q(π

₁(q))≧

β

to solve the approximation problem with a simple low dimensional linear program.

89. A method as in claim 58, develops the local mode by matching function values and gradients between the current model and the actual function.

90. A method as in claim 58, which develops the model as a solution to the least squares fit, evaluated over several points.

91. A method as in claim 58, which reduces the cross-coupling effect by allowing only a subset of links to update at any one particular time, wherein the subset members are chosen as those which are more likely to be isolated from one another.

92. A method as in claim 58, wherein:

the network further comprises a network controller element;

said network controller element governs a subset of the network;

said network controller element initiates, monitors, and changes the target objective for that subset;

said network controller communicates the target objective to each node in that subset;

and,

receives information from each node concerning the adaptation necessary to meet said target objective.

93. A method as in claim 92, wherein said network further records the scalar and history of the increments and decrements ordered by the network controller.

94. A method as in claim 58, wherein for any subset, a target objective may be a power constraint.

95. A method as in claim 58, wherein for any subset, a target objective may be a capacity maximization subject to a power constraint.

96. A method as in claim 58, wherein for any subset, a target objective may be a power minimization subject to the capacity attainment to the limit possible over the entire network.

97. A method as in claim 58, wherein for any subset, a target objective may be a power minimization at each particular node in the network subject to the capacity constraint at that particular node.

102. A method as in claim 1, wherein the step of dynamically adapting the diversity capability means and said proper subsets to optimize said network further comprises:

matching each transceiver'"'"'s degrees of freedom (DOF) to the nodes in the possible link directions;

equalizing those links to provide node-equivalent uplink and downlink capacity.

103. A method as in claim 102, further comprising, after the DOF matching:

assigning asymmetric transceivers to reflect desired capacity weighting;

adapting the receive weights to form a solution for multipath resolutions;

employing data and interference whitening as appropriate to the local conditions;

and,

using retrodirective transmission gains during subsequent transmission operations.

104. A method as in claim 102, wherein the receive weights are matched to the nodes in the possible link directions.

107. A method as in claim 104, wherein the network optimizes for QoS and not diversity capability means capacity.

108. A method as in claim 92, wherein:

said network controller adds, drops, or changes the target capacity for any node in the set the network controller controls.

109. A method as in claim 92, wherein:

said network controller may, either in addition to or in replacement for altering β

, add, drop, or change channels between nodes, frequencies, coding, security, or protocols, polarizations, or traffic density allocations usable by a particular node or channel.

113. The use of a method as described in claim 1 for fixed wireless electromagnetic communications.

115. The use of a method as described in claim 1 for mobile wireless electromagnetic communications.

117. The use of a method as described in claim 1 for mapping operations using wireless electromagnetic communications.

119. The use of a method as described in claim 1 for a military wireless electromagnetic communications network.

121. The use of a method as described in claim 1 for a military wireless electromagnetic communications network for battlefield operations.

123. The use of a method as described in claim 1 for a military wireless electromagnetic communications network for Back Edge of Battle Area (BEBA) operations.

125. The use of a method as described in claim 1 for a wireless electromagnetic communications network for intruder detection operations.

127. The use of a method as described in claim 1 for a wireless electromagnetic communications network for logistical intercommunications.

129. The use of a method as described in claim 1 in a wireless electromagnetic communications network for self-filtering spoofing signals.

131. The use of a method as described in claim 1 in a wireless electromagnetic communications network for airborne relay over the horizon.

133. The use of a method as described in claim 1 in a wireless electromagnetic communications network for traffic control.

134. The use of a method as in claim 1, further comprising the use thereof for air traffic control.

135. The use of a method as in claim 1, further comprising the use thereof for ground traffic control.

136. The use of a method as in claim 1, further comprising the use thereof for a mixture of ground and air traffic control.

141. The use of a method as in claim 1 in a wireless electromagnetic communications network for emergency services.

143. The use of a method as in claim 1 in a wireless electromagnetic communications network for shared emergency communications without interference.

145. The use of a method as in claim 1 in a wireless electromagnetic communications network for positioning operations without interference.

147. The use of a method as in claim 1 in a wireless electromagnetic communications network for high reliability networks requiring graceful degradation despite environmental conditions or changes.

149. The use of a method as in claim 1 in a wireless electromagnetic communications network for a secure network requiring assurance against unauthorized intrusion.

150. The use of a method as in claim 1 in a wireless electromagnetic communications network for a secure network requiring message end-point assurance.

151. The use of a method as in claim 1 in a wireless electromagnetic communications network for a secure network requiring assurance against unauthorized intrusion and message end-point assurance.

155. The use of a method as in claim 1 in a cellular mobile radio service.

157. The use of a method as in claim 1 in a personal communication service.

159. The use of a method as in claim 1 in a private mobile radio service.

161. The use of a method as in claim 1 in a wireless LAN.

163. The use of a method as in claim 1 in a fixed wireless access service.

165. The use of a method as in claim 1 in a broadband wireless access service.

167. The use of a method as in claim 1 in a municipal area network.

169. The use of a method as in claim 1 in a wide area network.

171. The use of a method as in claim 1 in wireless backhaul.

173. The use of a method as in claim 1 in wireless backhaul.

175. The use of a method as in claim 1 in wireless SONET.

177. The use of a method as in claim 1 in wireless Telematics.

183. A method as in claim 32, wherein the step of suppressing unintended recipients or transmitters by the imposition of signal masking further comprises:

imposition of a recipient mask.

2. A method for optimizing a wireless electromagnetic communications network, comprising:

organizing a wireless electromagnetic communications network, comprising

a set of nodes, said set of nodes further comprising,

at least a first subset wherein each node is MIMO-capable, comprising;

a spatially diverse antennae array of M antennae, where M≧

two,

a transceiver for each antenna in said spatially diverse antennae array,

means for digital signal processing to convert analog radio signals into digital signals and digital signals into analog radio signals,

means for coding and decoding data, symbols, and control information into and from digital signals,

diversity capability means for transmission and reception of said analog radio signals,

and,

means for input and output from and to a non-radio interface for digital signals;

linking said set of nodes according to design rules that create and support a condition of network reciprocity by meeting the first of the following criteria, and at least two out of five of the remaining following criteria;

subdividing said set of nodes into two or more proper subsets of nodes, with a first proper subset being a transmit uplink/receive downlink subset, and a second proper subset being a transmit downlink/receive uplink subset;

allowing each node in said set of nodes to simultaneously belong to up to as many transmitting uplink or receiving uplink subsets as it has diversity capability means;

allowing each node in the transmit uplink/receive downlink subset to simultaneously link to up to as many nodes with which it will hold time and frequency coincident communications in its field of view, as it has diversity capability means;

allowing each node in the transmit downlink/receive uplink subset to simultaneously link to up to as many nodes with which it will hold time and frequency coincident communications in its field of view, as it has diversity capability means;

allowing each member of the transmit uplink/receive downlink subset to engage in simultaneous time and frequency coincident communications with any other member of that transmit uplink/receive downlink subset only if both that other member also belongs to a different proper subset and the communication is between different proper subsets;

and,

allowing each member of the transmit downlink/receive uplink subset to engage in simultaneous time and frequency coincident communications with any other member of that transmit downlink/receive uplink subset only if both that other member also belongs to a different proper subset and the communication is between different proper subsets;

transmitting, in said wireless electromagnetic communications network, independent information from each node belonging to a first proper subset, to one or more receiving nodes belonging to a second proper subset that are viewable from the transmitting node;

processing independently, in said wireless electromagnetic communications network, at each receiving node belonging to said second proper subset, information transmitted from one or more nodes belonging to said first proper subset;

and,

dynamically adapting the diversity capability means and said proper subsets to optimize said network.

40. A method for optimizing a wireless electromagnetic communications network, comprising:

organizing a wireless electromagnetic communications network, comprising

a set of nodes, said set further comprising,

at least a first subset of MIMO-capable nodes, each MIMO-capable node comprising;

a spatially diverse antennae array of M antennae, where M≧

two, said antennae array being polarization diverse, and circularly symmetric, and providing 1-to-M RF feeds;

a transceiver for each antenna in said array, said transceiver further comprising

a Butler Mode Forming element, providing spatial signature separation with a FFT-LS algorithm, reciprocally forming a transmission with shared receiver feeds, such that the number of modes out equals the numbers of antennae, establishing such as an ordered set with decreasing energy, further comprising;

 

a dual-polarization element for splitting the modes into positive and negative polarities with opposite and orthogonal polarizations, that can work with circular polarizations, and

 

a dual-polarized link CODEC;

a transmission/reception switch comprising,

 

a vector OFDM receiver element;

 

a vector OFDM transmitter element;

 

a LNA bank for a receive signal, said LNA Bank also instantiating low noise characteristics for a transmit signal;

 

a PA bank for the transmit signal that receives the low noise characteristics for said transmit signal from said LNA bank;

 

an AGC for said LNA bank and PA bank;

 

a controller element for said transmission/reception switch enabling baseband link distribution of the energy over the multiple RF feeds on each channel to steer up to K_feed beams and nulls independently on each FDMA channel;

 

a Frequency Translator;

 

a timing synchronization element controlling said controller element;

 

further comprising a system clock, a universal Time signal element;

 

GPS;

 

a multimode power management element and algorithm;

 

and,

 

a LOs element;

said vector OFDM receiver element comprising

 

an ADC bank for downconversion of received RF signals into digital signals;

 

a MT DEMOD element for multitone demodulation, separating the received signal into distinct tones and splitting them into 1 through K_feed FDMA channels, said separated tones in aggregate forming the entire baseband for the transmission, said MT DEMOD element further comprising

 

a Comb element with a multiple of 2 filter capable of operating on a 128-bit sample; and

,

 

an FFT element with a 1,024 real-IF function;

 

a Mapping element for mapping the demodulated multitone signals into a 426 active receive bins, wherein

 

each bin covers a bandwidth of 5.75 MHz;

 

each bin has an inner passband of 4.26 MHz for a content envelope;

 

each bin has an external buffer, up and down, of 745 kHz;

 

each bin has 13 channels, CH0 through CH12, each channel having 320 kHz and 32 tones, T0 through T31, each tone being 10 kHz, with the inner 30 tones being used information bearing and T0 and T31 being reserved;

 

each signal being 100 μ

s, with 12.5 μ

s at each end thereof at the front and rear end thereof forming respectively a cyclic prefix and cyclic suffix buffer to punctuate successive signals;

 

a MUX element for timing modification capable of element-wise multiplication across the signal, which halves the number of bins and tones but repeats the signal for high-quality needs;

 

a link CODEC, which separates each FDMA channel into 1 through M links, further comprising

 

a SOVA bit recovery element;

 

an error coding element;

 

an error detection element;

 

an ITI remove element;

 

a tone equalization element;

 

and,

 

a package fragment retransmission element;

 

a multilink diversity combining element, using a multilink Rx weight adaptation algorithm for Rx signal weights W(k) to adapt transmission gains G(k) for each channel k,

 

an equalization algorithm, taking the signal from said multilink diversity combining element and controlling a delay removal element;

 

said delay removal element separating signal content from imposed pseudodelay and experienced environmental signal delay, and passing the content-bearing signal to a symbol-decoding element;

 

said symbol-decoding element for interpretation of the symbols embedded in the signal, further comprising;

 

an element for delay gating;

 

a QAM element; and

 

a PSK element;

said vector OFDM transmitter element comprising;

 

a DAC bank for conversion of digital signals into RF signals for transmission;

 

a MT MOD element for multitone modulation, combining and joining the signal to be transmitted from 1 through K_feed FDMA channels, said separated tones in aggregate forming the entire baseband for the transmission, said MT MOD element further comprising

 

a Comb element with a multiple of 2 filter capable of operating on a 128-bit sample; and

,

 

an IFFT element with a 1,024 real-IF function;

 

a Mapping element for mapping the modulated multitone signals from 426 active transmit bins, wherein

 

each bin covers a bandwidth of 5.75 MHz;

 

each bin has an inner passband of 4.26 MHz for a content envelope;

 

each bin has an external buffer, up and down, of 745 kHz;

 

each bin has 13 channels, CH0 through CH12, each channel having 320 kHz and 32 tones, T0 through T31, each tone being 10 kHz, with the inner 30 tones being used information bearing and T0 and T31 being reserved;

 

each signal being 100 μ

s, with 12.5 μ

s at each end thereof at the front and rear end thereof forming respectively a cyclic prefix and cyclic suffix buffer to punctuate successive signals;

 

a MUX element for timing modification capable of element-wise multiplication across the signal, which halves the number of bins and tones but repeats the signal for high-quality needs;

 

a symbol-coding element for embedding the symbols to be interpreted by the receiver in the signal, further comprising;

 

an element for delay gating;

 

a QAM element; and

 

a PSK element;

 

a link CODEC, which aggregates each FDMA channel from 1 through M links, further comprising

 

a SOVA bit recovery element;

an error coding element;

 

an error detection element;

 

an ITI remove element;

 

a tone equalization element;

 

and,

 

a package fragment retransmission element;

 

a multilink diversity distribution element, using a multilink Tx weight adaptation algorithm for Tx signal weights to adapt transmission gains G(k) for each channel k, such that g(q;

k)∝

w*(q;

k);

a TCM codec;

a pilot symbol CODEC element that integrates with said FFT-LS algorithm a link separation, a pilot and data signal elements sorting, a link detection, multilink combination, and equalizer weight calculation operations;

means for diversity transmission and reception,

and,

means for input and output from and to a non-radio interface;

linking said set of nodes according to design rules that create and support a condition of network reciprocity by meeting the first of the following criteria, and at least two out of five of the remaining following criteria;

subdividing said set of nodes into two or more proper subsets of nodes, with a first proper subset being a transmit uplink/receive downlink subset, and a second proper subset being a transmit downlink/receive uplink subset;

allowing each node in said set of nodes to simultaneously belong to only as many transmitting uplink or receiving uplink subsets as it has diversity capability means;

allowing each node in the transmit uplink/receive downlink subset to simultaneously link to only as many nodes with which it will hold time and frequency coincident communications in its field of view, as it has diversity capability means;

allowing each node in the transmit downlink/receive uplink subset to simultaneously link to only as many nodes with which it will hold time and frequency coincident communications in its field of view, as it has diversity capability means;

allowing each member of the transmit uplink/receive downlink subset to engage in simultaneous, time and frequency coincident communications with any other member of that transmit uplink/receive downlink subset only if both that other member also belongs to a different proper subset and the communication is between different proper subsets;

and,

allowing each member of the transmit downlink/receive uplink subset to engage in simultaneous, time and frequency coincident communications with any other member of that transmit downlink/receive uplink subset only if both that other member also belongs to a different proper subset and the communication is between different proper subsets;

transmitting, in said wireless electromagnetic communications network, independent information from each node belonging to a first proper subset, to one or more receiving nodes belonging to a second proper subset that are viewable from the transmitting node;

processing independently, in said wireless electromagnetic communications network, at each receiving node belonging to said second proper subset, information transmitted from one or more nodes belonging to said first proper subset;

and,

designing the network such that substantially reciprocal symmetry exists for the uplink and downlink channels by,

if the received interference is spatially white in both link directions, setting g₂(q)∝

w₂*(q) and g₁(q)∝

w₁*(q) at both ends of the link, where {g₂(q), w₁(q)} are the linear transmit and receive weights used in the downlink;

but if the received interference is not spatially white in both link directions, constraining {g₁(q)} and {g₂(q)} to satisfy;

$\underset{q=1}{\overset{Q_{21}}{\sum <br><br>}}<br><br><br><br>g_1^T<br><br>\left(q\right)<br><br>R_{i_1<br><br>i_1}<br><br>\left(n_1<br><br>\left(q\right)\right)<br><br>g_1^{*}<br><br>\left(q\right)=\underset{n=1}{\overset{N_1}{\sum <br><br>}}<br><br><br><br>\mathrm{Tr}<br><br>\left\{R_{i_1<br><br>i_1}<br><br>\left(n\right)\right\}=M_1<br><br>R_1$ $\underset{q=1}{\overset{Q_{12}}{\sum <br><br>}}<br><br><br><br>g_2^T<br><br>\left(q\right)<br><br>R_{i_2<br><br>i_2}<br><br>\left(n_2<br><br>\left(q\right)\right)<br><br>g_2^{*}<br><br>\left(q\right)=\underset{n=1}{\overset{N_2}{\sum <br><br>}}<br><br><br><br>\mathrm{Tr}<br><br>\left\{R_{i_2<br><br>i_2}<br><br>\left(n\right)\right\}=M_2<br><br>R_2;<br><br>$

using any standard communications protocol, including TDD, FDD, simplex,

and,

optimizing the network by dynamically adapting the diversity capability means between nodes of said transmitting and receiving subsets.

98. A wireless electromagnetic communications network, comprising:

a set of nodes, said set further comprising,

at least a first subset wherein each node is MIMO-capable, comprising;

a spatially diverse antennae array of M antennae, where M≧

one,

a transceiver for each antenna in said array,

means for digital signal processing,

means for coding and decoding data and symbols,

means for diversity transmission and reception,

and,

means for input and output from and to a non-radio interface;

said set of nodes further comprising one or more proper subsets of nodes, being at least one transmitting and at least one receiving subset, with said transmitting and receiving subsets having a topological arrangement whereby;

each node in a transmitting subset has no more nodes with which it will simultaneously communicate in its field of view, than it has number of antennae;

each node in a receiving subset has no more nodes with which it will simultaneously communicate in its field of view, than it can steer independent nulls to;

and,

each member of a non-proper subset cannot communicate with any other member of its non-proper subset;

means for transmitting independent information from each node in a first non-proper subset to one or more receiving nodes belonging to a second non-proper subset that are viewable from the transmitting node;

means for processing independently information transmitted to a receiving node in a second non-proper subset from one or more nodes in a first non-proper subset is independently by the receiving node;

and,

means for optimizing the network by dynamically adapting the means for diversity transmission and reception between nodes of said transmitting and receiving subsets.

99. An apparatus as in claim 98, further comprising means for scheduling according to a Demand-Assigned, Multiple-Access algorithm.

100. An apparatus as in claim 98, further comprising a LEGO adaptation-element for each node in said first subset.

101. An apparatus as in claim 98, further comprising:

a LEGO adaptation-element for each node in said first subset

and,

one or more network controllers.

112. A wireless electromagnetic communications network as in claim 98:

incorporating a dynamics-resistant multitone element.

114. The use of an apparatus as described in claim 98 for fixed wireless electromagnetic communications.

116. The use of an apparatus as described in claim 98 for mobile wireless electromagnetic communications.

118. The use of an apparatus as described in claim 98 for mapping operations using wireless electromagnetic communications.

120. The use of an apparatus as described in claim 98 for a military wireless electromagnetic communications network.

122. The use of an apparatus as described in claim 98 for a military wireless electromagnetic communications network for battlefield operations.

124. The use of an apparatus as described in claim 98 for a military wireless electromagnetic communications network for Back Edge of Battle Area (BEBA) operations.

126. The use of an apparatus as described in claim 98 for a wireless electromagnetic communications network for intruder detection operations.

128. The use of an apparatus as described in claim 98 for a wireless electromagnetic communications network for logistical intercommunications.

130. The use of an apparatus as described in claim 98 for a wireless electromagnetic communications network for self-filtering spoofing signals.

132. The use of an apparatus as described in claim 98 for a wireless electromagnetic communications network for airborne relay over the horizon.

137. The use of an apparatus as described in claim 98 for a wireless electromagnetic communications network for traffic control.

138. The use of an apparatus as in claim 98, further comprising the use thereof for air traffic control.

139. The use of an apparatus as in claim 98, further comprising the use thereof for ground traffic control.

140. The use of an apparatus as in claim 98, further comprising the use thereof for a mixture of ground and air traffic control.

142. The use of an apparatus as in claim 98 in a wireless electromagnetic communications network for emergency services.

144. The use of an apparatus as in claim 98 in a wireless electromagnetic communications network for shared emergency communications without interference.

146. The use of an apparatus as in claim 98 in a wireless electromagnetic communications network for positioning operations without interference.

148. The use of an apparatus as in claim 98 in a wireless electromagnetic communications network for high reliability networks requiring graceful degradation despite environmental conditions or changes.

152. The use of an apparatus as in claim 98 in a wireless electromagnetic communications network for a secure network requiring assurance against unauthorized intrusion.

153. The use of an apparatus as in claim 98 in a wireless electromagnetic communications network for a secure network requiring message end-point assurance.

154. The use of an apparatus as in claim 98 In a wireless electromagnetic communications network for a secure network requiring assurance against unauthorized intrusion and message end-point assurance.

156. The use of an apparatus as in claim 98 in a cellular mobile radio service.

158. The use of an apparatus as in claim 98 in a personal communication service.

160. The use of an apparatus as in claim 98 in a private mobile radio service.

162. The use of an apparatus as in claim 98 in a wireless LAN.

164. The use of an apparatus as in claim 98 in a fixed wireless access service.

166. The use of an apparatus as in claim 98 in a broadband wireless access service.

168. The use of an apparatus as in claim 98 in a municipal area network.

170. The use of an apparatus as in claim 98 in a wide area network.

172. The use of an apparatus as in claim 98 in wireless backhaul.

174. The use of an apparatus as in claim 98 in wireless backhaul.

176. The use of an apparatus as in claim 98 in wireless SONET.

178. The use of an apparatus as in claim 98 in wireless Telematics.

179. An apparatus as in claim 98, wherein the means for digital signal processing in said first subset of MIMO-capable nodes further comprises:

an ADC bank for downconversion of received RF signals into digital signals;

a MT DEMOD element for multitone demodulation, separating the received signal into distinct tones and splitting them into 1 through K_feed FDMA channels, said separated tones in aggregate forming the entire baseband for the transmission, said MT DEMOD element further comprising

a Comb element with a multiple of 2 filter capable of operating on a 128-bit sample; and

,

an FFT element with a 1,024 real-IF function;

a Mapping element for mapping the demodulated multitone signals into a 426 active receive bins, wherein

each bin covers a bandwidth of 5.75 MHz;

each bin has an inner passband of 4.26 MHz for a content envelope;

each bin has an external buffer, up and down, of 745 kHz;

each bin has 13 channels, CH0 through CH12, each channel having 320 kHz and 32 tones, T0 through T31, each tone being 10 kHz, with the inner 30 tones being used information bearing and T0 and T31 being reserved;

each signal being 100 μ

s, with 12.5 μ

s at each end thereof at the front and rear end thereof forming respectively a cyclic prefix and cyclic suffix buffer to punctuate successive signals;

and,

a symbol-decoding element for interpretation of the symbols embedded in the signal.

105. A method for optimizing a wireless electromagnetic communications network, comprising:

organizing a wireless electromagnetic communications network comprising

a set of nodes, said set of nodes further comprising,

at least a first subset wherein each node is MIMO-capable, comprising;

an antennae array of M antennae, where M≧

one,

a transceiver for each antenna in said spatially diverse antennae array,

means for digital signal processing to convert analog radio signals into digital signals and digital signals into analog radio signals,

means for coding and decoding data, symbols, and control information into and from digital signals,

diversity capability means for transmission and reception of said analog radio signals;

and,

means for input and output from and to a non-radio interface for digital signals;

linking said set of nodes according to design rules that create and support a condition of network reciprocity by meeting the first of the following criteria, and at least two out of five of the remaining following criteria;

subdividing said set of nodes into two or more proper subsets of nodes, with a first proper subset being a transmit uplink/receive downlink subset, and a second proper subset being a transmit downlink/receive uplink subset;

allowing each node in said set of nodes to simultaneously belong to up to as many transmitting uplink or receiving uplink subsets as it has diversity capability means;

allowing each node in the transmit uplink/receive downlink subset to simultaneously link to up to as many nodes with which it will hold time and frequency coincident communications in its field of view, as it has diversity capability means;

allowing each node in the transmit downlink/receive uplink subset to simultaneously link to up to as many nodes with which it will hold time and frequency coincident communications in its field of view, as it has diversity capability means;

allowing each member of the transmit uplink/receive downlink subset to engage in simultaneous time and frequency coincident communications with any other member of that transmit uplink/receive downlink subset only if both that other member also belongs to a different proper subset and the communication is between different proper subsets;

and,

allowing each member of a transmit downlink/receive uplink subset to engage in simultaneous time and frequency coincident communications with any other member of that transmit downlink/receive uplink subset only if both that other member also belongs to a different proper subset and the communication is between different proper subsets;

transmitting, in said wireless electromagnetic communications network, independent information from each node belonging to a first proper subset, to one or more receiving nodes belonging to a second proper subset that are viewable from the transmitting node;

processing independently, in said wireless electromagnetic communications network, at each receiving node belonging to said second proper subset, information transmitted from one or more nodes belonging to said first proper subset;

optimizing at the local level for each node for the channel capacity D₂₁ according to

D₂₁=max β

such that

$\mathrm{\beta <br><br>}\le <br><br>\underset{q\in <br><br>U<br><br>\left(m\right)}{\sum <br><br>}<br><br><br><br>\underset{k}{\sum <br><br>}<br><br><br><br>\log <br><br>\left(1+\mathrm{\gamma <br><br>}<br><br>\left(k,q\right)\right),$

γ

(k,q)≧

0,

$\underset{m}{\overset{}{\sum <br><br>}}<br><br><br><br>R_1<br><br><br><br>\left(m\right)\le <br><br>R,;<br><br>$

π

₁(k,q)≦

0,

$\underset{q\in <br><br>U<br><br>\left(m\right)}{\sum <br><br>}<br><br><br><br>\underset{k}{\sum <br><br>}<br><br><br><br>{\mathrm{\pi <br><br>}}_1<br><br>\left(k,q\right)\le <br><br>R_1<br><br>\left(m\right)$

solving first the reverse link power control problem;

then treating the forward link problem in an identical fashion, substituting the subscripts 2 for 1 in said equation;

and,

dynamically adapting the diversity capability means and said proper subsets to optimize said network.

106. A method as in claim 105, further comprising:

for each aggregate subset m, attempting to achieve the given capacity objective, β

, as described in

$\underset{{\mathrm{\pi <br><br>}}_r<br><br><br><br>\left(q\right)}{\min }<br><br>\underset{q\in <br><br>Q<br><br><br><br>\left(m\right)}{\overset{}{\sum <br><br>}}<br><br><br><br>{\mathrm{\pi <br><br>}}_r<br><br><br><br>\left(q\right),\mathrm{such}<br><br><br><br>\mathrm{that}$

β

=Σ

<sub>qε

Q(m)</sub>log(1+γ

(q))

by;

(1) optimizing the receive beamformers, using simple MMSE processing, to simultaneously optimize the SINR;

(2) based on the individual measured SINR for each q index, attempt to incrementally increase or lower its capacity as needed to match the current target; and

,

(3) stepping the power by a quantized small step in the appropriate direction;

then,

when all aggregate sets have achieved the current target capacity, then the network can either increase the target capacity β

, or add additional users to exploit the now-known excess capacity.

110. A wireless electromagnetic communications network, comprising:

a set of nodes, said set further comprising,

at least a first subset wherein each node is MIMO-capable, comprising;

a spatially diverse antennae array of M antennae, where M≧

one,

a transceiver for each antenna in said array,

means for digital signal processing,

means for coding and decoding data and symbols,

means for diversity transmission and reception,

pilot symbol coding &

decoding element timing synchronization element

and,

means for input and output from and to a non-radio interface;

said set of nodes further comprising two or more proper subsets of nodes, there being at least one transmitting and at least one receiving subset, with said transmitting and receiving subsets subset having a diversity arrangement whereby;

each node in a transmitting subset has no more nodes with which it will simultaneously communicate in its field of view, than it has number of antennae;

each node in a receiving subset has no more nodes with which it will simultaneously communicate in its field of view, than it can steer independent nulls to;

and,

each member of a non-proper subset cannot communicate with any other member of its non-proper subset over identical diversity channels;

a LEGO adaptation element and algorithm;

a network controller element and algorithm;

whereby each node in a first non-proper subset transmits independent information to one or more receiving nodes belonging to a second non-proper subset that are viewable from the transmitting node;

each receiving node in said second non-proper subset processes independently information transmitted to a from one or more nodes in a first non-proper subset is independently by the receiving node;

each node uses means to minimize SINR between nodes transmitting and receiving information;

the network is designed such that substantially reciprocal symmetry exists for the uplink and downlink channels by,

if the received interference is spatially white in both link directions, setting g₂(q)∝

w₂*(q) and g₁(q)∝

w₁*(q) at both ends of the link, where g₂(q), w₁(q)} are the linear transmit and receive weights used in the downlink;

but if the received interference is not spatially white in both link directions, constraining {g₁(q)} and {g₂(q)} to satisfy;

$\underset{q=1}{\overset{Q_{21}}{\sum <br><br>}}<br><br><br><br>g_1^T<br><br>\left(q\right)<br><br>R_{i_1<br><br>i_1}<br><br>\left(n_1<br><br>\left(q\right)\right)<br><br>g_1^{*}<br><br>\left(q\right)=\underset{n=1}{\overset{N_1}{\sum <br><br>}}<br><br><br><br>\mathrm{Tr}<br><br>\left\{R_{i_1<br><br>i_1}<br><br>\left(n\right)\right\}=M_1<br><br>R_1$ $\underset{q=1}{\overset{Q_{12}}{\sum <br><br>}}<br><br><br><br>g_2^T<br><br>\left(q\right)<br><br>R_{i_2<br><br>i_2}<br><br>\left(n_2<br><br>\left(q\right)\right)<br><br>g_2^{*}<br><br>\left(q\right)=\underset{n=1}{\overset{N_2}{\sum <br><br>}}<br><br><br><br>\mathrm{Tr}<br><br>\left\{R_{i_2<br><br>i_2}<br><br>\left(n\right)\right\}=M_2<br><br>R_2;<br><br>$

the network uses any standard communications protocol;

and,

the network is optimized by dynamically adapting the means for diversity transmission and reception between nodes of said transmitting and receiving subsets.

111. A wireless electromagnetic communications network as in claim 110:

wherein each node may further comprise a Butler Mode Forming element, to enable said node to ratchet the number of active antennae for a particular uplink or downlink operation up or down.

180. A wireless electromagnetic communications network, comprising:

a set of nodes, said set further comprising;

at least a first subset of MIMO-capable nodes, each MIMO-capable node comprising;

a spatially diverse antennae array of M antennae, where M≧

two, said antennae array being polarization diverse, and circularly symmetric, and providing 1-to-M RF feeds;

a transceiver for each antenna in said array, said transceiver further comprising;

a Butler Mode Forming element, providing spatial signature separation with a FFT-LS algorithm, reciprocally forming a transmission with shared receiver feeds, such that the number of modes out equals the numbers of antennae, establishing such as an ordered set with decreasing energy, further comprising;

a dual-polarization element for splitting the modes into positive and negative polarities with opposite and orthogonal polarizations, that can work with circular polarizations; and

,

a dual-polarized link CODEC;

a transmission/reception switch comprising;

a vector OFDM receiver element;

a vector OFDM transmitter element;

a LNA bank for a receive signal, said LNA Bank also instantiating low noise characteristics for a transmit signal;

a PA bank for the transmit signal that receives the low noise characteristics for said transmit signal from said LNA bank;

an AGC for said LNA bank and PA bank;

a controller element for said transmission/reception switch enabling baseband link distribution of the energy over the multiple RF feeds on each channel to steer up to K_feed beams and nulls independently on each FDMA channel;

a Frequency Translator;

a timing synchronization element controlling said controller element;

 

further comprising a system clock,

a universal Time signal element;

GPS;

a multimode power management element and algorithm;

 

and,

a LOs element;

said vector OFDM receiver element comprising;

an ADC bank for downconversion of received

RF signals into digital signals;

a MT DEMOD element for multitone demodulation, separating the received signal into distinct tones and splitting them into 1 through K_feed FDMA channels, said separated tones in aggregate forming the entire baseband for the transmission, said MT DEMOD element further comprising;

 

a Comb element with a multiple of 2 filter capable of operating on a 128-bit sample; and

,

 

an FFT element with a 1,024 real-IF function;

a Mapping element for mapping the demodulated multitone signals into a 426 active receive bins, wherein

 

each bin covers a bandwidth of 5.75 MHz;

 

each bin has an inner passband of 4.26 MHz for a content envelope;

 

each bin has an external buffer, up and down, of 745 kHz;

 

each bin has 13 channels, CH0 through CH12, each channel having 320 kHz and 32 tones, T0 through T31, each tone being 10 kHz, with the inner 30 tones being used information bearing and T0 and T31 being reserved;

 

and,

 

each signal being 100 μ

s, with 12.5 μ

s at each end thereof at the front and rear end thereof forming respectively a cyclic prefix and cyclic suffix buffer to punctuate successive signals;

a MUX element for timing modification capable of element-wise multiplication across the signal, which halves the number of bins and tones but repeats the signal for high-quality needs;

a link CODEC, which separates each FDMA channel into 1 through M links, further comprising;

 

a SOVA bit recovery element;

 

an error coding element;

 

an error detection element;

 

an ITI remove element;

 

a tone equalization element;

 

and,

 

a package fragment retransmission element;

a multilink diversity combining element, using a multilink Rx weight adaptation algorithm for Rx signal weights W(k) to adapt transmission gains G(k) for each channel k;

an equalization algorithm, taking the signal from said multilink diversity combining element and controlling a delay removal element;

 

said delay removal element separating signal content from imposed pseudodelay and experienced environmental signal delay, and passing the content-bearing signal to a symbol-decoding element;

 

said symbol-decoding element for interpretation of the symbols embedded in the signal, further comprising;

 

an element for delay gating;

 

a QAM element; and

 

a PSK element;

said vector OFDM transmitter element comprising;

a DAC bank for conversion of digital signals into

RF signals for transmission;

a MT MOD element for multitone modulation, combining and joining the signal to be

transmitted from 1 through K_feed FDMA channels, said separated tones in aggregate forming the entire baseband for the transmission;

said MT MOD element further comprising

 

a Comb element with a multiple of 2 filter capable of operating on a 128-bit sample; and

,

 

an IFFT element with a 1,024 real-IF function;

a Mapping element for mapping the modulated multitone signals from 426 active transmit bins, wherein

 

each bin covers a bandwidth of 5.75 MHz;

 

each bin has an inner passband of 4.26 MHz for a content envelope;

 

each bin has an external buffer, up and down, of 745 kHz;

 

each bin has 13 channels, CH0 through CH12, each channel having 320 kHz and 32 tones, T0 through T31, each tone being 10 kHz, with the inner 30 tones being used information bearing and T0 and T31 being reserved;

 

each signal being −

100 μ

s, with 12.5 μ

s at each end thereof at the front and rear end thereof forming respectively a cyclic prefix and cyclic suffix buffer to punctuate successive signals;

a MUX element for timing modification capable of element-wise multiplication across the signal, which halves the number of bins and tones but repeats the signal for high-quality needs;

a symbol-coding element for embedding the symbols to be interpreted by the receiver in the signal, further comprising;

 

an element for delay gating;

 

a QAM element; and

 

a PSK element;

a link CODEC, which aggregates each FDMA channel from 1 through M links, further comprising;

 

a SOVA bit recovery element;

 

an error coding element;

 

an error detection element;

 

an ITI remove element;

 

a tone equalization element;

 

and,

 

a package fragment retransmission element;

a multilink diversity distribution element, using a multilink Tx weight adaptation algorithm for Tx signal weights to adapt transmission gains G(k) for each channel k, such that g(q;

k) ∝

w*(q;

k);

a TCM codec;

a pilot symbol CODEC element that integrates with said FFT-LS algorithm a link separation, a pilot and data signal elements sorting, a link detection, multilink combination, and equalizer weight calculation operations;

means for diversity transmission and reception,

and,

means for input and output from and to a non-radio interface;

said set of nodes being linked according to design rules that create and support a condition of network reciprocity by meeting the first of the following criteria, and at least two out of five of the remaining following criteria;

subdividing said set of nodes into two or more proper subsets of nodes, with a first proper subset being a transmit uplink/receive downlink subset, and a second proper subset being a transmit downlink/receive uplink subset;

allowing each node in said set of nodes to simultaneously belong to only as many transmitting uplink or receiving uplink subsets as it has diversity capability means;

allowing each node in the transmit uplink/receive downlink subset to simultaneously link to only as many nodes with which it will hold time and frequency coincident communications in its field of view, as it has diversity capability means;

allowing each node in the transmit downlink/receive uplink subset to simultaneously link to only as many nodes with which it will hold time and frequency coincident communications in its field of view, as it has diversity capability means;

allowing each member of the transmit uplink/receive downlink subset to engage in simultaneous, time and frequency coincident communications with any other member of that transmit uplink/receive downlink subset only if both that other member also belongs to a different proper subset and the communication is between different proper subsets;

and,

allowing each member of the transmit downlink/receive uplink subset to engage in simultaneous, time and frequency coincident communications with any other member of that transmit downlink/receive uplink subset only if both that other member also belongs to a different proper subset and the communication is between different proper subsets;

means for transmitting, in said wireless electromagnetic communications network, independent information from each node belonging to a first proper subset, to one or more receiving nodes belonging to a second proper subset that are viewable from the transmitting node;

means for processing independently, in said wireless electromagnetic communications network, at each receiving node belonging to said second proper subset, information transmitted from one or more nodes belonging to said first proper subset;

and,

means for deploying said set of nodes such that substantially reciprocal symmetry exists for the uplink and downlink channels by,

if the received interference is spatially white in both link directions, setting g₂(q)∝

w₂*(q) and g₁(q)∝

w₁*(q) at both ends of the link, where {g₂(q), w₁(q)} are the linear transmit and receive weights used in the downlink;

but if the received interference is not spatially white in both link directions, constraining {g₁(q)} and {g₂(q)} to satisfy;

$\underset{q=1}{\overset{Q_{21}}{\sum <br><br>}}<br><br><br><br>g_1^T<br><br>\left(q\right)<br><br>R_{i_1<br><br>i_1}<br><br>\left(n_1<br><br>\left(q\right)\right)<br><br>g_1^{*}<br><br>\left(q\right)=\underset{n=1}{\overset{N_1}{\sum <br><br>}}<br><br><br><br>\mathrm{Tr}<br><br>\left\{R_{i_1<br><br>i_1}<br><br>\left(n\right)\right\}=M_1<br><br>R_1$ $\underset{q=1}{\overset{Q_{12}}{\sum <br><br>}}<br><br><br><br>g_2^T<br><br>\left(q\right)<br><br>R_{i_2<br><br>i_2}<br><br>\left(n_2<br><br>\left(q\right)\right)<br><br>g_2^{*}<br><br>\left(q\right)=\underset{n=1}{\overset{N_2}{\sum <br><br>}}<br><br><br><br>\mathrm{Tr}<br><br>\left\{R_{i_2<br><br>i_2}<br><br>\left(n\right)\right\}=M_2<br><br>R_2;<br><br>$

using any standard communications protocol, including TDD, FDD, simplex,

and,

means for optimizing the network by dynamically adapting the diversity capability means between nodes of said transmitting and receiving subsets.

181. A network as in claim 180, wherein said a transmission/reception switch further comprises an element for tone and slot interleaving.

182. A network as in claim 180, wherein said TMC codec and SOVA bit recovery element are replaced with a Turbo codec.