Jaekwon KIM Dongho KIM SangKyun YUN
In this letter, we propose a novel signal detection method for spatially multiplexed multiple input multiple output (MIMO) systems, based on the idea of ordered successive interference cancellation (OSIC). In the proposed method, we try every possible value as the first detected symbol instead of making a decision. Although the proposed method requires slightly increased complexity compared to the conventional OSIC, the proposed method eliminates the error propagation from the first detected symbol, so it offers significantly better error performance compared to the conventional OSIC. We compare the proposed method with previous ML, ML-DFE, QRD-M, MMSE, MMSE-OSIC detection methods in terms of the error performance and the computational complexity, and show that the proposed method offers a good performance-complexity trade-off.
Tetsuya KOJIMA Akiko FUJIWARA Kenji YANO Masahiro AONO Naoki SUEHIRO
Some signal design methods for the approximately synchronized CDMA systems based on complete complementary codes have been proposed. It has been shown that estimating the multipath channels and applying the convolution of the spread signals can increase both the information transmission rate and frequency usage efficiency. There are some variations of such signal design methods using complete complementary codes. The efficiency of the communication systems and information transmission rate depend upon the applied signal design method and the modulation scheme. In this paper, we consider two of these signal design methods. We analyze the bit error rate (BER) performances for both methods through some numerical simulations under the single cell scenario. Numerical results show the BER properties under some modulation schemes such as BPSK, QPSK and 16QAM. Some discussions on the relation between the BER performance and the information transmission rate are also included.
Kazuyoshi SUZUKI Toshihiko KASHIYAMA Eiji FUJIWARA
Spotty byte error control codes are very effective for correcting/detecting errors in semiconductor memory systems using recent high-density RAM chips with wide I/O data, e.g., 8, 16, or 32 bits. A spotty byte error is defined as t-bit errors within a byte of length b-bit, where 1 ≤ t ≤ b, and denoted as t/b-error. This paper proposes a new error model of two spotty byte errors occurring simultaneously, i.e., t/b-error and t′/b-error, where t t′, called complex spotty byte errors. This paper presents two complex m-spotty byte error control codes, i.e., St/bEC-(St/b+St′/b)ED codes which correct all single t/b-errors and detect both t/b-errors and t′/b-errors simultaneously, and (St/b+St′/b)EC codes which correct both single t/b-errors and single t′/b-errors simultaneously. This paper also presents practical examples of the codes with parameter t′=1, that is, St/bEC-(St/b+S)ED codes and (St/b+S) EC codes which require smaller check-bit length than the existing Single t/b-error Correcting and Double t/b-error Detecting (St/bEC-Dt/bED) codes and the Double t/b-error Correcting (Dt/bEC) codes, respectively.
A deep null algorithm for adaptive narrowband beamforming in the presence of array gain errors is proposed. This new algorithm not only preserves the desired signal, but also yields superior performance. Simulations confirm this new approach.
Hiroshi FUJISAKI Gerhard KELLER
We extend the sliding block code in symbolic dynamics to transform J (≥2) sequences of Markov chains with time delays. Under the assumption that the chains are irreducible and aperiodic, we prove the central limit theorem (CLT) for the normalized sums of extended sliding block codes from J sequences of Markov chains. We apply the theorem to the system analysis of asynchronous spread spectrum multiple access (SSMA) communication systems using spreading sequences of Markov chains. We find that the standard Gaussian approximation (SGA) for estimations of bit error probabilities in such systems is the 0-th order approximation of the evaluation based on the CLT. We also provide a simple theoretical evaluation of bit error probabilities in such systems, which agrees properly with the experimental results even for the systems with small number of users and low length of spreading sequences.
A temporal error concealment algorithm for the block-based video coder has been proposed. The concept of block overlapping is adopted to conceal the erroneous blocks, and the recovered pixels are estimated by the weighted sum from the overlapping. The overlapping weighting matrix has been carefully selected in order to fully exploit the spatial-temporal correlation between boundary blocks and the lost block. Furthermore, the motion vector for the lost block has been recovered by considering the best results for the overlapping. The experimental results are shown by integrating our algorithm into the H.263+ coder.
Jun TAKAHASHI Hideki TODE Koso MURAKAMI
Efficient real-time contents distribution services on the Internet are only possible by suppressing the influence of packet losses. One solution for UDP transmission is the use of Forward Error Correction (FEC) based on Reed-Solomon codes. However, a more efficient method is required since this causes the increase of network traffic and includes the weakness to burst packet losses. In this paper, we propose a data recovery method that generates redundant data with the combination of Reed-Solomon codes and convolution of neighboring blocks. We realize the small amount of redundancy and the high reliability in data transmission compared with using only Reed-Solomon codes in the environment that burst packet losses are occurred frequently. We implement proposal method into the network bridge and confirm its efficiency from the viewpoint of data reconstruction from burst packet losses.
Masami TAKATA Hayaru SHOUNO Masato OKADA
Solving the error correcting code is an important goal with regard to communication theory. To reveal the error correcting code characteristics, several researchers have applied a statistical-mechanical approach to this problem. In our research, we have treated the error correcting code as a Bayes inference framework. Carrying out the inference in practice, we have applied the NMF (naive mean field) approximation to the MPM (maximizer of the posterior marginals) inference, which is a kind of Bayes inference. In the field of artificial neural networks, this approximation is used to reduce computational cost through the substitution of stochastic binary units with the deterministic continuous value units. However, few reports have quantitatively described the performance of this approximation. Therefore, we have analyzed the approximation performance from a theoretical viewpoint, and have compared our results with the computer simulation.
Over the years, many improvements and refinements to the backpropagation learning algorithm have been reported. In this paper, a new adaptive penalty-based learning extension for the backpropagation learning algorithm and its variants is proposed. The new method initially puts pressure on artificial neural networks in order to get all outputs for all training patterns into the correct half of the output range, instead of mainly focusing on minimizing the difference between the target and actual output values. The upper bound of the penalty values is also controlled. The technique is easy to implement and computationally inexpensive. In this study, the new approach is applied to the backpropagation learning algorithm as well as the RPROP learning algorithm. The superiority of the new proposed method is demonstrated though many simulations. By applying the extension, the percentage of successful runs can be greatly increased and the average number of epochs to convergence can be well reduced on various problem instances. The behavior of the penalty values during training is also analyzed and their active role within the learning process is confirmed.
Aloys MVUMA Shotaro NISHIMURA Takao HINAMOTO
In this letter we present steady-state analyses of a gradient algorithm (GA) for second-order adaptive infinite impulse response (IIR) notch filters. A method for deriving more accurate estimation mean square error (MSE) expressions than the recently proposed method is presented. The method is based on the estimation error power spectral density (PSD). Moreover, an expression for the estimation bias for the adaptive IIR notch filter with constrained poles and zeros is shown to be obtained from the estimation MSE expression. Simulations are presented to confirm the validity of the analyses.
Tatsuhiko KAGEHIRO Hiroto NAGAYOSHI Hiroshi SAKO
This paper describes a method for the classification of bank-notes. The algorithm has three stages, and classifies bank-notes with very low error rates and at high speeds. To achieve the very low error rates, the result of classification is checked in the final stage by using different features to those used in the first two. High-speed processing is mainly achieved by the hierarchical structure, which leads to low computational costs. In evaluation on 32,850 samples of US bank-notes, with the same number used for training, the algorithm classified all samples precisely with no error sample. We estimate that the worst error rate is 3.1E-9 for the classification statistically.
Expressions are presented for the probability of target detection and the measurement accuracy of the detection, taking into account the effects of antenna beam-pointing error. Evaluation of these expressions requires numerical integration, which is computationally expensive. Approximate but analytic and efficient expressions are also presented. Numerical examples are given to present the relative accuracy of our analytic approximations.
Donghyung KIM Jongho KIM Jechang JEONG
The H.264 standard allows each macroblock to have up to sixteen motion vectors, four reference frames, and a macroblock mode. Exploiting this feature, we present an efficient temporal error concealment algorithm for H.264-coded video. The proposed method turns out to show good performance compared with conventional approaches.
Nobutaka KUROKI Nobuhiro OKA Masahiro NUMA Keisuke YAMAMOTO
A triple density Error Diffusion for medical monochrome LCDs is proposed to improve their gray-scale precisions. In addition, a measurement technique of image qualities based on E-MSE (Eye model-based Mean Square Error) is proposed. Several conventional techniques for medical LCDs, such as Sub-Pixel Modulation and Error Diffusion, are evaluated based on E-MSE and the validity of the proposed technique is ensured objectively.
Mohammad Azizur RAHMAN Shigenobu SASAKI Hisakazu KIKUCHI
In this paper, ultra-wideband (UWB) multiple access systems are introduced by using direct-sequence (DS) and hybrid direct-sequence time-hopping (DS/TH) code division multiple access (CDMA) that use arbitrary chip-duty of the spreading sequences. The bit error probabilities are presented. First of all, the variances of the multiple access interference are developed by investigating the collision properties of the signals. Afterward, various approximations are applied. The standard Gaussian approximation (SGA) for the DS system is shown to become extremely optimistic as the chip-duty becomes low. Though the hybrid system performs better, the SGA still remains optimistic. To obtain accurate results, Holtzman's simplified improved Gaussian approximation (SIGA) and Morrow and Lehnert's improved Gaussian approximation (IGA) are used. A shortcoming of the SIGA is rediscovered that renders it unusable for low-duty DS systems, especially, at high signal-to-noise ratio. However, for the hybrid system, the SIGA works as an excellent tool. The IGA is used to get accurate results for the low-duty DS systems. It is shown that lowering of chip-duty by keeping chip rate and chip length unchanged improves performance for asynchronous DS and both asynchronous and synchronous hybrid systems. However, under the same processing gain, a high-duty system performs better than a low-duty system. Performance of synchronous DS system remains independent of chip-duty.
This paper presents a video coding method that improves error resilient functionality of H.264 with good coding efficiency. The method is based on PD (polyphase downsampling) multiple description coding. The only changes to H.264 are inserting PD before the DCT process and having new data partitioning NAL units. A coded slice is sent on 3 data partitioning NAL units. A header NAL unit contains motion vectors and block modes. Each of the other two NAL units contains a description generated by PD multiple description coding. The experimental results on all 9 of the test sequences of JVT SVC show that the proposed method gives 0.5 to 5 dB enhancement over the existing H.264 FMO checker board mode with motion vector based error-concealment.
Jae-Won KIM Sun-Young JEON Hye-Soo KIM Jae-Woong YUN Sung-Jea KO
Vertical handoff is required to achieve anywhere and anytime internet access in the fourth generation (4G) network providing interoperability between universal mobile telecommunications system (UMTS) and wireless LAN (WLAN). However, video data can be lost due to latency caused by vertical handoff. To solve this problem, in this paper, we propose a video streaming technique supporting error concealment (EC) for video on demand (VOD) services that provides seamless playout at the client in vertical handoff. In the proposed method, the streaming server first predicts the client buffer status (CBS). Using the predicted CBS and the channel rate, the streaming server selects a proper video transmission method for vertical handoff between frame selective pre (FSP)-transmission and re-transmission. Performance evaluations are presented to demonstrate the effectiveness of the proposed method.
Tomohiko SAITO Toshiyasu MATSUSHIMA Shigeichi HIRASAWA
Orthogonal Arrays (OAs) have been playing important roles in the field of experimental design. It has been known that OAs are closely related to error-correcting codes. Therefore, many OAs can be constructed from error-correcting codes. But these OAs are suitable for only cases that equal interaction effects can be assumed, for example, all two-factor interaction effects. Since these cases are rare in experimental design, we cannot say that OAs from error-correcting codes are practical. In this paper, we define OAs with unequal strength. In terms of our terminology, OAs from error-correcting codes are OAs with equal strength. We show that OAs with unequal strength are closer to practical OAs than OAs with equal strength. And we clarify the relation between OAs with unequal strength and unequal error-correcting codes. Finally, we propose some construction methods of OAs with unequal strength from unequal error-correcting codes.
Eduard A. JORSWIECK Holger BOCHE
The average performance of a single-user MIMO system under spatially correlated fading and with different types of CSI at the transmitter and with perfect CSI at the receiver was studied in recent work. In contrast to analyzing a single performance metric, e.g. the average mutual information or the average bit error rate, we study an arbitrary representative of the class of matrix-monotone functions. Since the average mutual information as well as the average normalized MSE belong to that class, this universal class of performance functions brings together the information theoretic and signal processing performance metric. We use Lowner's representation of operator monotone functions in order to derive the optimum transmission strategies as well as to characterize the impact of correlation on the average performance. Many recent results derived for average mutual information generalize to arbitrary matrix-monotone performance functions, e.g. the optimal transmit strategy without CSI at the transmitter is equal power allocation. The average performance without CSI is a Schur-concave function with respect to transmit and receive correlation. In addition to this, we derive the optimal transmission strategy with long-term statistics knowledge at the transmitter and propose an efficient iterative algorithm. The beamforming-range is the SNR range in which only one data stream spatially multiplexed achieves the maximum average performance. This range is important since it has a simple receiver structure and well known channel coding. We entirely characterize the beamforming-range. Finally, we derive the generalized water-filling transmit strategy for perfect CSI and characterize its properties under channel correlation.
Jaeyoon LEE Dongweon YOON Sang Kyu PARK
The quadrature component unbalance generated by a non-ideal component such as an imperfect 90-degree phase shifter is an inevitable physical phenomenon and leads to performance degradation in a practical coherent M-ary phase shift keying (MPSK) transceiver. In this letter, we present an exact and general expression involving the one- and two-dimensional Gaussian Q-functions for the symbol error rate (SER) of MPSK with I/Q phase unbalance over an additive white Gaussian noise (AWGN) channel. The SER expression provided here offers a convenient way to evaluate the performance of MPSK systems for various cases of practical interest.