METHOD AND APPARATUS FOR WIRELESS COMMUNICATION EMPLOYING CONTROL FOR CONFIDENCE METRIC BANDWIDTH REDUCTION

Abstract: A communication system having a plurality of forward channel communications and a plurality of corresponding reverse channel communications from and to a plurality of mobile users. A plurality of collectors are distributed at macro-diverse locations for receiving reverse channel signals from the users which are processed to yield one or more sequences of data bits as a burst and corresponding initial confidence metrics for each bit. The collectors forward these reverse channel signals including the data bits and corresponding processed confidence metrics to aggregators. The combining of multiple collector signals for the same user results in an output bit stream for the user with fewer bit errors. The system includes bandwidth control for minimizing backhaul bandwidth from collector to aggregator while maximizing signal quality.

Description: TITLE METHOD AND APPARATUS FOR WIRELESS COMMUNICATION EMPLOYING CONTROL FOR CONFIDENCE METRIC BANDWIDTH REDUCTION BACKGROUND OF THE INVENTION The present invention relates to the field of two-way wireless communication systems and more specifically to methods and apparatus for communication with mobile telephone users (cellular and personal communication systems), basic exchange telecommunications radio, wireless data communications, two-way paging and other wireless systems. Conventional Cellular Systems Present day cellular mobile telephone systems developed due to a large demand for mobile services that could not be satisfied by earlier systems. Cellular systems "reuse" frequency within a group of cells to provide wireless two-way radio frequency (RF) communication to large numbers of users. Each cell covers a small geographic area and collectively a group of adjacent cells covers a larger geographic region. Each cell has a fraction of the total amount of RF spectrum available to support cellular users. Cells are of different sizes (for example, macro-cell or micro-cell) and are generally fixed in capacity. The actual shapes and sizes of cells are complex functions of the terrain, the man-made environment, the quality of communication and the user capacity required. Cells are connected to each other via land lines or microwave links and to the public-switched telephone network (PSTN) through telephone switches that are adapted for mobile communication. The switches provide for the hand-off of users from cell to cell and thus typically from frequency to frequency as mobile users move between cells. In conventional cellular systems, each cell has a base station with RF transmitters and RF receivers co-sited for transmitting and receiving communications to and from cellular users in the cell. The base station employs forward RF frequency bands (carriers) to transmit forward channel communications to users and employs reverse RF carriers to receive reverse channel communications from users in the cell. The forward and reverse channel communications use separate frequency bands so that simultaneous transmissions in both directions are possible. This operation is referred to as frequency division duplex (FDD) signaling. In time division duplex (TDD) signaling, the forward and reverse channels take turns using the same frequency band. The base station in addition to providing RF connectivity to users also provides connectivity to a Mobile Telephone Switching Office (MTSO). In a typical cellular system, one or more MTSO's will be used over the covered region. Each MTSO can service a number of base stations and associated cells in the cellular system and supports switching operations for routing calls between other systems (such as the PSTN) and the cellular system or for routing calls within the cellular system. Base stations are typically controlled from the MTSO by means of a Base Station Controller (BSC). The BSC assigns RF carriers to support calls, coordinates the handoff of mobile users between base stations, and monitors and reports on the status of base stations. The number of base stations controlled by a single MTSO depends upon the traffic at each base station, the cost of interconnection between the MTSO and the base stations, the topology of the service area and other similar factors. A handoff between base stations occurs, for example, when a mobile user travels from a first cell to an adjacent second cell. Handoffs also occur to relieve the load on a base station that has exhausted its traffic-carrying capacity or where poor quality communication is occurring. The handoff is a communication transfer for a particular user from the base station for the first cell to the base station for the second cell. During the handoff in conventional cellular systems, there may be a transfer period of time during which the forward and reverse communications to the mobile user are severed with the base station for the first cell and are not established with the second cell. Conventional cellular implementations employ one of several techniques to reuse RF bandwidth from cell to cell over the cellular domain. The power received from a radio signal diminishes as the distance between transmitter and receiver increases. Conventional frequency reuse techniques rely upon power fading to implement reuse plans. In a frequency division multiple access (FDMA) system, a communications channel consists of an assigned particular frequency and bandwidth (carrier) for continuous transmission. If a carrier is in use in a given cell, it can only be reused in cells sufficiently separated from the given cell so that the reuse site signals do not significantly interfere with the carrier in the given cell. The determination of how far away reuse sites must be and of what constitutes significant interference are implementation-specific details. TDMA Conventional Cellular Architectures In TDMA systems, time is divided into time slots of a specified duration. Time slots are grouped into frames, and the homologous time slots in each frame are assigned to the same channel. It is common practice to refer to the set of homologous time slots over all frames as a time slot. Each logical channel is assigned a time slot or slots on a common carrier band. The radio transmissions carrying the communications over each logical channel are thus discontinuous. The radio transmitter is off during the time slots not allocated to it. Each separate radio transmission, which should occupy a single time slot, is called a burst. Each TDMA implementation defines one or more burst structures. Typically, there are at least two burst structures, namely, a first one for the initial access and synchronization of a user to the system, and a second one for routine communications once a user has been synchronized. Strict timing must be maintained in TDMA systems to prevent the bursts comprising one logical channel from interfering with the bursts comprising other logical channels in the adjacent time slots. Space Diversity Combining signals from a single source that are received at multiple spaced- apart antennas is called space diversity. Micro-diversity is one form of space diversity that exists when two or more receiving antennas are located in close proximity to each other (within a distance of several meters for example) and where each antenna receives the signals from the single source. In micro-diversity systems, the received signals from the common source are processed and combined to form an improved quality resultant signal for that single source. Micro-diversity is effective against Rayleigh or Rician fading or similar disturbances. The terminology micro-diverse locations means, therefore, the locations of antennas that are close together and that are only separated enough to be effective against Rayleigh or Rician fading or similar disturbances. The signal processing for micro- diverse locations can occur at a single physical location and hence micro-diversity processing need not adversely impact reverse channel bandwidth requirements. Macro-diversity is another form of space diversity that exists when two or more receiving antennas are located far apart from each other (at a distance much greater than several meters, for example, ten kilometers) and where each antenna receives the signals from the single source. In macro-diversity systems, the received signals from the single source are processed and combined to form an improved quality resultant signal for that single source. The terminology macro-diversity means that the antennas are far enough apart to have decorrelation between the mean signal levels for signals from the single source. The terminology macro-diverse locations means, therefore, the locations of antennas that are far enough apart to achieve that decorrelation. Since macro-diversity processing involves forwarding of signals to a common processing location, an adverse impact on channel bandwidth tends to result from macro-diversity processing. Shadow Fading The decorrelation of mean signal levels employed in macro-diversity systems is due to local variability in the value of signal strength diminution to each of the spaced-apart receiving antennas. This local variability exists on length scales above Rayleigh or Rician fading and is due to terrain effects, signal blocking by structures or vegetation, and any other variability that exists in a particular environment. This variability is referred to as shadow fading. Decorrelation lengths for shadow fading may be as small as length scales just above Rayleigh fading length scales (for example, less than a few meters), or may be as large as several kilometers. Signal Quality Enhancements In order for diversity combining to increase the quality of a signal, some measure of the quality of the input signals must be generated. One of the difficult problems in designing space-diversity algorithms is finding an accurate measure of precombination decision reliability, which can be computed in real-time. While micro-diversity systems improve system quality by ameliorating the effects of Rayleigh fading, which is short-term in nature, they are not very effective in combatting shadow fading, which is caused by effects such as an obstruction coming between a transmitter and a receiving antenna. While macro-diversity systems combine received signals from a number of receivers spaced far apart in space to combat shadow fading, in order for macro-diversity combining to increase the quality of the resulting signal, some measure of the quality of the individual received signals is necessary. In the above cross-referenced application entitled METHOD AND APPARATUS FOR WIRELESS COMMUNICATION EMPLOYING AGGREGATION FOR DIGITAL SIGNALS, a communication system is disclosed having a plurality of forward channel communications and a plurality of corresponding reverse channel communications from and to a plurality of mobile users. A plurality of collectors is distributed at macro-diverse locations for receiving reverse channel signals from the users. Each of the collectors typically includes micro-diversity receivers for receiving the reverse channel signals from users. The collectors forward these reverse channel signals to the aggregators. The aggregators combine the received signals from the macro-diverse collectors. The combining of multiple collector signals for the same user that are both macro- diverse and micro-diverse results in an output bit stream with fewer bit errors. In one embodiment of that cross-referenced application, the micro-diverse combining occurs in the collectors and the macro-diverse combining occurs in the aggregators. In an alternative embodiment, some or all of the micro-diverse combining occurs along with the macro-diverse combining in the aggregators. In the aggregation method of the cross-referenced application, the signals from users received at collector antennas are processed to yield one or more sequences of bits and corresponding one or more confidence metrics for each bit. Inputs from the same user through multiple micro-diverse antennas at each collector are combined to reduce errors resulting from Rayleigh and similar disturbances. Signals from the same user are processed to form sequences of bits and corresponding confidence metric vectors from multiple macro-diverse collectors. These signals are combined in an aggregator to reduce errors resulting from shadow fading and similar disturbances. Increasing the number of confidence metric bits (that is increasing the amount of bandwidth) tends to increase the quality of signals (particularly weak signals) while reducing the bandwidth available for other uses (hence reducing the capacity of the system or the quality of other parts of the system). An appropriate balance between reverse channel bandwidth, aggregated signal quality and system capacity is required. The aggregator processes the data from the multiple collectors and combines and decodes the resulting streams to reduce the probability of bit errors. The combining process utilizes the confidence metrics to make a final decision on each bit. The number of bits of data used in the cross-referenced application can be large and hence there is a need to reduce the amount of data allocated to confidence metrics. In accordance with the above background, the communications problems resulting from interference, noise, fading and other disturbances create a need for improved wireless communication systems which overcome the interference problems and other limitations of conventional cellular systems. SUMMARY OF THE INVENTION The present invention is a communication system having a plurality of forward channel communications and a plurality of corresponding reverse channel communications from and to a plurality of mobile users. A plurality of collectors are distributed at macro-diverse locations for receiving reverse channel signals from the users. The reverse channel signals from users received at collector antennas are processed to yield one or more sequences of data bits as a burst and corresponding initial confidence metrics for each bit where the confidence metrics for the burst form an initial confidence metric vector. The collectors include bandwidth control to forward these reverse channel signals including the data bits and corresponding processed confidence metrics to aggregators using different bandwidth levels. The higher the signal quality, the lower the bandwidth level and the lower the signal quality, the higher the bandwidth level. The aggregators combine the multiple collector signals for the same user received from the macro-diverse collectors. The combining of multiple collector signals for the same user when the quality of the signals is low results in an output bit stream for the user with fewer bit errors. The aggregator includes central control for commanding bandwidth levels to the collectors based upon information from multiple macro-diverse collectors. The processing of the initial confidence metrics to form processed confidence metrics is performed with a number of different variations which require different bandwidth levels. The initial confidence metrics in the initial confidence metric vector have an initial range, a^, represented by an initial number of bits, y m , and are processed to form processed confidence metrics having a processed range, β p , represented by a processed number of bits, γ p , and which form the processed confidence metric vector. In certain embodiments, the number of processed confidence metrics in the processed confidence metic vector are fewer than (and therefore can be sent at a lower bandwidth level) the number of initial confidence metrics in the initial confidence metic vector. The reduction in the number of confidence metrics is achieved by combining two or more initial confidence metrics into a single processed confidence metric and in this manner the total number of bits allocated to the processed confidence metric vector is less than the number of bits in the initial confidence metric vector. In other embodiments, the processed range, a,,, and the processed number of bits, γ p , are less than the initial range, a^, and the initial number of bits, ^, respectively. The reduction in the number of initial confidence metric bits to a fewer number of bits in the processed confidence metrics causes the total number of bits allocated to the processed confidence metric vector to be less than (and therefore can be sent at a lower bandwidth level) the number of bits in the initial confidence metric vector. In other embodiments, both the number of confidence metrics and the number of bits per confidence metric are reduced to cause the total number of bits allocated to the processed confidence metric vector to be less than (and therefore can be sent at a lower bandwidth level) the number of bits in the initial confidence metric vector. The present invention employs static and dynamic control of channel bandwidth at local and centralized sites. The bandwidth level is increased to improve the quality of poor signals and is decreased when signal quality is good to enable the unused bandwidth to be used by other resources. The foregoing and other objects, features and advantages of the invention will be apparent from the following detailed description in conjunction with the drawings. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 depicts a communication system for wireless users employing macro- diversity combining, each user transmitting user signals to a plurality of collectors that in turn forward the user signals with processed confidence metrics for each user to an aggregator for combining. FIG. 2 depicts further details of the users, plurality of collectors and aggregator for the communication system of FIG. 1. FIG. 3 depicts a block diagram representation of a collector. FIG. 4 depicts a block diagram representation of a collector processing unit for processing of confidence metrics. FIG. 5 depicts a block diagram representation of compression of confidence metrics. FIG. 6 depicts a block diagram representation of an aggregator. FIG. 7 depicts a detailed representation of an embodiment of the aggregator of FIG. 6. FIG. 8 depicts a block diagram representation of an aggregator processing unit for processing of confidence metrics. FIG. 9 depicts a block diagram representation of uncompression of compressed confidence metrics. FIG. 10 depicts a graphic representation of the signal level from a collector for one particular user. FIG. 11 A, FIG. 11B and FIG. 11C depict a graphic representation of the signal levels from three different collectors for one particular user. FIGs. 12A, 12B and 12C depict a representation of when the the FIGs. 11 A, 11B and 11C signals are above an aggregation threshold level. FIG. 13 depicts a logical OR of signals analogous to the FIGs. 12A, 12B and 12C signals but processed relative to a higher threshold. FIG. 14 depicts the logical OR of the FIGs. 12A, 12B and 12C signals. FIG. 15A, FIG. 15B and FIG. 15C depict sections of FIG.11 A, FIG. 11B and FIG. 11C signal levels, respectively. FIG. 16A, FIG. 16B and FIG. 16C depict sections of FIG. 12A, FIG. 12B and FIG. 12C signal levels, respectively. FIG. 17 depicts a time-expanded section of FIG. 13. FIG. 18 depicts a time-expanded section of FIG. 14. FIG. 19 and FIG. 20 depict representations of multiple zones of the FIG. 1 type in a cellular system. FIG. 21 depicts representations of multiple zones of the FIG. 1 type in a cellular system with users located in subzones. DETAILED DESCRIPTION Cellular System - FIG. 1 In FIG. 1, a cellular system is shown having a zone manager 20 that broadcasts forward channel (FC) communications from broadcaster 16 to multiple users 15 including users Ul , U2, ... , UU located within a zone 5 designated by the dashed-line triangle. Each of the multiple users 15 transmits reverse channel (RC) communications to one or more of multiple collectors 45 including collectors Cl, C2 and C3, which in turn forward the reverse channel communications to aggregator 17 in zone manager 20. Each of the users 15 has a receiver antenna for receiving broadcasts on the forward channel from the broadcaster 16. Also, each of the users 15 has a transmitter that transmits on a reverse channel to the collectors 45. The collectors 45 are sited at macro-diverse locations relative to each other within zone 5. Therefore, multiple copies of macro-diverse reverse channel communications are received at the aggregator 17 for each user. In FIG. 1, the Ul user 15 is typical with forward channel (FC) communication from broadcaster 16, the user-to-collector reverse channel communications O^RC) to each of the Cl, C2 and C3 collectors 45, and the collector-to-aggregator reverse channel communications ( c ϊ RC) for each of the collectors to aggregator 17. The reverse channel communications from the Ul user 15 include the user-to-collector communication "'"RCl and the collector-to- aggregator communication c/ϊ RCl, the user-to-collector communication u/c RC2 and the collector-to-aggregator communication c/ RC2 and the user-to-collector communication ^RCS and the collector-to-aggregator communication c/a RC3. Each of the other users U2, ... , UU in FIG. 1 has similar forward and reverse channel communications. The forward and reverse channel communications of FIG. 1 in the present invention apply to any digital radio signal system including for example TDMA, CDMA, SDMA and FDMA systems. If the digital radio signals of any particular system are not inherently burst structured, then arbitrary burst partitions may be used for confidence metric processing in accordance with the present invention. Multiple-Collector Configuration - FIG. 2 In FIG. 2, a plurality of collectors 45-1 , ... , 45-Nc, like the collectors 45 in FIG.l, each receive reverse channel communications from users 15-1, ..., 15-U. For each user 15, the collectors 45-1, ..., 45-Nc each process the received signals with initial confidence metrics to generate data bursts, l p , ..., Nc B p , respectively, and corresponding processed confidence metric vectors ^M,,, ... , No CM p , respectively, all representing the same communication from the user 15. These communications have macro-diversity because of the macro distances separating the collectors 45 of FIG. 1. These communications include spatially macro-diverse data bursts, ^ p , ..., Nc B p , and corresponding processed confidence metric vectors ^M., ..., Nc CM p that are forwarded to the aggregator 17 in formatted form designated as ... , Nc B p / Nc CM p / Nc M/ Nc CC. The aggregator 17 combines the spatially diverse data bursts x B p , ... , Nc B p , and corresponding confidence metric vectors 'CM,,, ... , Nc CM p to form a final single representation of the data burst, B f , with a corresponding final confidence metric vector, CM f . The aggregator 17 may use the measurement signals ,... , Nc M and control signals CC, ... Nc CC in selecting or processing the data bursts ^ p , ... , Nc B p , and/or the corresponding confidence metric vectors ^M p , ... , Nc CM p . For example, if a particular burst is associated with a poor quality signal, the particular burst may be excluded from the aggregation. The quality of a signal is measured in one example based on the channel model attenuation estimate. In FIG. 2, the collectors 45-1 , ... , 45-Nc include an RF subsystem groups 41-1, ..., 41-Nc which have two or more micro-diversity receive antennas 48-1, ..., 48-N a . The antennas 48-1, ... , 48-N a each receives the transmitted signals from each one of a plurality of users 15-1 , ... , 15-U. Each representation of a received _ signal from a single user that is received by the RF subsystem group 41-1, ..., 41- Nc connects in the form of a burst of data to the corresponding signal processor group 42-1, ..., 42-Nc. The received data bursts from the antennas 48-1, ..., 48- N a are represented as *B r , ... , Na B r . The signal processor groups 42-1 , ... , 42-Nc processes the plurality of received bursts for a single user to form a single processed bursts, l B p , ... , Nc B p , representing the signals from the single user. The processed bursts, ^ p , ..., Nc B p , have corresponding confidence metric vectors, 'CM., 2 CM p , ... , Nc CM p , representing the reliability of each bit of the data bursts. Each processed burst has the bits β pl , β p2 , ..., β pB and the processed confidence metric vector, CM,,, has the corresponding processed confidence metrics CTj pl , CTJ p2 , ..., Ciτj pB . Measurement signals, 1 M, ... , Nc M, are formed that measure the power or other characteristics of the signal. The processed bursts, the confidence metric vectors, and the measurements connect to the interface units 46-1, ..., 46-Nc which format those signals and transmit or otherwise connect them as reverse channel signals to the aggregator 17. In FIG. 2, the signal processor groups 42-1, ..., 42-Nc receive timing information that permits collector signals from each collector to be time synchronized with signals from each of the other collectors. For example, each collector has a global positioning system (GPS) receiver (not shown) for receiving a time synchronization signal. Alternatively, or in addition, the zone manager 20 of FIG. 1 can broadcast or otherwise transmit time synchronization information. The signal processors 42-1 , ... , 42-Nc provide time stamps in collector control signals ^C, ..., Nc CC that are forwarded from interface units 46-1, ..., 46-Nc as part of the reverse channel signals to the aggregator 17. Collector - FIG. 3 In FIG. 3, a collector 45 is typical of each of the collectors 45 of FIG. 1 and FIG. 2. In FIG. 3, the collector 45 includes an RF subsystem group 41 which has two or more micro-diversity receive antennas 48-1 , ... , 48-N a . The antennas 48-1 , ... , 48-N a each receives the transmitted signals from each one of a plurality of users. Each representation of a received signal from a single user that is received by the RF subsystem group 41 connects in the form of a burst of data to the signal processor group 42. The received bursts of data from the antennas 48-1 , ... , 48-N a are represented as ^ ..., N B r , respectively, in FIG. 3. The signal processor group 42 processes the plurality of received bursts for a single user to form a single processed burst, B p , representing the signals from the single user. The processed burst, B p , has a confidence metric vector, CM, representing the reliability of each bit of the data comprising the processed burst, B p . Each processed burst has the bits β D β P2> ••• > β PB ^d the confidence metric vector, CM, has the corresponding confidence metrics crjj, CTfe, ..., crrj B . Measurement signals, M, are formed that measure the power or other characteristics of the signal, and control signals, CC, are generated to control the operations. The processed burst, B p , the confidence metric vector, CM p , the measurements, M, and the control, CC, connect to the interface unit 46 which formats those signals and transmits or otherwise connects them as reverse channel signals to the aggregator 17 of zone manager 20 of FIG. 1. In FIG. 3, the signal processor group 42 receives timing information that permits collector signals from each collector to be time synchronized with signals from each of the other collectors. For example, each collector has a global positioning system (GPS) receiver (not shown) for receiving a time synchronization signal. Alternatively, or in addition, the zone manager 20 or some region manager (not shown) of FIG. 1 can broadcast or otherwise transmit time synchronization information. The time stamp is provided in the control code (CC) signal that is forwarded from interface unit 46 to the aggregator 17 of FIG. 2. In FIG. 3, the RF subsystem group 41 includes an RF diversity unit 51 that receives signals from users 15 on micro-diversity antennas 48-1, ..., 48-N a and connects to a channelizer/digitizer 52. The channelizer isolates signals on individual carriers for processing with an output for each of the carriers N 1; ... , N ic . The digital signals from the channelizer/digitizer 52 for one carrier are input to the signal processor group 42-1 and specifically to a buffer 98. The address unit 99 selects from buffer 98 bursts that correspond to individual users for processing by micro-combiner 53. The micro-combiner 53 outputs processed data bit values in processed burst, B p , and associated confidence metric values in confidence metric vector, CM p . The data and metric values from signal processor 42-1 are connected directly to the format unit 43 in interface unit 46. In FIG. 3, a plurality of signal processors 42-1, ..., 42-N ic form a signal processor group 42 with one processor for each channel signal from the channelizer/digitizer 52. Each signal processor is like processor 42-1 and provides inputs to interface unit 46. The digital signals from the channelizer/digitizer 52 for a carrier are input to one of the signal processors 42-1 , ... , 42-N ic and a corresponding buffer like buffer 98 in signal processsor 42-1. The data and metric values from signal processors 42-1, ..., 42-Nic are all connected directly to the format unit 43 in interface unit 46 for forwarding to an aggregator. In FIG. 3, the control 50 performs control functions associated with the other units of the collector and in particular, receives the time synchronization signal through antenna 97-2 from some timing source. The control 50 generates a time stamp that is inserted at times into the control code (CC) field by the interface unit 46 so that each one or more bursts has a time stamp in a collector that is used at the aggregator to time correlate the same bursts from the same user that are processed at different collectors. In FIG. 3, the address unit 99 controls the writing of the signals into buffer 98 and the reading of the signals from buffer 98. The address unit 99 is synchronized by coarse timing information from control 50 and by fine timing information from micro-combiner 53. Further, a signal measurement unit 54 receives signals from the combiner 53 to form power or other measurements on the received bursts or on the processed signals from the combiner 53 to form a measurement signal, M, that inputs to interface unit 46. The format unit 43 changes the format of the data and metric values from the signal processor group 42 to form signal, B p /CM p /M/CC, and the format unit 43 connects to the signal transmit unit 44. The transmit unit 44 of collector 45 transmits or otherwise connects the reverse channel user information, B p /CM p /M/CC, to the aggregator 17. The transmission medium between the collector 45 and the aggregator 17 can be land lines, such as wire or optical fiber, or can be RF transmission using either in-band or out-of-band RF transmission signals. If the collector 45 is located at the aggregator 17, then a local bus or other direct connection not requiring transmission is employed. In FIG. 3, the micro-combiner 53 operates with each of the received data bursts l B t , ..., Na B r to form the processed data burst, B p , and a corresponding confidence metric vector, CM. The combining of confidence metrics from micro- diverse antennas at a collector to produce processed bits of a processed data burst, B p , and corresponding confidence metrics may be accomplished in one embodiment by an integrated multisensor equalization process. In another embodiment, the signals from separate antennas may be equalized individually and then combined by averaging or other processing of the equalizer confidence metrics. The processed data burst, B p , includes the processed burst bit values β pl , β p2 • • • , β pB and the resultant confidence metric vector, CM, includes the corresponding confidence metrics CTh, Ciτj 2 , ..., CTJ B where B in the subscript is the number of bits in the burst and the number of corresponding confidence metrics, one confidence metric for each bit. The confidence metric, CT) b , is in the form of a number. A large positive confidence metric value indicates a high confidence that the data bit is a binary 1. A large negative confidence metric value indicates a high confidence that the data bit is a binary 0. Collector Confidence Metric Processing Unit - FIG. 4 And FIG.5 In FIG. 4, the Collector Confidence Metric Processing unit 49 of FIG. 3 is shown in further detail. The confidence metric vectors for a series of bursts are input one at a time to the CM input register 61. Each confidence metric vector, CM, includes the confidence metrics CTJ], CTh, ..., crrj b , ..., crrj B , one for each of the B data bits, β pl , β p2 , ..., β pb , ..., β pB , in a data burst. Each of the confidence metrics such as typical confidence metric, cn_ b. corresponding to a data bit, β pb , is in the form of an signed number, s b c b , where s b is the sign having a -1 or +1 value and c b is the amplitude where 0 < c b < a and the amplitude a indicates the range for c b . Therefore, each confidence metric, cπ_ b , is represented by a signed number value, s b c b , where (-a) <s b c b < (+a). For γ equal to the number of bits in the amplitude of the confidence metric, a — V . A large positive confidence metric value, +c b , indicates a high confidence that cτj b is a binary 1. A large negative confidence value for -c b indicates a high confidence that Ci j b is a binary 0. More generally, the confidence metrics, cirj ! , cn] 2 , ..., cπ_ b , ... , CITJ B are represented by the signed numbers S J C J , S£ 2 , ..., s b c b , ..., Sj£ B for the B bits in a data burst. In one embodiment described, the logical 1 and logical 0 values of the data bits, β pl , β p2 , ... , β pb , ... , β pB , in a data burst represent the signs s s 2 , ..., s b , ..., s B where a 1 for a data bit is positive and a 0 for a data bit is negative. Only the data bits, β pl , β p2 , ..., β pb , ..., β pB and confidence metrics are actually transmitted from the collectors to the aggregator. At the aggregator, the data bits, β pl , β p2 , ... , β pb> • • • > β PB are mapped to the signs Sj, s 2 , ..., s b , ..., s B where a 1 for a data bit is a positive sign and a 0 for a data bit is a negative sign as follows: β = 0 - s b = -I β = 1 - s b = +1 Eq. (1) In FIG. 4, the CM processor 62 operates with a number of different algorithms to process the initial confidence metrics to form processed confidence metrics. For example, the processing includes grouping of confidence metrics, scaling and quantizing of confidence metrics together with static and dynamic control of the processing. In FIG. 4, the CM processor 62 in one grouping embodiment processes the confidence metrics in groups and, for each group, provides one or more processed confidence metrics. The initial confidence metrics crn, ! , crτj 2 , ..., crη b , ... , crrj B for one data burst are divided into G groups that include the groups Gl , G2, ... , GG that in turn include the confidence metrics cπrj,, ... , crrj gl for group Gl ; Crrj^ +D , • • • » cn] g2 ; ... ; Ciτj (gG . 1)+1 , ... , crrj gG for group GG. Each of the confidence metrics in the first group, crf]_,..., Crrj gl , is combined to form a single processed confidence metric crrj pl . Similarly, the other groups are processed to form the processed confidence metrics crrj pl , crη p2 , ..., cιη pi , ..., cιη Pg . By way of example, and referring to FIG. 5, the confidence metrics cnrj j , Crrj 2 , ... , CT) b , ... . CT) B for one burst are divided into four groups. The four groups Gl, G2, G3 and G4 include the confidence metrics crTjj, ..., cτj gl for group Gl; CiTj f ci + i ) , ... , Crτj g2 ; for group G2; crη fe2+1) ... , Crrj g3 for group G3 ; and crrj +1) , ... , CιTj g4 for group G4. Each of the confidence metrics in the first group, crrj j , ... , Crrj gl , is combined to form a single processed confidence metric cτj pl . Similarly, the four groups are processed to form the four processed confidence metrics crrj pl , CT) p2. Cπr) p3 , Cirj p4 . The processing for each group is achieved in one embodiment by averaging the confidence metrics in a group. The processed confidence metric for the i* group, Cirj p. , is given by the average as follows: Aτ=g0+1) Σ crη* f=g(Q+l Eq. (2) Crη _ c 'pi g(i^)-g( ) where, Ciτj k = k initial confidence metric CD p i = processed confidence metric for the I th group g(i)+l = beginning confidence metric in group g(i+l) = ending confidence metric in group g(i- -l) - g(i) = number of confidence metrics in group By way of example and referring to FIG. 5 for group Gl with g(l) equal to 4, Eq. (2) becomes: _ crη, ÷ crrj 2 + crη 3 ÷ Crη 4 Ciη^ Eq. (3) In the four-group example described, the processing of four groups causes four processed confidence metrics to replace all (for example, 116 in a GSM embodiment) of the initial confidence metrics. In FIG. 4, the input to register 61 is the initial confidence metrics cn]_, Ciτj 2 , ..., crrj b , ..., crrj B and the output, after processing in the collector CM processor 62, is the processed confidence metrics CTj p u Cn] p2 , ..., crrj pG stored in the CM output register 64. In the example where the number of groups, G, is four, the four processed confidence metrics are cn] pl , Ciη p2 , Ciη p3 and cπ) ≠ . Other grouping embodiments process confidence metrics by using a median confidence metric or some N* percentile confidence metric to represent two or more of the initial confidence metrics. The combining of groups of confidence metrics substantially reduces the amount of data required to represent confidence metrics and hence reduces the amount of reverse channel information which is propagated and thereby conserves reverse channel bandwidth. In FIG. 4, the CM store 63 stores control code and information for the algorithms used to combine the confidence metrics from the input register 61 to form the processed confidence metrics in the output register 64. In one example described, store 63 determines that the input metrics will be divided into four groups and causes each group to be averaged to form one processed confidence metric per group. Other control algorithms are stored in the CM store 63. For example, the number of confidence metrics in each group, the group boundaries (overlapping or non-overlapping) and the number of bits per processed confidence metric can be selected. The combining process is controllable to use algorithms other than averaging (for example using a median confidence metric or some N 111 percentile confidence metric) and the combining process is controllable to apply one algorithm at one time and another algorithm at another time. The store 63 is static in one embodiment and in other embodiments is modified from time to time with information over the remote interface 65. In some embodiments of the present invention, the confidence metrics are scaled and quantized so that each one can be represented by a small number of bits, typically 2 to 4, to conserve transmission bandwidth. Such quantization of the initial confidence metrics tends to have only a minimal adverse impact on the final signals output from the aggregator 17 of FIG. 2 if three or more bits are used. By way of comparison, grouping of initial confidence metrics into grouped confidence metrics tends to have a greater adverse impact on the final signals output from the aggregator 17 of FIG. 2 when the group sizes are one-half or one-quarter of the total number of initial confidence metrics. A simple quantization scheme is linear quantization, where the range of confidence metrics is divided into 2 γ equal-sized bins, and values in each bin are represented by a γ-bit value. In FIG. 4, each of the initial confidence metrics, crrh, Crrj 2 , ... , CTJi, ... , cnrj B has an initial range, a^, represented by an initial number of metric bits, γ^, and the collector confidence metric processing unit processes the initial confidence metrics to form processed confidence metrics, Cn] pl , cn] p2 , ... , CTJ pG , each having a processed range, a., represented by a processed number of metric bits, γ p , where the processed number of metric bits, γ p is typically less than the initial number of metric bits, γ ώ . Assuming that confidence metrics are processed in unsigned form (since the sign information is present in the corresponding data bit values that are also transmitted to the aggregator) the following formula can be used to perform linear quantization of the confidence metrics: Crη pi = FLOOR 2 r Eq. (4) where: Cirj p i = processed confidence metric as quantized value of CTJ; max_cπ)_value = maximum value of cn]_ i = 1, 2, ..., B e — small positive value chosen so that the division always produces a number less than 1. The floor function maps its argument to the nearest integer less than or equal to the argument. For example, if the maximum confidence metric possible from the micro combiner is 100, and the desired number of bits per transmitted confidence metric is 3, the formula is C π) pi = FLOOR Eq. (5) Various examples of confidence metric processing using different groupings and quantizations are listed in TABLE 1. In TABLE 1, a^ represents the range of each of the input confidence metrics, en];, where i = 1, ... . B, γ in represents the number of binary bits used to represent a in , a p represents the range of each of the output confidence metrics, crrj pj , where j = 1, ..., G, γ p represents the number of binary bits used to represent a p , G represents the number of groups per burst (assuming 116 data bits per burst as is the case in a GSM embodiment), BITS G represents the number of bits per group, and TOT^ represents the total number of bits per burst used for the confidence metrics of a confidence metric vector for a burst. TABLE 1 In TABLE 1, Example 1 is the initial unprocessed confidence metric, Examples 2 and 5 employ quantization as set forth in Eq. (4) and Eq. (5) above and Examples 3, 4 and 5 employ grouping. Note that Example 5 employs a combination of both grouping and quantization. The relationship between the performance of confidence metric processing as determined by the quahty of the final signals output from the aggregator 17 of FIG. 2 and the total number of bits per burst, TOT^, depends on a number of factors. When the quahty of the received signals is high, then the quality of the final signals output from the aggregator 17 tends to be high even when the total number of bits per burst is low. When the quahty of the received signals is low, then the quahty of the final signals output from the aggregator 17 tends to be higher when the total number of confidence metric bits sent per burst is higher. The total number of bits per burst allocated to confidence metrics affects the capacity of the system as well as the quahty of the signals. Higher numbers of bits allocated for confidence metrics reduces the number of bits available for other purposes such as for increased numbers of users in the system. In light of this trade off between quahty and capacity, the performance of the system is enhanced if more confidence metric bits are allocated to improving poorer quahty initial signals where the improvement is needed than are allocated to improving higher quahty initial signals where the improvement is not needed. Aggregator - FIG. 6 and FIG. 7 In FIG. 6, a block diagram representation of the aggregator 17 is shown. The aggregator 17 includes a receive/format group 66 which operates to receive and format signals transmitted by the signal transmit unit 44 of collectors 45 of FIG. 3. The received signals 1 B 1 CM p 1 M 1 CC, B p / 2 CM M/ 2 CC, ... , Nc B p / ""Cm,,/ No M/ Ne CC, after formatting are connected to the signal processor 67 which processes the received signals for macro-diversity combining. The format group 66 uses the time stamp and other control code (CC) information to align the signals from different collectors for the same user. More specifically, the format unit 66 for each one or more bursts compares and aligns the time stamps from the control fields ^C, 2 CC, ... , Nc CC so that the corresponding data, confidence metric and measurement signals from different collectors, for the same common burst from a user are aligned. In FIG. 7, further details of the signal processor 67 for the aggregator 17 of FIG. 6 are shown. The signal processor 67 of FIG. 7 is a representation of the processing of burst signals from a single one of the users, for example user 15-1 of FIG. 2 and the N c representations of the reverse channel signal from the user as received through the N c active collectors, such as the collectors 45-1, 45-2, ..., 45-N c in FIG. 2. In FIG. 1, the N c data, metric and measurement values at 96 for a single user include the data and processed confidence metric pairs ^B,,, 'CM p ], [ 2 B,„ 2 CM p ] , ..., [ Nc B b , Nc CM p ] and the measurement values, X M, 2 M, ..., Nc M. The processed confidence metrics, 'CM,,, CM p , ... , Nc CM p are processed in the aggregator CM processing units 70-1, 70-2, ..., 70-Nc, respectively, to form the aggregator processed confidence metrics, 'CM pp , 2 CM pp , ..., Nc CM pp . The aggregator processed confidence metrics, 'CM.., 2 CM pP , ..., Nc CM pp together with the data bits, ^j 2 B b , ..., ^B b , at 87 are input to the input selector 93 which selects one or more aggregator processed confidence metrics and corresponding data bits for each of the combiner unit groups 99 including combiner unit groups 99-1 , ... , 99-N g . The selected aggregator processed confidence metrics, 'CM pp , 2 CM pP , ..., Nc CM pp together with the corresponding selected data bits of bursts 1 B b , 2 B b , ... , Nc B b , are input at 88 to macro-diversity combiners like macro-diversity combiner 73 in combiner unit 99-1. The combiner unit group 99-1 is typical of the combiner unit groups 99-1 , ..., 99-N g and includes the macro-diversity combiner 73, de-interleaver 74, de- convolution unit 75 and block decoder 85. The data and metric values from the combiner 73 are de-interleaved in the de-interleaver 74 and de-convolved (that is, the convolutional coding is removed) in de-convolution unit 75. The data and metric outputs from the de-convolution unit 75 connect to the block decoder unit 85 to form the output pair 78-1. Specifically, the combiner unit groups 99-1 , ... , 99- Ng provide the output pairs 78-1 , ... , 78-Ng that are input to the output selector 95. The output selector 95 selects one of the output pairs 78-1, ... , 78-Ng as the final output pair 78 that connects to communications network 76 and, ultimately, after connection through the network, to a speech decoder 77 to re-establish a user voice signal that corresponds to the user voice signal that was input to the transceiver of the user 15 in FIG. 2. The FIG. 7 signal processor 67 includes a measurement processor 91 that receives the measurement signals 1 M, 2 M, ... , Nc M and processes them to determine which ones or all of the data and metric values are actually used in the macro- diversity combiners 73 in each of the combiner unit groups 99. As one example, the measurement signals are measures of the power of the received bursts and any burst that has a power level that is below a threshold is not selected for further processing. The selector 93 selects different ones of the data and metric input pairs as inputs to the macro-diversity combiners 73. The FIG. 7 signal processor 67 in a simple embodiment does not use the measurement signals 1 M, 2 M, ... , Nc M. In FIG. 7 and in one embodiment, the measurement processor 91 provides weighting factors j, 2 w b , ..., a w b , ..., Nc w b corresponding to the data bits , 2 β p , ... , Nc β p of a burst. The weighting factors are used, for example, to weight the combination of bit values based upon a measurement parameter from measurement processor 91. The data and metric values from the combiners 73 are de-interleaved in the de-interleavers 74 and de-convolved in de-convolution units 75, respectively. The data and metric outputs from the de-convolution units 75 connect to the block decoders 85, respectively, which in turn connect to the output selector 95. The output selector 95 operates, for example, on frame erasure signals from the block decoders 85 which are input to the erasure select control 94. The erasure select control 94 may inhibit any of the outputs 78-1, ... , 78-Ng from block decoders 85 from being selected as the output 78 when a frame erasure signal is present. When more than one of the outputs is available without a frame erasure signal, the one selected is the one corresponding to a particular measurement signal from measurement processor 91. For example, one having the highest power level is selected. The block decoders 85 connect through output selector 95 to the communications network 76 and ultimately after connection through the network to a vocoder 77, to re-establish a voice signal that corresponds to the user voice signal that was input to the user transceiver. Aggregator Confidence Metric Processing Unit - FIG. 8 And FIG. 9 In FIG. 8, the aggregator CM processing unit 70 is typical of the CM processing units 70-1, 70-2, ..., 70-N. of FIG. 7. The processed confidence metric vectors 'CM p , ... , c CM p , ... , Nc CM p are input one at a time to the CM input register 61. Each processed confidence metric vector, e CM p , includes as an input the processed confidence metrics Υjrη p ι, ... , c Crrj pG and produces as an output the output confidence metrics "cn],^, ..., jn3 ppG . The type of processing performed in the aggregator CM processing unit of FIG. 8 complements the type of processing performed in the collector CM processing unit of FIG. 4. Specifically, when the confidence metrics have been grouped in the collector CM processing unit of FIG. 4, the aggregator CM processing unit of FIG. 8 ungroups the confidence metrics. In FIG. 8, the CM processor 62 in a grouped confidence metric embodiment operates for each grouped confidence metric to provide ungrouped confidence metrics, one for each data bit. By way of the FIG. 5 example, and referring to FIG. 5, the initial confidence metrics c cπ]ι, JITJ 2 , ... , c cπ] b , ..., jιη B for one burst were divided into four groups. In FIG. 8 the grouped confidence metric "CTJ p i, is processed to provide the aggregator output confidence metrics c C ) ι. ... . Tjrrj gl for group Gl; the grouped confidence metric Υjrη p2 is processed to provide the aggregator output confidence metrics c cn] fel+1) ..., jrn, g2 for group G2, the grouped confidence metric TJirj p3 is processed to provide the aggregator output confidence metric "CTJ^ +I. J ..., ΥJtτj g3 for group G3; and the grouped confidence metrics Jirj^ is processed to provide the aggregator output confidence metrics "CITJ^ +D . ... . c Cϊ ) g4 for group G4. The processing for each grouped confidence metric in the aggregator is achieved, in one embodiment, by setting each of a plurality of aggregator output confidence metrics equal to the grouped confidence metric value for its corresponding group. In FIG. 8 for the FIG. 9 example, the input to register 61 for each of the 1, ..., N c collectors is the grouped confidence metrics crrj pl , crη p2 , cnrj p3 and and the output, after processing in the CM processor 62, is the aggregator output confidence metrics jrrjj, jrτ] 2 , ... . jrτj b , ..., ΎJΓΓJ B stored in the register 64. The aggregator output confidence metrics, p cn] fel+1). c crrj 2 , ..., e cπr) b. ..., Υjτj B , are not a one-for-one reconstitution of the initial confidence metrics, CiT , CT] 2 , ... , Crrj b , ... , crrj B , since the confidence metric processing may be lossy in that some information is lost. Notwithstanding the lossy processing, overall system operation is enhanced by allowing flexibility in trade-offs between quahty, bandwidth and capacity. In FIG. 8, the CM store 63 stores control code and information for the algorithms used to process the grouped confidence metrics from the CM input register 61 to form the confidence metrics in the CM output register 64. In the example described, store 63 determines that the input of the metrics has been divided into four groups and causes each confidence metric of a group to be equal to the average determined in the CM processing unit 49 of FIG. 4. Other control algorithms are stored in the CM store 63 of FIG. 8 to match the operation of the collector CM processing unit of FIG. 4. Combining Processed Confidence Metrics The aggregator 17 of FIG. 6 receives a plurality of bursts 'B p , ... , B p , ... , Nc B p , representing the reverse channel signals for the same particular one of the users 15 and combines them based on quality metrics. Each burst such as typical burst, e B p , includes data bits β pl , β p2 , ..., β pb , ..., β pB , and a confidence metric vector, CM, having confidence metrics, CTh, crτ) 2 , ..., crrj b , ..., cnrj B . The confidence metrics, crT , Ci } 2 , ..., crrj b , ... . CiTj B are represented by the signed numbers S J C J , sp- 2 , ..., s b c b , ..., SgC B . In the embodiment described, the logical 1 and logical 0 values of the data bits, β pl , β p2 , ... , β pb , ... , β pB , in the data burst represent signs s 1} s 2 , ..., s b , ... , s B of the confidence metrics where a 1 for a data bit is positive sign and a 0 for a data bit is a negative sign. In an embodiment where N c representations, ^ pb , 2 β pb , ..., Nc β pb , of each bit such as typical bit, β pb , are generated with Nc confidence metrics, 'cirj,,, 2 crrj b , ..., α CT) b> • • • > Nc CT) b f° r ∞ch bit, each measured by numbers 1 c b , 2 c b , ...,, a c b , ..., Nc c b , respectively, with each number a c b ranging between 0 and +a and where % is the sign, the average aggregate confidence metric, agg c b for each bit b is as follows: agg r _ Σ c b 1) Eq. (6) N. α=l In an example where the number of collectors N c is equal to 3, the calculations for a single one of the bits b is as follows: + 1) + V c * + 1)) Eq. (7) The Eq. (4) confidence metric combining is useful where soft decision information is available for each bit of data. One embodiment for generating the initial soft decision information in the form of initial confidence metrics uses micro-diversity processing at collectors having two or more spatially diverse antennas 48-1, ..., 48- Na as described in connection with FIG 2. Referring to the collectors of FIG. 3, for example, macro-diversity is achieved with the spatially macro-diverse collectors 45-1, ..., 45-Nc where in an example if N c = 3, the collectors are 45-1, 45-2 and 45-3 (45-2 and 45-3 are not explicitly shown in FIG. 2). A numerical example is as follows: a = 200 γ = 8 = 103.33 (Collector 45-1), ( x β fc = 0) Eq. (8) 2 c b = 56.69 (Collector 45-2), ( 2 β. = 0) 3 c b = 166.67 (Collector 45-3), ( 3 β ft = 1) The FLOOR function as described in Eq. (4) is applied to the values of Eq. (8) and these values are then forwarded from the collector to the aggregator. At the aggregator, the data bits 1 β b , 2 β b and 3 β b having values 0, 0 and 1, respectively, are mapped to the signs 1 s b , 2 s b and 3 s,, having values -1, -1 and +1, respectively, and then Eq. (7) becomes: asSc b = - ( (-1)(103 + 1) + (-1)(56 + 1) + ( + 1)(166 + 1) Eq. (9) In this example, although the magnitude of the negative values for confidence metrics c b (-103) for the path 1 (from a collector 45-1 of FIG. 2) and 2 c,, (-56) for path 2 (from a collector 45-2 not explicitly shown in FIG.2) indicate a 0 bit, the positive value of confidence metric 3 c,, for path 3 (from a collector 45-3 not explicitly shown in FIG.2) indicates a 1 bit with a magnitude that is large enough to outweigh the negative magnitudes for confidence metrics 1 c h and 2 C b . For the case where micro-diversity equalization occurs at the collectors and aggregation occurs at an aggregator (where the aggregator is remotely located at a BTS, for example), the number of confidence metrics and the precision (range) of those metrics is limited in order to conserve bandwidth. Where the back haul design only allocates a few bits for transmitting confidence metrics, the number of bits in the initially formed confidence metrics at the collectors needs to be reduced. For example, if 3-bit integers are allocated for transmitting confidence metrics, then the range, a, of values transmitted is from 0 to 7 (or 1 to 8) where γ indicates the size in bits of the metric and the range, a, is 2 γ . Let c p be the magnitude of the processed confidence metric derived from processing the initial confidence metric, c^, represented by a γ-bit integer. Then the following algorithm is used to reduce the number of confidence metric bits required: c p = FLOOR Eq. (10) a } From the previous example with a = 200, Eq. (10) becomes for each path l c p = FLOOR 103.33 4, (\ = 0) 200 J 56.67 2 c p = FLOOR 2, (% = 0) 200 Eq. (11) 3 c = EEOOR 166.67 p 200 = 6, X = 1) The values of Εq. (11) are transmitted from the collectors to the aggregator. At the aggregator, the data bits i β b , 2 β b and 3 β b having values 0, 0 and 1, respectively, are mapped to the signs , and ^ having values -1, -1 and + 1, respectively, and then Εq. (7) becomes: c p = j ( (-1X4 + 1) + (-1)(2 + 1) + (+1X6 + 1)' Εq. (12) The small negative value determined by Eq. (12) for the processed confidence metric indicates low confidence that the bit is a 0. The bit-by-bit confidence metric aggregation is implemented at the aggregator using the 3-bit confidence metric representation with each data bit transmitted from the collector. A normal GSM burst has 116 coded data bits. Therefore, using 3-bit confidence metrics, an additional 348 bits of confidence metric information needs to be transmitted for each burst from each collector. In order to reduce the number of confidence metric bits further, in embodiments of the invention, the confidence metrics are grouped. One processed confidence metric can be used for different group sizes. For example, one metric can be used for every half burst of data, for every quarter burst of data or for every 4 bits of data. If 3-bit confidence metrics are grouped on a half burst basis, this requires that each burst transmit an additional 6 bits of data, 3 additional bits for the confidence metric for each half of the data segment. The algorithm for forming one grouped confidence metric, c pg , for a group of n confidence metrics and then aggregating is as follows. The processed grouped confidence metric, c pg , for a group of n confidence metrics for a coπesponding n data bits, with the bit number for a group indicated by the subscript, k, is given by averaging the confidence metrics of the group as follows: 'c 1 'c pg = FLOOR Eq. (13) = FLOOR ± n w - a Σ fe = ι For example, for a grouping of confidence metrics for four data bits path! 1 c 1 = 103.33 80.00 'c_ = 123.33 -70.00 path2 -56.67 156.67 80.00 43 33 Eq. (14) path3 3 C j = 166.67 -70.00 183.33 s c. = 186.67 Eq. (13) becomes: g = FLOOR I s 200 k=l 2 c pg = FEOOR I s Εq. (15) 200 *=ι 3 c pg = FLOOR The grouped values of Εq. (15) are transmitted from the three different collectors 45 to an aggregator 17. The aggregator performs the ungrouping by assigning the group value to each of the ungrouped values, one for each data bit, of a group. The signals are then aggregated, on a bit by bit basis, using voting that is weighted by the grouped metrics according to Εq. (7) as follows: agg r - (-4) + (-4) + (7) = -.333 agg, C P2 = I (4) + (4) + (-7) | = .333 Eq. (16) ag&r "P3 i- I (4) + (4) + (7) = 5 agg, P* (-4) + (4) + (7) = 2.333 If grouping is done on a half burst basis using 3-bit integers for the confidence metric, Eq. (13) is as follows: 'c pg = FLOOR Eq. (17) Weighted Averaging In an embodiment where N c representations, ^ pb , 2 β pb , ..., Nc β pphb ,, of each bit are generated with confidence metrics, 1 cnrj b , crrj b , ... , Nc Ciτj b , each measured by numbers ^ W,---, N % Nc C b> respectively, with each number a s b "c b ranging between (-a) and (+α) and with the weighting values, a w b for each bit b, the average aggregate confidence metric, ags c b for each bit b, is as follows: N. agg. = ÷ Σ x α * b ( i) Eq. (18) N„ α=l Νon-linear Quantizing Alternative methods for scaling and quantizing from initial values of y^-bits for each initial confidence metric reduced to γ p -bits for each processed confidence metric take advantage of the nature of the distributions of confidence metric magnitudes for good bits versus bad bits. One non-linear method of quantization is a logarithmic mapping function where the following logarithmic mapping function is an example: c p = ROUND log. ~ 1) Eq. (19) The mapping of Eq. (19) achieves the same degree of compression as the linear mapping, but the aggregation gain is larger for Eq. (19). Eq. (19) has the advantage that less information is sent for the high end of the range where there is less chance of confusing good bits with bad. Bandwidth Control Bandwidth control of collector-to-aggregator reverse channel communications is important for overall system efficiency and is implemented in both static and dynamic embodiments. The embodiment used is a function of the system environment considering many factors including the number and density of users, the relative locations of users, collectors and aggregators, the physical environment including the terrain, buildings and other signal interferers and the dynamics under which the system is undergoing change from moment to moment. The bandwidth control functions are implemented at both collectors and at aggregators and are also implemented at zone and region managers. The conditions for bandwidth control are implemented by storage of parameters and algorithms in either or both local storage (CM store 63 of FIG. 4) and central storage (CM store 63 of FIG. 8). In the simplest embodiments, static bandwidth control is implemented where the system is tuned for the desired bandwidth operation without need for dynamic changes. Static bandwidth control is useful for example where relatively poor signal quahty exists widely so that high or maximum confidence metric bandwidth is always employed to achieve acceptable signal quahty in a poor transmission environment. In another embodiment, static bandwidth control is useful for example where the premium is on maximum signal quahty irrespective of the bandwidth requirements. Where capacity, quality, bandwidth and cost are inteπelated parameters, then dynamic bandwidth control is important. Distributed intelligence at the collectors is useful for bandwidth conservation. Distributed intelligence at collectors includes means for decoding, for checking parity and other conditions and for setting confidence metric bandwidth. Parity checking of block coded signals such are used in GSM can give a reliable objective indication of received signal quahty. The system including the collectors operate in various modes including operations based only on local collector information and including operations based upon central information from a central control (at an aggregator for example). Centralized intelligence (at an aggregator for example) is important in many embodiments for bandwidth conservation. Often, a single collector does not have access to sufficient local information to make adequate bandwidth decisions. Each of the collectors alone cannot be aware of the performance of other collectors based only on the information available locally irrespective of how much processing power each of the collectors has. A common condition where one collector does not have adequate local information for a particular user occurs when some other particular collector is receiving a strong enough signal from that user to particularly enable acceptable quahty to be achieved solely with the information from that collector without aggregation of signals from that one collector or from other collectors. Centralized information in this example is effective in allocating bandwidth among the macro-diverse collectors by causing the particular collector to be active and all other collectors to be inactive or operative in low bandwidth modes. Large bandwidth savings are attained using centralized control information gathered from multiple macro-diverse collectors. The centralized control information is used to dynamically control the amount of confidence metric information transmitted by the macro-diverse collectors. The dynamic control is implemented using bandwidth control messages (over a control link between the centralized aggregator and the distributed collectors) that commands the collectors to different bandwidth modes based upon centralized information and based upon local information. In one embodiment, an LAPD-M link implemented in a Tl wireline connection can be used for the bandwidth control message channel although the faster the control message link, the better the system performance. A point-to-point radio Tl link is an example of a lower latency connection than a wireline connection. In one embodiment, communications between collectors and aggregators indicate the format of each returned burst in a 4-bit code word. An example encoding appropriate for a GSM embodiment has the 4 bits (3, 2, 1, 0) spht into two 2-bit fields (xx, yy) in TABLE 2 as follows: ΪΔBL 1 Field 1: Grouping Code (bits 3 and 2) t =00 0 = off mode (send nothing, not even data bits) ; =01 1 = group each burst into 2 groups xt=10 2 = group each burst into 4 groups xt=ll 3 = N groups, each confidence metric is sent individually Field 2: Quantization Code (bits 1 and 0) y=00 0 = 2 bit non-linear quantization yy =01 1 = 3 bit linear quantization yy= 10 2 = 3 bit non-linear quantization yy= 11 3 = 8 bit linear quantization Various different bandwidth modes are available for each collector extending from full off(xx=00) to a range including, for example, minimum (xx =01), intermediate (xx= 10) and maximum (xx= 11) bandwidth levels. In the full off mode, neither data bits nor confidence metrics are sent back from a collector to the aggregator. In all other modes, at least the data bits are sent back and often one or more confidence metric bits are sent back. In addition to the Grouping Code (xx), the range of each confidence metric is determined by the Quantization Code (yy). These different modes are selected to keep quahty acceptable while also reducing the bandwidth utilized in order to conserve bandwidth. The bandwidth not used for data bits and confidence metrics is available for other uses such as increased capacity of the system or increased quality for other parts of the system. Backhaul bandwidth from a collector is shared by all users serviced by that collector, so reducing the bandwidth required for some users allows more users to share a particular communications link. An example of the usefulness of dynamic centralized control is apparent when a collector that has been receiving a strong signal for a user, without need for aggregation of signals from other collectors for that user, suddenly no longer can service the needs of the user alone without unacceptable quahty deterioration. The dynamic bandwidth control senses the reduced quahty and switches the mode of operation, for example, from a single collector operation without aggregation to a multiple collector operation where the signals from multiple collectors are combined for a single user. If required, one or more of the multiple collectors are also set to increased confidence metric bandwidth levels in order to compensate for the quahty deterioration of the single collector initially active or to compensate for the quahty deterioration of all the collectors, in addition to the initially active collector, that become active for that user. An advantage of having the redundant collectors operate in a minimum bandwidth mode, such as one of the grouping modes requiring a small number of bits, rather than a full ø^mode, is that when one active collector no longer receives a strong enough signal to maintain acceptable quahty, the aggregator can respond quickly to combine confidence metrics from other collectors operating in minimum bandwidth modes. Although reduced quahty may result during the time elapsed when a bandwidth control message is sent and the message-receiving collectors responsively are set to a higher bandwidth mode, the signal is not lost altogether as is likely to occur if no confidence metrics are being sent because of operation in a full ø fmode. Local Bandwidth Control-FIG. 10 In FIG. 10, the signal strength of an exemplary user signal is plotted as a function of time. The user signal of FIG. 10 may be located near a collector 45 or near an aggregator 17. In the absence of centralized (remote) control, the local control at the collector operates to determine the bandwidth in the following manner. Referring to FIG. 4, the CM store 63 stores the mode of operation. In the absence of a central bandwidth command, the collector receiving the FIG. 10 signal stores a local high threshold value, T h , which in the example describe is at 6dB, and stores a low threshold value, T h , which in FIG. 10 is at - 6dB. When the signal strength (or other quahty measure) is above the high threshold value, T h , then a default minimum bandwidth is set; for example c=01 _ and yy =00. In the FIG. 10 example, the high threshold T h , is set at about 6. In FIG. 10, the signal level is above the high threshold, T h , at from about Time=l to about Time =25, from about Time =210 to about Time =260 and from about Time=330 to about Time=340. When the signal strength is between the high threshold value, T h , and the low threshold value, T^, then a default intermediate bandwidth is set, for example, xc=10 and _χy=01. When the signal strength is less than the low threshold value, T^, then the default maximum bandwidth is set, for example c = 11 and yy =11. The foregoing examples are merely by way of illustration as many variants of thresholds and default values are possible. If the control method employed exhibits unwanted control behavior, then filtering and other control processing can be introduced. For example, where the rate of state changes is excessive about the lower threshold, a hysteresis mode of operation is selected. Assuming for example that the local hysteresis mode is activated, CM store 63 stores an upper hysteresis threshold, T^, and a lower hysteresis threshold, T^. In the FIG. 10 example, the upper hysteresis threshold, T ώ , is about -2 and the lower hysteresis threshold, T^, is about -6. The processing unit 49 in FIG. 4 also stores a hysteresis toggle bit, H^, that is set and reset as a function of the processing to eliminate excessive oscillations. Referring to FIG. 10, when processing commences at Time=0, it is assumed for purpose of explanation that the hysteresis toggle bit, H^, is in the reset state, that the signal level is above the lower hysteresis threshold, T Ά , and that the confidence metric bandwidth is set to a reduced level for conserving bandwidth in the reverse channel. As long as the signal level remains above the lower hysteresis threshold, T Ά , the CM processor 62 functions to maintain the operation at a reduced confidence metric bandwidth level. The algorithm for producing the particular reduced confidence metric bandwidth is selected from any one of a number of possibilities such as grouping with different size groups, range compression and others. When the signal value drops below the upper hysteresis threshold, T^, as occurs for example at about Time =45, Time =60 and Time =125 in the FIG. 10 example, the confidence metric bandwidth is not changed and remains at a previously set reduced bandwidth value. When the signal value first drops below the lower hysteresis threshold, T , as occurs for example at about Time =140, the CM processor 62 functions to set the operation for a higher confidence metric bandwidth level, for example, at the full maximum confidence metric bandwidth level. Also at about Time=140, the hysteresis toggle bit, H^, in the reset state is set to the set state. With the hysteresis toggle bit, Ha,, in the set state, the confidence metric bandwidth value is not switched to a reduced bandwidth value until the signal strength has exceeded the upper hysteresis threshold, T^. Specifically, in FIG. 10, at about Time=149 when the signal level exceeds the lower hysteresis threshold, T , the confidence metric bandwidth is not changed since the hysteresis toggle bit, H^,, has not been reset so that the confidence metric bandwidth remains at the full confidence metric value. When the signal value again exceeds the upper hysteresis threshold, T,^, as occurs for example at about Time =210, the CM processor 62 functions to set the operation for a reduced confidence metric bandwidth level as occurs for example in FIG. 10 at about Time=205. At this time the hysteresis toggle bit, H^, is reset. In the FIG. 10 example, the reduced confidence metric value remains set between about Time=205 and about Time=260. At about Time=260 when the signal value again drops below the lower hysteresis threshold, T , and the hysteresis toggle bit, H^, in the reset state, the CM processor 62 functions to set the operation for a higher confidence metric bandwidth level which remains until about Time= 280 when the signal strength again exceeds the upper hysteresis threshold, T^. At about Time =260, the hysteresis toggle bit, H,,,, is reset and remains reset until set again at about Time=280. In the FIG. 10 example, the reduced confidence metric value remains set between about Time =280 and about Time =350. At about Time =350 when the signal value again drops below from about Time =210 to about Time =260, the hysteresis toggle bit, H,,,, in the reset state, the CM processor 62 functions to set the operation for a higher confidence metric bandwidth level which remains until about Time =365 when the signal strength again exceeds the upper hysteresis threshold, T UJ .. At about Time =365, the hysteresis toggle bit, H^,, is reset and remains reset in the FIG. 10 example. Threshold Level Controls In some embodiments of the invention, a high threshold, T h , is present for indicating that only reduced confidence metric bandwidth levels are required. Whenever the signal level is above the high threshold, T h , a collector when enabled for such control, subject to possible overrides from the remote commands, transmits only at a reduced confidence metric bandwidth level. Increasing and decreasing the value of the high threshold, T h , will increase and decrease the bandwidth used by the system. The lower hysteresis threshold, T Ά , and the upper hysteresis threshold, T^, are set in order to help control the reverse channel bandwidth used for confidence metrics. Raising the lower hysteresis threshold, T tt , increases bandwidth usage since the system will operate to send full confidence metrics more frequently. Similarly, lowering the lower hysteresis threshold, T , decreases bandwidth usage since the system will operate to send full confidence metrics less frequently. In some embodiments of the invention, the aggregator sets the threshold levels used by different collectors based upon a bandwidth allocation among multiple collectors in order to tune the system for efficient bandwidth utilization. Centralized Control Based Upon Multiple Collector Signals — FIG. 11 Through FIG. 18 FIG. 11 A, FIG. 11B and FIG. 11C depict graphic representations of the user reverse channel signals from collectors Cl, C2 and C3, respectively, for user U2 in FIG. 1, and FIG. 15A, FIG. 15B and FIG. 15C depict an expanded time interval between Time indices 70 to 85 of those graphic representations. Note that the mean signal level for the C2 collector of FIG. 11B is greater than for the Cl coUector of FIG. 11A and the C3 collector of FIG. 11C. This difference in mean signal levels is primarily due to the location of the U2 user relative to the collectors Cl, C2 and C3. The U2 user is closest to the C2 collector and hence the mean signal strength at the C2 collector is highest. The U2 user is farther from the Cl and C3 collectors and hence the mean signal strength at the Cl and C3 collectors is lower. The signal strength from a user at a particular collector is approximately proportional to 1/D 4 where D is the distance between the user and the particular coUector. Using a coUector separation of 10 ldlometers(km), U2 in the example described is about 3km from C2, about 7.5km from both Cl and C3. This arrangement results in mean signal levels -4.5dB, lldB and -4.6dB, respectively, for coUectors Cl, C2 and C3 relative to a reference level of 0 dB, which represents the mean signal strength of a mobUe at the center of the triangle formed by Cl , C2 and C3. FIG. 12A, FIG. 12B and FIG. 12C depict representations of the FIG. 11 A, FIG. 11B and FIG. 11C signals relative to a threshold level which in FIG. 11 A, FIG. 11B and FIG. 11C is 0 dB. FIG. 16A, FIG. 16B and FIG. 16C depict an expanded time interval between Time indices 70 to 85 of the FIG. 12A, FIG. 12B and FIG. 12C representations. Whenever the FIG. 11 A, FIG. 11B and FIG. 11C signals are above 0 or below 0, the FIG. 12A, FIG. 12B and FIG. 12C signals are 1 or 0, respectively. FIG. 13 and FIG. 14 depict logical OR's of the FIG. 12A, FIG. 12B and FIG. 12C type signals and FIG. 17 and FIG. 18 depict expanded time intervals between Time indices 70 to 85 of the FIG. 13 and FIG. 14 representations. FIG. 13 (FIG. 17) depicts a logical OR of signals analogous to the signals of FIG. 12A, FIG. 12B and FIG. 12C processed relative to a threshold higher than 0, for example, 2. FIG. 14 (FIG. 18) depicts a logical OR of the signals of FIG. 12A, FIG. 12B and FIG. 12C processed relative to a threshold of 0. Whenever the FIG. 14 (FIG. 18) signal is a 1, then at least one of the coUectors Cl, C2 and C3 is receiving the U2 user signal with sufficient strength so as not to require the maximum amount of confidence metric information to assure sufficient quahty of operation. Therefore, aU coUectors can be commanded to send less confidence metric information back. In this example, the threshold is set at 0 dB, the relative mean signal strength of a mobUe at the center of the triangle. However, depending on the environment, the required threshold can be some higher or lower signal level. The decision variables in FIG. 12 through FIG. 14 (FIG. 16 through FIG. 18) can be set directly by using the signal levels shown in FIG. 11 (FIG. 15). In one embodiment, the decision variables are set based on signal quahty, which can be measured using Frame Erasure Rate (FER), that is, block code parity checking, such as is avaUable in the GSM standard. The signal quahty is, on average, a monotonic function of the signal levels depicted in FIG. 12 through FIG. 14 (FIG. 16 through FIG. 18). If the coUector having the strongest signal is not strong enough by itself for acceptable quahty, but acceptable quahty can be obtained with confidence metric combining, then the bandwidth level of the confidence metrics must be determined. The stronger the signals, the less confidence metric information required and the weaker the signals the more confidence metric information required. If one of the coUectors has a very strong signal for a user that far exceeds the level sufficient by itself to assure acceptable quahty, then the other coUectors are commanded to fuU off mode in which neither confidence metrics nor data bits are sent for that user. If the best one of the coUectors has a strong signal for a user that marginaUy exceeds the level sufficient by itself to assure acceptable quahty, then the other coUectors are commanded to a minimum bandwidth level where compressed confidence metrics and data bits are sent for that user. The advantage of sending at least the data bits and some confidence metric information is that in the event of signal deterioration below the acceptable signal threshold for single coUector mode operation, the mode is immediately changed to multiple mode combining without any delay that would be incurred by sending messages back to the coUectors. In order to increase the margin of safety, when signal quahty begins to deteriorate in any mode of operation, messages are sent to change the mode of operation to a higher bandwidth level. SimUarly, in order to take advantage of an increasing margin of safety, when signal quahty begins to increase in any mode of operation, messages can be sent to change the mode of operation to a lower bandwidth level. Whenever the FIG. 13 (FIG. 17) signal is a less than 1, then two or more of the coUectors Cl, C2 and C3 are used for receiving the U2 user signal and these coUector signals are combined to assure sufficient quahty of operation. FIG. 13 (FIG. 17) depicts a logical OR of signals analogous to the signals of FIG. 12A, FIG. 12B and FIG. 12C but processed relative to a threshold higher than 0 dB, for example, 5 dB. Whenever the FIG. 13 (FIG. 17) signal is a 1, then at least one of the coUectors Cl, C2 and C3 is receiving the U2 user signal with sufficient strength so as not to require combining multiple coUector signals to assure sufficient quahty of operation. Whenever the FIG. 13 (FIG. 17) signal is a less than 1, then it is anticipated that the FIG. 14 (FIG. 18) signal wiU shortly also be less than 1 and the system wiU shortly require more confidence metric information from two or more of the coUectors Cl, C2 and C3 to assure sufficient quahty of operation. The FIG. 13 (FIG. 17) signal transitions from 1 lead the FIG. 14 (FIG. 18) transitions from 1 and hence the FIG. 13 (FIG. 17) signal transitions from 1 are used to originate control messages to increase the confidence metric bandwidth or for signaling full off to be set to on so that enough information is conveyed to the aggregator to assure that the signal quahty from the coUector signals is adequate. Referring to FIG. 17 and FIG. 18, a leading l-to-0 transition commences at about Time =76 in FIG. 17 and the coπesponding foUowing l-to-0 transition occurs at about Time=78 in FIG. 18. The difference in time, T a , between the leading and foUowing l-to-0 transition is about 0.2 seconds in the particular example of FIG. 17 and FIG. 18. The difference in threshold levels used to generate the FIG. 13 (FIG. 17) and FIG. 14 (FIG. 18) waveforms determines the amount of time that is avaUable for signaling changes in bandwidth modes of operation. In one particular embodiment, the messaging time between coUectors and the aggregator is set to be less than 0.2 second. In such an embodiment, the threshold difference between threshold levels used to generate the FIG. 13 (FIG. 17) and FIG. 14 (FIG. 18) waveforms is adjusted to insure that at least a 0.2 second lead time is avaUable from the FIG. 13 (FIG. 17) transitions from 1 before the FIG. 14 (FIG. 18) transitions from 1. The messaging time and the thresholds are tunable parameters of the communication system. In general, a 0.2 second messaging time is adequate for most environments. For example, a vehicle moving at 50 kUometers/hour takes about 2 seconds of travel time (calculated by shadow fading spatial coπelation statistics where 2 seconds is the time constant for a 1/e decay in correlation) before signal levels change enough to affect signal. Accordingly, 0.2 second messaging times can easUy control changes in the system bandwidth weU in advance of fast moving users. In some environments, there are instances where spatial decoπelation occurs very suddenly and the signal quahty deteriorates faster than the system can respond. In such environments, where the problem occurs at fixed locations in the zone, the locations where these problems occur are detected and are stored in memory. Whenever a user approaches one of these locations, the bandwidth is increased to anticipate the need for more confidence metric information to aUow the multiple coUector aggregation to maintain acceptable quahty. This mode of operation requires information about the approximate location of the user. Such location information is determined from the timing of training sequences and the signal strength measurements such as are avaUable in GSM and other protocols. Both signal strength and timing from multiple macro-diverse coUectors are used to perform triangulation. When a user leaves such a location, the bandwidth is decreased. In some environments, where signal quahty problems occur in a manner that can be predicted based upon patterns of changes in user signals, these patterns are stored in memory and the occurrence of these patterns for a particular user are recognized by comparing the detected user parameters with the patterns stored in memory. Upon detection of a match, the bandwidth is increased to anticipate the need for more confidence metric information to aUow the multiple coUector aggregation to maintain acceptable quahty. When the increased bandwidth is not needed, the bandwidth is decreased. Collectors Commanded to full g^Mode A mobUe user sending the center of the triangular region of FIG. 1 is received at aU three coUectors Cl, C2 and C3 with mean signal strengths which are assigned a reference value of 0 dB. For the example pertaining to FIGs 11 through 14, it is assumed that this mean signal level is also the lowest level at which the signal can be rehably aggregated when aU coUectors send back fuU confidence metrics. The objective is to calculate a distance from any single coUector such that if a mobUe is within that distance, its signal is strong enough at the nearest coUector that aggregation is not required. First, the signal level that is required for a particular environment is calculated, as characterized by the shadow fading standard deviation and path loss exponent. A constant-level signal that can be rehably aggregated at a reference level of 0 dB wiU be strong enough to process without aggregation at 5 dB. Therefore, if the signal is to be above 5 dB more than 99 % of the time, the mean signal level is required to be at 5 dB + 2 sigma, where sigma is the standard deviation of the log-normal shadow fading. If sigma = 8 dB in this environment, that value implies that a mean signal level of 21 dB is required. Assuming for purposes of this example that the mean path loss in this environment is 1/D 4 (a value typical for urban ceUular radio) the equation for calculating the distance to meet any particular signal strength criterion is: Off-ModeRadius = (CoUectorRadius) * io ( re « uiredDb ' va & ~ χ * ∞a * ι > In this equation, CoUectorRadius is the distance from the center of a triangle of coUectors to any coUector. If in the example, the sides of the triangle in FIG. 1 are 10 km, the distance from any coUector that a mobUe can be to meet the criterion for being in off mods is 1.7 km. MobUe users closer to any coUector are expected to be at least 5 dB above the reference aggregation level more than 99 % of the time. Combined Signals - FIG. 1 A r FIG. 15B and FIG. 15C FIG. 15A, FIG. 15B and FIG. 15C represent an expanded time interval of FIG. 11 A, FIG. 11B and FIG. 11C between Time indices 70 to 85. During this interval, as observed in FIG. 13, the control level is at 0 meaning that no single coUector is adequate. Therefore during this interval, combining of the confidence metrics for the combining for the FIG. 15 A, FIG. 15B and FIG. 15C signals is dictated. The results of such combining are shown in the foUowing TABLE 3 for different modes of confidence metric bandwidth where the quahty of the combined output signal is measured by the frame erasure rate (FER). TABLE 3 The savings in bandwidth can be appreciated by observing the amount of time that the FIG. 12A, FIG. 12B and FIG. 12C and the FIG. 13 signals are less than 1. In TABLE 3, the signal quahty (measured by frame erasure rate) aUows the system to determine the Least Significant coUector signal (Cl) and the Most Significant coUector signal (C2) for purposes of bandwidth control as explained in connection with TABLE 4. TABLE 4 indicates bandwidth utilization in the system under local control and under central control. In TABLE 4, the Bandwidth Utilization column represents the bandwidth level relative to the maximum bandwidth level that is used for transmission for a single user. These values assume that bandwidth levels switch between no grouping, 3-bit quantization of the confidence metric and quarter burst grouping. Thus a 1 value in FIG. 12 represents sending about four times as much information as is sent when a 0 value is present in FIG. 12. From TABLE 4, it is apparent that if the Cl, C2 and C3 coUectors each operate independently on only locaUy avaUable information that coUector Cl wiU send 81 % of the maximum bandwidth level, that coUector C2 wiU send 29 % of the maximum bandwidth level and that coUector C3 wiU send 75 % of the maximum bandwidth level so that Cl, C2 and C3 are on average sending at 61 % of the maximum bandwidth level. However, a centralized aggregator using the OR function of FIG. 13 can determine that aU coUectors send at an average of 37% of the maximum bandwidth level. If coUectors are switched to fuU off mode rather than to grouping mode, the savings are even greater but the system is more apt to be prone to quahty deterioration when signal levels change suddenly. Algorithms used to control system bandwidth levels rely on various system parameters. One parameter employed is the signal quahty of the received user reverse channel. One measure of signal quahty in GSM or simUar systems is the frame eπor rate (FER) and the good frame rate (GFR) where GFR=(1-FER). In TABLE 5, three quahty thresholds based on the GFR are indicated. The T decrease threshold is used to signal a decrease in bandwidth whenever the signal quahty is above a GFR of 99.8%, the T^. ^^ threshold is used to signal an increase in bandwidth whenever the signal quahty is below a GFR of 97% and the T^ threshold is used to signal a change to fuU bandwidth whenever the signal quahty is below a GFR of 94%. T LK1 Many different modes of bandwidth control are possible within the scope of the present invention. Exemplary control code for controlling the various modes of operation appears in the foUowing TABLE 6. In TABLE 6, the itahcized values of bandwidth levels (such as Local Maximum, Reduced, Local Minimum, Local Intermediate and so forth are selected with different values for xx and yy in order to provide suitable different bandwidth levels. Some of the values in TABLE 6 are indicated by way of examples. TABLE 6 COPYRIGHT ® 1997 CELLULAR TELECOM. LTD AT EACH OF MULTIPLE USERS ♦ For each user, ♦ Transmit user reverse channel signals AT EACH OF MULTIPLE COLLECTORS ♦ For each user, ♦ For each coUector, receive user signals and process user signals to form coUector signals (data and confidence metric), ♦ IF confidence metric bandwidth commanded as Central Bandwidth Level by central control in aggregator, ♦ Set Current Bandwidth Level to Central Bandwidth Level, ♦ Go to XMIT ♦ ELSE ♦ IF set to Local Hysteresis Mode, then ♦ IF signal quahty less than lower hysteresis threshold, T , ♦ Set bandwidth level to Local Maximum value, ♦ Set hysteresis toggle bit, H^ ♦ ELSE, ♦ IF hysteresis toggle bit, H^ set and signal quahty greater than upper hysteresis threshold, T^,, ♦ Set Current Bandwidth Level to Reduced value, ♦ Reset hysteresis toggle bit, H^ ♦ ELSE, ♦ Set Current Bandwidth Level to Local Maximum value ♦ Go to XMIT ♦ ELSE, ♦ IF signal quahty less than lower threshold, T Ά , ♦ Set Current Bandwidth Level to Local Maximum value, ♦ ELSE, ♦ IF signal quahty greater than high threshold, T h , ♦ Set Current Bandwidth Level to Local Minimum value ♦ ELSE, ♦ Set Current Bandwidth Level to Local Intermediate value, ♦ XMIT. Transmit coUector signals using Current Bandwidth Level ♦ REPEAT AT SINGLE AGGREGATOR Determining Collector Signal Quality Module ♦ For each user, ♦ For each coUector, ♦ Measure and store coUector signal quahty, ♦ Order coUectors according to coUector signal quahty rank Selecting Participating Collectors Module ♦ For each user, ♦ Select Participating CoUectors for user as function of coUector signal quaUty rank, location or other parameters, Combining Collector Signals Module ♦ For each user, ♦ Form Combined Signal by combining individual signals from Participating CoUectors ♦ Determine user location (Using time-of-arrival and other information from multiple macro-diverse coUectors) ♦ Process coUector signals to form Cuπent Parameters for user and update History Store with Current Parameters (such as location and signal patterns), Centralized Collector Bandwidth Determining Module ♦ Create Desired Bandwidth Level list giving desired confidence metric bandwidth for all users on all backhaul links coming into the aggregator from coUectors, ♦ For each user, ♦ If the signal quahty of Individual Signal for a particular user exceeds high quality threshold, T qh , at one particular coUector of Participating CoUectors and signal quality is lilely to remain high for some period of time (for example, particular user is very close to a particular collector as determined by signal time-of-arrival and signal strength), ♦ Select particular coUector as Primary CoUector for particular user and set Desired Bandwidth Level for Primary CoUector to Primary Minimum value, (for example, ;ct=10), ♦ Set Desired Bandwidth Level for Other CoUectors to Secondary Minimum value, (for example, xc=00 which is fuU ø^mode) ♦ Else, ♦ IF signal quahty of Combined Signal from multiple coUectors is greater than a first intermediate quahty threshold, T decrease (for example, if GFR of TABLE 5 is greater than 99.8 %) and signal quahty is likely to remain high for some period of time (for example, Combined Signal quahty has been stable and above the threshold, T decrease for a sufficient period of time), ♦ Decrease Desired Bandwidth Level for each of Participating CoUectors from one Intermediate value (for 83 example, xx=01,yy=ll) for aU Participating CoUectors . 84 to a lower Intermediate value (for example, xc=01,- 85 yy=01) , 86 ♦ IF signal quahty of Combined Signal from multiple coUectors is 87 less than a second intermediate quahty threshold, T^ ^^ (for 88 example, if GFR of TABLE 5 is less than 97%), 89 ♦ Increase Desired Bandwidth Level for each of 90 Participating CoUectors from one Intermediate value (for 91 example, xc=01, ;yy=ll) for aU Participating CoUectors 92 to a higher Intermediate value (for example, xx = 11 , - 93 yy=oi), 94 ♦ IF signal quahty of Combined Signal is less than a low quahty 95 threshold, T ω (for example, if GFR of TABLE 5 is less than 96 94%), 97 ♦ Increase Desired Bandwidth Level for aU Participating 98 CoUectors to Maximum value (for example, xx = 11 , 99 ^=11). 100 ♦ IF Current Parameters match Stored Parameters whereby it is 101 anticipated that signal quahty of the Combined Signal wiU become 102 poor (for example, where the location of the user is approaching a 103 location where signal quahty is historicaUy known to be poor for 104 users), 105 ♦ Set Desired Bandwidth Level to Stored value (for 106 example, xt=ll, yy=ll which is maximum bandwidth) 107 Adjusting Desired Bandwidth I_evel Based Upon Available Bandwidth Module 108 ♦ For each coUector, 109 ♦ Determine coUector-to-aggregator Total Available Bandwidth for aU 110 users and determine Total Remaining Bandwidth avaUable, 111 ♦ FOR all user backhaul links coming into collector 112 ♦ Order all the users by final signal quality at aggregator, 113 ♦ IF based on Desired Bandwidth Level for all users, 114 Total Remaining Bandwidth is greater than 0, 115 ♦ Increase the bandwidth allocation (Desired 116 Bandwidth Level ) of those users having signals 117 with the lowest aggregated final signal quality 118 that aren't already at maximum bandwidth level, 119 ♦ IF based on Desired Bandwidth Level for all users, 120 Total Remaining Bandwidth is less than 0, 121 ♦ Decrease the bandwidth allocations (Desired 122 Bandwidth Level ) of users having signals with 123 the highest aggregated final signal quality until 124 available bandwidth fits within limits of link 125 (Total Remaining Bandwidth equals 0) 126 ♦ Set Central Bandwidth Level equal to Desired 127 Bandwidth Level (as increased or decreased based 128 upon avaUable bandwidth) 129 ♦ Forward Central Bandwidth Level to Participating 130 CoUectors, 131 Adjusting Collector Quality Parameters Module 132 ♦ Adjust coUector signal quahty thresholds and other bandwidth parameters 133 based, for example, on number of users in the system, avaUable bandwidth, 134 historical time-of-day patterns, and facUities avaUabihty. 135 ♦ REPEAT Multiple Zone Configurations-FIG.1 and FIG. 20 In FIG. 19, the zones 5, including the zones 5-1, 5-2, ..., 5-6, are like the zone 5 of FIG. 1 and each zone 5 includes users 15 like those for zone 5-1. For example, zone 5-2 is adjacent to zone 5-1 and includes a C4 coUector 45 that operates together with at least the coUectors Cl and C2 that operate with zone 5-1. In FIG. 19, the ceUular system is shown having zone managers 20-1, ..., 20-6 of which zone manager 20-1 is typical. The zone managers have broadcasters 16-1, ..., 16-6, where broadcaster 16-1 is typical, that broadcast forward channel (FC) communications to multiple users 15 in one or more of the zones 5-1, ... , 5-6. Each of the users 15 transmits reverse channel (RC) communications to one or more of multiple coUectors 45 including coUectors Cl, C2, C3 and C4, which in turn forward the reverse channel communications to aggregators 17-1, ..., 17-6, where aggregator 17-1 is typical. The zone managers 20 can be located at a base station that is configured in a number of different ways. In one configuration, each broadcaster broadcasts forward channel communications in a different one of six sectors in six different frequency ranges corresponding to the zones 5-1, 5-2, ... , 5- 6. The users in the different zones transmit reverse channels on coπesponding frequency ranges to the various coUectors operating in their broadcast ranges and the coUectors in turn forward reverse channel communications to a corresponding one of the aggregators 17. In another configuration, aU of the zones use the same frequency ranges and no sectorization is employed and in such an embodiment one or more zone managers may be employed. In general, regardless of the configuration, some coUector sites are associated with coUectors for several zones. For example, C3 services users in two zones, 5-1 and 5-2. The backhaul link from C3 to the aggregator 17-1 is shared by users from zones 5-1 and 5-2. In order to conserve bandwidth, the confidence metric bandwidth for one zone is at times reduced in order to permit an increase in the bandwidth of another zone where the zones are sharing reverse channels communication bandwidth from common associated coUectors, like coUectors Cl and C3 in the example described. Control of the algorithms used in each coUector for determining the bandwidth used by each coUector are stored and executed in the confidence metric processing unit 49 of FIG. 4 and processing unit 70 of FIG. 8. Further, the zone manager 20 of FIG. 1 communicates with the processing units 49 and 70 over the remote interfaces 65 when adjustments, such as for bandwidth balancing, are required. In FIG. 19, the region manager 12 controls the bandwidth aUocation of the zone managers 20-1, ..., 20-6 for the contiguous regions 5-1, ..., 5-6 and for other regions 5* which may or may not be contiguous to the regions 5-1, ..., 5-6. In FIG. 20, the zones 5 1 , 5 2 , ... , 5 7 are each like the zone 5 of FIG. 19 and form a seven zone cluster. SimUarly, in FIG. 20, the zones 6 1 , 6 2 , ..., 6 7 are each like the zone 5 of FIG. 19 and form a second seven zone cluster. Any number of additional zone clusters may be provided as necessary to cover any particular region. The region manager 12 of FIG. 20 functions to control the bandwidth values of the coUector reverse channels in order to balance the load among the various regions of FIG. 20 along common backhaul channels. For example, if traffic tends to move from one particular zone to another zone during a certain time (such as durng a rush hour commute), the bandwidth of the common backhaul channel is dynamicaUy aUocated so that the zone with higher traffic is aUocated more bandwidth. Suhregion Control-FIG. 21 In FIG. 21, a ceUular system like that in FIG.l is shown having a zone manager 20 that broadcasts forward channel (FC) communications from broadcaster 16 to multiple users 15 including users Ul, U2, ..., UU located within a zone 5 designated by the dashed-line triangle. Each of the multiple users 15 transmits reverse channel (RC) communications to one or more of multiple coUectors 45 including coUectors Cl, C2 and C3, which in turn forward the reverse channel communications to aggregator 17 in zone manager 20. Each of the users 15 has a receiver antenna for receiving broadcasts on the forward channel from the broadcaster 16. Also, each of the users 15 has a transmitter that transmits on a reverse channel to the coUectors 45. The coUectors 45 are sited at macro-diverse locations relative to each other within zone 5. Therefore, multiple copies of macro-diverse reverse channel communications are received at the aggregator 17 for each user. In FIG. 21, the Ul user 15 is typical with forward channel (FC) communication from broadcaster 16, the user-to-coUector reverse channel communications C^RC) to each of the Cl, C2 and C3 coUectors 45, and the coUector-to-aggregator reverse channel communications ( c/a RC) for each of the coUectors to aggregator 17. The reverse channel communications from the Ul user 15 include the user-to-coUector communication u/c RCl and the coUector-to- aggregator communication c/a RCl, the user-to-coUector communication ^"RCl and the coUector-to-aggregator communication c/a RC2 and the user-to-coUector communication ^RCS and the coUector-to-aggregator communication c/a RC3. Each of the other users U2, ... , UU in FIG. 21 has simUar forward and reverse channel communications. In FIG. 21, the Ul users 15-1,, ..., 15-l ul are aU located in a subregion bounded by the coUector Cl and the arc 5j and hence are in close proximity to the coUector Cl . Because of the close proximity, the signal strength of the reverse channel transmissions from the Ul users 15-l l5 ..., 15-l ul to coUector Cl is normaUy high and can be expected to require a low confidence metric bandwidth level for high quahty reverse channel transmissions. SimUarly, the U2 users 15-2 t , ... , 15-2^ are aU located in a subregion bounded by the coUector C2 and the arc 5 2 and hence are in close proximity to the coUector C2 and the U3 users 15-3 l5 ... , 15- 3„ 3 are aU located in a subregion bounded by the coUector C3 and the arc 5 3 and hence are in close proximity to the coUector C3. SimUarly, because of the close proximity, the signal strength of the reverse channel transmissions from the U2 users 15-2 l5 ..., 15-2 u2 to coUector C2 is normaUy high and can be expected to require a low confidence metric bandwidth level for high quahty reverse channel transmissions and because of the close proximity, the signal strength of the reverse channel transmissions from the U3 users 15-3 1; ..., 15-3, 3 to coUector C3 is normaUy high and can be expected to require a low confidence metric bandwidth level for high quahty reverse channel transmissions. In FIG. 21, the central subregion 5 C generaUy bounded by the arcs 5 l5 5 2 and 5 3 are relatively far from the coUectors Cl, C2 and C3 so that the reverse channel signal strength from aU of the UU users 15-U l5 ... , 15-U uU in this region to each of the coUectors Cl, C2 and C3 is normaUy weaker than for users closer to the coUectors in the subregions 5 1; 5 2 and 5 3 can be expected to require a higher confidence metric bandwidth level for high quahty reverse channel transmissions. WhUe the invention has been particularly shown and described with reference to prefeπed embodiments thereof it wiU be understood by those skUled in the art that various changes in form and detaUs may be made therein without departing from the spirit and scope of the invention.

