Abstract:
A method for beamforming is described. The method includes generating a pseudo-random unitary matrix. A first codebook is rotated with the pseudo-random unitary matrix. The method includes generating a second codebook based upon the rotated codebook and a correlation matrix. A codeword is selected from the second codebook using a channel matrix. The correlation matrix is updated based upon the selected codeword. The method includes transmitting an index of the selected codeword in the codebook. The method includes receiving the codeword index. A codebook is consulted using the codeword index to locate a codeword. Beamforming is performed based upon the located codeword. An apparatus is also described.
Abstract:
A method including transmitting a binary vector from a source node to a relay node and receiving a signal vector at the relay node. The method also includes compressing the signal at the relay node by multiplying the signal with a matrix using probabilities and converting output probabilities from the multiplying into retransmission signal amplitudes, the signal amplitude depending not only on a probability of a bit but on a transmission power constraint at the relay node. The method also includes transmitting, by the relay node, estimates of information from the source node to a destination node.
Abstract:
The telecommunications system described herein implements a multi-rank beamformer for use in wireless systems equipped with multiple transmit and multiple receive antennas. The multi-rank beamformer uses finite-rate feedback of channel conditions to achieves close to theoretical performance indicated by the water-filling algorithm, while avoiding the computational complexity associated with space time codes. In addition, the multi-rank beamforming system described herein improves on the performance of unit rank beamforming methods by maintaining the gains over space time codes over a broader range of transmission rates.
Abstract:
Beamforming systems having a few bits of channel state information fed back to the transmitter benefit from low complexity decoding structures and performances gains compared with systems that do not have channel state feedback. Both unit rank and higher rank systems are implemented. Substantial design effort may be avoided by following a method of using functions formulated for space-time systems with the change that the channel coherence time is equated to the number of transmit antennas and the number of antennas in the space-time formulation is fixed at one.
Abstract:
A method for reducing outages in a cooperative network comprising measuring a channel gain for each of a plurality of received signals one of the received signals comprising a source signal, executing an algorithm utilizing the channel gain of the source signal and at least one other of the plurality of channel gains to determine a source transmit power value, and transmitting the source transmit power value to the source.
Abstract:
A first data symbol that includes a kth data bit is received over a multicarrier system. A first channel quality parameter is estimated for the first data symbol. A second data symbol that includes a retransmitted kth data bit is received. A second channel quality parameter for the second data symbol is estimated. A probable value of the kth data bit is determined based on both the first channel quality parameter and the second channel quality parameter. In response to an ARQ for data symbols communicated over a multicarrier system, the following are performed: determining channel quality parameters, each of the channel quality parameters corresponding to at least one of the transmitted data symbols; selecting a subset of the channel quality parameters exhibiting a worst quality; constructing a block of data symbols corresponding to the subset; and communicating the block of data symbols over a plurality of subcarriers.
Abstract:
A method including transmitting a binary vector from a source node to a relay node and receiving a signal vector at the relay node. The method also includes compressing the signal at the relay node by multiplying the signal with a matrix using probabilities and converting output probabilities from the multiplying into retransmission signal amplitudes, the signal amplitude depending not only on a probability of a bit but on a transmission power constraint at the relay node. The method also includes transmitting, by the relay node, estimates of information from the source node to a destination node.
Abstract:
A multistage detector is disclosed that maximizes computation power while minimizing system delay. The differencing multistage detector receives signals from a plurality of users in a cell of a communications system and reduces the effect of multiple access interference to a signal from a desired user caused by interference from other users in the cell. The differencing multistage detector includes a plurality of stages, each stage including an interference canceller for removing intra-cell interference caused by the other users in the cell and producing an estimation output vector, wherein except for a first stage, the estimation output vector of a current stage is based on both a decision of the interference canceller of the current stage and the output from an interference canceller of a previous stage. The estimation output vector of a current stage is produced by combining the output from an interference canceller of a previous stage and the decision of the interference canceller of the current stage. Except for the first stage each interference canceller calculates an estimate of multi-user interference by computing a product of a cross-correlation of the received signals and a difference signal thereby reducing the number of multiplication operations required.
Abstract:
Thus, the exemplary embodiments of the invention describe methods, computer program products and apparatus that provide improved quantization, as may be useful within the context of a communication system (e.g., a wireless communication system) that has a relay node. In one non-limiting, exemplary embodiment, a method includes: receiving a transmission having source data from an information source; determining an estimate of the source data using a quantization technique based on maximizing data throughput; and transmitting a message including the determined estimate towards an information destination.
Abstract:
A signal constellation is optimized for trellis coded modulation in fast fading channels, where the receiver does not have perfect knowledge of the channel parameters. Specifically, the signal constellation is partitioned into 2n mutually exclusive subsets, each preferably defining two points. Points within each subset are separated from one another by a distance between conditional distributions, preferably a Kullback-Leibler (KL) distance. For a block m=k1+k2 of information bits input into a trellis coder 30, the k1 bits are trellis encoded into n bits (n>k1) and used to select a subset of the constellation. The k2 bit(s) is/are used to select a particular point within the subset. Because the inter-subset distance between points is a KL distance that is effectively greater than a Euclidean distance, error at the receiver is substantially reduced, especially at higher SNR. Using a KL distance ensures statistics of channel fading are inherent within the signal constellation.
Abstract translation:信号星座对于快速衰落信道中的网格编码调制进行了优化,其中接收机不具有对信道参数的完全了解。 具体地说,将信号星座分成2个互斥子集,每个子集优选地定义两个点。 每个子集内的点彼此间隔开条件分布之间的距离,最好是Kullback-Leibler(KL)距离。 对于输入到网格编码器30的信息比特的块m = k 1/2&lt; 2&lt; 2&lt; 1&lt; 1&gt;比特,被编码成n个 位(n> k <1> 1)并用于选择星座的子集。 使用k 2位来选择子集内的特定点。 因为点之间的子集间距离是有效地大于欧几里德距离的KL距离,所以在接收机处的误差显着降低,特别是在较高的SNR时。 使用KL距离可确保信号衰落的统计信息在信号星座内是固有的。