For more efficient data transmissions, a new MLP/BP-based channel equalizer is proposed to compensate for multi-path fading in wireless applications. In this work, for better system performance, we apply the soft output and the soft feedback structure as well as the soft decision channel decoding. Moreover, to improve packet error rate (PER) and bit error rate (BER), we search for the optimal scaling factor of the transfer function in the output layer of the MLP/BP neural networks and add small random disturbances to the training data. As compared with the conventional MLP/BP-based DFEs and the soft output MLP/BP-based DFEs, the proposed MLP/BP-based soft DFEs under multi-path fading channels can improve over 3-0.6 dB at PER=10-1 and over 3.3-0.8 dB at BER=10-3.

Assume that G(D) is a k0n0 canonical generator matrix. Let G(L)(D) be the generator matrix obtained by integrating L consecutive trellis-modules associated with G(D). We also consider a modified version of G(L)(D) using a column permutation. Then take notice of the corresponding minimal trellis-module T(L). In this paper, we show that there is a case where the minimum number of states over all levels in T(L) is less than the minimum attained for the minimal trellis-module associated with G(D). In this case, combining with a shifted sectionalization of the trellis, we can construct a trellis-module with further reduced number of states. We actually present such an example. We also clarify the mechanism of state-space reduction. That is, we show that trellis-module integration combined with an appropriate column permutation and a shifted sectionalization of the trellis is equivalent to shifting some particular bits of the original code bits by L time units.

In this letter, we discussed some properties of characteristic generators for a finite Abelian group code, proved that any two characteristic generators can not start (end) at the same position and have the same order of the starting (ending) components simultaneously, and that the number of all characteristic generators can be directly computed from the group code itself. These properties are exactly the generalization of the corresponding trellis properties of a linear code over a field.

This paper presents an approach that uses the Viterbi algorithm in a stereo correspondence problem. We propose a matching process which is visualized as a trellis diagram to find the maximum a posterior result. The matching process is divided into two parts: matching the left scene to the right scene and matching the right scene to the left scene. The last result of stereo problem is selected based on the minimum error for uniqueness by a comparison between the results of the two parts of matching process. This makes the stereo matching possible without explicitly detecting occlusions. Moreover, this stereo matching algorithm can improve the accuracy of the disparity image, and it has an acceptable running time for practical applications since it uses a trellis diagram iteratively and bi-directionally. The complexity of our proposed method is shown approximately as O(N2P), in which N is the number of disparity, and P is the length of the epipolar line in both the left and right images. Our proposed method has been proved to be robust when applied to well-known samples of stereo images such as random dot, Pentagon, Tsukuba image, etc. It provides a 95.7 percent of accuracy in radius 1 (differing by 1) for the Tsukuba images.

The letter presents an analysis of bit error probability for trellis coded 8-ary phase shift keying moduation with 2-state soft decision Viterbi decoding. It is shown that exact numerical error performance can be obtained for low singal-to-noise power ratio where bounds are useless.

Using several high rate recursive convolutional codes as the basic element and the trace criteria as the designing principle, a new kind of recursive space-time trellis code with more flexible and higher data rate is presented for the serially concatenated space-time code. When 2b-ary modulation and N transmit antennas are used, the data rate of the new code can be arranged from b bps/Hz to Nb-1bps/Hz by modifying the number of recursive convolutional codes and the data rate of each code.

Trellis diagrams of lattices and the Viterbi algorithm can be used for decoding. It has been known that the numbers of states and labels at every level of any finite trellis diagrams of a lattice L and its dual L* under the same coordinate system are the same. In the paper, we present concrete expressions of the numbers of distinct paths in the trellis diagrams of L and L* under the same coordinate system, which are more concrete than Theorem 2 of [1]. We also give a relation between the numbers of edges in the trellis diagrams of L and L*. Furthermore, we provide the upper bounds on the state numbers of a trellis diagram of the lattice L1L2 by the state numbers of trellis diagrams of lattices L1 and L2.

It is well known that the trellises of lattices can be employed to decode efficiently. It was proved in [1] and [2] that if a lattice L has a finite trellis under the coordinate system , then there must exist a basis (b1,b2,,bn) of L such that Wi=span() for 1in. In this letter, we prove this important result in a completely different method, and give an efficient method to compute all bases of this type.

