# Patent

## Title
Method and system for data communication

## Abstract

There is provided a system and method for multi-user detection by a plurality of base stations situated at different geographical locations through base station cooperation. An exemplary method comprises exchanging detected data iteratively while performing separate detection and decoding of received data streams.

## Background
CROSS REFERENCE TO RELATED APPLICATION
This application claims priority to European (EP) Patent Application No. 08008747.1, filed on May 9, 2008, the contents of which are incorporated by reference as if set forth in their entirety herein.
BACKGROUND
A long felt desire in the communication, especially the multi media technology is to encounter a need for higher spectral efficiency in wireless systems.
One principal line of thought to address the OCI problem was initiated by Wyner's treatment of base station cooperation in a simple and analytically tractable model of cellular systems [11]. In this model, cells are arranged in either an infinite linear array or in some two-dimensional pattern, with interference originating only from the immediate neighboring cells (having a common edge). All the processing is performed at a single central point. Subsequent work on the information theoretic capacity of the centralized processing systems concluded that the achievable rate per user significantly exceeds that of a conventional cellular system [12,13].
Recently, decentralized detection using the belief propagation algorithm for a simple one-dimensional Wyner model was proposed in [14]. The belief propagation algorithm effectively exchanges the estimates for all signals received at each BS, by alternately exchanging likelihood values and extrinsic information. This idea was extended to 2D cellular systems in [15-17], where the limits compared to MAP decoding were studied, showing the great potential of BS cooperation with decentralized processing (at least for regular situations). Unfortunately, for a star network (commonly used today) interconnecting the BSs, this results in a huge back-haul traffic.
Another approach to convert situations where cochannel users interfere each other with comparably strong signals into an advantage for a high-frequency reuse cellular system was proposed in [18]: different BSs cooperate by sending quantized baseband signals to a single central point for joint detection and decoding. Such a distributed antenna system (DAS) not only reduces the aggregate transmitted power, but also results in much improved received SINR [19]. Using 3 appropriate receive strategies, both array and diversity gains are obtained, resulting in a substantial increase in system capacity [20, 21]. The DAS scheme, however, is less attractive for network operators due to the large amount of backhaul it requires and the cooperative scheduling necessary between the adjacent DAS units in order to avoid interference. Here, backhaul is defined as the additional communication link between different cooperating entities. Although the bandwidth of wired links used for backhaul can be very high, they are usually owned by a third party, making it attractive for the cellular system operators to reduce the backhaul in order to minimize operating costs. The influence of limited back-haul on capacity in DAS has been investigated in [22, 23].
SUMMARY OF THE INVENTION
An exemplary embodiment of the present invention relates to a method and a system for multi-user detection.
Moreover, exemplary embodiments of the present invention may relate to a method, a system and a communication device for processing data for transmission in a wireless communication system using for multi-user detection through base station cooperation.
Exemplary embodiments of the present invention may employ advanced receiver techniques for uplink communication. However, exemplary embodiments of the present invention are not limited to this case and may also relate to a down link communication.
Therefore, an exemplary embodiment of the present invention may allow for a more reliable and/or flexible method for multi-user detection through base station cooperation.
An exemplary embodiment of the present invention relates to a method for multi-user detection through base station cooperation. This method may be characterized in, that the base stations are situated at different geographical locations and that the base stations exchange detected data iteratively while performing separate detection and decoding of their received data streams.
Moreover, an exemplary embodiment of the present invention may provide the advantage that resulting backhaul traffic is considerably lower than that of existing cooperative multi-user detection strategies.
An exemplary embodiment of the present invention deals with multi-user detection through base station cooperation in an uplink, interference-limited, high frequency reuse scenario. Distributed iterative detection (DID) is an interference mitigation technique in which the base stations at different geographical locations exchange detected data iteratively while performing separate detection and decoding of their received data streams.
Exemplary embodiments of the present invention utilize DID receive strategies and proposes to exchange between base stations especially, preferably only the processed information for their associated mobile terminals. The resulting backhaul traffic is considerably lower than that of existing cooperative multi-user detection strategies.
Within further preferred exemplary embodiments of the invention, single-antenna interference cancellation techniques are employed to generate local estimates of the dominant interferers at each base station, which are then combined with their independent received copies from other base stations, resulting in more effective interference suppression.
A higher-frequency reuse is therefore proposed, resulting in the interference from cochannel users outside the cells to dominate, thereby forming a single most important factor limiting the system performance. This interference coming from outside the cell boundaries is commonly referred to as other cell interference (OCI). OCI has been treated in [1], where it was suggested that advanced receiver and transmitter techniques can be employed in the uplink and downlink of a cellular system, respectively. Given that the mobile terminals (MTs) are low-cost, low-power independent entities, and are not expected to cooperate to perform transmit or receive beamforming, they are assumed to be as simple as possible with most of the complex processing of a cellular system moved to the base stations (BSs).
An exemplary embodiment of the invention proposes to exchange between base stations mainly the processed information for their associated mobile terminals.
According to a preferred exemplary embodiment of the method, the communication system, the logical node and the mobile user equipment, it is proposed to exchange between base stations only the processed information for their associated mobile terminals.
An exemplary embodiment of the invention may further include, that local estimates of the dominant interferers of at least two base stations are calculated
This exemplary embodiment of the invention may provide several advantages. For example, it may result in more effective interference suppression.
It is especially useful to use many, most or even all of these local estimates in order to improve the performance.
The usage of the local estimates of the dominant interferers may result in an even more effective interference suppression.
According to a preferred exemplary embodiment of the method, the communication system, the logical node and the mobile user equipment, local estimates of the dominant interferers of most base stations, are generated, wherein the local estimates are then combined with their independent received copies from other base stations.
According to a preferred exemplary embodiment of the method, the communication system, the logical node and the mobile user equipment, at least some of the local estimates are combined with their independent received copies from other base stations.
According to an exemplary embodiment of the invention, most of the local estimates are combined with their independent received copies from other base stations.
According to one exemplary embodiment of the invention, all of the local estimates are combined with their independent received copies from other base stations,
According to a preferred exemplary embodiment of the method, the communication system, the logical node and the mobile user equipment, single-antenna interference cancellation techniques are employed to generate the local estimates of the dominant interferers at each base station.
If hard information bits or quantized log-likelihood ratios (LLRs) are transferred, it is preferred to investigate the effect of quantization of the LLR values with the objective of further reducing the backhaul traffic.
Schemes based on nonuniform quantization of the “soft bits” may allow for reducing the backhaul to 1-2 exchanged bits/coded bit.
The exchange of soft bits minimizes the backhaul traffic.
It is especially advantageous to detect a bit as a soft bit, which has more than 2 levels, for example, from 0 to 15 for a four-bit digital number. In this 16-level example, the level 15 of the soft bit is a very strong 1 and level 8 of the soft bit is a very weak 1. Similarly, the level 7 of the soft bit is a very weak 0 and the level 0 of the soft bit is a very strong 0.
If nonuniformly quantized soft bits are exchanged to minimize the backhaul traffic, the quantization of reliability information does not result in a pronounced performance loss and sometimes even hard bits can be exchanged without undue degradation.
For further reducing backhaul it is further proposed that only those bits that have changed signs between iterations be exchanged. The result is a considerable reduction in backhaul traffic between base stations.
In order to improve a functionality of communication system it is preferred, that it employs the capability for carrying out at least one part of the method steps explained in the current application.
It is furthermore advantageous, that also the logical node and/or the mobile user equipment employ the capability of carrying out the method or at least some steps for integrating the method.
According to a preferred exemplary embodiment of the method, the communication system, the logical node and the mobile user equipment, asymmetric multi-user detection is realized.
Preferably. it is utilized that the resource management of the cellular network can detect (e.g., via signal strength indicators) groups of MTs that are strongly received at several base stations. Advantageous embodiment of the invention especially relate to a decentralized implementation. To this end, the concept of distributed iterative detection (DID) was introduced in [24, 25]: each base station initially performs single-user detection for the strongest MT, treating the signals received from all other mobile terminals as noise. The information that becomes available at the decoder output is then sent to neighboring BS while mutually receiving data from its own neighbors in order to reconstruct and cancel the interference of its own received signal. This leads to interference-reduced signals.
According to a preferred exemplary embodiment of the method, the communication system, the logical node and the mobile user equipment. single-user detection is applied to interference-reduced signal by applying parallel interference cancellation. Further improvements can be achieved by repeated application of this procedure.
In respect to conventional single-user. the detection in different scenarios can be improved by varying the strength of the user coupling through the channel.
An exemplary embodiment of the present invention includes further improvement with respect to conventional single-user detection in different scenarios with varying strength of the user coupling through a channel.
A significant additional gain is possible if the single-user detection step in the 0th iteration with single-antenna interference cancellation (SAIC) implemented as joint maximum likelihood detection (JMLD) in the symbol detector acting as the receiver front-end.
Furthermore. a significant tradeoff between the amount of information exchanged and improvement beyond a single-user detection is realized.



BRIEF DESCRIPTION OF THE DRAWINGS
Reference will be made by way of example to the accompanying drawings in which
FIG. 1 is a graph showing an example setup showing a rectangular grid of 4 cells, with power control assumed with respect to associated BS;
FIG. 2 is a block diagram of a DID receiver at the lth base station, the subscripts d and i representing the desired data stream and the dominant interferes, the variables designated by † being evaluated only in the first pass of the processing through the receiver, the superscripts 1 and 2 corresponding to variables associated with detector and decoder, respectively;
FIG. 3 is a graph showing L-value /, soft-bit λ(/), and mutual information I(/) representations of the LLR plotted as a function of the magnitude |/| of the LLR;
FIG. 4 is a set of graphs showing a comparison of the distribution of Lvalues represented in the original bimodal Gaussian form or by soft bits or mutual information;
FIG. 5 is a graph showing mutual information loss ΔI(X; L) for nonuniform quantization levels determined in the LLR and soft-bit domains (1-3 quantization bits);
FIG. 6 is a graph showing BER after soft combining of L-values for quantized information exchange with optimized levels in either the soft-bit or LLR domain;
FIG. 7 is a graph showing FER curves for different receive strategies in decentralized detection, distributed iterative detection (DID), SAIC-aided DID (SAIC), and DID with unconstrained backhaul (DID-UB);
FIG. 8 is a graph showing an effect of path loss of the dominant interferer pi, SAIC-DID, for the dashed curve labeled as “random”, each element of the path-loss vector 0≦pl,m<1, /≠m, is randomly generated with uniform distribution;
FIG. 9 is a graph showing iterative behavior of SAIC-DID exchanging soft APP values;
FIG. 10 is a graph showing FER for SAIC-DID, plotted as function of the number of dominant cochannel signals ml at SNR=5 dB;
FIG. 11 is a graph showing SAIC-DID performance comparison for 2×2 and 3×3 cells setup, in which each MT is received strongly at 4 BSs, while each BS receives signals from 4 MTs, the two curves for 3×3 cells setup giving the bounds for different possible combinations of couplings within the setup;
FIG. 12 is a graph showing the effect of path loss of the dominant interferer pi for different modulation orders, in which each BS sees just two dominant signals ml=2;
FIG. 13 is a graph showing the effect of quantization of the exchanged decoder LLR values, where pi=0 dB, the curve labeled with “+” exchanging only those bits that have changed signs between iterations, and adaptively sets the number of quantization intervals during each iteration to reduce backhaul;
FIG. 14 is a graph showing backhaul traffic normalized with respect to total information bits single-bit quantization of LLR values being performed only those bits that have changed signs between iterations being exchanged (pi=0 dB);
FIG. 15 is a graph showing FER for SAIC-DID in the presence of a weak interferer, in which pj represents the path loss of the weak interferer;
FIG. 16 is a graph showing optimum nonuniform quantization levels obtained by optimization in the L-value domain;
FIG. 17 is a graph showing optimum nonuniform quantization levels obtained by optimization in the “soft-bit” domain; and
FIG. 18 is a graph showing mutual information loss ΔI(X;L) for 1-3 quantization bits as a function of the variance of the L-values.



