128,265 research outputs found

    Adaptive minimum symbol error rate beamforming assisted receiver for quadrature amplitude modulation systems

    No full text
    An adaptive beamforming assisted receiver is proposed for multiple antenna aided multiuser systems that employ bandwidth efficient quadrature amplitude modulation (QAM). A novel minimum symbol error rate (MSER) design is proposed for the beamforming assisted receiver, where the system’s symbol error rate is directly optimized. Hence the MSER approach provides a significant symbol error ratio performance enhancement over the classic minimum mean square error design. A sample-by-sample adaptive algorithm, referred to as the least symbol error rate (LBER) technique, is derived for allowing the adaptive implementation of the system to arrive from its initial beamforming weight solution to MSER beamforming solution

    Linear complexity problems of level sequences of Euler quotients and their related binary sequences

    Full text link
    The Euler quotient modulo an odd-prime power pr (r>1)p^r~(r>1) can be uniquely decomposed as a pp-adic number of the form u(p1)pr11pra0(u)+a1(u)p++ar1(u)pr1(modpr), gcd(u,p)=1, \frac{u^{(p-1)p^{r-1}} -1}{p^r}\equiv a_0(u)+a_1(u)p+\ldots+a_{r-1}(u)p^{r-1} \pmod {p^r},~ \gcd(u,p)=1, where 0aj(u)<p0\le a_j(u)<p for 0jr10\le j\le r-1 and we set all aj(u)=0a_j(u)=0 if gcd(u,p)>1\gcd(u,p)>1. We firstly study certain arithmetic properties of the level sequences (aj(u))u0(a_j(u))_{u\ge 0} over Fp\mathbb{F}_p via introducing a new quotient. Then we determine the exact values of linear complexity of (aj(u))u0(a_j(u))_{u\ge 0} and values of kk-error linear complexity for binary sequences defined by (aj(u))u0(a_j(u))_{u\ge 0}.Comment: 16 page

    Continuous-Variable Quantum Games

    Get PDF
    We investigate the quantization of games in which the players can access to a continuous set of classical strategies, making use of continuous-variable quantum systems. For the particular case of the Cournot's Duopoly, we find that, even though the two players both act as "selfishly" in the quantum game as they do in the classical game, they are found to virtually cooperate due to the quantum entanglement between them. We also find that the original Einstein-Podolksy-Rosen state contributes to the best profits that the two firms could ever attain. Moreover, we propose a practical experimental setup for the implementation of such quantum games.Comment: 3 figure
    corecore