摘要:
At least one example embodiment discloses a method of controlling a system. The method includes determining a constant number of bits for each of a plurality of tones, each constant number of bits being constant, obtaining a single parameter from a user of the system, the single parameter being a code rate and transmitting, to the user, data as information bits in the plurality of tones across a channel based on the single parameter, each of the plurality of tones including the constant number of bits.
摘要:
Provided is a method and apparatus for allocating transmit power in a wireless network. The method includes determining powers at which a base station transmits downlink signals to each active user equipment associated with the base station such that each of the downlink signals is associated with a different active user and the base station is permitted to transmit downlink signals with different powers to the associated active user equipments. The method further includes transmitting the associated downlink signals, by the base station, to the active user equipments at the determined powers.
摘要:
Methods for suppressing inter-cell interference during data transmission using a preceding matrix are provided. Inter-cell interference is suppressed by precoding data (or information) signals for transmission from base station to mobile or vice versa. Methods according to example embodiments also increase intra-cell data transmission rates. The precoding matrix is generated based on estimated channel coefficients for propagation channels between a base station and mobiles inside and outside the base station's coverage area.
摘要:
A method is provided to reduce inter-cell interference in mobile wireless systems, and particularly in TDD wireless systems. In an embodiment, a base station receives a pilot signal from at least one of the mobile terminals that it serves at a plurality of base station antennas, which include both main antennas and auxiliary antennas. In response, each of the base station antennas provides an output that is processed to obtain a set of precoding weights for a transmission from the main antennas. The processing includes nulling at least one interfering signal using the outputs from at least the auxiliary antennas.
摘要:
A construction is provided for uplink pilot signals in a cellular network. Three sets of pilot signals are defined, having orthogonality properties that lead to reduced inter-cell interference. In example embodiments, the network has a reuse factor of 3 for pilot signals, with sets U, V, and W of pilot signals assigned to cells in respective reuse classes. The pilots of each set form an orthogonal basis. Some pilots of each class, i.e. those which will generally be assigned to mobile stations near the cell edges, will also form an orthogonal basis with some pilots of each of the other classes.
摘要:
Methods for suppressing inter-cell interference during data transmission using a preceding matrix are provided. Inter-cell interference is suppressed by precoding data (or information) signals for transmission from base station to mobile or vice versa. Methods according to example embodiments also increase intra-cell data transmission rates. The precoding matrix is generated based on estimated channel coefficients for propagation channels between a base station and mobiles inside and outside the base station's coverage area.
摘要:
Methods discussed herein provide more efficient precoding matrices for precoding signals prior to transmission. The methods discussed herein improve throughput in wireless MIMO systems. Methods discussed herein are applicable to frequency division duplexing (FDD) systems, time division duplexing (TDD) systems as well as other wireless communication systems.
摘要:
A method of receiving information includes receiving a vector of signal values for a transmitted codeword in antennas of a MIMO receiver array in each of a sequence of time slots. Each vector forms one row of a matrix Y. Each antenna receives the signal values of one column of the matrix Y over the sequence of time slots such that one of the antennas receives the signal values of each column of the matrix Y. The method also includes evaluating a vector S(0, . . . , 0) for an associated zero m-component vector (0, . . . , 0). The vector S(0, . . . , 0) is given by a Hadamard transform of the diagonal part of the square matrix Y·Y†.
摘要:
A method and apparatus for reducing the number of erred bits in the decoded signal by using a channel decoder whose transfer characteristic is matched to the transfer characteristic of the MIMO detector. This means that the curve of the transfer characteristic of the MIMO detector is 1) above the curve of the reflected transpose of the transfer characteristic of the channel decoder for about 95% of the curve, and 2) close to the reflected transpose of the curve of the transfer characteristic of the channel decoder. Particularly, an LDPCC decoder can be used as the channel decoder and can be matched to the MIMO detector by matching 1) the transfer characteristic of the LDPCC decoder's CND to 2) the transfer characteristic of a combination of the MIMO detector and the LDPCC VND. Furthermore, the LDPCC can be similarly matched to any appropriate detector in addition to or instead of the MIMO detector. Additionally, a receiver can re-match the transfer characteristics of the detector and the channel decoder when the channel characteristics and/or SNR of the received signals change.
摘要:
A method and apparatus are disclosed for MAP decoding of signals encoded using error correction codes to make maximum probability decisions about each transmitted bit. A MAP decoding algorithm is disclosed that exploits properties of Reed-Muller error correction codes that use q-ary block codes to provide a decoding algorithm having a complexity that is proportional to n logq n for Reed-Muller codes. The disclosed MAP decoding algorithm employs two matrices D and {overscore (D)} to represent the code set and has an overall complexity that is exponential for a general code set. For Reed-Muller codes, the disclosed MAP decoding algorithm employs matrices Bi and {overscore (Bi)} that are sparse matrices (i.e., contain many zero entries), thereby reducing the number of required operations and yielding a complexity that is proportional to n logq n. In addition, the disclosed MAP decoding algorithm permits faster decoding by permitting a parallel implementation having a critical path length that is proportional to 2 logq n for Reed-Muller codes.