4-Ary Codebook Design Using Reed-Muller Codes for MIMO Beamforming Systems
نویسندگان
چکیده
We design 4-ary codebooks using Reed Muller codes for multiple-input multiple-output (MIMO) beamforming systems. An upperbound on the maximum correlation magnitude metric of a 4-ary codebook is derived from the minimum Hamming distance of the corresponding binary linear block code. The 4-ary MIMO beamforming codebooks for the number of transmit antennas equal to 4, 8, 16, and 32 are tabulated. We show that the 4-ary codebook using Reed Muller codes provides the same symbol error probability (SEP) as the LTE codebook when the number of transmit antennas is four and the number of feedback bits is four.
منابع مشابه
List Decoding of q - ary Reed - Muller Codes 1 )
The q-ary Reed-Muller codes RMq(u,m) of length n = q are a generalization of Reed-Solomon codes, which use polynomials in m variables to encode messages through functional encoding. Using an idea of reducing the multivariate case to the univariate case, randomized list-decoding algorithms for Reed-Muller codes were given in [1] and [15]. The algorithm in [15] is an improvement of the algorithm ...
متن کاملGrassmannian beamforming for multiple-input multiple-output wireless systems
Transmit beamforming and receive combining are simple methods for exploiting the significant diversity that is available in multiple-input and multiple-output (MIMO) wireless systems. Unfortunately, optimal performance requires either complete channel knowledge or knowledge of the optimal beamforming vector which are not always realizable in practice. In this correspondence, a quantized maximum...
متن کاملImpact of Limited Feedback on MIMO-OFDM Systems using Joint Beamforming
In multi input multi output antenna systems, beamforming is a technique for guarding against the negative effects of fading. However, this technique requires the transmitter to have perfect knowledge of the channel which is often not available a priori. A solution to overcome this problem is to design the beamforming vector using a limited number of feedback bits sent from the receiver to the t...
متن کاملGeneralized Hamming Weights of q-ary Reed-Muller Codes
The order bound on generalized Hamming weights is introduced in a general setting of codes on varieties which comprises both the one point geometric Goppa codes as the q-ary Reed-Muller codes. For the latter codes it is shown that this bound is sharp and that they satisfy the double chain condition.
متن کاملFast Decoding of the p-Ary First-Order Reed-Muller Codes Based On Jacket Transform
order Reed-Muller code guaranteeing correction of up to •un/4 sin(p-1/2 pƒÎ)•v errors and having complexity proportional to nlogn, where n=pm is the code length and p is an odd prime. This algorithm is an extension in the complex domain of the fast Hadamard transform decoding algorithm applicable to the binary case. key words: p-ary first-order Reed-Muller codes, decoding algorithms, Jacket matrix
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Vehicular Technology
دوره 65 شماره
صفحات -
تاریخ انتشار 2016