Masato TAJIMA Koji OKINO Takashi MIYAGOSHI
Yamada, Harashima, and Miyakawa proposed to use a trellis constructed based on a syndrome former for the purpose of Viterbi decoding of rate-(n-1)/n convolutional codes. In this paper, we extend their code-trellis construction to general rate-k/n convolutional codes. We show that the extended construction is equivalent to the one proposed by Sidorenko and Zyablov. Moreover, we show that the proposed method can also be applied to an error-trellis construction with minor modification.
Jinah PARK Seungkeun PARK Pyung-Dong CHO Hyeong-Ho LEE
In this letter, we derive an analytical expression for computing the symbol error probability (SEP) of the M-ary quadrature amplitude modulation (M-QAM) in the joint presence of phase/quadrature error and I/Q gain imbalance over an additive white Gaussian noise (AWGN) channel. The derived expression containing only the two-dimensional Gaussian Q-function can be used to compute the SEP of M-QAM in various fading channels by making use of the moment-generating function (MGF) approach.
Ann-Chen CHANG Chun HSU Ing-Jiunn SU
This letter deals with adaptive array beamforming based on a minimum variance distortionless response (MVDR) technique with robust capabilities for code-division multiple access signals. It has been shown that the MVDR beamformer suffers from the drawback of being very sensitive to pointing error over the eigenspace-based beamformers. For the purpose of efficient estimation and calibration, a highly efficient approach has been proposed that is implemented on polynomial rooting rather than spectral searching. However, this rooting method is suboptimal in the presence of the noise and multiple access interference (MAI). In this letter, we propose an improved polynomial rooting calibration method that is robust in both of the low signal-to-noise ratio and large MAI scenarios. Several computer simulations are provided for illustrating the effectiveness of the proposed method.
Hoojin LEE Robert W. HEATH, Jr. Edward J. POWERS
Full-diversity transmission for space-time block codes (STBCs) with multiple transmit antennas can be achieved by using coordinate interleaved orthogonal designs (CIODs). To effectively evaluate the performance of CIODs, we derive union upper and lower bounds on the symbol-error rate (SER) and a corresponding asymptotic diversity order of symmetric structured CIOD, in particular, with two transmit antennas over quasi-static spatially uncorrelated/correlated frequency-nonselective Rayleigh fading channels. Some numerical results are provided to verify our analysis.
Hae-Yeoun LEE Dong-Hyuck IM Heung-Kyu LEE
Imperfect transmission of satellite imagery results in the loss of image lines. This paper proposes a novel error concealment technique using LSB-based watermarking. We generate block description information and insert it into the LSB bit plane of the image. Missing lines after transmission are restored by extracting this block description information. Simulation results show outstanding performance of the proposed technique.
Shun GOKITA Masashi SUGIYAMA Keisuke SAKURAI
In order to obtain better learning results in supervised learning, it is important to choose model parameters appropriately. Model selection is usually carried out by preparing a finite set of model candidates, estimating a generalization error for each candidate, and choosing the best one from the candidates. If the number of candidates is increased in this procedure, the optimization quality may be improved. However, this in turn increases the computational cost. In this paper, we focus on a generalization error estimator called the regularized subspace information criterion and derive an analytic form of the optimal model parameter over a set of infinitely many model candidates. This allows us to maximize the optimization quality while the computational cost is kept moderate.
In this letter, we introduce a new adaptive beamforming assisted receiver based on minimizing the approximate negentropy (NEGMIN) of the estimation error. We consider the approximate negentropy by using a nonpolynomial expansion of the estimation error as a new performance criterion to improve the performance of adaptive beamforming receivers based on the minimizing minimum mean squared error (MMSE) criteria. Negentropy includes higher order statistical information and its minimization provides improved converge, performance, and accuracy compared to traditional methods such as MMSE in terms of bit error rate (BER).
Weihua ZHANG Hanbing SHEN Zhiquan BAI Kyung-sup KWAK
Due to the ultra low power spectral desity of the ultra-wide band (UWB), narrow band interference (NBI) with high-level emission power will degrade the accuracy of UWB ranging system. We propose a novel waveform to suppress the accuracy degradation by NBI with a given frequency. In addition, we compare the ranging error ratio (RER) of the proposed scheme with the traditional one with Gaussian monocycle in this letter.
We design M(≥3)-phase spreading sequences of Markov chains optimal in terms of bit error probabilities in asynchronous SSMA (spread spectrum multiple access) communication systems. To this end, we obtain the distributions of the normalized MAI (multiple access interference) for such systems and find a necessary and sufficient condition that the distributions become independent of the phase shifts.
Soo Young SHIN Hong Seong PARK Wook Hyun KWON
In this paper, the packet error rate (PER) of IEEE 802.15.4 under the interference of a saturated IEEE 802.11b network is evaluated using an analytic model when IEEE 802.15.4 and IEEE 802.11b coexist. The PER is obtained from the bit error rate (BER) and the collision time, where the BER is obtained from the signal-to-interference-plus-noise ratio. The analytic results are validated using simulations.
Makoto SUGIHARA Tohru ISHIHARA Kazuaki MURAKAMI
This paper proposes a soft-error model for accurately estimating reliability of a computer system at the architectural level within reasonable computation time. The architectural-level soft-error model identifies which part of memory modules are utilized temporally and spatially and which single event upsets (SEUs) are critical to the program execution of the computer system at the cycle accurate instruction set simulation (ISS) level. The soft-error model is capable of estimating reliability of a computer system that has several memory hierarchies with it and finding which memory module is vulnerable in the computer system. Reliability estimation helps system designers apply reliable design techniques to vulnerable part of their design. The experimental results have shown that the usage of the soft-error model achieved more accurate reliability estimation than conventional approaches. The experimental results demonstrate that reliability of computer systems depends on not only soft error rates (SERs) of memories but also the behavior of software running in computer systems.
Yong-Goo KIM Yungho CHOI Yoonsik CHOE
The error resilient entropy coding (EREC) provides efficient resynchronization method to the coded bitstream, which might be corrupted by transmission errors. The technique has been given more prominence, nowadays, because it achieves fast resynchronization without sizable overhead, and thereby provides graceful quality degradation according to the network conditions. This paper presents a novel framework to analyze the performance of EREC in terms of the error probability in decoding a basic resynchronization unit (RU) for various error prone networks. In order to show the feasibility of the proposed framework, this paper also proposes a novel EREC algorithm based on the slightly modified H.263 bitstream syntax. The proposed scheme minimizes the effect of errors on low frequency DCT coefficients and incorporates near optimal channel-matched searching pattern (SP), which guarantees the best possible quality of reproduced video. Given the number of bits generated for each RU, the near optimal SP is produced by the proposed iterative deterministic partial SP update method, which reduces the complexity of finding optimal solution, O((N-1)!), to O(m·N2). The proposed EREC algorithm significantly improves the decoded video quality, especially when the bit error rate is in the rage of 10-3-10-4. Up to 5 dB enhancement of the PSNR value was observed in a single video frame.
Shigeki MIYAKE Mitsuru MARUYAMA
A universal coding scheme for information from i.i.d., arbitrarily varying sources, or memoryless correlated sources is constructed using LDPC matrices and shown to have an exponential upper bound of decoding error probability. As a corollary, we construct a universal code for the noisy channel model, which is not necessarily BSC. Simulation results show universality of the code with sum-product decoding, and presence of a gap between the error exponent obtained by simulation and that obtained theoretically.
Pengcheng ZHU Lan TANG Yan WANG Xiaohu YOU
In this letter, we study the impact of feedback error on transmit beamforming systems with finite rate feedback. The feedback channel is modeled as a uniform symmetric channel. The outage probability, bit error rate (BER), diversity gain, and array gain formulas are given. Both analytical and simulation results show that feedback error with small probability will make the system behave badly at high signal-to-noise ratios (SNR).
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.
Motohiko ISAKA Philippa A. MARTIN Marc P.C. FOSSORIER
In this paper we look at the serial concatenation of short linear block codes with a rate-1 recursive convolutional encoder, with a goal of designing high-rate codes with low error floor. We observe that under turbo-style decoding the error floor of the concatenated codes with extended Hamming codes is due to detectable errors in many cases. An interleaver design addressing this is proposed in this paper and its effectiveness is verified numerically. We next examine the use of extended BCH codes of larger minimum distance, resulting in an improved weight spectrum of the overall code. Reduced complexity list decoding is used to decode the BCH codes in order to obtain low decoding complexity for a negligible loss in performance.
Hideki YAGI Toshiyasu MATSUSHIMA Shigeichi HIRASAWA
This paper generalizes parallel error correcting codes proposed by Ahlswede et al. over a new type of multiple access channel called parallel error channel. The generalized parallel error correcting codes can handle with more errors compared with the original ones. We show construction methods of independent and non-independent parallel error correcting codes and decoding methods. We derive some bounds about the size of respective parallel error correcting codes. The obtained results imply a single parallel error correcting code can be constructed by two or more kinds of error correcting codes with distinct error correcting capabilities.
We give a centralized deterministic algorithm for constructing linear network error-correcting codes that attain the Singleton bound of network error-correcting codes. The proposed algorithm is based on the algorithm by Jaggi et al. We give estimates on the time complexity and the required symbol size of the proposed algorithm. We also estimate the probability of a random choice of local encoding vectors by all intermediate nodes giving a network error-correcting codes attaining the Singleton bound. We also clarify the relationship between the robust network coding and the network error-correcting codes with known locations of errors.
CORDIC (COordinate Rotation DIgital Computer) is a well known algorithm using simple adders and shifters to evaluate various elementary functions. Thus, CORDIC is suitable for the design of high performance chips using VLSI technology. In this paper, a complete analysis of the computation error of both the (conventional) CORDIC algorithm and the CORDIC algorithm with expanded convergence range is derived to facilitate the design task. The resulting formulas regarding the relative and absolute approximation errors and the truncation error are summarized in the tabular form. As the numerical accuracy of CORDIC processors is determined by the word length of operands and the number of iterations, three reference tables are constructed for the optimal choice of these numbers. These tables can be used to facilitate the design of cost-effective CORDIC processors in terms of areas and performances. In addition, two design examples: singular value decomposition (SVD) and lattice filter for digital signal processing systems are given to demonstrate the goal and benefit of the derived numerical analysis of CORDIC.
The minimum mean square error (MMSE) multiple antenna transmission scheme for a code division multiple access (CDMA) system was recently developed by Choi and Perreau [1]. In this paper, we first show that the zero-forcing (ZF) transmit beamformer for multiple antenna CDMA system has the same form as the MMSE beamformer given by Choi and Perreau. We then develop an analytical method to obtain a closed-form expression of the bit error rate (BER) of the ZF transmit beamformer when there are channel estimation errors. The analytical and simulation results show good agreement, and confirm the importance of accurate channel state information (CSI) at the transmitter when using the ZF transmit beamformer.