Optimization of Joint Progressive Source and Channel Coding for MIMO Systems

The optimization of joint source and channel coding for a sequence of numerous progressive packets is a challenging problem. Further, the problem becomes more complicated if the space- time coding is also involved with the optimization in a multiple-input multiple-output (MIMO) system. This is because the number of ways of jointly assigning channel codes and space-time codes to progressive packets is much larger than that of solely assigning channel codes to the packets. This paper applies a parametric approach to address that complex joint optimization problem in a MIMO system. Employing the parametric distortion-rate function, the joint assignment of channel codes and space-time codes to the packets can be optimized in a packet-by- packet manner. As a result, the computational complexity of the optimization is exponentially reduced, compared to the exhaustive search. The numerical results show that the proposed method significantly improves the peak-signal-to-noise ratio performance of the rate-based optimal solution in a MIMO system

Optimization of Scalable Broadcast for a Large Number of Antennas

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.1

Optimization of Scalable Broadcast for a Large Number of Antennas

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.1