摘要:
A compression/decompression method for backhaul communication of a complex-valued radio signal between base stations and the network processing unit, such as a Central Processor of a Coordinated MultiPoint (CoMP) system, significantly reduces backhaul bandwidth. The spatial and temporal correlations of the wireless IQ signal are exploited in order to remove redundancy and substantially reduce signal bandwidth. Feature component signals of significance are extracted through linear transformation to form the radio signal, and are individually quantized, possibly at different bit rates in accordance with their relative importance. The transformation can either be pre-determined or computed in real-time based on the spatial and temporal statistics of the radio signal. In the latter case, the transformation matrix or matrices are also sent over the backhaul in order to allow the radio signal to be reconstructed at the receiving end. Different methods of generating the transformation matrices are proposed.
摘要:
According to a method and apparatus taught herein, a decoding circuit and method decode linear block codes based on determining joint probabilities for one or more related subsets of bits in received data blocks. The use of joint probabilities enables faster and more reliable determination of received bits, meaning that, for example, joint probability decoding requires fewer decoding iterations than a comparable decoding process based on single-bit probabilities. As a non-limiting example, the decoding circuit and method taught herein provide advantageous operation with Low Density Parity Check (LDPC) codes, and can be incorporated in a variety of communication systems and devices, such as those associated with wireless communication networks.
摘要:
A two-stage approach to MIMO detection improves receiver performance in a computationally tractable manner. A whitening joint detector processes a MIMO symbol stream. The whitening joint detector includes a pre-filter operative to suppress a first subset of the received MIMO streams as colored noise. The whitening joint detector further includes a primary joint detector operative to process a second subset of the MIMO streams and to output a preliminary solution obtained by minimizing a whitening joint detection metric. A secondary detector then operates in the vicinity of the primary joint detector preliminary solution. The secondary detector improves the preliminary solution by comparison to a full joint detection metric.
摘要:
A receiver includes a constellation processing module and a multi-stage demodulator having a plurality of non-final demodulation stages and a final demodulation stage. The constellation processing module derives a set of centroid-based values from subsets of constellation points associated with a plurality of transmitted signals for input to each of the non-final demodulation stages. Each of the non-final demodulation stages demodulates a group of signals input to the non-final demodulation stage using the set of centroid-based values as constellation points and suppresses residual interference associated with using the set of centroid-based values as constellation points for signal demodulation. The final demodulation stage demodulates a group of modified signals input to the final demodulation stage using the subset of constellation points input to the final demodulation stage to determine a final symbol decision for the plurality of transmitted signals.
摘要:
As disclosed herein, a “super receiver” structure enriches the information provided for decoding modem bits included in a received sequence of symbols. In particular, an equalizer circuit provides joint metrics to a decoder circuit, where the joint metrics advantageously reflect joint bit probabilities. However, the metrics are computed without need for complex joint probability calculations. The decoder circuit “fuses” the joint metrics with corresponding side information, which indicates the likelihood that one or more bits represented by the joint metric take on a particular value. Such fusing biases the soft value estimation for the other bits represented by the joint metric, thus enabling the decoder to operate on refined soft values in its bit decoding operations.
摘要:
A method and apparatus for updating a square root matrix of a covariance matrix when sample sets are added to or removed from a received signal. When a sample set is added to the received signal, a processor augments the square root matrix to generate an updated square root matrix for future processing. When a sample set is no longer present in the received signal, the processor reduces the square root matrix to generate the updated square root matrix.
摘要:
A flexible Fast Walsh Transform circuit provides configurable FWT sizes, and is suitable for use in radio receivers where the received signal may be generated using varying spreading codes and/or varying numbers of multi-codes. Such signal types are commonly encountered in wireless communication systems like those based on the Wideband CDMA (W-CDMA) or IS-2000 (cdma2000) standards, and particularly with the higher data rate provisions of those standards. In one application, a RAKE receiver includes RAKE fingers that each include one of the flexible FWT circuits, such that each finger despreads the received signal using variably sized FWTs in accordance with the characteristics of the received signal. The flexibility in FWT sizing may derive from, for example, the inclusion of separately selectable but differently sized FWT circuits, or from the inclusion of a configurable FWT circuit capable of generating different sizes of FWTs.
摘要:
A method of generating a control signal to enable or inhibit a wide variety of applications is provided. The method generally includes the steps of determining the location of a first mobile radio terminal, determining the location of a second mobile radio terminal, comparing the locations of the terminals, and generating a control signal based upon the comparison. The control signal may be generated if the first and second mobile radio terminals are within a specified distance of one another. Alternatively, the control signal may be generated if the first and second mobile radio terminals are separated by at least a specified distance from one another. Additionally, the control signal may be generated if it is determined that the first mobile radio terminal is at a first specified location and the second mobile radio terminal is at a second specified location spacially separated from the first specified location. Further, the control signal may be generated if the first and second mobile radio terminals are at specified locations at a preselect time.
摘要:
Biasing soft output values based on a known or learned bit error rate function yields performance improvements in decoding algorithms adapted to work with soft values, such as soft output Viterbi algorithms (SOVA). For example, in a wireless receiver, the soft output values output from a signal demodulator may be biased to reflect the changes in bit error rate across a given burst or block of data. Such changes might arise, for example, due to increasing inaccuracies in the receiver's channel estimate, which is typically computed at the beginning or middle of a block of received data. The wireless receiver may store a table of scaling factors corresponding to the expected bit error rate distribution of the received signal. The table may be preloaded into the receiver, or may be determined during operation. In either case, the table may be updated during operation to reflect bit error incidence observed during operation.
摘要:
A reduced search symbol estimation algorithm includes a forward recursion, a backward recursion, and a combining step. To reduce complexity, during the forward and backward recursions, the number of survivor states retained at each stage is less than the total number of states of the trellis. The survivor states are selected from a group of candidate states, that are connected by branches to survivors from the previous stage of the recursion. The decoder compares the accumulated path metrics for each candidate state and retains a specified number of states that is less than the total possible number of states. For the forward recursion, the retained states or survivor states, denoted as Qk, are stored along with the corresponding state metrics. For the backward recursion, the retained states, denoted as Rk, are stored along with the corresponding state metrics. During the combining step, the computation of a soft value is restricted to branches (s′,s) connecting survivor states s′ and s in the forward and backward recursions respectively.