DETAILED DESCRIPTION OF SPECIFIC EMBODIMENTS
This application makes reference to a number of publications listed below in the Appendix of References, each of which is incorporated by reference as though fully set forth herein. These publications are referred to herein by numbers set forth in square brackets ([ ]).
Notation
Throughout the current application text, complex baseband notation is used. Vectors are written in boldface. A set is written in double stroke font such as [ ] and its cardinality is denoted by |[ ]|. The expected value and the estimates of a quantity such as s are denoted as E{s} and ŝ, respectively. Random variables are written as uppercase letters and their realization with lowercase letters. A posterior probabilities (APPs) will be expressed as log-likelihood ratios (L-values). A superscript denotes the origin (or receiver module), where it is generated. We distinguish Ld1, Ld2 and Lext which are APPs generated at the detector and the decoder of a given BS or externally to it.
The aforementioned and other aspects of the invention will also be apparent from and elucidated with reference to the embodiments of the invention described herein after making reference to the drawings.
Different advanced receiver techniques, suggested in the literature for the uplink, give tradeoffs between complexity and performance. Optimum maximum likelihood detection (MLD) [2, 3] is prohibitively complex for multiple-input multiple-output (MIMO) scenarios employing higher-order modulation. Linear receivers [4-7] are less effective in decoupling the incoming multiplexed data streams, and offer low spatial diversity for full-rank systems. Iterative receivers [8-10] with soft decision feedback offer the best compromise between complexity and performance, and they have been universally adopted as a strategy of choice.
The detailed description of exemplary embodiments of the present invention according to the figures presents a preferred exemplary system model, where a preferred exemplary coupling among users/cells and the channel model are described. Section 3 discusses in detail various components of distributed iterative receivers. In Section 4 different decentralized detection strategies are compared. In Section 5 the effect of quantization of reliability information is examined. Various quantization strategies are compared in terms of information loss and necessary backhaul traffic. Numerical results are presented in Section 6.
An exemplary embodiment of the present invention can be integrated into different communication and handling standards.
In order to facilitate an integration of an exemplary embodiment of the present invention in current communication systems, it is especially useful to use the invention in an environment according to at least one communication standard.
2. Transmission Model
According to a preferred exemplary transmission model. an idealized synchronous single-carrier (narrow band) cellular network in the uplink direction is analyzed. N is the number of receive antennas and M is the number of transmit antennas corresponding to the number of BSs and cochannel MTs, respectively.
A block of information bits um from user antenna m is encoded and bit-interleaved leading to the sequence xm of length K, where m=1 . . . M. This sequence is divided into groups of q bits each, which are then mapped to a vector of output symbols for user m of size Ks=K/q according to Sm=[Sm,1, . . . , Sm,Ks]=map(xm). Each symbol is randomly drawn from a complex alphabet A of size Q=2q with E{sm,k}=0 and E{/ sm,k/2}=σ2s for m=1 . . . M.
A block of Ks symbol vectors s[k]=[s1,k, s2,k, . . . , sM,k]T(corresponding to one respective codeword) is transmitted synchronously by all M users. At any BS l, a corresponding block of symbols rl[k] is received, where the index k is related to time or subcarrier indices (1≦k≦Ks):

rl[k]=gl[k]·s[k]+n[k], 1≦k≦Ks. 

With n we denote the additive zero mean complex Gaussian noise with variance σ2n=E{n2}. For ease of notation, we omit the time index k in the following, because the detector operates on each receive symbol rl separately.
The row vector gl is the elementwise product gl,m=hl,m√{square root over (ρ)}l,m of weighted channel coefficients hl,m of M cochannels seen at the lth BS. The channel coefficient vector hl, obtained as the current realization of a channel model (the channel is passive on the average, i.e., E{/hl,m/2}=1), is assumed to be known perfectly. The coupling coefficients ρl,m reflect different user positions (path losses) with respect to base station l. These will be abstracted in the following by two coupling coefficients ρi, and ρj which characterize the BS interaction with strong and weak interferers.
Equation (1) can therefore be written in terms of the desired signal (denoted with the index d) and weak and strong interferences:




   
  
    
      
        
          
            r
            l
          
          =
          
          ⁢
          
            
              
                g
                ld
              
              ⁢
              
                s
                d
              
            
            +
            
              
                ∑
                
                  i
                  ∈
                  
                    •
                    l
                  
                
              
              ⁢
              
                
                  g
                  li
                
                ⁢
                
                  s
                  i
                
              
            
            +
            
              
                ∑
                
                  j
                  ∈
                  
                    
                      •
                      _
                    
                    l
                  
                
              
              ⁢
              
                
                  g
                  lj
                
                ⁢
                
                  s
                  j
                
              
            
            +
            n
          
        
      
    
    
      
        
          
            =
            
            ⁢
            
              
                
                  h
                  ld
                
                ⁢
                
                  s
                  d
                
              
              +
              
                
                  
                    
                      ρ
                      i
                    
                  
                  ⁢
                  
                    
                      ∑
                      
                        i
                        ∈
                        
                          •
                          l
                        
                      
                    
                    ⁢
                    
                      
                        h
                        li
                      
                      ⁢
                      
                        s
                        i
                      
                    
                  
                
                
                  }
                  
                    strong
                    ⁢
                    
                      
                    
                    ⁢
                    interference
                  
                
              
              +
              
                
                  
                    
                      ρ
                      j
                    
                  
                  ⁢
                  
                    
                      ∑
                      
                        j
                        ∈
                        
                          
                            •
                            _
                          
                          l
                        
                      
                    
                    ⁢
                    
                      
                        h
                        lj
                      
                      ⁢
                      
                        s
                        j
                      
                    
                  
                
                
                  }
                  
                    weak
                    ⁢
                    
                      
                    
                    ⁢
                    interference
                  
                
              
              +
              n
            
          
          ,
        
      
    
  




where ρld=1. We note that this is of course a variant of the two-dimensional Wyner model. With [ ]l we denote the set of indices of all strongly received interferers at BS l with cardinality |[ ]l|=ml−1, where ml is total number of strongly received signals at BS/. Additionally, [  ]l is the complementary set for all weakly received interferers:

|[ ]l[  ]l|=M−1.

Note that the received signal-to-noise ratio (SNR) is defined as the ratio of received signal power at the nearest BS and the noise power. Specifically, the SNR at the lth BS can be written as SNR=E{\\hldsd\\2}/E{n2}=σs2/σn2.
The considered synchronous model is admittedly somewhat optimistic and was recently criticized due to the impossibility to compensate different delays to different mobiles (positions) simultaneously. However, the reason to ignore synchronization errors is twofold. First, it allows the ability to study the possible improvement through base station cooperation without other disturbing effects to obtain bounds (the degradation from nonideal synchronization should thereafter be included as a second step). Second, for OFDM transmission or frequency domain equalization that we envisage in order to obtain parallel flat channels enabling separate JMLD on each subcarrier, we argue that it is possible to keep the interference due to timing and frequency synchronization errors at acceptable levels.
Increased delay spreads of more distant MTs have to be handled by an appropriately adjusted guard interval in the cooperating region. Timing differences between mobiles lead to phase shifts in the channel transfer function, which are taken into account with the channel estimate. An additional consideration relates to frequency offsets due to variations among oscillators.
FIG. 1 shows an example setup showing a rectangular grid of 4 cells, with power control assumed with respect to associated BS.
Doppler effects, one has to evaluate the intercarrier interference induced by relative shifts of the subcarrier spectra of different users. Roughly estimating this with the sinc2(f/fsub) function of the power spectral density for adjacent subcarriers, the SINR should still be well above 20 dB, if the frequency offset can be kept at the order of 1% and therefore become negligible with respect to the interference to be cancelled on the same resource (oscillator accuracies of 0.1 ppm considered, e.g., in the LTE standardization translate to around 1% in terms of the subcarrier spacing of 15 kHz). We, however, leave the detailed study of asynchronous transmission for future work.
As an example for a cellular scenario, a rectangular grid of 4 cells is shown in FIG. 1, where pTh is the path-loss threshold introduced to distinguish between weak and strong interferers. It is defined as the minimum path loss required for an interferer to be detected separately during the BS processing. It depends upon the constellation size and ml; for example, for 16-QAM and ml=2 we use pTh=−12 dB. Periodic or nonperiodic boundary conditions are possible, allowing for representing extended joint operation or isolated groups of cooperating BSs.
3. Distributed Iterative Receiver
The setup for performing distributed detection with information exchange between base stations is shown in FIG. 2. It comprises one input for the signal rl generated by the mobile terminals and received at the base station antenna. In addition, it contains a communication interface for exchanging information with the neighboring base stations. This information is either in the form of hard bits ûl or likelihood ratios Lld2 of the locally detected signal and corresponding quantities about the estimates of the interfering signals delivered from other base stations. This communication interface is capable of not only transmitting information about the detected data stream to the other base stations, but also receiving information from these base stations.
The receiver processing during initial processing involves either SAIC/JMLD or conventional single-user detection followed by decoding. In subsequent iterations, interference subtraction is performed followed by conventional single-user detection and decoding. Different components of the distributed multi-user receiver are discussed in what follows:
FIG. 2 shows a DID receiver at the lth base station. The subscripts d and i represent the desired data stream and the dominant interferes. Variables designated by † are evaluated only in the first pass of the processing through the receiver. The superscripts 1 and 2 correspond to variables associated with detector and decoder, respectively.

    (i) interference cancellation,
    (ii) demapping at the symbol detector,
    (iii) soft decoding,
    (iv) (soft) interference reconstruction.

3.1. Interference canceller and effective noise calculation



At the beginning of every iterative stage, interference of neighboring mobile terminals is subtracted from the signal received at each base station. If rl is the signal received at the lth base station, the interference-reduced signal yl at the output of the interference canceller is




  
    
      y
      l
    
    =
    
      
        
          r
          l
        
        -
        
          
            g
            l
          
          ·
          
            
              s
              ^
            
            i
          
        
      
      =
      
        
          r
          l
        
        -
        
          
            ∑
            
              i
              ∈
              
                
                  •
                  l
                
                ⋃
                
                  
                    •
                    _
                  
                  l
                
              
            
          
          ⁢
          
            
              g
              li
            
            ⁢
            
              
                s
                ^
              
              i
            
          
        
      
    
  
  ,




where siεC[1xnT] is a vector of symbol estimates. If we exchange only hard decisions about the information bits, then no reliability information is conveyed. Under such condition, additional noise due to the variance of the symbol estimates is not available and the effective noise variance σeff2 is underestimated and taken to be equal to that of receiver input noise, that is, σeff2=σn2. On the other hand, if reliability information for the received bits is available, a vector of error variances ei2 for the estimated symbol streams can be calculated. It is then added to the AWGN noise for the subsequent calculations:





  
    
      
        
          σ
          eff
          2
        
        =
        
          
            
              σ
              n
              2
            
            +
            
              
                ∑
                
                  i
                  ∈
                  
                    
                      •
                      l
                    
                    ⋃
                    
                      
                        •
                        _
                      
                      l
                    
                  
                
              
              ⁢
              
                
                  
                    
                    
                      g
                      li
                    
                    
                  
                  2
                
                ⁢
                E
                ⁢
                
                  {
                  
                    
                      
                      
                        
                          s
                          i
                        
                        -
                        
                          
                            s
                            ^
                          
                          i
                        
                      
                      
                    
                    2
                  
                  }
                
              
            
          
          =
          
            
              σ
              n
              2
            
            +
            
              
                
                  
                    ∑
                    
                      i
                      ∈
                      
                        
                          •
                          l
                        
                        ⋃
                        
                          
                            •
                            _
                          
                          l
                        
                      
                    
                  
                  ⁢
                  
                    
                      
                        
                        
                          g
                          li
                        
                        
                      
                      2
                    
                    ⁢
                    
                      e
                      i
                      2
                    
                  
                
                
                  }
                  
                    residual
                    ⁢
                    
                      -
                    
                    ⁢
                    noise
                  
                
              
              .
            
          
        
      
    
    
      
        
      
    
  