Claims: CLAIMS 1 . A communication system having a plurahty of channels comprising, a plurahty of users for transmitting user signals in user channels, a plurahty of macro-diverse coUector means distributed at macro-diverse locations, each of said coUector means including, coUector receiver means for receiving said user signals and providing a plurahty of received signals for each of said plurahty of users, coUector processing means for processing said received signals to form coUector signals including sequences of data bits representing the received signals and including initial confidence metrics coπesponding to said data bits for each of said plurahty of users, where the initial confidence metrics are represented by an initial number of metric bits, said coUector processing means including coUector confidence metric processing means for processing said initial confidence metrics to form processed confidence metrics, aggregator means for combining said coUector signals using said processed confidence metrics from said plurahty of macro-diverse coUector means for each of said plurahty of users to form a final sequence of data bits representing the user signals for each of said plurahty of users. 2 . The communication system of Claim 1, 30, 31 or 32 wherein said coUector confidence metric processing means processes said initial confidence metrics to form processed confidence metrics represented by a processed number of metric bits fewer than said initial number of metric bits. 3 . The communication system of Claim 1, 30, 31 or 32 wherein said aggregator means includes aggregator confidence metric processing means for processing said processed confidence metrics to form aggregator confidence metrics for each of said data bits. 4 . The communication system of Claim 1, 30, 31 or 32 wherein said coUector processing means includes group processing means for processing said initial confidence metrics in groups to form said processed confidence metrics as grouped confidence metrics having grouped numbers of confidence metric bits fewer than said initial number of metric bits. 5 . The communication system of Claim 1, 30, 31 or 32 wherein the initial confidence metrics have an initial range, a^, represented by an initial number of metric bits, γ^, and said coUector confidence metric processing means includes range processing means for processing the initial confidence metrics to form processed confidence metrics having a processed range, a,,, represented by a processed number of metric bits, γ p , where the processed number of metric bits, γ p is less than the initial number of metric bits, γ . 6 . The communication system of Claim 1, 30, 31 or 32 wherein said coUector processing means includes group processing means for processing said initial confidence metrics having an initial range, a^,, represented by an initial number of metric bits, γ^, in groups, cτjι . • •• , CTj G , to form grouped confidence metrics including the confidence metrics cπji, ..., Ciτj gl for group Gl; Cn3 (g1+1) , ..., cτj g2 ; for group G2; ...; Cnj (g3+1) , ..., CTJ gG for group GG having grouped numbers of confidence metric bits, γ g , fewer than said initial number of metric bits, and wherein said coUector confidence metric processing means includes range processing means for processing the grouped confidence metrics having an initial range, a^, represented by an initial number of metric bits, 7^, to form processed confidence metrics having a processed range, a p , represented by a processed number of metric bits, γ p , where the processed number of metric bits, γ p is less than the initial number of metric bits, γ^. 7 . The communication system of Claim 1, 30, 31 or 32 wherein said coUector processing means includes group processing means for processing said initial confidence metrics in groups to form said processed confidence metrics as grouped confidence metrics having grouped numbers of confidence metric bits fewer than said initial number of metric bits, wherein said aggregator means includes aggregator confidence metric processing means for processing said processed confidence metrics to form aggregator confidence metrics for each of said data bits. 8 . The communication system of Claim 1, 30, 31 or 32 wherein the initial confidence metrics have an initial range, a^, represented by an initial number of metric bits, y^, and said coUector confidence metric processing means includes range processing means for processing the initial confidence metrics to form processed confidence metrics having a processed range, a,,, represented by a processed number of metric bits, γ p , where the processed number of metric bits, γ p is less than the initial number of metric bits, γ^. , wherein said aggregator means includes aggregator confidence metric processing means for processing said processed confidence metrics to form aggregator confidence metrics for each of said data bits. 9 . The communication system of Claim 1, 30, 31 or 32 wherein said coUector processing means includes group processing means for processing said initial confidence metrics having an initial range, a^, represented by an initial number of metric bits, y^, in groups, CT , • • • , Ci J o , to form grouped confidence metrics including the confidence metrics cnj ! , ..., c η gl for group Gl; cnj (g1+1) , ..., crrj g2 ; for group G2; ...; Crrj (g3+1) , ..., Ci j gG for group GG having grouped numbers of confidence metric bits, γ g , fewer than said initial number of metric bits, wherein said coUector confidence metric processing means includes range processing means for processing the grouped confidence metrics having an initial range, a^, represented by an initial number of metric bits, γ^, to form processed confidence metrics having a processed range, a p , represented by a processed number of metric bits, γ p , where the processed number of metric bits, γ p is less than the initial number of metric bits, γ^, wherein said aggregator means includes aggregator confidence metric processing means for processing said processed confidence metrics to form aggregator confidence metrics for each of said data bits. 10 . The communication system of Claims 5, 6, 8 or 9 wherein said range processing means performs linear quantization of the initial confidence metric, CTJ i5 to form the processed confidence metric, cn] pi , as foUows: Cm Jpi. = 2 γ where: crrj p j = processed confidence metric as quantized value of cnj ; max_cr _value = maximum value of cτj_ t = l, 2, ..., B e = smaU positive value chosen so that the division always produces a number less than 1. 11 . The communication system of Claims 4, 7 or 9 wherein the initial confidence metrics crrju crη 2 , ... , cn] b , ... , CTj B are organized into G groups that include the groups Gl, G2, ..., GG that in turn include the confidence metrics CTJ_, ..., Crη gl for group Gl; cπj f ci + i ) , ..., Crrj^; ...; Ciη (gG . 1)+1 , ..., cnj g o for group GG. where each of the confidence metrics in a group are processed to form a single processed confidence metrics crrj pl , cnr) p2 , ..., Cirj P j, ..., crrj Pg where the processed confidence metric for the t* group, cn3 pi , is given as foUows: where, CiTj t = k" 1 initial confidence metric cn] pi = processed confidence metric for the f 1 group g(i)+l = beginning confidence metric in group g(i+l) = ending confidence metric in group g(i+l) - g(i) = number of confidence metrics in group. 12 . The communication system of Claim 1, 30, 31 or 32 wherein said coUector confidence metric processing means includes input register means for storing initial confidence metrics, a coUector confidence metric processor for processing the initial confidence metrics using a processing algorithm to form processed confidence metrics, a confidence metric store for storing algorithm information for determining said processing algorithm, and output register means for storing the processed confidence metrics. 13 . The communication system of Claim 1, 30, 31 or 32 wherein said coUector confidence metric processing means includes remote interface means for remotely communicating confidence metric processing information. 14 . The communication system of Claim 1, 30, 31 or 32 wherein said aggregator confidence metric processing means includes input register means for storing processed confidence metrics, an aggregator confidence metric processor for processing the processed confidence metrics using a processing algorithm to form processed confidence metrics, a confidence metric store for storing algorithm information for determining said processing algorithm, and output register means for storing output confidence metrics. 15 . The communication system of Claim 1, 30, 31 or 32 wherein said aggregator confidence metric processing means includes remote interface means for remotely communicating confidence metric processing information. 16 . The communication system of Claim 1, 30, 31 or 32 wherein, said coUector receiver means includes a plurahty of micro-diversity receivers each for receiving said user signals and providing a plurahty of micro-diverse received signals for each of said plurahty of users, said coUector processing means processes said micro-diverse received signals to form said coUector signals including sequences of data bits representing the micro-diverse received signals and including said initial confidence metrics corresponding to said data bits for each of said plurahty of users. 17 . The communication system of Claim 1, 30, 31 or 32 wherein said aggregator means receives, from N c of said coUector means, N c macro-diverse coUector signals each having a processed confidence metric value, c b for each bit and combines said processed confidence metric values to form an average processed confidence metric, ags c b , as follows: N. agg, C_ = N Σ ( + 1) - =l where, ags c b = average processed confidence metric "c b = number ranging between (0) and (+a) % = sign N c = number of macro-diverse coUector signals. 18 . The communication system of Claim 1, 30, 31 or 32 wherein said aggregator means receives, from N c of said coUector means, N c macro-diverse coUector signals each having a processed confidence metric value, a c b for each bit and each having a weighting factor, a w b , for each bit and combines said processed confidence metric values to form a weighted average confidence metric, agg c b , as foUows: where, agg c b = weighted average processed confidence metric c b = number X = sign N = number of macro-diverse coUector signals a w b = weighting factor for each bit. 19 . The communication system of Claim 1, 30, 31 or 32 wherein said initial confidence metric for each bit is in the form of a number, c b , where (0) < c b < (+a) and where a is an amphtude represented by one or more bits to indicate the range for c b . 20 . The communication system of Claim 1, 30, 31 or 32 wherein, said coUector processing means includes signal measurement means for providing measurement signals measuring properties of the received user signals, said aggregator means includes measurement processor means receiving said measurement signals for controlling which ones of said coUector signals are combined. 21 . The communication system of Claim 1, 30, 31 or 32 wherein said aggregator means includes a signal processor having a macro-diversity combiner unit for combining said processed confidence metrics from two or more of said macro-diverse coUector signals and forms a logical 1 or logical 0 value for each bit of said sequence of data bits based on combined processed confidence metrics. 22 . The communication system of Claim 21 wherein said signal processor includes a de-interleaver, a de-convolution unit and a block decoder. 23 . The communication system of Claim 1, 30, 31 or 32 wherein said aggregator means includes an aggregator signal processor having, a plurahty of macro-diversity combiner units each for combining said confidence metrics from two or more of said macro-diverse coUector signals to form a logical 1 or logical 0 value for each bit of said sequence of data bits based on combined confidence metrics, first selector means for selecting different ones of the macro-diverse coUector signals for inputs to different ones of the macro-diversity combiner units, second selector means for selecting one of the outputs from the macro- -diversity combiner units to form said final sequence of data bits. 24 . The communication system of Claim 23 wherein said signal processor includes a macro-diversity combiner, a de-interleaver, a de-convolution unit and a block decoder. 25 . The communication system of Claim 1, 30, 31 or 32 wherein said user signals employ multiple access protocols. 26 . The communication system of Claim 25 wherein said user signals employ TDMA protocols. 27 . The communication system of Claim 25 wherein said user signals employ CDMA protocols. 28 . The communication system of Claim 25 wherein said user signals employ SDMA protocols. 29 . The communication system of Claim 25 wherein said user signals employ FDMA protocols. 30 . A communication system having a plurahty of forward channel communications and a plurahty of coπesponding reverse channel communications comprising, a plurahty of users in a broadcaster zone, each of said users including user receiver means for receiving different user forward channel signals and including user transmitter means for broadcasting user reverse channel signals in a user reverse channel, said plurahty of users providing a composite signal formed of a plurahty of different user reverse channels, a plurahty of macro-diverse coUector means distributed in proximity to said broadcaster zone at macro-diverse locations, each of said coUector means including, coUector receiver means including a plurahty of micro- diversity receivers each for receiving said user signals and providing a plurahty of micro-diverse received signals for each of said plurahty of users, coUector processing means for processing said received signals to form coUector signals including sequences of data bits representing the received signals and including initial confidence metrics coπesponding to said data bits for each of said plurahty of users, where the initial confidence metrics are represented by an initial number of metric bits, said coUector processing means including coUector confidence metric processing means for processing said initial confidence metrics to form processed confidence metrics, zone manager means including, broadcaster means including a broadcaster transmitter for broadcasting said plurahty of user forward channel signals over a broadcaster range to said users in said broadcaster zone, aggregator means for combining said coUector signals from said pluraUty of macro-diverse coUector means for each of said plurahty of users to form a final sequence of data bits, using said processed confidence metrics, representing the user signals for each of said plurahty of users. 31 . A communication system having a plurahty of forward channel communications and a plurahty of corresponding reverse channel communications comprising, a plurahty of users in a broadcaster zone, each of said users including user receiver means for receiving different user forward channel signals and including user transmitter means for broadcasting user reverse channel signals in a user reverse channel, said plurahty of users providing a composite signal formed of a plurahty of different user reverse channels, a plurahty of macro-diverse coUector means distributed in proximity to said broadcaster zone at macro-diverse locations, each of said coUector means including, coUector receiver means including a plurahty of micro- diversity receivers each for receiving said user signals and providing a plurahty of micro-diverse received signals for each of said plurahty of users, coUector processing means for processing said received signals to form coUector signals including sequences of data bits representing the received signals and including initial confidence metrics coπesponding to said data bits for each of said plurahty of users, where the initial confidence metrics are represented by an initial number of metric bits, said coUector processing means including coUector confidence metric processing means for processing said initial confidence metrics to form processed confidence metrics, broadcaster means including a broadcaster transmitter for broadcasting said pluraUty of user forward channel signals over a broadcaster range to said users in said broadcaster zone, control means for selecting ones of said plurahty of coUector means in a coUector group for receiving reverse channel signals from particular ones of said plurahty of users, aggregator means for combining said coUector signals from said plurahty of macro-diverse coUector means in said coUector group for each of said particular ones of said plurahty of users to form a final sequence of data bits, using said processed confidence metrics, representing the user signals for each of said particular ones of said plurahty of users. 32 . A communication system having a plurahty of forward channel communications and a plurahty of coπesponding reverse channel communications comprising, a plurahty of users in a plurahty of broadcaster zones, each of said users including user receiver means for receiving different user forward channel signals and including user transmitter means for broadcasting user reverse channel signals in a user reverse channel, said plurahty of users providing a composite signal formed of a plurahty of different user reverse channels, a number, N bm , of broadcaster means, each including a broadcaster transmitter for broadcasting said plurahty of user forward channel signals over a broadcaster range to said users in one of said broadcaster zones, a number, N c , of coUector means distributed in proximity to said broadcaster zones at macro-diverse locations where the number N c , of coUector means is greater than the number, N bm , of broadcaster means, each of said coUector means including, coUector receiver means including a plurahty of micro- diversity receivers each for receiving said composite signal and providing a plurahty of micro-diverse received signals for each of ones of said plurahty of users, coUector processing means for processing said received signals to form coUector signals including sequences of data bits representing the received signals and including initial confidence metrics corresponding to said data bits for each of said plurahty of users, where the initial confidence metrics are represented by an initial number of metric bits, said coUector processing means including coUector confidence metric processing means for processing said initial confidence metrics to form processed confidence metrics, coUector forwarding means for forwarding said sequences of data bits and said processed confidence metrics as coUector signals for each of said ones of said plurahty of users, aggregator means for combining said macro-diverse coUector signals for said each one of particular ones of the users from said coUector means in said coUector group to form a final sequence of data bits representing the user signals for said each one of particular ones of the users. 33 . In a communication system having a plurahty of channels, having a plurahty of users for transmitting user signals in user channels, and having a plurahty of macro-diverse coUector means distributed at macro-diverse locations, the method comprising: for each of said coUector means, receiving said user signals and providing a plurahty of received signals for each of said plurahty of users, processing said received signals to form coUector signals including sequences of data bits representing the received signals and including initial confidence metrics corresponding to said data bits for each of said plurahty of users, where the initial confidence metrics are represented by an initial number of metric bits, said processing including coUector confidence metric processing for processing said initial confidence metrics to form processed confidence metrics, combining said coUector signals using said processed confidence metrics from said plurahty of macro-diverse coUector means for each of said plurahty of users to form a final sequence of data bits representing the user signals for each of said plurahty of users. 34 . A communication system having a plurahty of channels comprising, a plurahty of users for transmitting user signals in user channels, a plurahty of macro-diverse coUector means distributed at macro-diverse locations, each of said coUector means including, coUector receiver means for receiving said user signals and providing a plurahty of received signals for each of said plurahty of users, coUector processing means for processing said received signals to form coUector signals including sequences of data bits representing the received signals and including initial confidence metrics coπesponding to said data bits for each of said pluraUty of users, where the initial confidence metrics are represented by an initial number of metric bits, said coUector processing means including coUector confidence metric processing means for processing said initial confidence metrics to form processed confidence metrics having bandwidth values, aggregator means for combining said coUector signals using said processed confidence metrics from said plurahty of macro-diverse coUector means for each of said plurahty of users to form a final sequence of data bits representing the user signals for each of said pluraUty of users, bandwidth control means for controlling said bandwidth values. 35 . The communication system of Claim 34 wherein said bandwidth control means is static whereby said bandwidth values are fixed according to initial setup conditions. 36 . The commumcation system of Claim 34 wherein said bandwidth control means is dynamic whereby said bandwidth values are modified according to conditions that change during the operation of said communication system as a function of time. 37 . The communication system of Claim 36 wherein said bandwidth control means includes local bandwidth control means in said coUector processing means. 38 . The communication system of Claim 36 wherein said bandwidth control means includes central bandwidth control means in said aggregator means. 39 . The communication system of Claim 36 wherein said bandwidth control means includes, for each of said plurahty of macro-diverse coUector means, local bandwidth control means for controlling bandwidth levels, central bandwidth control means in said aggregator means receiving information from said plurahty of macro-diverse coUector means to provide central information for setting bandwidth levels for said macro-diverse coUector means, control channel means connecting said central bandwidth control means to said local bandwidth control means in said plurahty of macro-diverse coUector means for sending said central information to control the bandwidth levels of said macro-diverse coUector means. 40 . The communication system of Claim 39 wherein at each particular macro-diverse coUector means of said plurahty of macro-diverse coUector means, said local bandwidth control means includes local processing means for processing local information at said particular macro-diverse coUector means to set the bandwidth level of said particular macro-diverse coUector means. 41 . The communication system of Claim 40 wherein said local processing means receives said central information and sets the bandwidth level of said particular macro-diverse coUector means based upon said central information and said local information. 42 . The communication system of Claim 40 or 41 wherein said local information is based on signal quahty. 43 . The communication system of Claim 40 or 41 wherein said local information is based on signal quahty measured against a plurahty of quahty thresholds. 44 . The communication system of Claim 40 or 41 wherein said central information is based on cuπent parameters and stored parameters. 45 . The communication system of Claim 44 wherein said cuπent parameters are the location of a user and the stored parameters are known poor signal quahty locations in a zone. 46 . The communication system of Claim 39 wherein said central bandwidth control means includes a plurahty of modules executable for controlling bandwidth values. 47 . The communication system of Claim 46 wherein said plurahty of modules include a module for determining coUector signal quaUty. 48 . The communication system of Claim 46 wherein said plurahty of modules include a module for selecting participating coUectors. 49 . The communication system of Claim 46 wherein said plurahty of modules include a module for combining coUector signals. 50 . The communication system of Claim 46 wherein said plurahty of modules include a module for centralized determining coUector bandwidth. 51 . The communication system of Claim 46 wherein said plurahty of modules include a module for updating coUector bandwidth usage. 52 . The communication system of Claim 46 wherein said plurahty of modules include a module for adjusting coUector quahty parameters. 53 . The communication system of Claim 34 wherein said coUector confidence metric processing means processes said initial confidence metrics to form processed confidence metrics represented by a processed number of metric bits fewer than said initial number of metric bits. 54 . The communication system of Claim 34 wherein said aggregator means includes aggregator confidence metric processing means for processing said processed confidence metrics to form aggregator confidence metrics for each of said data bits. 55 . The communication system of Claim 34 wherein said coUector processing means includes group processing means for processing said initial confidence metrics in groups to form said processed confidence metrics as grouped confidence metrics having grouped numbers of confidence metric bits fewer than said initial number of metric bits. 56 . The communication system of Claim 34 wherein the initial confidence metrics have an initial range, a^, represented by an initial number of metric bits, γ k , and said coUector confidence metric processing means includes range processing means for processing the initial confidence metrics to form processed confidence metrics having a processed range, a,,, represented by a processed number of metric bits, γ p , where the processed number of metric bits, γ p is less than the initial number of metric bits, y^. 57 . The communication system of Claim 34 wherein said coUector processing means includes group processing means for processing said initial confidence metrics having an initial range, a^, represented by an initial number of metric bits, y^, in groups, cnrj ! , ... , CD G , to form grouped confidence metrics including the confidence metrics cnjj, ..., cn] gl for group Gl; ... . crrj g2 ; for group G2; ... ; Ciη^ +D , ... , Ciη gG for group GG having grouped numbers of confidence metric bits, γ g , fewer than said initial number of metric bits, wherein said coUector confidence metric processing means includes range processing means for processing the grouped confidence metrics having an initial range, a^, represented by an initial number of metric bits, Yi n , to form processed confidence metrics having a processed range, a., represented by a processed number of metric bits, γ p , where the processed number of metric bits, γ p is less than the initial number of metric bits, Y^,, wherein said aggregator means includes aggregator confidence metric processing means for processing said processed confidence metrics to form aggregator confidence metrics for each of said data bits. 58 . The communication system of Claim 34 wherein, said coUector receiver means includes a pluraUty of micro-diversity receivers each for receiving said user signals and providing a plurahty of micro-diverse received signals for each of said plurahty of users, said coUector processing means processes said micro-diverse received signals to form said coUector signals including sequences of data bits representing the micro-diverse received signals and including said initial confidence metrics coπesponding to said data bits for each of said plurahty of users. 59 . The communication system of Claim 34 wherein said aggregator means receives, from N c of said coUector means, N c macro-diverse coUector signals each having a processed confidence metric value, a c b for each bit and combines said processed confidence metric values to form an average processed confidence metric, agg c b , as foUows: N, agg f = ÷ 1 N Σ i 1) α=l where, agg c b = average processed confidence metric a c b = number ranging between (0) and (+a) X = sign N c = number of macro-diverse coUector signals. 60 . The communication system of Claim 34 wherein said aggregator means receives, from N c of said coUector means, N c macro-diverse coUector signals each having a processed confidence metric value, a c b for each bit and each having a weighting factor, a w b , for each bit and combines said processed confidence metric values to form a weighted average confidence metric, agg c b , as foUows: where, agg c b = weighted average processed confidence metric a c b = number X = sign N == number of macro-diverse coUector signals "w b = weighting factor for each bit. 61 . The communication system of Claim 34 wherein said user signals employ multiple access protocols. 62 . The communication system of Claim 61 wherein said user signals employ TDMA protocols. 63 . The communication system of Claim 61 wherein said user signals employ CDMA protocols. 64 . The communication system of Claim 61 wherein said user signals employ SDMA protocols. 65 . The communication system of Claim 61 wherein said user signals employ FDMA protocols.

Inventors: UYEHARA LANCE KAZUMI, VASTANO JOHN ANDREW, WALLERIUS JOHN WALKER, WALTERS ANDREWS JOHN, UYEHARA, LANCE, KAZUMI, VASTANO, JOHN, ANDREW, WALLERIUS, JOHN, WALKER, WALTERS, ANDREWS, JOHN
Applicants: SILICON WIRELESS LIMITED
Application year: 1998
Main classification: H04B7
IPC codes: H04B7, H04J1, H04J13, H04L1, H04Q7