Hyunseuk YOO Chang Hui CHOE Moon Ho LEE
The key weakness of Low-Density Parity Check codes is the complexity of the encoding scheme. The generator matrices can be made by Gaussian elimination of parity check matrices for normal block codes. Richardson succeeded in making parity bits from parity check matrices by the low density computation. In this letter, we focus on the execution of numerical experiments which show that even if the matrix D, which is the part of the Richardson's LDPC matrix, is restricted, proposed LDPC codes is lower complexity than Richardson's LDPC codes. The constraint of D results in reducing complexity from O(n + g2) to O(n) due to the omission of computing inverse matrices of φ and T in Richardson's encoding scheme. All the sub-matrices in parity check matrix are composed of Circulant Permutation Matrices based on Galois Fields.
Hideyuki FURUHASHI Yoshinobu KAJIKAWA Yasuo NOMURA
In this paper, we propose a low complexity realization method for compensating for nonlinear distortion. Generally, nonlinear distortion is compensated for by a linearization system using a Volterra kernel. However, this method has a problem of requiring a huge computational complexity for the convolution needed between an input signal and the 2nd-order Volterra kernel. The Simplified Volterra Filter (SVF), which removes the lines along the main diagonal of the 2nd-order Volterra kernel, has been previously proposed as a way to reduce the computational complexity while maintaining the compensation performance for the nonlinear distortion. However, this method cannot greatly reduce the computational complexity. Hence, we propose a subband linearization system which consists of a subband parallel cascade realization method for the 2nd-order Volterra kernel and subband linear inverse filter. Experimental results show that this proposed linearization system can produce the same compensation ability as the conventional method while reducing the computational complexity.
Keiichi FUNAKI Tatsuhiko KINJO
This paper proposes a novel robust fundamental frequency (F0) estimation algorithm based on complex-valued speech analysis for an analytic speech signal. Since analytic signal provides spectra only over positive frequencies, spectra can be accurately estimated in low frequencies. Consequently, it is considered that F0 estimation using the residual signal extracted by complex-valued speech analysis can perform better for F0 estimation than that for the residual signal extracted by conventional real-valued LPC analysis. In this paper, the autocorrelation function weighted by AMDF is adopted for the F0 estimation criterion and four signals; speech signal, analytic speech signal, LPC residual and complex LPC residual, are evaluated for the F0 estimation. Speech signals used in the experiments were an IRS filtered speech corrupted by adding white Gaussian noise or Pink noise whose noise levels are 10, 5, 0, -5 [dB]. The experimental results demonstrate that the proposed algorithm based on complex LPC residual can perform better than other methods in noisy environment.
An adaptive subcarrier allocation (SA) algorithm is proposed for both the enhancement of system capacity and the practical implementation in a clustered OFDM system. The proposed algorithm is based on the two dimensional comparison of the channel gain in both rows and columns of the channel matrix to achieve higher system capacity. Simulation results demonstrate that the proposed algorithm outperforms the SA algorithm based on only one dimensional comparison in terms of system capacity, and furthermore, it performs as well as the optimal SA algorithm at relatively low computational cost.
Wenjie JIANG Yusuke ASAI Satoru AIKAWA
Recent theoretical and experimental studies indicate that spatial multiplexing (SM) systems have enormous potential for increasing the capacity of corresponding multiple input multiple output (MIMO) channels in rich scattering environments. In this paper, we propose a new recursion based algorithm for Bell Labs layered space time (BLAST) signal detection in SM systems. The new algorithm uses an inflated recursion in the initialization and a deflated recursion in the iteration stage: as a result, the complexity is greatly reduced and the irregularity issues are completely avoided. Compared with the conventional fastest recursive approach, the complexity of our proposal is lower by a factor of 2 and it is also very implementation friendly.
Hao SAN Yoshitaka JINGU Hiroki WADA Hiroyuki HAGIWARA Akira HAYAKAWA Haruo KOBAYASHI Tatsuji MATSUURA Kouichi YAHAGI Junya KUDOH Hideo NAKANE Masao HOTTA Toshiro TSUKADA Koichiro MASHIKO Atsushi WADA
We have designed, fabricated and measured a second-order multibit switched-capacitor complex bandpass ΔΣAD modulator to evaluate our new algorithms and architecture. We propose a new structure of a complex bandpass filter in the forward path with I, Q dynamic matching, that is equivalent to the conventional one but can be divided into two separate parts. As a result, the ΔΣ modulator, which employs our proposed complex filter can also be divided into two separate parts, and there are no signal lines crossing between the upper and lower paths formed by complex filters and feedback DACs. Therefore, the layout design of the modulator can be simplified. The two sets of signal paths and circuits in the modulator are changed between I and Q while CLK is changed between high and low by adding multiplexers. Symmetric circuits are used for I and Q paths at a certain period of time, and they are switched by multiplexers to those used for Q and I paths at another period of time. In this manner, the effect of mismatches between I and Q paths is reduced. Two nine-level quantizers and four DACs are used in the modulator for low-power implementations and higher signal-to-noise-and-distortion (SNDR), but the nonlinearities of DACs are not noise-shaped and the SNDR of the ΔΣAD modulator degrades. We have also employed a new complex bandpass data-weighted averaging (DWA) algorithm to suppress nonlinearity effects of multibit DACs in complex form to achieve high accuracy; it can be realized by just adding simple digital circuitry. To evaluate these algorithms and architecture, we have implemented a modulator using 0.18 µm CMOS technology for operation at 2.8 V power supply; it achieves a measured peak SNDR of 64.5 dB at 20 MS/s with a signal bandwidth of 78 kHz while dissipating 28.4 mW and occupying a chip area of 1.82 mm2. These experimental results demonstrate the effectiveness of the above two algorithms, and the algorithms may be extended to other complex bandpass ΔΣAD modulators for application to low-IF receivers in wireless communication systems.
Hiroki WAKATSUCHI Masahiro HANAZAWA Soichi WATANABE Atsuhiro NISHIKATA Masaki KOUZAI Masami KOJIMA Yoko YAMASHIRO Kazuyuki SASAKI Osamu HASHIMOTO
We measured the complex permittivities of whole blood and blood plasma in quasi millimeter and millimeter wave bands using a coaxial probe method. The validity of these measurements was confirmed by comparing with those of a different measurement method, i.e., a dielectric tube method. It is shown that the complex permittivities of the blood samples are similar to those of water in quasi millimeter and millimeter wave bands. Furthermore, the temperature dependences of the complex permittivities of the samples were measured.
Thet Htun KHINE Kazuhiko FUKAWA Hiroshi SUZUKI
This paper proposes a suboptimal algorithm for the maximum likelihood detection (MLD) in multiple-input multiple-output (MIMO) communications. The proposed algorithm regards transmitted signals as continuous variables in the same way as a common method for the discrete optimization problem, and then searches for candidates of the transmitted signals in the direction of a modified gradient vector of the metric. The vector is almost proportional to the direction of the noise enhancement, from which zero-forcing (ZF) or minimum mean square error (MMSE) algorithms suffer. This method sets the initial guess to the solution by ZF or MMSE algorithms, which can be recursively calculated. Also, the proposed algorithm has the same complexity order as that of conventional suboptimal algorithms. Computer simulations demonstrate that it is much superior in BER performance to the conventional ones.
Tongjiang YAN Rong SUN Guozhen XIAO
This paper contributes to a new generalized cyclotomic sequences of order two with respect to p1e1p2e2… ptet. The emphasis is on the linear complexity and autocorrelation of new prime-square sequences and two-prime sequences, two special cases of these generalized cyclotomic sequences. Our method is based on their characteristic polynomials. Results show that these sequences possess good linear complexity. Under certain conditions, the autocorrelation functions of new prime-square sequences and two-prime sequences may be three-valued.
During these years, we have been focusing on developing ultra high-data-rate wireless access systems for future wireless multimedia communications. One of such kind of systems is called DPC-OF/TDMA (dynamic parameter controlled orthogonal frequency and time division multiple access) which targets at beyond 100 Mbps data rate. In order to support higher data rates, e.g., several hundreds of Mbps or even Gbps for future wireless multimedia applications (e.g., streaming video and file transfer), it is necessary to enhance DPC-OF/TDMA system based on MIMO-OFDM (multiple-input multiple-output orthogonal frequency division multiplexing) platform. In this paper, we propose an enhanced DPC-OF/TDMA system based on Multi-Layer MIMO-OFDM scheme which combines both diversity and multiplexing in order to exploit potentials of both techniques. The performance investigation shows the proposed scheme has better performance than its counterpart based on full-multiplexing MIMO-OFDM scheme. In addition to the Exhaustive Detection (EXD) scheme which applies the same detection algorithm on each subcarrier independently, we propose the Reduced-Complexity Detection (RCD) scheme. The complexity reduction is achieved by exploiting the suboptimal Layer Detection Order and subcarrier correlation. The simulation results show that huge complexity can be reduced with very small performance loss, by using the proposed detection scheme. For example, 60.7% complexity can be cut off with only 1.1 dB performance loss for the 88 enhanced DPC-OF/TDMA system.
Zaide LIU Nanning ZHENG Yuehu LIU Huub VAN DE WETERING
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.
This paper proposes a butterfly structure for Viterbi decoders, which works for convolutional codes of all rates k/n. The proposed butterfly structure can exploit the inherent symmetry of trellis branches, so that only some branch metrics need to be computed, while the others can be derived from the computed branches. Consequently, the computational complexity of the Viterbi decoder can be significantly reduced without any error performance loss. The applicability of the butterfly structure is validated by the best codes of rates 1/2, 2/3, and 3/4. Most of the best codes can apply the butterfly structure to reduce their branch metric computation complexity by a factor of 2 or 4. This study also reports a number of new codes with high branch symmetry under the symmetry consideration. Their branch metric computation can be reduced by a factor of 4, 8 or 16 with the similar performance to the best codes.
Shigeaki KUZUOKA Tomohiko UYEMATSU
This paper investigates the fixed-rate and fixed-distortion lossy coding problems of individual sequences subject to the subadditive distortion measure. The fixed-rate and fixed-distortion universal lossy coding schemes based on the complexity of the sequence are proposed. The obtained coding theorems reveal that the optimal distortion (resp. rate) attainable by the fixed-rate (resp. fixed-distortion) lossy coding is equal to the optimal average distortion (resp. rate) with respect to the overlapping empirical distribution of the given sequence. Some connections with the lossy coding problem of ergodic sources are also investigated.
This letter develops an efficient CPM demodulator which provides soft outputs for use in coded CPM. The proposed algorithm offers reduced-complexity soft output detection in which the number of matched filters and trellis states is appreciably reduced. The complexity reduction is achieved by approximating the CPM signal using the Laurent representation. A simulation study of iterative decoding of serially concatenated CPM with an outer code was performed. The performance degradation of the proposed algorithm relative to optimal full complexity generation of soft outputs was found to be small.
Satoshi NAKAYAMA Maki YOSHIDA Shingo OKAMURA Toru FUJIWARA
Data retrieval is used to obtain a particular data item from a database. A user requests an item in the database from a database server by sending a query, and obtains the item from an answer to the query. Security requirements of data retrieval include protecting the privacy of the user, the secrecy of the database, and the consistency of answers. In this paper, a data retrieval scheme which satisfies all the security requirements is defined and an efficient construction is proposed. In the proposed construction, the size of a query and an answer is O((log N)2), and the size of data published by the database server when the database is updated is only O(1). The proposed construction uses the Merkle tree, a commitment scheme, and Oblivious Transfer. The proof of the security is given under the assumption that the used cryptographic schemes are secure.
Seiichiro NAKABAYASHI Nobuko TANIMURA Toshikazu YAMASHITA Shinichiro KOKUBUN
The relationship between the topology and collective function of a nonlinear oscillator network was investigated using nonlinear electrochemical oscillators. The constitutive experiments showed that the physiological robustness in the living system is due to their topological redundancy and asymmetry in the nonlinear network.
Shingo YAMAGUCHI Tomohiro TAKAI Tatsuya WATANABE Qi-Wei GE Minoru TANAKA
This paper deals with computation of parallel degree, PARAdeg, for (dataflow) program nets with SWITCH-nodes. Ge et al. have given the definition of PARAdeg and an algorithm of computing PARAdeg for program nets with no SWITCH-nodes. However, for program nets with SWITCH-nodes, any algorithm of computing PARAdeg has not been proposed. We first show that it is intractable to compute PARAdeg for program nets with SWITCH-nodes. To do this, we define a subclass of program nets with SWITCH-nodes, named structured program nets, and then show that the decision problem related to compute PARAdeg for acyclic structured program nets is NP-complete. Next, we give a heuristic algorithm to compute PARAdeg for acyclic structured program nets. Finally, we do experiments to evaluate our heuristic algorithm for 200 acyclic structured program nets. We can say that the heuristic algorithm is reasonable, because its accuracy is more than 96% and the computation time can be greatly reduced.
Jun GUO Norikazu TAKAHASHI Tetsuo NISHI
A novel method to simplify decision functions of support vector machines (SVMs) is proposed in this paper. In our method, a decision function is determined first in a usual way by using all training samples. Next those support vectors which contribute less to the decision function are excluded from the training samples. Finally a new decision function is obtained by using the remaining samples. Experimental results show that the proposed method can effectively simplify decision functions of SVMs without reducing the generalization capability.
Yuichi HINO Hirotake KAJII Yutaka OHMORI
We investigated luminescent properties in combination of red emissive europium complex of tris(dibenzoylmethane)-mono(4,7-dimethylphenanthroline)europium(III) [Eu(dbm)3phen] and blue phosphorescent molecule of bis[(4,6-difluorophenyl)-pyridinato-N,C2'] (picolinate) iridium (III) (FIrpic) doped in poly(N-vinyl-carbazole) (PVK). A sharp red emission from Eu(dbm)3phen was observed in photoluminescence (PL) measurement, whereas, in the case of electroluminescence (EL), emission from FIrpic and Eu compound were observed. The difference of the PL and EL spectra indicates that different energy transfer processes between Eu(dbm)3phen and FIrpic are suggested.
Masatsugu HIGASHINAKA Akihiro OKAZAKI Katsuyuki MOTOYOSHI Takayuki NAGAYASU Hiroshi KUBO Akihiro SHIBUYA
This paper proposes a co-channel interference cancellation method for multiple-input multiple-output (MIMO) wireless communication systems. Maximum-likelihood multi-user detection (ML-MUD), which is one of the co-channel interference cancellation methods at a receiver side, has excellent bit error rate (BER) performance. However, computational complexity of the ML-MUD is prohibitive, because the ML-MUD must search for the most probable symbol vector from all candidates of the transmitted signals. We apply sphere decoding (SD) to the ML-MUD in order to reduce the computational complexity of the ML-MUD, and moreover we propose a modified version of the SD suitable for the ML-MUD. The proposed method extracts desired signal components from a received signal vector and a channel matrix decomposed the upper triangular form, and then performs the SD to the low dimensional model in order to detect the transmitted signals of the desired user. Computer simulation confirms that the proposed method can suppress the undesired signals and detect the desired signals, offering significant reduction of the computational complexity of the conventional method.