The quantities ei2 and ŝi2 are both evaluated in the soft modulator (see FIG. 1) and are discussed in detail in Section 3.4.
Note that if the contributions of weak interferers ŝiε[  ]l in (4) and (5) are neglected, an error floor will occur in the performance curves, especially at higher-order modulation.
Since both ei2 and si2 are evaluated upon arrival of estimates from the neighboring base stations, the interference subtractor is not activated during the first pass and rl is fed directly into the detector. The effective noise due to inherent interference present in the signal during the first pass is calculated based on the mean transmitted signal power and the number md of received signals that are to be jointly detected. Therefore, for the first pass, the effective noise σeff2 at the input of the detector of the /th BS, assuming md=ml, is given as




  
    σ
    eff
    2
  
  =
  
    
      σ
      n
      2
    
    +
    
      
        σ
        s
        2
      
      ⁢
      
        
          ∑
          
            i
            ∈
            
              
                •
                _
              
              l
            
          
        
        ⁢
        
          
            
              
              
                g
                li
              
              
            
            2
          
          .
        
      
    
  




3.2. Detection and Demapper APP Evaluation The interference-reduced signal yl and its corresponding noise value are sent to a demapper to compute the a posteriori probability, usually expressed as an L-value [28]. If md data streams (each with q bits/sample) are to be detected, the a posteriori probabilities Ld1(Xκ/Yl) of the coded bits Xκε{±1} for k=1 . . . qmd, conditioned on the input signal yl, are given as





  
    
      L
      
        d
        ⁢
        
          
        
        ⁢
        1
      
    
    ⁡
    
      (
      
        
          x
          k
        
        ❘
        
          y
          l
        
      
      )
    
  
  =
  
    ln
    ⁢
    
      
    
    ⁢
    
      
        
          P
          ⁡
          
            [
            
              
                x
                k
              
              =
              
                
                  +
                  1
                
                ❘
                
                  y
                  l
                
              
            
            ]
          
        
        
          P
          ⁡
          
            [
            
              
                x
                k
              
              =
              
                
                  -
                  1
                
                ❘
                
                  y
                  l
                
              
            
            ]
          
        
      
      .
    
  




