Switching Optimization in SS/TDMA Systems

AInS/TDMA system is considered in a generalized form wherein the number of uplink and downlink beams may be equal to or less than that needed for maximal utility (notationally K ?? M ?? N). A closed form expression for the least upper bound on the number of switching matrices required for efficient decomposition is derived. A methodology which is superior to any known is established in a universal form for all K, M, N triples possible. Recursive formulations for explicit least upper bounds of traffic density are shown in relationship to the number of switching matrices required.