In this paper, we study trellis properties of the tensor product (product code) of two linear codes, and prove that the tensor product of the lexicographically first bases for two linear codes in minimal span form is exactly the lexicographically first basis for their product code in minimal span form, also the tensor products of characteristic generators of two linear codes are the characteristic generators of their product code.

The multiple space-time trellis codes (M-STTC) structure is one of the Multiple Input Multiple output (MIMO) schemes providing high transmission rate and diversity and coding gain without bandwidth expansion. In this paper, an M-STTC system is proposed wherein the transmitter employs a multiple space-time TCM for the fast fading channel and the receiver has a decoding order block, several whitening processors, STTC decoders, and interference cancellers. The proposed layered receiver adopts a whitening process instead of a minimum mean squared error (MMSE) estimator, which is widely used in the BLAST type receiver. An optimum decoding order scheme is also planned since it gives at least a 2 dB gain in the proposed system in the fast flat Rayleigh fading channel of fd Tc = 1/3 at the FER of 10-2. For an M-STTC system employing two STTCs with four transmit and receive antennas, the layered receiver with whitening process obtains a 5 dB gain over the coded layered space-time processing in the fast flat Rayleigh fading channel at the FER of 10-2.

Parallel concatenated convolutional codes, turbo codes, are very attractive scheme at a point of view of an error probability performance. An bit error rate (BER) evaluation for turbo codes is done by a uniform interleaver bound calculation and/or a computer simulation. The former is calculated under the assumption of uniform interleaver, and is only effective for an BER evaluation with a pseudo random interleaver. The latter dose not have any interleaver restrictions. However, for a very low BER evaluation, it takes enormous simulation time. In this paper, a new error probability evaluation method for turbo codes is proposed. It is based on the error event simulation method. For each evaluation for the predetermined error sequence, importance sampling, which is one of the fast simulation methods, is applied. To prove the effectiveness of the proposed method, numerical examples are shown. The proposed method well approximates the BER at the error floor region. Under the same accuracy, the IS estimation time at BER = 10-7 is reduced to 1/6358 of the ordinary Monte-Carlo simulation time.

A Generalized Symbol-rate-increased (GSRI) Pragmatic Trellis coded Type-I Hybrid ARQ based on a Selective-Repeat (SR) ARQ with multicopy (MC) retransmission (SR+MC scheme) for high speed mobile satellite communication system is analyzed. The SR+MC ARQ is a suitable scheme for mobile satellite systems and further improvement of the throughput performance can be expected by an additional combination of an error control coding. In this paper, we investigate the performance of the SR+MC scheme employing GSRI Pragmatic TCM. GSRI TC-MPSK can arbitrarily set the bandwidth expansion ratio keeping higher coding gain than conventional TCM scheme. Also Pragmatic TCM has an advantage in that the modulation level can be easily changeable. By changing the modulation level and the bandwidth expansion ratio, this scheme can optimize the performance according to the channel conditions. Numerical and simulation results show that the GSRI Trellis Coded Type-I Hybrid ARQ presents better performance than conventional Pragmatic Trellis Coded Type-I Hybrid ARQ.

Reduced-state sequence estimation (RSSE) for trellis-coded modulation (TCM) in cyclic prefixed single carrier (CPSC) with minimum mean-square error-linear equalization (MMSE-LE) on frequency-selective Rayleigh fading channels is proposed. The Viterbi algorithm (VA) is used to search for the best path through the reduced-state trellis combined equalization and TCM decoding. Computer simulations confirm the symbol error probability of the proposed scheme.

An automatic-repeat-request (ARQ) scheme for improving the system throughput efficiency is evaluated in coded multiple-input multiple-output (MIMO) transmissions. Supplementary trellis-coded modulation (TCM) code has been proposed for hybrid ARQ schemes. The free distance of the TCM after code combining can be increased by employing different TCM codes for retransmissions. The MIMO scheme offers additional flexibility in preventing successive frame errors by changing the connections between transmitters and transmit antennas upon retransmission. In this paper, an ARQ strategy employing both TCM reassignment and antenna permutation technique is investigated. It is shown through computer simulations that this ARQ scheme achieves high throughput even in severe conditions of low signal-to-noise ratio and high Rician factor over spatially and temporally correlated Nakagami-Rice fading MIMO channels.