For md=1 single-user detection to be applied, when md=ml, where ml; is the number of strong signals at the BS /, JMLD-based single-antenna interference cancellation is applied.
We make the standard assumption that the received bits from any of the md data streams in yl have been encoded and scrambled through an interleaver placed between the encoder and the modulator. Therefore, all bits within yl can be assumed to be statistically independent of each other. Using Bayes' theorem and exploiting the independence of x1, x2, . . . , xqmd by splitting up joint probabilities into products, we can write the APPs as




   
  
    
      
        
          
            
              L
              
                d
                ⁢
                
                  
                
                ⁢
                1
              
            
            ⁡
            
              (
              
                
                  x
                  k
                
                ❘
                
                  y
                  l
                
              
              )
            
          
          =
          
          ⁢
          
            ln
            ⁢
            
              
                
                  P
                  ⁡
                  
                    (
                    
                      
                        
                          y
                          l
                        
                        ❘
                        
                          x
                          k
                        
                      
                      =
                      
                        +
                        1
                      
                    
                    )
                  
                
                ⁢
                
                  P
                  ⁡
                  
                    (
                    
                      
                        x
                        k
                      
                      =
                      
                        +
                        1
                      
                    
                    )
                  
                
              
              
                
                  P
                  ⁡
                  
                    (
                    
                      
                        
                          y
                          l
                        
                        ❘
                        
                          x
                          k
                        
                      
                      =
                      
                        -
                        1
                      
                    
                    )
                  
                
                ⁢
                
                  P
                  ⁡
                  
                    (
                    
                      
                        x
                        k
                      
                      =
                      
                        -
                        1
                      
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        
          =
          
          ⁢
          
            ln
            ⁢
            
              
                
                  
                    ∑
                    
                      x
                      ∈
                      
                        X
                        
                          k
                          ,
                          
                            +
                            1
                          
                        
                      
                    
                  
                  ⁢
                  
                    
                      p
                      ⁡
                      
                        (
                        
                          
                            y
                            l
                          
                          ❘
                          x
                        
                        )
                      
                    
                    ⁢
                    
                      
                        ∏
                        
                          
                            x
                            i
                          
                          ∈
                          x
                        
                      
                      ⁢
                      
                        P
                        ⁡
                        
                          (
                          
                            x
                            i
                          
                          )
                        
                      
                    
                  
                
                
                  
                    ∑
                    
                      x
                      ∈
                      
                        X
                        
                          k
                          ,
                          
                            -
                            1
                          
                        
                      
                    
                  
                  ⁢
                  
                    
                      p
                      ⁡
                      
                        (
                        
                          
                            y
                            l
                          
                          ❘
                          x
                        
                        )
                      
                    
                    ⁢
                    
                      
                        ∏
                        
                          
                            x
                            i
                          
                          ∈
                          x
                        
                      
                      ⁢
                      
                        P
                        ⁡
                        
                          (
                          
                            x
                            i
                          
                          )
                        
                      
                    
                  
                
              
              .
            
          
        
      
    
  




Xk,+1 is the set of 2qmd−1 bit vectors x having xk=+1, and Xk,−1 is the complementary set of 2qmd−1 bit vectors x having xk=−1; that is,

k,+1=[x|xk=+1], k,−1={x|xk=−1},

The product terms in (7) are the a priori information about the bits belonging to a certain symbol vector. Since we do not make use of any a priori information in the demapper, these terms cancel out. The L-values at the output of the demap-per can now be obtained by taking the natural logarithm of the ratio of likelihood functions p(yl/x), that is,




  
    
      L
      
        d
        ⁢
        
          
        
        ⁢
        1
      
    
    ⁡
    
      (
      
        
          x
          k
        
        ❘
        
          y
          l
        
      
      )
    
  
  =
  
    
      
        
          ∑
          
            x
            ∈
            
              X
              
                k
                ,
                
                  +
                  1
                
              
            
          
        
        ⁢
        
          p
          ⁡
          
            (
            
              
                y
                l
              
              ❘
              x
            
            )
          
        
      
      
        
          ∑
          
            x
            ∈
            
              X
              
                k
                ,
                
                  -
                  1
                
              
            
          
        
        ⁢
        
          p
          ⁡
          
            (
            
              
                y
                l
              
              ❘
              x
            
            )
          
        
      
    
    .
  




Calculating Likelihood Functions

The signal yl at the detector input contains not only md signals that are to be detected at a BS, but also noise and weak interference. For a typical urban environment (assumed here), the number of cochannel interferers from the surrounding cells can be quite large. We therefore make the simplifying assumption that the distribution of the effective noise due to the (M−md) interferers together with the receiver noise is Gaussian. The likelihood function p(yl/sd) can then be written as




  
    
      p
      ⁡
      
        (
        
          
            y
            l
          
          ❘
          
            s
            d
          
        
        )
      
    
    =
    
      
        1
        
          π
          ⁢
          
            
          
          ⁢
          
            σ
            eff
            2
          
        
      
      ⁢
      exp
      ⁢
      
        {
        
          
            -
            
              1
              
                σ
                eff
                2
              
            
          
          ⁢
          
            
              (
              
                
                  y
                  l
                
                -
                
                  
                    h
                    ld
                  
                  ⁢
                  
                    s
                    d
                  
                
                -
                
                  
                    ∑
                    
                      i
                      ∈
                      
                        •
                        l
                      
                    
                  
                  ⁢
                  
                    
                      g
                      li
                    
                    ⁢
                    
                      s
                      i
                    
                  
                
              
              )
            
            2
          
        
        }
      
    
  
  ,




where sd=map(x) is the vector of md jointly detected symbols. For single-user detection, sd=sd and the sum term in the exponent of (10) disappears (the subscript “d” in md and sd denotes the detected streams). This should not be confused with the desired user meant by the scalar sd.

To evaluate (10), the standard trick that we exploit in our numerical simulation is the so-called “Jacobian logarithm”:

ln(ex1+ex2)=max(x1,x2)+ln(1+e−|x1−x2|).

The second term in (11) is a correction of the coarse approximation with the max-operation and can be neglected for most cases, leading to the max-log approximation. The APP at the detector output at the lth BS as given in (9) can then be simplified to




  
    
      L
      
        d
        ⁢
        
          
        
        ⁢
        1
      
    
    ⁡
    
      (
      
        
          x
          k
        
        ❘
        
          y
          l
        
      
      )
    
  
  ≅
  
    
      
        max
        
          x
          ∈
          
            X
            
              k
              ,
              
                +
                1
              
            
          
        
      
      ⁢
      
        {
        
          
            -
            
              1
              
                σ
                eff
                2
              
            
          
          ⁢
          
            
              
              
                
                  y
                  l
                
                -
                
                  
                    h
                    ld
                  
                  ⁢
                  
                    s
                    d
                  
                
                -
                
                  
                    ∑
                    
                      i
                      ∈
                      
                        •
                        l
                      
                    
                  
                  ⁢
                  
                    
                      g
                      li
                    
                    ⁢
                    
                      s
                      i
                    
                  
                
              
              
            
            2
          
        
        }
      
    
    -
    
      
        max
        
          x
          ∈
          
            X
            
              k
              ,
              
                -
                1
              
            
          
        
      
      ⁢
      
        
          {
          
            
              -
              
                1
                
                  σ
                  eff
                  2
                
              
            
            ⁢
            
              
                
                
                  
                    y
                    l
                  
                  -
                  
                    
                      h
                      ld
                    
                    ⁢
                    
                      s
                      d
                    
                  
                  -
                  
                    
                      ∑
                      
                        i
                        ∈
                        
                          •
                          l
                        
                      
                    
                    ⁢
                    
                      
                        g
                        li
                      
                      ⁢
                      
                        s
                        i
                      
                    
                  
                
                
              
              2
            
          
          }
        
        .
      
    
  




Despite the max-log simplification, the complexity of calculating Ld1(xk/yn) is still exponential in the number of the detected bits in x. To find a maximizing hypothesis in (12) for each xk, there are 2qmd−1 hypotheses to search over in each of the two terms (e.g., 16-QAM modulation with md=2 already requires a search over 256 hypotheses to detect a single bit unless other approximations like tree-search techniques [29] are introduced; for lower-order modulation, more than 2 users can certainly be simultaneously detected with acceptable complexity).
3.3. Soft-Input Soft-Output Decoder
The detector and decoder in our receiver form a serially concatenated system. The APP vector Ld1 (for each detected stream) at the demapper output is sent after deinterleaving as a priori information Lα2 to the maximum a posteriori (MAP) decoder. The MAP decoder delivers another vector Ld2 of APP values about the information as well as the coded bits.
The a posteriori L-value of the coded bit xk, conditioned on Lα2, is




  
    
      L
      
        d
        ⁢
        
          
        
        ⁢
        2
      
    
    ⁡
    
      (
      
        
          x
          k
        
        ❘
        
          L
          
            a
            ⁢
            
              
            
            ⁢
            2
          
        
      
      )
    
  
  =
  
    ln
    ⁢
    
      
        
          P
          ⁡
          
            [
            
              
                x
                k
              
              =
              
                
                  +
                  1
                
                ❘
                
                  L
                  
                    a
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
              
            
            ]
          
        
        
          P
          ⁡
          
            [
            
              
                x
                k
              
              =
              
                
                  -
                  1
                
                ❘
                
                  L
                  
                    a
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
              
            
            ]
          
        
      
      .
    
  




Using the sets Yk,+1 and Yk,−1 to denote all possible codewords x, where bit k equals ±1, respectively, this can after some mathematical manipulation (see [30]) be simplified to




  
    
      L
      
        d
        ⁢
        
          
        
        ⁢
        2
      
    
    ⁡
    
      (
      
        
          x
          k
        
        ❘
        
          L
          
            a
            ⁢
            
              
            
            ⁢
            2
          
        
      
      )
    
  
  =
  
    ln
    ⁢
    
      
        
          
            ∑
            
              x
              ∈
              
                Y
                
                  k
                  ,
                  
                    +
                    1
                  
                
              
            
          
          ⁢
          
            e
            
              
                (
                
                  1
                  /
                  2
                
                )
              
              ⁢
              
                
                  x
                  T
                
                ·
                
                  L
                  
                    a
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
              
            
          
        
        
          
            ∑
            
              x
              ∈
              
                Y
                
                  k
                  ,
                  
                    -
                    1
                  
                
              
            
          
          ⁢
          
            e
            
              
                (
                
                  1
                  /
                  2
                
                )
              
              ⁢
              
                
                  x
                  T
                
                ·
                
                  L
                  
                    a
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
              
            
          
        
      
      .
    
  




3.4. Interference Reconstruction

The decoded APP values received from neighboring BS are combined with local information to generate reliable symbol estimates before interference subtraction. It is therefore critical that the dominant interferers are correctly evaluated. Soft symbol vectors ŝl estimating the signals of the strongest interferers at BS / are generated from the exchanged extrinsic LLR values Liext and local dominant interference estimate Lid2, where ŝi=[ŝ1, ŝ2 . . . ŝM]T removing the component of the desired signal with sd=0. Since the channels for the links between one MT and different BSs can be assumed to be uncorrelated, the extrinsic and local LLR values are combined by simply adding them, that is,

Litot=Liext+Lid2.

The soft symbol estimate ŝi (one element of the vector ŝi,) is evaluated in the soft modulator [31] by calculating the expectation of the random variable Si given the combined likelihood ratios associated with the bits of the symbol taken from Litot:




   
  
    
      
        
          
            
              s
              ^
            
            i
          
          =
          
          ⁢
          
            E
            ⁢
            
              {
              
                
                  S
                  i
                
                ❘
                
                  L
                  i
                  tot
                
              
              }
            
          
        
      
    
    
      
        
          
            =
            
            ⁢
            
              
                ∑
                
                  
                    s
                    k
                  
                  ∈
                  A
                
              
              ⁢
              
                
                  s
                  k
                
                ⁢
                
                  P
                  ⁡
                  
                    (
                    
                      
                        S
                        i
                      
                      =
                      
                        
                          s
                          k
                        
                        ❘
                        
                          L
                          i
                          tot
                        
                      
                    
                    )
                  
                
              
            
          
          ,
          
            ∀
            
              i
              ∈
              
                
                  •
                  l
                
                ⋃
                
                  
                    
                      •
                      _
                    
                    l
                  
                  .
                
              
            
          
        
      
    
  




The variance of this estimate is equal to the power of the estimation error and it adds to the receiver noise as described in Section 3.1. Any element of the variance vector

ei2=[e12, e22 . . . eM2]T with ed2=0 is calculated as





  
    
      e
      i
      2
    
    =
    
      
        var
        ⁡
        
          (
          
            
              
                s
                ^
              
              i
            
            ❘
            
              L
              i
              tot
            
          
          )
        
      
      ⁢
      
        

      
      ⁢
      
        
      
      =
      
        
          ∑
          
            
              s
              k
            
            ∈
            A
          
        
        ⁢
        
          
        
        ⁢
        
          
            
              (
              
                
                  s
                  k
                
                -
                
                  
                    s
                    ^
                  
                  i
                
              
              )
            
            2
          
          ⁢
          
            P
            ⁡
            
              (
              
                
                  S
                  i
                
                =
                
                  
                    s
                    k
                  
                  ❘
                  
                    L
                    i
                    tot
                  
                
              
              )
            
          
        
      
    
  
  ,
  
    ∀
    
      i
      ∈
      
        
          l
          i
        
        ⋃
        
          
            
              l
              _
            
            i
          
          .
        
      
    
  




The error power ei2 depends upon the extent of quantization of the LLR values (see Section 5). If only hard bits are transferred, ŝiεA and the estimated symbol error becomes zero, resulting in degraded performance.
4. Decentralized Detection Strategies
The performance of the decentralized processing schemes depends upon receiver complexity and allowable backhaul traffic. In this section, we describe three strategies with increasing complexity that offer different tradeoffs between complexity, performance, and backhaul.
4.1. Basic Distributive Iterative Detection
In the basic version of distributive iterative detection, the decentralized detection problem is treated as parallel interference cancellation by implementing information exchange between the BSs. To keep complexity and backhaul low, only the signal from the associated MT is detected and exchanged between the BSs, while the rest of the received signals are treated as part of the receiver noise. Consider FIG. 2, showing the receiver for BS l, where only the desired data sd is detected with single-user detection and transmitted out to other BSs. The APPs at the output of the soft detector are approximated as




  
    
      L
      
        d
        ⁢
        
          
        
        ⁢
        1
      
    
    ⁡
    
      (
      
        
          x
          k
        
        ❘
        
          y
          i
        
      
      )
    
  
  ≅
  
    
      
        max
        
          x
          ∈
          
            X
            
              k
              +
              1
            
          
        
      
      ⁢
      
        {
        
          
            -
            
              1
              
                σ
                eff
                2
              
            
          
          ⁢
          
            
              
              
                
                  y
                  i
                
                -
                
                  
                    h
                    id
                  
                  ⁢
                  
                    s
                    d
                  
                
              
              
            
            2
          
        
        }
      
    
    -
    
      
        max
        
          x
          ∈
          
            X
            
              k
              -
              1
            
          
        
      
      ⁢
      
        
          {
          
            
              -
              
                1
                
                  σ
                  eff
                  2
                
              
            
            ⁢
            
              
                
                
                  
                    y
                    i
                  
                  -
                  
                    
                      h
                      id
                    
                    ⁢
                    
                      s
                      d
                    
                  
                
                
              
              2
            
          
          }
        
        .
      
    
  




The decoded estimates of the desired streams are exchanged after quantization. The incoming decoded data streams from the neighboring BS are used to reconstruct the interference energy. Since only the desired data stream is detected, no local estimates of the strongest interferers Lid2 are available.
This implementation is especially useful in the case of low-frequency reuse.
4.2. Enhanced distributive iterative detection with SAIC
The performance of the basic distributed detection receiver degrades for asymmetrical channels encountered in high-frequency reuse networks when dominant interferers are present and the SIR→0 dB.
The error propagation encountered in the basic DID scheme is reduced by improving the initial estimate through single-antenna interference cancellation. Although all the detected data streams are decoded, in this approach only the decoded APPs for the desired users are exchanged between the BSs to limit the amount of backhaul. However, the APPs for the dominant interferers are not discarded, but used in conjunction with reliability information from other BSs to cancel the interference. The performance of this scheme is, however, limited by the number of nondetected weak interferers and/or by the quantization of the exchanged reliability information. Therefore, also the number of required exchanges between the BSs to reach convergence is slightly higher than for the unconstrained scheme described next.
Unlike the basic DID scheme, the performance curves for SAIC aided DID to converge even if the SIR is around or below 0 dB (this is similar to the situation in spatial multiplexing with strong coupling among the streams). Since a BS does not receive multiple copies of the desired signal from several neighboring BSs, there is a loss of array gain and spatial diversity for the desired signals.
4.3. DID with Unconstrained Backhaul
In this version of decentralized detection, all estimates of the received data streams are detected at each BS, and all available soft LLR values are exchanged. This approach uses multiple exchanges of extrinsic information between the BSs and is similar to message passing (although we may use an ML detector during the first information pass). Since all detected input streams are exchanged, both diversity and array gain are obtained. In addition, the algorithm converges more quickly than the ones with constrained backhaul. While the simultaneous detection of multiple data streams through SAIC during initial iteration can further speed up convergence, low-complexity SUD detection during the first iteration is normally sufficient and results in only marginal degradation in performance. The amount of backhaul per iteration for a fully coupled system (ml=M), however, grows cubically in the cooperating setup size, that is, backhaul ∞MN(M−1), making this scheme impractical even for a few BSs in cooperation.
5. Quantization Of The Reliability Information
A posteriori probabilities at the decoder are preferably quantized before transmission causing quantization noise, which is equivalent to information loss in the system. By increasing the number of quantization levels, this loss will decrease at the cost of added backhaul, which has to stay within guaranteed limits from the network operator's standpoint.
The information content associated with L-values varies with their magnitude. While single-bit quantization will incur little information loss at high reliability values, it leads to considerable degradation in performance for L-values having their mean close to zero. Therefore, L-values following a bimodal Gaussian distribution should not simply be represented using uniform quantization. Even nonuniform quantization according to [32, 33] applied directly to the L-values by minimizing the mean square error (MSE) between the quantized and nonquantized densities is not optimum as we will show. In what follows we develop a quantization strategy based on information-theoretic concepts, such as “soft bits” and mutual information. Representation of the L-values with these quantities takes the saturation of the information content (with increasing magnitude of the L-values) into account and improves the backhaul efficiency
5.1. Representation of L-Values Based on Mutual Information
Mutual information I(X;L) between two variables x and / measures the average reduction in uncertainty about x when / is known and vice versa [34]. We use mutual information to measure the average information loss about binary data if the Lvalues are quantized. A general expression for mutual information based on entropy and conditional entropy is

I(X;L)=H(L)−H(L/X).

Assuming equal a priori probability for the binary variable xε{−1;+1}, a simplified expression for the mutual information between x and the a posteriori L-value at the decoder output is (in what follows all logarithms are with respect to base 2)




  
    I
    ⁡
    
      (
      
        X
        ;
        L
      
      )
    
  
  =
  
    
      1
      2
    
    ⁢
    
      
        ∑
        
          x
          =
          
            ±
            1
          
        
      
      ⁢
      
        
      
      ⁢
      
        
          ∫
          
            -
            ∞
          
          
            +
            ∞
          
        
        ⁢
        
          
            p
            ⁡
            
              (
              
                l
                ❘
                x
              
              )
            
          
          ⁢
          
            ln
            [
            
              
                2
                ⁢
                p
                ⁢
                
                  (
                  
                    l
                    ❘
                    x
                  
                  )
                
              
              
                
                  p
                  ⁡
                  
                    (
                    
                      
                        l
                        ❘
                        x
                      
                      =
                      
                        +
                        1
                      
                    
                    )
                  
                
                +
                
                  p
                  ⁡
                  
                    (
                    
                      
                        l
                        ❘
                        x
                      
                      =
                      
                        -
                        1
                      
                    
                    )
                  
                
              
            
            ⁢
            
              
            
            ]
          
          ⁢
          
            
              d
              l
            
            .
          
        
      
    
  




Exploiting the symmetry and consistency properties of the L-value density [28], (20) becomes




  
    I
    ⁢
    
      (
      
        X
        ;
        L
      
      )
    
  
  =
  
    
      
        ∫
        
          -
          ∞
        
        ∞
      
      ⁢
      
        
          
            p
            ⁡
            
              (
              
                
                  l
                  ❘
                  x
                
                =
                
                  +
                  1
                
              
              )
            
          
          ⁡
          
            [
            
              1
              -
              
                ln
                ⁡
                
                  (
                  
                    1
                    +
                    
                      e
                      
                        -
                        l
                      
                    
                  
                  )
                
              
            
            ]
          
        
        ⁢
        
          d
          l
        
      
    
    ⁢
    
      

    
    ⁢
    
      
    
    =
    
      1
      -
      
        E
        ⁢
        
          
            {
            
              ln
              ⁡
              
                (
                
                  1
                  +
                  
                    e
                    
                      -
                      l
                    
                  
                
                )
              
            
            }
          
          .
        
      
    
  




If in the last relation the expected bit values or “soft bits”[28] defined as λ=E{x}=tan h(l/2) are used, then an equivalent expression for the mutual information between X and L is

I(X;L)=E{ln(1+λ)},

In practice, the expectation in (21) and (22) is approximated by a finite sum over the L-values in a received codeword:




  
    
      I
      ⁡
      
        (
        
          X
          ;
          L
        
        )
      
    
    ≅
    
      1
      -
      
        
          1
          K
        
        ⁢
        
          
            ∑
            
              k
              =
              1
            
            K
          
          ⁢
          
            
          
          ⁢
          
            ln
            ⁡
            
              (
              
                1
                +
                
                  e
                  
                    
                      -
                      
                        l
                        k
                      
                    
                    ⁢
                    
                      x
                      
                        k
                        ⁢
                        
                          
                        
                      
                    
                  
                
              
              )
            
          
        
      
    
  
  =
  
    
      1
      K
    
    ⁢
    
      
        ∑
        
          k
          =
          1
        
        K
      
      ⁢
      
        
          ln
          ⁡
          
            (
            
              1
              +
              
                
                  λ
                  k
                
                ⁢
                
                  x
                  k
                
              
            
            )
          
        
        .
      
    
  




An expression to calculate the conditional mutual information based solely on the magnitude |I| of the APP values was provided in [35]. If we evaluate the binary entropy (the entropy of a binary random variable x is Hb=−x ln x−(1−x) In (1−x)) of the (instantaneous) bit error probability Pe(l)=e−|l|/2/(e|l|/2+e−|l|/2)d|l|, the probability that hard decisions based on the L-values lead to the wrong sign, lkxk=−1, is given by ∫0∞p(|l|)Pe(l)d|l|. Now the mutual information between X and L can be compactly written (as the expectation of the complement of the binary entropy of the bit error rate Pe [36]):




  
    I
    ⁡
    
      (
      
        X
        ;
        L
      
      )
    
  
  =
  
    
      1
      -
      
        E
        ⁢
        
          {
          
            
              H
              b
            
            ⁡
            
              (
              
                P
                e
              
              )
            
          
          }
        
      
    
    ⁢
    
      

    
    ⁢
    
      
    
    =
    
      1
      +
      
        E
        ⁢
        
          
            {
            
              
                
                  P
                  e
                
                ⁢
                
                  ln
                  ⁡
                  
                    (
                    
                      P
                      e
                    
                    )
                  
                
              
              +
              
                
                  (
                  
                    1
                    -
                    
                      P
                      e
                    
                  
                  )
                
                ⁢
                
                  ln
                  ⁡
                  
                    (
                    
                      1
                      -
                      
                        P
                        e
                      
                    
                    )
                  
                
              
            
            }
          
          .
        
      
    
  




From the above expressions, three different L-value representations are conceivable for quantization. They are sketched as a function of the magnitude of the L-values in FIG. 3:

    (i) original L-values,
    (ii) soft bits: λ(l)=tan h(l/2),
    (iii) mutual information: l(l)=1−Hb(Pe).


The underlying L-value density depends only on a single parameter σL, because mean and variance are related by μL=σL2/2 [37]. This density is given as




  
    
      p
      L
    
    ⁡
    
      (
      l
      )
    
  
  =
  
    
      
        
          1
          /
          2
        
        
          
            
              
                2
                ⁢
                π
              
              ⁢
              
                
              
            
          
          ⁢
          
            σ
            L
          
        
      
      ⁡
      
        [
        
          
            exp
            ⁢
            
              {
              
                -
                
                  
                    
                      (
                      
                        l
                        -
                        
                          
                            σ
                            L
                            2
                          
                          /
                          2
                        
                      
                      )
                    
                    2
                  
                  
                    2
                    ⁢
                    
                      σ
                      L
                      2
                    
                  
                
              
              }
            
          
          +
          
            exp
            ⁢
            
              {
              
                -
                
                  
                    
                      (
                      
                        l
                        -
                        
                          
                            σ
                            L
                            2
                          
                          /
                          2
                        
                      
                      )
                    
                    2
                  
                  
                    2
                    ⁢
                    
                      σ
                      L
                      2
                    
                  
                
              
              }
            
          
        
        ]
      
    
    .
  




FIG. 3 shows L-value l, soft-bit λ(l), and mutual information I(l) representations of the LLR plotted as a function of the magnitude |l| of the LLR.
Using the distribution function (cdf) of pL(l) and the inverse function l=2 tan h−1λ, the transformed soft value density can be obtained in closed form as




  
    
      
        p
        L
      
      ⁡
      
        (
        l
        )
      
    
    =
    
      
        
          1
          /
          2
        
        
          
            (
            
              1
              -
              
                λ
                2
              
            
            )
          
          ⁢
          
            
              2
              ⁢
              π
            
          
          ⁢
          
            σ
            L
          
        
      
      ⁡
      
        [
        
          
            
              
                
                  exp
                  ⁢
                  
                    {
                    
                      -
                      
                        
                          
                            (
                            
                              
                                4
                                ⁢
                                
                                  tanh
                                  
                                    -
                                    1
                                  
                                
                                ⁢
                                λ
                              
                              -
                              
                                σ
                                
                                  L
                                  ⁢
                                  
                                    
                                  
                                
                                2
                              
                            
                            )
                          
                          2
                        
                        
                          8
                          ⁢
                          
                            σ
                            
                              L
                              ⁢
                              
                                
                              
                            
                            2
                          
                        
                      
                    
                    }
                  
                
                +
              
            
          
          
            
              
                
                  exp
                  ⁢
                  
                    {
                    
                      -
                      
                        
                          
                            (
                            
                              
                                4
                                ⁢
                                
                                  tanh
                                  
                                    -
                                    1
                                  
                                
                                ⁢
                                λ
                              
                              +
                              
                                σ
                                
                                  L
                                  ⁢
                                  
                                    
                                  
                                
                                2
                              
                            
                            )
                          
                          2
                        
                        
                          8
                          ⁢
                          
                            σ
                            
                              L
                              ⁢
                              
                                
                              
                            
                            2
                          
                        
                      
                    
                    }
                  
                
                ⁢
                
                  
                
              
            
          
        
        ]
      
    
  
  ,




while a mutual information density based on (23) can only be calculated numerically. The three densities that can be alternatively quantized are illustrated in FIG. 4. The mutual information density is mirrored at the ordinate to conserve the sign as in the LLR or λ-representations. The performance of different quantization schemes will be investigated next.

5.2. Quantization Strategies

Mutual information evaluated with Hb(Pe) and similarly the soft-bit representation are nonlinear functions of L-values that saturate with increasing magnitude. This suggests that nonuniform quantization schemes that minimize the meansquared quantization error should be able to exploit this and have in addition an advantage over uniform quantization. Preferably the well-known Lloyd-Max quantizer is adopted.
Nonuniform Quantization in the LLR Domain
The optimal quantization scheme due to Lloyd [32] and Max [33] was applied to the L-value density of the decoder output. The reconstruction levels ri are determined through an iterative process after the initial decision levels d, have been set. The objective function to calculate the optimal ri reads




  
    min
    
      r
      i
    
  
  ⁢
  
    
      ∑
      
        i
        =
        1
      
      R
    
    ⁢
    
      
    
    ⁢
    
      
        ∫
        
          d
          i
        
        
          d
          
            i
            +
            1
          
        
      
      ⁢
      
        
          
            (
            
              1
              -
              
                r
                i
              
            
            )
          
          2
        
        ⁢
        
          p
          ⁡
          
            (
            l
            )
          
        
        ⁢
        
          
        
        ⁢
        
          
            d
            l
          
          .
        
      
    
  




FIG. 4 shows Comparison of the distribution of L-values represented in the original bimodal Gaussian form or by soft bits or mutual information.
This is iteratively solved by determining the centroids ri of the area of p(l) between the current pairs of decision levels di and di+1:




  
    
      r
      i
    
    =
    
      
        
          ∫
          
            d
            i
          
          
            d
            
              i
              +
              1
            
          
        
        ⁢
        
          
            lp
            ⁡
            
              (
              l
              )
            
          
          ⁢
          
            d
            l
          
        
      
      
        
          ∫
          
            d
            i
          
          
            d
            
              i
              +
              1
            
          
        
        ⁢
        
          
            p
            ⁡
            
              (
              l
              )
            
          
          ⁢
          
            d
            l
          
        
      
    
  
  ,




and later updating the decision level for the next iteration as





  
    d
    i
  
  =
  
    
      1
      2
    
    ⁢
    
      
        (
        
          
            r
            
              i
              -
              1
            
          
          +
          
            r
            i
          
        
        )
      
      .
    
  




The number of quantization levels and the number of quantization bits are denoted with R=2b and b, respectively. Results for b=1, 2 and 3 bits can be found in the appendix.
Nonuniform Quantization in the Soft-Bit Domain
In this approach, the optimum reconstruction and decision levels to quantize the L-values were calculated in the “soft-bit domain” again in accordance with (27) and (29). Detailed results for b=1-3 quantization bits are shown again in the appendix. It should be stressed that the final quantization still occurs in the L-value domain, because the optimized levels are mapped back via l=2 tan h−1(λ). Note that only the number of quantization levels and the variance of the L-values have to be communicated between the BSs to interpret the exchanged data, because the optimized levels can be stored in lookup tables throughout the network.
Mutual Information Loss
Based on the set of levels di and ri, the mutual information for quantized and nonquantized L-value densities was calculated. The difference represents the reduction or loss in mutual information ΔI due to quantization:

ΔI=Inon-quant−Iquant.

This loss is shown in FIG. 5 as a function of the average mutual information of the nonquantized L-values.
Inon-quant was found with pL(I/x=+1) evaluating (21). Using the optimized reconstruction and decision levels from the appendix, Iquant was determined explicitly as




  
    I
    quant
  
  =
  
    
      
        ∑
        
          i
          =
          1
        
        R
      
      ⁢
      
        
      
      ⁢
      
        
          [
          
            1
            -
            
              ln
              ⁡
              
                (
                
                  1
                  +
                  
                    e
                    
                      -
                      
                        r
                        i
                      
                    
                  
                
                )
              
            
          
          ]
        
        ⁢
        
          
            ∫
            
              d
              i
            
            
              d
              
                i
                +
                1
              
            
          
          ⁢
          
            
              p
              ⁡
              
                (
                
                  
                    l
                    ❘
                    x
                  
                  =
                  
                    +
                    1
                  
                
                )
              
            
            ⁢
            
              
            
            ⁢
            
              d
              l
            
          
        
      
    
    ⁢
    
      

    
    ⁢
    
      
    
    =
    
      
        
          1
          2
        
        ⁢
        
          
        
        ⁢
        
          
            ∑
            
              i
              =
              1
            
            R
          
          ⁢
          
            
              [
              
                1
                -
                
                  ln
                  ⁡
                  
                    (
                    
                      1
                      +
                      
                        e
                        
                          -
                          
                            r
                            i
                          
                        
                      
                    
                    )
                  
                
              
              ]
            
            ⁢
            
              erf
              ⁡
              
                (
                
                  
                    1
                    -
                    
                      μ
                      L
                    
                  
                  
                    
                      2
                    
                    ⁢
                    
                      σ
                      L
                    
                  
                
                )
              
            
          
        
      
      ⁢
      
        ❘
        
          d
          i
        
        
          d
          
            i
            +
            1
          
        
      
      .
    
  




The larger loss due to quantization of the L-values is clearly visible in FIG. 5, where ΔI is plotted for 1-3 quantization bits (R=2, 4, 8 levels).
We also tested the combining of two mutual information values with and without quantization as it occurs in decentralized detection with limited backhaul. For transmission of BPSK symbols over an AWGN channel, the relation between
FIG. 5 shows Mutual information loss ΔI(X; L) for nonuniform quantization levels determined in the LLR and soft-bit domains (1-3 quantization bits).
FIG. 6 shows BER after soft combining of L-values for quantized information exchange with optimized levels in either the soft-bit or LLR domain.
SNR and the associated variance of the L-values at the channel output is given by Es/N0=8σL2 [36]. Generating two independent distributions for the same σL2 and combining the unquantized L1 with L2 according to Ltot=L1+L2, we compared the bit error rates (probability of the L-value having the wrong sign) for unquantized L2 and quantized L2 based either on optimized quantization levels in the LLR or on soft-bit domains. FIG. 6 shows the BER again for b=1-3 quantization bits.
We note that the curves for quantization based on the soft-bit domain already for only 1 quantization bit approach the performance of 2 to 3 quantization bits based on the L-value domain.
6. Numerical Results
In this section, we provide simulation results to illustrate the performance of distributed iterative strategies in an uplink cellular system. A synchronous cellular setup of 3×3 cells (N=M=9) or 2×2 cells (N=M=4) is assumed. The number of strongly received signals ml varies from 1 to 5. The dominant interferers for any BS l are defined by the index set

[ ]i={i:l(mod M)+1≦i≦1+mi(mod M)+1},

where 1≦l≦M and x(mod y) represents the module operation. As an example, the 2×2 setup with ml=2 strong interferers and pj=0 is characterized by the following coupling matrix:





  
    
  
  ⁢
  
    ρ
    =
    
      
        [
        
          
            
              1
            
            
              
                ρ
                i
              
            
            
              
                ρ
                i
              
            
            
              0
            
          
          
            
              0
            
            
              1
            
            
              
                ρ
                i
              
            
            
              
                ρ
                i
              
            
          
          
            
              
                ρ
                i
              
            
            
              0
            
            
              1
            
            
              
                ρ
                i
              
            
          
          
            
              
                ρ
                i
              
            
            
              
                ρ
                i
              
            
            
              0
            
            
              1
            
          
        
        ]
      
      .
    
  




The number of symbols in each block (codeword) is fixed to 504. A narrowband flat fading i.i.d. Rayleigh channel model is assumed with an independent channel for each symbol. It is further assumed that the receiver has perfect channel knowledge for the desired user signal as well as the interfering signals. A half-rate memory two-parallel concatenated convolutional code with generator polynomials (7, 5)8 is used in all simulations with either 4-QAM or 16-QAM modulation. The number of information exchanges between neighboring base stations is fixed to five unless otherwise stated.
6.1. Comparison of Different Decentralized Detection Schemes
The performance of different decentralized detection schemes described in Section 4 is presented in FIG. 7 for a 3×3 setup and 4-QAM modulation.
Three dominant interferers are received at each BS, that is, ml=4, with normalized dominant interferer path loss ρiε{0.23 0.5} (−3 and −6 dB, resp.). The path loss for the weak interferers pj is assumed to be zero, and unquantized L-values are exchanged. As already mentioned, both basic DID and DID with SAIC have the inherent disadvantage that they only utilize the desired user energy received at the associated BS for signal detection. As a consequence, they do not benefit from array gain or additional spatial diversity and are bounded by the isolated user performance. Although the performance of the basic-DID scheme is comparable to that of SAIC-DID for low values of pi, the difference becomes substantial for higher values of pi. In fact, for pi≈1 and for higher-order modulation (16-QAM or higher), the basic-DID scheme does not converge.
In terms of performance, the strategy of exchanging all processed information between the BSs with unlimited backhaul (DID-UB) is the clear winner. This advantage, however, comes at the cost of huge backhaul, with an increase in the number of exchanges between the BSs per iteration ∝ml. Besides, the large array gain of the near-optimal scheme diminishes (not shown here) for less-robust higher-order modulation, that is, 16-QAM.
FIG. 7 shows FER curves for different receive strategies in decentralized detection: distributed iterative detection (DID), SAIC-aided DID (SAIC), DID with unconstrained backhaul (DID-UB).
FIG. 8 shows an effect of path loss of the dominant interferer pi, SAIC-DID. For the dashed curve labeled as “random”, each element of the path-loss vector 0≦pl,m<1, l≠m, is randomly generated with uniform distribution.
6.2. SAIC-DID with Unquantized LLR Exchange
FIG. 8 shows the FER curves for the (3×3) cell setup with ml=4, pj=0, while the normalized path losses pi of the dominant interferers vary from 0 to 1. Physically, this can be interpreted as an interferer moving away from its own BS towards the base station where the observations are being made. For a network with more than a single tier of neighbors, it is physically impossible to have a high normalized path loss between all the communicating entities. The curve for pi=0 dB is practically not possible and serves only as the indication of the lower performance limits of the receiver. The results for 4-QAM modulation show that the performance stays quite close to an isolated user performance, and has a loss of less than 1 dB at FER of 10−2 for pi≦−6 dB.
To show the behavior of a setup with random path losses, the elements pli of the path-loss vector are randomly generated with uniform distribution at every channel realization, where iε[ ]l. and 0≦pi<1. The simulation results are shown by the dashed curve labeled as “random”, which is comparable to pi=−6 dB curve.
FIG. 9 illustrates the iterative behavior of the SAIC-based receive strategy. There is a large improvement in performance after the initial exchange of decoder APPs, which diminishes with later iterations. We therefore restrict all subsequent simulations to five iterations as very little performance improvement is gained beyond this point.
FIG. 10 shows the FER for SAIC-DID plotted as a function of the number of dominant cochannel signals ml at SNR=5 dB. The FER curve for pi=−10 dB indicates that the performance is relatively independent of ml at low interference levels. However, when pi→1, the performance degrades considerably with additional interferers. For example, for ml=5 and p>−6 dB, the SAIC-DID schemes only start converging at an SNR higher than 5 dB. For a typical cellular setup using directional BS antennas with downtilt, ml normally stays between 2 and 4 for 4-QAM, resulting in the FER water fall to be located around 5 dB.
To see how the performance of a received strategy scales with the size of the network, FIG. 11 depicts a 2×2 cell network in comparison to a 3×3 cell network for different values of the normalized path loss pi. The number of dominant received signals at each BS is fixed to 4. For the solid curves, the set [ ]l is defined according to (32), with the modulo operation ensuring that symmetry conditions are incorporated; that is, each MT is received by 4 BSs, while each BS receives 4 MTs. Interestingly, the performance for a 2×2 cell network with greater mutual-coupling is only slightly worse than in a 3×3 cell setup. The mutual-coupling in a 3×3 cell setup can be increased by symmetrically placing the dominant interferers on either side of the leading diagonal. The resulting difference in performance between the setups of two sizes is further reduced (dashed lines). This suggests that for a given number of dominant interferers ml and couplings pi, the performance depends on the sizes of the cycles that are formed by exchanging information among the BSs.
FIG. 10 shows FER for SAIC-DID, plotted as function of the number of dominant cochannel signals ml at SNR=5 dB.
FIG. 11 shows SAIC-DID performance comparison for 2×2 and 3×3 cells setup. Each MT is received strongly at 4 BSs, while each BS receives signals from 4 MTs. The two curves for 3×3 cell setup give the bounds for different possible combinations of couplings within the setup.
FIG. 12 shows Effect of path loss of the dominant interferer pi for different modulation orders. Each BS sees just two dominant signals ml=2.
FIG. 12 shows the performance of SAIC-DID for 4-QAM and 16-QAM modulations, employing a 2×2 cellular setup with only a single dominant interferer, ml=2, and varying the coupling strength. While the performance of 4-QAM degrades only marginally for pi=0 dB at the FER of 10−2, the loss of the performance for 16-QAM is already more than 3 dB. This indicates that with additional impairments, strong cochannel interferers are difficult to handle for 16-QAM modulation.
6.3. Quantization of L-Values and Backhaul Traffic
The performance of the proposed scheme for the two different quantization strategies, optimal quantization in the soft-bit and LLR domains, and for different numbers of quantization bits is presented in FIG. 13. The normalized path loss pi=1 (0 dB) is chosen such that any loss of quality of the estimates has a pronounced effect on system performance. As already predicted, quantization in the soft-bit domain is clearly superior to that in the LLR domain. For soft-bit domain quantization, exchanging hard bits will result in a performance loss of one dB which is reduced to almost one quarter of a dB for 2-bit quantization (R=4). Any further increase in quantization bits will bring limited gains.
For the dashed curve labeled with a plus sign (“+”) only those bits that have changed signs between iterations are exchanged, and the number of quantization intervals R is set adaptively during each iteration to save backhaul capacity. The maximum number of reconstruction levels is Rmax=8. It is illustrated that despite a large improvement in backhaul, the performance degrades only marginally.
FIG. 13 shows Effect of quantization of the exchanged decoder LLR values, where pi=0 dB. Curve labeled with “+” exchanges only those bits that have changed signs between iterations, and adaptively sets the number of quantization intervals during each iteration to reduce backhaul.
As already mentioned, all decoded information bits are only exchanged during the first iteration to minimize the backhaul, while in the later iterations only those bits that have changed signs are exchanged after applying some lossless compression, for example, run-length encoding or vector quantization techniques.
FIG. 14 shows that the average backhaul traffic during different iterations is plotted as a function of SNR for a hard information bit exchange. In the operating region of interest (Eb/N0>15 dB), there is negligible traffic after 3 iterations. The total backhaul in this operating region lies between 100% and 150% of the total number of information bits received, which is a substantial gain over DAS backhaul traffic requirement [19]. It must be mentioned that any additional overhead, required for the compression technique (such as run-length) and used for exchanging a fraction of the estimates, was not taken into account.
6.4. Sensitivity to Additional Interference
Finally, FIG. 15 shows the degradation in the performance of the receiver in the presence of additional weak interferes. As an example, a (2×2) cellular system is considered with three interferers. It is assumed that two interferers are strongly received (ml=3) with the normalized path loss pi=1 (0 dB), while the third one is a weak interferer whose normalized path loss pj can be varied. As illustrated, the performance deteriorates sharply if pj>−10 dB. This is due to the fact that the product constellation of the three stronger streams is quite densely populated and any small additional noise may result in a large change in the demap-per output estimates, thereby making the decoder less effective. As to be expected, the schemes become more sensitive to this additional noise after quantization. With comparison to FIG. 11 (2×2, 0 dB curve), one can conclude that it is more beneficial for the considered scenario to jointly detect all four incoming signals if the normalized path loss for the weak interferer exceeds −10 dB.
FIG. 14 shows Backhaul traffic normalized with respect to total information bits. Single-bit quantization of LLR values is performed. Only those bits that have changed signs between iterations are exchanged (pi=0 dB).
FIG. 15 shows FER for SAIC-DID in the presence of a weak interferer. pj represents the path loss of the weak interferer.
FIG. 16 shows optimum nonuniform quantization levels obtained by optimization in the L-value domain.
FIG. 17 shows optimum nonuniform quantization levels obtained by optimization in the “soft-bit” domain.
FIG. 18 shows mutual information loss ΔI(X;L) for 1-3 quantization bits as a function of the variance of the L-values.
7. Conclusions
Outer cell interference in future cellular networks can be suppressed through base station cooperation.
Preferred exemplary embodiments of the invention include an alternative strategy to the distributed antenna system (DAS) for mitigating OCI which we termed as distributed iterative detection (DID). An interesting feature of this approach is the fact that no special centralized processing units are needed. In addition, we explored its implementation with reduced backhaul traffic by performing joint maximum likelihood detection for the desired user and the dominant interferers. We propose to exchange nonuniformly quantized soft bits to minimize the backhaul traffic. Interestingly, the quantization of reliability information does not result in a pronounced performance loss and sometimes even hard bits can be exchanged without undue degradation. To minimize backhaul it is further proposed that only those bits that have changed signs between iterations be exchanged. The result is a considerable reduction in backhaul traffic between base stations. The scheme is limited by (undetected) background interference.
An extension of this work could address the question under which conditions reliability information for more than one stream should be exchanged to obtain diversity and array gain and when this does not pay. This should provide some further insight into the tradeoff between capacity increase and affordable complexity.
Optimum Quantization of the L-Value Density
To optimize the reconstruction (quantization) levels ri and decision levels di for a given density pL(X), we have to iteratively compute the integrals updating the reconstruction levels given the current decision levels di (see (29)).
Consider first the bimodal Gaussian density of L-values given in (25). The integrals to be evaluated become (with μL=ρL2/2)




  
    
      
        
          ∫
          
            d
            i
          
          
            d
            
              i
              +
              1
            
          
        
        ⁢
        
          exp
          ⁢
          
            {
            
              -
              
                
                  
                    (
                    
                      x
                      -
                      
                        μ
                        L
                      
                    
                    )
                  
                  2
                
                
                  2
                  ⁢
                  
                    σ
                    L
                    2
                  
                
              
            
            }
          
        
      
      +
      
        exp
        ⁢
        
          {
          
            -
            
              
                
                  (
                  
                    x
                    +
                    
                      μ
                      L
                    
                  
                  )
                
                2
              
              
                2
                ⁢
                
                  σ
                  L
                  2
                
              
            
          
          }
        
        ⁢
        
          d
          x
        
      
    
    =
    
      
        
          σ
          L
        
        ⁢
        
          
            
              π
              2
            
          
          ⁡
          
            [
            
              
                erf
                ⁢
                
                  
                    x
                    -
                    
                      μ
                      L
                    
                  
                  
                    
                      2
                    
                    ⁢
                    
                      σ
                      L
                      2
                    
                  
                
              
              +
              
                erf
                ⁢
                
                  
                    x
                    +
                    
                      μ
                      L
                    
                  
                  
                    
                      2
                    
                    ⁢
                    
                      σ
                      L
                    
                  
                
              
            
            ]
          
        
      
      ⁢
      
        ❘
        
          d
          i
        
        
          d
          
            i
            +
            1
          
        
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        
          ∫
          
            d
            i
          
          
            d
            
              i
              +
              1
            
          
        
        ⁢
        
          x
          ⁢
          
            
          
          ⁢
          exp
          ⁢
          
            {
            
              -
              
                
                  
                    (
                    
                      x
                      -
                      
                        μ
                        L
                      
                    
                    )
                  
                  2
                
                
                  2
                  ⁢
                  
                    σ
                    L
                    2
                  
                
              
            
            }
          
        
      
      +
      
        x
        ⁢
        
          
        
        ⁢
        exp
        ⁢
        
          {
          
            -
            
              
                
                  (
                  
                    x
                    +
                    
                      μ
                      L
                    
                  
                  )
                
                2
              
              
                2
                ⁢
                
                  σ
                  L
                  2
                
              
            
          
          }
        
        ⁢
        
          d
          x
        
      
    
    =
    
      
        
          σ
          L
          2
        
        ⁡
        
          [
          
            
              exp
              ⁢
              
                {
                
                  -
                  
                    
                      
                        (
                        
                          x
                          -
                          
                            μ
                            L
                          
                        
                        )
                      
                      2
                    
                    
                      2
                      ⁢
                      
                        σ
                        L
                        2
                      
                    
                  
                
                }
              
            
            +
            
              exp
              ⁢
              
                {
                
                  -
                  
                    
                      
                        (
                        
                          x
                          +
                          
                            μ
                            L
                          
                        
                        )
                      
                      2
                    
                    
                      2
                      ⁢
                      
                        σ
                        L
                        2
                      
                    
                  
                
                }
              
            
          
          ]
        
      
      ⁢
      
        ❘
        
          d
          i
        
        
          d
          
            i
            +
            1
          
        
      
      ⁢
      
        
          
            +
            ...
          
          +
          
            
              μ
              L
            
            ⁢
            
              σ
              L
            
            ⁢
            
              
                
                  π
                  2
                
              
              ⁡
              
                [
                
                  
                    erf
                    ⁢
                    
                      
                        x
                        -
                        
                          μ
                          L
                        
                      
                      
                        
                          2
                        
                        ⁢
                        
                          σ
                          L
                        
                      
                    
                  
                  +
                  
                    erf
                    ⁢
                    
                      
                        x
                        +
                        
                          μ
                          L
                        
                      
                      
                        
                          2
                        
                        ⁢
                        
                          σ
                          L
                        
                      
                    
                  
                
                ]
              
            
          
        
        ⁢
        
          ❘
          
            d
            i
          
          
            d
            
              i
              +
              1
            
          
        
      
    
  
  ,




The optimum positive quantization levels are displayed in FIG. 16 (the negative levels are obtained by inversion due to symmetry). As to be expected, for one quantization bit, the level equals the mean more or less exactly. With additional bits, the levels are placed on both sides around the mean. Similar integrals have to be evaluated to be quantized nonuniformly in the “soft-bit” domain. Here only one integral can be carried out:




  
    
  
  ⁢
  
    
      
        ∫
        
          d
          i
        
        
          d
          
            i
            +
            1
          
        
      
      ⁢
      
        
          
            p
            L
          
          ⁡
          
            (
            λ
            )
          
        
        ⁢
        
          d
          λ
        
      
    
    =
    
      
        
          1
          2
        
        ⁢
        
          erf
          [
          
            
              
                2
                ⁢
                
                  
                
                ⁢
                
                  
                    tanh
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    λ
                    )
                  
                
              
              -
              
                μ
                L
              
            
            
              
                2
              
              ⁢
              
                σ
                L
              
            
          
          ]
        
      
      ⁢
      
        ❘
        
          d
          
            d
            i
          
        
        
          d
          
            i
            +
            1
          
        
      
    
  




