303 research outputs found

    Optimization of Scalable Broadcast for a Large Number of Antennas

    No full text
    In this paper, for a system incorporating a large number of antennas, we address the optimal space-time coding of multimedia scalable sources, which require unequal target error rates in their bitstream. First, in terms of the number of antennas, we analyze the behavior of the crossover point of the outage probability curves for the vertical Bell Laboratories space-time (V-BLAST) architecture with a linear or a maximum-likelihood receiver, and orthogonal space-time block codes (OSTBCs). We prove that, as the number of antennas increases with the transmission data rate fixed, the crossover point in outage probability monotonically decreases. This holds for any data rate employed by the system and is valid over propagation channels such as spatially correlated Rayleigh or Rician fading channels, as well as independent and identically distributed Rayleigh channels. We next show that, over such propagation channels with a large number of antennas, those analytical results can be used to simplify the computational complexity involved with the optimal space-time coding of a sequence of scalable packets, with no performance degradation. © 2016 IEEE.FALS

    Optimization of Multimedia Progressive Transmission Over MIMO Channels

    No full text
    This paper studies the optimal transmission of multimedia progressive sources, which require unequal target error rates in their bitstream, over multiple-input-multiple-output (MIMO) channels. First, we derive the information outage probability expression of a space-time code for an arbitrarily given piecewise-linear diversity-multiplexing tradeoff (DMT) function and the conditions for the existence of a crossover point of the information outage probability curves of the space-time codes. We prove that as long as the crossover point of the outage probabilities exists, as spectral efficiency increases, the crossover point in the signal-to-noise ratio (SNR) monotonically increases, whereas that of the outage probability monotonically decreases. This analysis can be applied to any space-time code, receiver, and propagation channel with a given DMT function. As a specific example, we analyze the two-layer diagonal Bell Labs space-time architecture (D-BLAST) with a group zero-forcing receiver, the vertical BLAST (V-BLAST) with a minimum mean-square error receiver, and orthogonal space-time block codes (OSTBCs), and prove the monotonic behavior of the crossover point for those codes. Based on that, with respect to D-BLAST, V-BLAST, and OSTBC, we derive a method for the optimal space-time coding of a sequence that contains numerous progressive packets. We show that by employing the optimization method rather than exhaustive search, the computational complexity involved with optimal space-time coding can be exponentially reduced without losing any peak SNR performance. © 2015 IEEE
    corecore