12 research outputs found

    Finding patterned complex-valued matrix derivatives by using manifolds

    No full text
    Often in engineering, the design requirements are to find a complex-valued matrix which minimizes or maximizes a real-valued objective function under the constraint that the matrix belongs to a set of matrices with pattern. Recently, a systematic method was published for finding the derivative of complex-valued matrix functions which depend on matrix arguments that contain patterns. Central in this theory is the pattern producing function. Derivatives with respect to the input paranleters of the pattern producing function were proposed earlier. Now, slightly stricter requirements are put on the pattern producing function such that explicit expressions can be found for the patterned derivatives with respect the actual patterned matrices. Several examples are presented

    Training-Embedded, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks

    No full text
    Recently, a special class of complex designs called Training-Embedded Complex Orthogonal Designs (TE-CODs) has been introduced to construct single-symbol Maximum Likelihood decodable (SSD) distributed space-time block codes (DSTBCs) for two-hop wireless relay networks using the amplify and forward protocol. However, to implement DSTBCs from square TE-CODs, the overhead due to the transmission of training symbols becomes prohibitively large as the number of relays increase. In this paper, we propose TE-Coordinate Interleaved Orthogonal Designs (TE-CIODs) to construct SSD DSTBCs. Exploiting the block diagonal structure of TE-CIODs, we show that the overhead due to the transmission of training symbols to implement DSTBCs from TE-CIODs is smaller than that for TE-CODs. We also show that DSTBCs from TE-CIODs offer higher rate than those from TE-CODs for identical number of relays while maintaining the SSD and full-diversity properties

    Performance analysis of single-symbol maximum likelihood decodable linear STBCs

    No full text
    Performance of space-time block codes can be improved using the coordinate interleaving of the input symbols from rotated M-ary phase shift keying (MPSK) and M-ary quadrature amplitude modulation (MQAM) constellations. This paper is on the performance analysis of coordinate-interleaved space-time codes, which are a subset of single-symbol maximum likelihood decodable linear space-time block codes, for wireless multiple antenna terminals. The analytical and simulation results show that full diversity is achievable. Using the equivalent single-input single-output model, simple expressions for the average bit error rates are derived over flat uncorrelated Rayleigh fading channels. Optimum rotation angles are found by finding the minimum of the average bit error rate curves
    corecore