with pL(λ) given by (26). The other integral ∫didi+1λpL(λ)dλ has to be evaluated by numerical integration. The derived optimum quantization levels converted back to the LLR domain with L=2 tan h−1(λ) are shown in FIG. 17.

We observe that now the optimized levels show some saturation with increasing mean/variance of the L-value density because the increase in reliability is not important. Rather it pays more to distinguish L-values of intermediate magnitude, say roughly in the range 2≦/≦6.
For practical evaluation, it is more convenient to determine the necessary quantizer resolution according to the variance of the L-values. We therefore provide a plot corresponding to FIG. 5 with a as the abscissa.
In many signal processing applications, concatenated modules exchange probabilities to perform certain tasks in a given signal processing chain or even do this iteratively to process the data. For digital processing, the signals are typically represented by bits in binary form and so-called log-likelihood ratios (abbreviated as LLRs or −values in the following) occur and have to be communicated with finite precision. The necessary quantization step inevitably causes quantization noise equivalent to information loss in the system.
The underlying idea is the intuitive consideration, that a (typically Gaussian) density to is more difficult to quantize than some transformed variable that shows saturation with increasing reliability (magnitude) of the −value. Based on a closed form expression for the transformed soft bit density that we had derived, Lloyd's optimum algorithm for scalar quantization could be conveniently applied to derive decision and reconstruction (quantization) levels and, respectively we also show that the loss of mutual information due to quantization was clearly smaller with soft bit based quantization than with “direct” quantization of the −value density.
Optimum levels in terms of mutual information loss were determined by maximizing the mutual information of the quantized value density by a steepest ascent technique. We alternatingly optimized the two level types in the spirit of Lloyd's algorithm for several iterations).
Example results are presented for reconstruction levels (4 finite decision levels; the decision levels and have the values independent of the method of quantization). Due to symmetry two level pairs occur for both reconstruction and decision levels which only differ in sign while the 5th reconstruction level is exactly zero independent of the value variance. Therefore only positive levels are shown as a function of comparing LLR and soft bit quantization with the scheme maximizing mutual information.
We note that the levels due to soft bit quantization show the expected saturation with increasing −value magnitude (increasing variance). This effect is less pronounced after maximizing the mutual information. Apart from optimizing the levels directly w.r.t. the nonlinear expression for the mutual information, a new degree of freedom that can be exploited with the latter scheme is the independent optimization of the decision levels which do not have to be the mean of the neighbouring reconstruction levels (corresponding to 1D-Voronoi regions, when viewed as a special case of vector quantization).
This allows reducing the loss in mutual information.
We note a relatively large reduction of the mutual information loss (decreasing with increasing number of levels), when the LLR-based quantization is replaced by the maximization of the mutual information.
The comparison between the soft bit quantisation and the mutual information maximization shows that with soft bits a large portion of the loss can already be avoided, although still up to 1⁄4 of this loss can be saved with the separate optimization of the decision levels. Here the case is special, because this degree of freedom is not yet available, so that both schemes are equivalent.
For hardware implementation a look-up table with interpolation could be used. More practical, however, is to use curve fitting based on an appropriate approximating function. In this case an expansion in terms of works well.
Another observation concerns the probabilities with which different quantization levels are used: while quantization of the LLR density with the Lloyd-Max algorithm leads to more or less uniformly used levels, L-value quantization based on mutual information or soft bits causes significant differences in probability.
This can be exploited with a well-known technique referred to as entropy coding that assigns quantization labels of different length using a prefix-free code either to the individual levels or to groups of them, if several −values are represented jointly. A lower bound for the required average label length is given by the entropy of the quantization levels.
We compare this bound for LLR quantization based on mutual information and the Lloyd-Max algorithm applied to the L-value density. In addition we computed the practically achievable rate reduction using Huffman coding in three dimensions. This corresponds to the staircase functions lying above the bounding entropy curves.
As a test case for the proposed LLR quantization scheme we studied decoding of a parallel concatenated convolutional code (PCCC). The extrinsic information obtained from the decoder output with the BCJR algorithm (applying the max. Log-MAP approximation) was exchanged either after direct LLR quantization, soft bit quantization or quantization based on maximizing the mutual information for 2, 3, 4, 8 levels by the two companion decoders. As a reference the unquantized representation of the a-priori information was taken. We used a simple recursive systematic PCCC with generators block length with a random interleaver punctured to obtain rate 1⁄2.
The variance of the LLRs was adaptively determined at the MAP decoder output from the observed variance of, the LLR of the code bits. The fitting functions were used to obtain the new quantization levels in each decoder iteration. For variances larger than the levels for that value were taken and the current −value distribution was scaled accordingly to maintain the information about the relative magnitude among the −values (one could stop iterating here, too). The findings here can be compared with the observations in [P. Robertson, P. Hoeher, and E. Villebrun, “Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding,” Eur. Trans. Telecommun., vol. 8, pp. 119-125, 1997], where quantization of all involved quantities in the Log-MAP algorithm was studied. The results for LLR quantization in the upper plot are markedly worse than the other two schemes, because quantization levels are wasted at large −value magnitude. In the lower plot the soft bit quantization (dashed lines) is slightly worse than the mutual information based techniques.
Distinguishing three quantization schemes, we showed that a significant gain is possible, if LLR values are not quantized “directly” with the Lloyd-Max algorithm. Rather soft bits or even slightly better mutual information provide better cost functions. We quantified this with the loss in mutual information, demonstrating the improvement with a turbo decoding example. Although the proposed scheme strictly applies only to Gaussian channels, it should also be of interest for coded transmission over fading channels, if a Gaussian approximation for the −value density at the decoder output is applicable. An extension from scalar to vector quantization is feasible by generalizing vectors.
According to a preferred exemplary embodiment of the method, the communication system, the logical node and the mobile user equipment quantized Lvalues are exchanged for which the optimum quantization and decision levels have been obtained based on the density of the associated ‘soft-bit’ values and not on the density of the L-values.
According to a further preferred exemplary embodiment of the method, the communication system, the logical node and the mobile user equipment the average amount of mutual information communicated with the proposed quantization scheme is increased with respect to ‘direct’ quantization of the L-value density.
According to a further preferred exemplary embodiment of the method, the communication system, the logical node and the mobile user equipment the used levels vary with mean and variance of the currently to be transmitted block of L-values. The currently used levels can be stored in advance at the transmitter and receiver side of the quantized communication link, so that at the beginning of the exchange of quantized L-values only the current absolute mean value has to be reliably communicated to correctly interpret the transmitted indices for the levels.
According to yet another exemplary embodiment of the method, the communication system, the logical node and the mobile user equipment that the data rate required for the exchange of quantized L-values is estimated by exploiting the fact that the used quantization levels differ strongly in their respective probabilities. Thus, the levels can represented with a technique called ‘entropy coding’ and prefix-free codes using labels of different length.
Application examples are:


    
    
        Cooperating base stations jointly but non-locally detecting data from several mobile terminals
        Hardware implementations of modules such as probability decoders used for decoding concatenated codes, where L-values have to be exchanged between devices (leading to a trade-off between performance and complexity at an acceptable data rate).
    
    


