In this letter we design a new family of space-time block codes (STBC) for multi-input multi-output (MIMO) systems. The complex orthogonal STBC achieves full diversity and full transmission rate with fast maximum-likelihood decoding when only two transmit antennas are employed. By combining the Alamouti STBC and the multidimensional signal constellation rotation based on the cyclotomic number field, we construct cyclotomic orthogonal space-time block codes (COSTBCs) which can achieve full diversity and full rate for multiple transmit antennas. Theoretical analysis and simulation results demonstrate excellent performance of the proposed codes, while the decoding complexity is further reduced.

A stochastic quasi-gradient algorithm is applied to design linear dispersion (LD) codes for two-way wireless relay networks under Rayleigh fading channels. The codes are designed to minimize an upper bound of the average pairwise error probability. Simulation results show that the codes obtained by the optimization technique achieve a coding gain over codes that are randomly generated based on the isotropic distribution.

A rate-6/4 full-diversity orthogonal space-time block code (STBC) is constructed for QPSK and 2 transmit antennas by applying constellation scaling and rotation to the set of quaternions used in Alamouti code. Also given is a rate-9/8 full-diversity quasi-orthogonal space-time block code (QOSTBC) for 4 transmit antennas. Lastly, a rate-10/8 code is presented for 4 transmit antennas. Simulation results indicate that these high-rate codes achieve better throughputs in the high signal-to-noise ratio region.

It has been shown that the output information produced by the soft output Viterbi algorithm (SOVA) is too optimistic. To compensate for this, the output information should be normalized. This letter proposes a simple normalization technique that extends the existing sign difference ratio (SDR) criterion. The new normalization technique counts the sign differences between the a-priori information and the extrinsic information, and then adaptively determines the corresponding normalization factor for each data block. Simulations comparing the new technique with other well-known normalization techniques show that the proposed normalization technique can achieve about 0.2 dB coding gain improvement on average while reducing up to about 1/2 iteration for decoding.

Space-time block coding is an attractive solution for improving quality in wireless links. In general, the multiple-input multiple-output (MIMO) channel is correlated by an amount that depends on the propagation environment as well as the polarization of the antenna elements and the spacing between them. In this paper, asymptotic performance and exact symbol error probability (SEP) of orthogonal space-time block code (STBC) are considered in spatially correlated Rayleigh fading MIMO channel. We derive the moment generating function (MGF) of effective signal-to-noise ration (SNR) after combining scheme at the receiver. Using the MGF of effective SNR, we calculate the probability density function (pdf) of the effective SNR and derive exact closed-form SEP expressions of PAM/PSK/QAM with M-ary signaling. We prove that the diversity order is given by the product of the rank of the transmit and receive correlation matrix. Moreover, we quantify the loss in coding gain due to the spatial correlation. Simulation results demonstrate that our analysis provides accuracy.

