Optimization of Multimedia Progressive Transmission Over MIMO Channels

• Published in: IEEE transactions on vehicular technology 2016-03, Vol.65 (3), p.1244-1260
• Main Authors: Seok-Ho Chang, Choi, Jihwan P., Cosman, Pamela C., Milstein, Laurence B.
• Format: Article
• Language: English
• Subjects: Block codes; Codes; Computer architecture; Diagonal Bell Labs space-time architecture (DBLAST); diversity-multiplexing tradeoff (DMT); group zeroforcing receiver; information outage probability; Mean square errors; MIMO; minimum meansquare error (MMSE) receiver; multimedia progressive sources; multiple-input multiple-output (MIMO) systems; Multiplexing; orthogonal space-time block codes (OSTBC); Probability; Receivers; Signal to noise ratio; Space-time codes; Spacetime; vertical Bell Labs space-time architecture (V-BLAST)
• ISSN: 0018-9545; 1939-9359
• DOI: 10.1109/TVT.2015.2412655

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.