Search

We consider differential spatial modulation (DSM) operating in a block fading environment and propose sparse unitary dispersion matrices (DMs) using algebraic field extensions. The proposed DM sets are capable of exploiting full transmit diversity and, in contrast to the existing schemes, can be constructed for systems having an arbitrary number of transmit antennas. More specifically, two schemes are proposed: 1) field-extension-based DSM (FE-DSM), where only a single conventional symbol is transmitted per space–time block; and 2) FE-DSM striking a diversity–rate tradeoff (FE-DSM-DR), where multiple symbols are transmitted in each space–time block at the cost of a reduced transmit diversity gain. Furthermore, the FE-DSM scheme is analytically shown to achieve full transmit diversity, and both proposed schemes are shown to impose decoding complexity, which is independent of the size of the signal set. It is observed from our simulation results that the proposed FE-DSM scheme suffers no performance loss compared with the existing DM-based DSM (DM-DSM) scheme, whereas FE-DSM-DR is observed to give a better bit-error-ratio performance at higher data rates than its DM-DSM counterpart. Specifically, at data rates of 2.25 and 2.75 bits per channel use, FE-DSM-DR is observed to achieve about 1- and 2-dB signal-to-noise ratio (SNR) gain with respect to its DM-DSM counterpart. [ABSTRACT FROM PUBLISHER]

Let F be a field, char F ≠ 2 , L / F a quartic field extension. Define by G L / F the group of elements r ∈ F ⁎ such that D ∪ ( r ) = 0 for any regular field extension K / F and any D ∈ Br 2 ( K L / K ) . We show that G L / F = F ⁎ 2 N L / F L ⁎ . As a consequence we prove that the Hasse norm theorem modulo squares holds for L / F . [ABSTRACT FROM AUTHOR]

Abstract: In this work, we give a new and elementary proof that simultaneous similarity and simultaneous equivalence of families of matrices are invariant under extension of the ground field, a result which is non-trivial for finite fields and first appeared in an earlier paper of Klinger and Levy. [Copyright &y& Elsevier]

Abstract: A practical computational system is described for computing with an algebraic closure of a field. The system avoids factorization of polynomials over extension fields, but gives the illusion of a genuine field to the user. All roots of an arbitrary polynomial defined over such an algebraically closed field can be constructed and are easily distinguished within the system. The difficult case of inseparable extensions of function fields of positive characteristic is also handled properly by the system. A technique of modular evaluation into a finite field critically ensures that a unique genuine field is simulated by the system but also provides fast optimizations for some fundamental operations. Fast matrix techniques are also used for several non-trivial operations. The system has been successfully implemented within the Magma Computer Algebra System, and several examples are presented, using this implementation. [Copyright &y& Elsevier]

The two-dimensional local field K = F q(( u))(( t)), char K = p, and its Brauer group Br( K) are considered. It is proved that, if L = K( x) is the field extension for which we have x p − x = ut − p =: h, then the condition that ( y, f | h]K = 0 for any y ε K is equivalent to the condition f ε Im(Nm( L*)). [ABSTRACT FROM AUTHOR]