Recently, space-time multiple trellis coded modulation (ST-MTCM) has been introduced in order to achieve maximum transmit diversity gain and larger coding gain with the existance of parallel paths, which can not be achieved with STTCM system. In order to achieve good performance, it is crucial to maximize the intra-distance, which is defined by parallel paths and determine the performance. Conventional ST-MTCM uses a generator matrix G for coded modulation; however, we find that no matrix can be designed which can maximize the intra-distance by computer search. In this paper, we focus on maximizing the intra-distance and the diversity gain, and hence design a new coded modulation scheme. We use trellis codes in this paper which cannot be described by a matrix G. The proposed codes can achieve the maximum intra-distance and thus good coding gain, which may not be achieved by conventional codes. We also show that the proposed code can achieve good performance both in quasi-static and fast flat fading channels without the need for changing the codes as is necessary in the conventional ST-MTCM scheme.

A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for low-rate codes, but the complexity grows considerably large for high-rate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for high-rate codes. The proposed algorithm is more efficient than the BCJR algorithm for well-known linear block codes.

It is known that Viterbi decoding based on the code trellis and syndrome decoding based on the syndrome trellis (i.e., error trellis) are equivalent. In this paper, we show that Scarce State Transition (SST) Viterbi decoding of convolutional codes is equivalent to syndrome decoding. First, we derive fundamental relations between the hard-decision input to the main decoder and the encoded data for the main decoder. Then using these relations, we show that the code trellis module for the main decoder in an SST Viterbi decoder can be reduced to a syndrome trellis module. This fact shows that SST Viterbi decoding based on the code trellis is equivalent to syndrome decoding based on the syndrome trellis. We also calculate the SST Viterbi decoding metrics for general convolutional codes assuming an AWGN channel model. It is shown that the derived metrics are equal to those of conventional Viterbi decoding. This fact shows that SST Viterbi decoding is equivalent to conventional Viterbi decoding, and consequently to syndrome decoding.

In an attempt to improve the performance under frequency selective fading environment, we develop in this paper an orthogonal frequency division multiplex (OFDM) system in which adaptive interleaving is applied. The adaptive interleaving is a method that assigns symbols adaptively to the subcarriers in order to cope with frequency selective fading based on a channel state information (CSI) sent back from the reception end. The concept of adaptive interleaving is to maximize a free Euclidean distance in the limited interleave size. In this paper, we extend the method by an introduction of bit interleaving and multiple trellis coded modulation (MTCM). MTCM assigns two or more symbols to one trellis branch and shows good performance in frequency selective fading. If we could assign those set of symbols with an aid of the adaptive interleaving, the performance improvement can be expected. Another improvement method considered in this paper is the use of bit interleaving. The bit interleaving techniques randomize the effect of channel more efficiently compared to the case of symbols interleaving. Thus the further performance improvement is expected. One draw back is that since the interleaving process is done in bit level, bit interleaving can not be applied to TCM nor MTCM. In this paper, we mainly focus on adaptive bit and symbol interleaving and discuss the performance from the point of interleaving effect, and the error correcting code (convolutional code and MTCM).

In this paper, the Viterbi decoder containing new branch metrics of the squared Euclidean distance with multiple order phase differences is introduced in order to improve the bit error rate (BER) in the differential detection of the trellis-coded MDPSK-OFDM. The proposed Viterbi decoder is conceptually same as the sliding multiple phase differential detection method that uses the branch metric with multiple phase differences. Also, we describe the Viterbi algorithm in order to use this branch metrics. Our study shows that such a Viterbi decoder improves BER performance without sacrificing bandwidth and power efficiency. Also, the proposed algorithm can be used in the single carrier modulation.

The design criteria for space-time trellis codes (STTC's) in fast fading channels have been proposed: the Distance Criterion and the Product Criterion. The design criteria in [1] are based on optimizing the pairwise error probability (PWEP). However, the frame error rate (FER) of STTC's depends on the distance spectrum. In this paper, we propose a new design criterion for STTC's based on the distance spectrum in fast fading channels. The proposed design criterion is based on the product distance distribution for the large signal-to-noise ratio (SNR) and the trace distribution for the small SNR, respectively. Moreover, we propose new STTC's by the computer search based on the proposed design criterion in fast fading channels. By computer simulation, we show that the proposed design criterion is more useful than the Product Criterion in [1] in fast fading channels. We also show that the proposed STTC's achieve better FER than the conventional STTC's in fast fading channels.