As set forth herein, an exemplary embodiment of the present invention improves multi-user detection through an effective base station cooperation.
Base stations situated at different geographical locations are utilized for an effective data exchange, thus resulting backhaul traffic.
APPENDIX OF REFERENCES


    [1] J. G. Andrews, “Interference cancellation for cellular systems: a contemporary overview,” IEEE Wireless Communications, vol. 12, no. 2, pp. 19-29, 2005.
    [2] H. Dai, A. F. Molisch, and H. V. Poor, “Downlink capacity of interference-limited MIMO system with joint detection,” IEEE Transactions on Wireless Communications, vol. 3, no. 2, pp. 442-453, 2004.
    [3] J. G. Proakis, Digital Communication, McGraw-Hill, New York, N.Y., USA, 4th edition, 2001.
    [4] S. Verdu, “Demodulation in the presence of multi-user interference: progress and misconceptions,” in Intelligent Methods in Signal Processing and Communications, pp. 15-44, Birkhauser Boston, Cambridge, Mass., USA, 1997.
    [5] R. Lupas and S. Verdu, “Linear multi-user detectors for synchronous code-division multiple-access channels,” IEEE Transactions on Information Theory, vol. 35, no. 1, pp. 123-136, 1989.
    [6] U. Madhow and M. L. Honig, “MMSE interference suppression for direct-sequence spread-spectrum CDMA,” IEEE Transactions on Communications, vol. 42, no. 12, pp. 3178-3188, 1994.
    [7] D. Seethaler, G. Matz, and F. Hlawatsch, “An efficient MMSE-based demodulator for MIMO bit-interleaved coded modulation,” in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '04), vol. 4, pp. 2455-2459, Dallas, Tex., USA, November-December 2004.
    [8] P. D. Alexander, M. C. Reed, J. A. Asenstorfer, and C. B. Schlegel, “Iterative multi-user interference reduction: turbo CDMA,” IEEE Transactions on Communications, vol. 47, no. 7, pp. 1008-1014, 1999.
    [9] B. Lu and X. Wang, “Iterative receivers for multi-user space-time coding systems,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 11, pp. 2322-2335, 2000.
    [10] H. Lee, B. Lee, and I. Lee, “Iterative detection and decoding with an improved VBLAST for MIMO-OFDM systems,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 3, pp. 504-513, 2006.
    [11] A. D. Wyner, “Shannon-theoretic approach to a Gaussian cellular multiple-access channel,” IEEE Transactions on Information Theory, vol. 40, no. 6, pp. 1713-1727, 1994.
    [12] S. Shamai and A. D. Wyner, “Information-theoretic considerations for symmetric, cellular, multiple-access fading channels. I,” IEEE Transactions on Information Theory, vol. 43, no. 6, pp. 1877-1894, 1997.
    [13] W. Choi, J. G. Andrews, and C. Yi, “Capacity of multicellular distributed antenna networks,” in Proceedings of the International Conference on Wireless Networks, Communications and Mobile Computing (WIRLES '04), vol. 2, pp. 1337-1342, Maui, Hi., USA, June 2005.
    [14] A. Grant, S. Hanly, J. Evans, and R. Mu{umlaut over ( )}ller, “Distributed decoding for Wyner cellular systems,” in Proceedings 5th Australian Communications Theory Workshop (AusCTW '04), pp. 77-81, Newcastle, Australia, February 2004.
    [15] E. Aktas, J. Evans, and S. Hanly, “Distributed decoding in a cellular multiple-access channel,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '04), p. 484, Chicago, Ill., USA, June-July 2004.
    E. Aktas, J. Evans, and S. Hanly, “Distributed base station processing in the uplink of cellular networks,” in Proceedings of IEEE International Conference on Communications (ICC '06), vol. 4, pp. 1641-1646, Istanbul, Turkey, June 2006.
    [17] O. Shental, A. J. Weiss, N. Shental, and Y. Weiss, “Generalized belief propagation receiver for near-optimal detection of two-dimensional channels with memory,” in Proceedings of the IEEE Information Theory Workshop (ITW '04), pp. 225-229, San Antonio, Tex., USA, October 2004.
    [18] A. Sklavos and T. Weber, “Interference suppression in multi-user OFDM systems by antenna diversity and joint detection,” in Proceedings of the COST 273 Management Committee Meeting (MCM '01), Bologna, Italy, October 2001, TD(01)020.
    [19] S. Khattak, W. Rave, and G. Fettweis, “SIC based multi-user turbo detection in a distributed antenna system for non gray mapping,” in Proceedings of the 9th International Symposium on Wireless Personal Multimedia Communications (WPMC '06), San Diego, Calif., USA, September 2006.
    [20] W. Roh and A. S. Paulraj, “MIMO channel capacity for the distributed antenna systems,” in Proceedings of the IEEE 56th Vehicular Technology Conference (VTC '02), vol. 2, pp. 706-709, Vancouver, BC, Canada, September 2002.
    [21] S. Verdu, Multi-user Detection, Cambridge University Press, Cambridge, UK, 1998.
    [22] P. Marsch and G. Fettweis, “A framework for optimizing the uplink performance of distributed antenna systems under a constrained backhaul,” in Proceedings of the IEEE 5 International Conference on Communications (ICC '07), pp. 975-979, Glasgow, Scotland, June 2007.
    [23] A. Sanderovich, O. Somekh, and S. Shamai, “Uplink macro diversity with limited backhaul capacity,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '07), Nice, France, June 2007.
    [24] S. Khattak and G. Fettweis, “Distributed iterative detection in an interference limited cellular network,” in Proceeding of the 65th IEEE Vehicular Technology Conference (VTC '07), pp. 2349-2353, Dublin, Ireland, April 2007.
    [25] T. Weber, A. Ahrens, and S. Deng, “Decentralized interference cancellation in mobile radio networks,” in Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '07), pp. 2190-2194, Kowloon, China, March 2007.
    [26] V. Ku{umlaut over ( )}hn, “Combined MMSE-PIC in coded OFDM-CDMA systems,” in Proceedings of Conference IEEE Global Telecom-munications Conference (GLOBECOM '01), vol. 1, pp. 231-235, San Antonio, Tex., USA, November 2001.
    [27] H. Zhang, N. B. Mehta, A. F. Molisch, J. Zhange, and H. Dai, “Joint transmission by cooperative base stations in multi-user

MIMO cellular downlinks with asynchronous interference,” IEEE Transactions on Wireless Communications, vol. 7, no. 1, 2008.

    [28] J. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of binary block and convolutional codes,” IEEE Transactions on Information Theory, vol. 42, no. 2, pp. 429-445, 1996.
    [29] E. Zimmermann, S. Bittner, and G. Fettweis, “Complexity re-ductioniniterative MIMO receivers based on EXIT chart analysis,” in Proceedings of the 4th International Symposium on Turbo Codes & Related Topics (ISTC '06), Mu{umlaut over ( )}nchen, Germany, April 2006.
    [30] B. M. Hochwald and S. ten Brink, “Achieving near-capacity on a multiple-antenna channel,” IEEE Transactions on Communications, vol. 51, no. 3, pp. 389-399, 2003.
    [31] W.-J. Choi, K.-W. Cheong, and J. M. Cioffi, “Iterative soft interference cancellation for multiple antenna systems,” in Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '00), vol. 1, pp. 304-309, Chicago, Ill., USA, September 2000.
    [32] S. Lloyd, “Least squares quantization in PCM,” IEEE Transactions on Information Theory, vol. 28, no. 2, part 1, pp. 129-137, 1982.
    [33] J. Max, “Quantizing for minimum distortion,” IEEE Transactions on Information Theory, vol. 6, no. 1, pp. 7-12, 1960.
    [34] T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, New York, N.Y., USA, 1991.
    [35] I. Land, P. A. Hoeher, and S. Gligorevic, “Computation of symbol-wise mutual information in transmission systems with LogAPP decoders and application to Exit charts,” in Proceedings of the 5th International ITG Conference on Source and Channel Coding (SCC '04), pp. 195-202, Erlangen, Germany, January 2004.
    [36] J. Hagenauer, “The Exit chart,” in Proceedings of the 12th European Signal Processing Conference (EUSIPCO '04), pp. 1541-1548, Vienna, Austria, September 2004.
    [37] S. ten Brink, “Convergence behavior of iteratively decoded parallel concatenated codes,” IEEE Transactions on Communications, vol. 49, no. 10, pp. 1727-1737, 2001.
    [38] S. Golomb, “Run-length encodings,” IEEE Transactions on Information Theory, vol. 12, no. 3, pp. 399-401, 1966.
    [39] A. Gersho and R. M. Gray, Vector Quantization and Signal Compression, Kluwer Academic Publishers, Boston, Mass., USA, 1992.

## Claims

1. A method for multi-user detection by a plurality of base stations situated at different geographical locations through base station cooperation, the method comprising exchanging detected data iteratively among the base stations while performing separate detection and decoding of received data streams, wherein the detected data is based on processed information relating to associated mobile terminals between the base stations, and wherein the detected data comprises L-values for which optimum quantization and decision levels have been obtained based on a transformed variable showing saturation with increasing reliability.

2. The method recited in claim 1, comprising exchanging only processed information relating to associated mobile terminals between the base stations.

3. The method recited in claim 1, comprising calculating local estimates of dominant interferers of at least two base stations.

4. The method recited in claim 3, comprising combining local estimates of dominant interferers of a first subset of the plurality of base stations with independently received copies from a second subset of the plurality of base stations.

5. The method recited in claim 4, wherein the first subset of the plurality of base stations comprises most of the plurality of base stations.

6. The method recited in claim 3, comprising combining the local estimates for the at least two base stations with their independently received copies from other ones of the plurality of base stations.

7. The method recited in claim 1, comprising:
calculating local estimates of dominant interferers of the plurality of base stations; and
combining the local estimates with independently received copies from at least some of the plurality of base stations.

8. The method recited in claim 1, comprising generating local estimates of dominant interferers at each of the plurality of base stations using single-antenna interference cancellation techniques.

9. The method recited in claim 1, wherein the transformed variable showing saturation with increasing reliability is a soft-bit density presentation of the L-values.

10. The method recited in claim 9, wherein only soft-bits that have changed signs between iterations are exchanged.

11. The method recited in claim 1, wherein the transformed variable showing saturation with increasing reliability is a mutual information presentation of the L-values.

12. The method recited in claim 1, wherein used levels vary with mean and variance of a currently to be transmitted block of L-values.

13. The method recited in claim 1, comprising estimating a data rate required for the exchange of quantized L-values by exploiting the fact that used quantization levels differ strongly in their respective probabilities, wherein the levels can represented with an entropy coding technique and prefix-free codes using labels of different length.

14. The method recited in claim 1, wherein the optimum quantization comprises nonuniform quantization minimizing mean square quantization error.

15. A communication system that is adapted to carry out communication between a plurality of communication devices situated at different geographical locations, each of the communication devices being adapted to exchange detected data iteratively among the plurality of base stations while performing separate detection and decoding of received data streams, whereby the exchanged detected data is based on processed information relating to associated mobile terminals between the base stations and the exchanged detected data comprises L-values for which optimum quantization and decision levels have been obtained based on a transformed variable showing saturation with increasing reliability.

16. The communication system recited in claim 15, wherein each of the communication devices comprises a logical node.