We present here a simple technique for parametrization of popular biorthogonal wavelet filter banks (BWFBs) having vanishing moments (VMs) of arbitrary multiplicity. Given a prime wavelet filter with VMs of arbitrary multiplicity, after formulating it as a trigonometric polynomial depending on two free parameters, we prove the existence of its dual filter based on the theory of Diophantine equation. The dual filter permits perfect reconstruction (PR) and also has VMs of arbitrary multiplicity. We then give the complete construction of two-parameter families of 17/11 and 10/18 BWFBs, from which any linear-phase 17/11 and 10/18 BWFB possessing desired features could be derived with ease by adjusting the free parameters. In particular, two previously unpublished BWFBs for embedded image coding are constructed, both have optimum coding gains and rational coef ficients. Extensive experiments show that our new BWFBs exhibit performance equal to Winger's W-17/11 and Villasenor's V-10/18 (superior to CDF-9/7 by Cohen et al. and Villasenor's V-6/10) for image compression, and yet require slightly lower computational costs.

A design of non-orthogonal 33 space-time block code (STBC) is proposed. The proposed design achieves full rate, full level diversity, and maximum coding gain by symbol rotation (SR) method. In addition, the proposed scheme has lower encoding complexity than the unitary constellation-rotation (CR) STBC, while two methods exhibit the same bit error rate (BER) performance in Rayleigh fading channel.

This paper examines a coded Gaussian Minimum Shift Keying (GMSK) system which uses Reed-Solomon (RS) codes both in Additive White Gaussian Noise (AWGN) channels and Rayleigh fading channels. The performance of GMSK and RS code combinations is compared with the constraint that the transmitted signal bandwidth is constant. The coding gains were obtained using simulations and the best combination of GMSK and RS codes was found. The optimal code rates over AWGN and Rayleigh fading channels were also compared.

This paper analytically formulates both the optimal quantization noise allocation ratio and the coding gain of the two-dimensional morphological Haar wavelet transform. The two-dimensional morphological Haar wavelet transform has been proposed as a nonlinear wavelet transform. It has been anticipated for application to nonlinear transform coding. To utilize a transformation to transform coding, both the optimal quantization noise allocation ratio and the coding gain of the transformation should be derived beforehand regardless of whether the transformation is linear or nonlinear. The derivation is crucial for progress of nonlinear transform image coding with nonlinear wavelet because the two-dimensional morphological Haar wavelet is the most basic nonlinear wavelet. We derive both the optimal quantization noise allocation ratio and the coding gain of the two-dimensional morphological Haar wavelet transform by introducing appropriate approximations to handle the cumbersome nonlinear operator included in the transformation. Numerical experiments confirmed the validity of formulations.

In this paper, we develop a fast dynamic programming technique to construct the subband decomposition yielding the maximum coding gain. We first derive a unified coding gain applicable to arbitrary subband decompositions and arbitrary filter bases. Then, we prove that the unified coding gains are monotonically increasing function for the implementation complexities. Based on this phenomenon, we treat the implementation complexity and the coding gain in the same way as the rate and distortion function. Finally, we applied the developed algorithm to the wavelet packet based image coding, so as to verify coding performance improvement by the proposed algorithm.

In this paper, we propose lossless/lossy coding criterion as a new objective criterion to theoretically evaluate coding performance of the lossless/lossy wavelet (LLW). The proposed lossless/lossy coding criterion consists of three parameters: "lossless coding criterion," "quantization-lossy coding gain" and "rounding errors. " The first parameter is a criterion to evaluate lossless coding performance of the LLW, whereas the second and the third parameters are criteria to evaluate lossy coding performance of the LLW at low bit rate and high bit rate, respectively. Relation among those three parameters is clearly illustrated in this paper. Performances of 15 kinds of the LLW are measured with two-dimensional (2D) octave-decomposition by applying some standard images and 2D AR(1) model as input signals.

This paper proposes a new AFC (automatic frequency control) circuit employing a double-product type frequency discriminator to enable fast acquisition in very-low CNR (carrier to noise power ratio) environments. The frequency step responses of the proposed AFC circuit are theoretically analyzed. In addition this paper evaluates the performance of the proposed AFC circuit by computer simulation in very-low CNR environments. The simulation results confirm that click noise at the frequency discriminator causes large frequency tracking error and that this error can be improved by increasing the delay time of the double-product type frequency discriminator. The frequency error can be also reduced by introducing the proposed frequency discriminator to modify the frequency error detection performance. The acquisition time of the proposed AFC circuit can be reduced by about 100 symbols compared to the conventional cross-product type AFC circuit.

This work addresses the problems of bit allocation and coding gain in subband coding system with non-paraunitary filter banks. Since energy conservation does not hold in non-paraunitary filter banks, the model to be adopted for quantizers is important to evaluate the output distortion introduced by subband signal quantization. To evaluate the overall distortion we start with adopting the gain plus additive noise model for quantizers, which is more reliable than the additive noise model. With this model, the expression for overall reconstruction error variance becomes so complicated that the problem of optimum bit allocation, as required for evaluation of the coding gain, must be numerically solved. So, we propose an approximation method in which we neglect the terms due to correlation among quantization errors in calculating the bit allocation but take them into consideration in evaluating the coding gain, assuming sufficiently high bitrate coding. Application of this approximation method to the SSKF subband coding systems with AR (1) input source shows that the method is very accurate even at low bit rate coding (1 bit/sample).