scholarly journals Algebraic reduction for the Golden Code

2012 ◽  
Vol 6 (1) ◽  
pp. 1-26 ◽  
Author(s):  
Jean-Claude Belfiore ◽  
Ghaya Othman ◽  
Laura Luzzi
Author(s):  
Ghaya Rekaya-Ben Othman ◽  
Laura Luzzi ◽  
Jean-Claude Belfiore

2009 ◽  
Author(s):  
G. Rekaya-Ben Othman ◽  
L. Luzzi ◽  
J.-C. Belfiore

Author(s):  
J Ph Guillet ◽  
E Pilon ◽  
Y Shimizu ◽  
M S Zidi

Abstract This article is the first of a series of three presenting an alternative method of computing the one-loop scalar integrals. This novel method enjoys a couple of interesting features as compared with the method closely following ’t Hooft and Veltman adopted previously. It directly proceeds in terms of the quantities driving algebraic reduction methods. It applies to the three-point functions and, in a similar way, to the four-point functions. It also extends to complex masses without much complication. Lastly, it extends to kinematics more general than that of the physical, e.g., collider processes relevant at one loop. This last feature may be useful when considering the application of this method beyond one loop using generalized one-loop integrals as building blocks.


Author(s):  
A.A. Reznev ◽  
V.B. Kreyndelin

The application of optimality criteria for the study of space-time codes is considered. Known rank and determinant criteria are described. The computational complexity of determinant criteria is presented taking into account some estimation of the real CPUs specifications. An algorithm for calculating a new optimality criterion is described. The computational complexity of the new optimality criterion is evaluated. The new criterion is applied to the study of the space-time Golden matrix. The obtained criterion value is used to modify the Golden code. The modeling for Golden code demonstrates that criterion works and gives us better levels for noise immunity. The proposed optimality criterion is acceptable in terms of computational complexity even for a large number of antennas, which is typical for large-scale MIMO systems. Рассматривается применение критериев оптимальности для исследования пространственно-временных кодов.Описаны известные ранговый и детерминантный критерии. Для детерминантного критерия оценена вычислительная сложность с учетом определения специальных высокопроизводительных процессоров. Описан алгоритм расчета нового критерия оптимальности. Проведена оценка вычислительной сложности нового критерия оптимальности. Новый критерий применен для исследования пространственно-временной матрицы Голден. Полученное значение критерия использовано для модификациикода Голден. Продемонстрированы кривые помехоустойчивости для кода Голден и кода Голден с модифицированным параметром, получен энергетический выигрыш. Предложенный критерий оптимальности приемлем с точки зрения вычислительнойсложности даже при большом числе антенн, характерном для систем широкомасштабного MIMO.


Author(s):  
L. Ge ◽  
G. J. Chen ◽  
J. A. Chambers

The implementation of cooperative diversity with relays has advantages over point-to-point multiple-input multiple-output (MIMO) systems, in particular, overcoming correlated paths due to small inter-element spacing. A simple transmitter with one antenna may exploit cooperative diversity or space time coding gain through distributed relays. In this paper, similar distributed transmission is considered with the golden code, and the authors propose a new strategy for relay selection, called the maximum-mean selection policy, for distributed transmission with the full maximum-likelihood (ML) decoding and sphere decoding (SD) based on a wireless relay network. This strategy performs a channel strength tradeoff at every relay node to select the best two relays for transmission. It improves on the established one-sided selection strategy of maximum-minimum policy. Simulation results comparing the bit error rate (BER) based on different detectors and a scheme without relay selection, with the maximum-minimum and maximum-mean selection schemes confirm the performance advantage of relay selection. The proposed strategy yields the best performance of the three methods.


Sign in / Sign up

Export Citation Format

Share Document