A soft-decision decoding scheme of low-density parity-check codes (LDPC) is proposed for hard-detected signals of optical fiber communication (OFC) systems. Based on the error detection, the proposed scheme converts the received hard-decision into soft reliability for the input of the LDPC decoder, and soft-decision decoding is performed. Simulation results under OFC channels are shown and superior performance is obtained by using the proposed decoding scheme of the LDPC codes.

For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n-1 internally disjoint paths connecting the nodes in the time complexity of polynomial order of n. The length of each path obtained and the time complexity of the algorithm are estimated theoretically and verified by computer simulation.

We propose a modified orthogonal transmit diversity (OTD) scheme, which can simultaneously achieve full path diversity and temporal diversity by using symbol splitting. Our proposed method is comparable to space-time spreading (STS) in performance and superior to STS in the cost and efficiency of base station RF devices.

As a typical planar antenna in Japan, a microstrip antenna and radial line slot antenna are chosen and some original technologies are introduced for them. About the microstrip antenna, the analyzing method is described first and the method based on the theory of microstrip planar circuit born in Japan is introduced. According to the formulas derived by this method, the design procedure considering the bandwidth is established. In addition, it is shown clearly that a microstrip antenna can produce the circular polarizations at two kinds of frequencies with a single feed. Furthermore, two kinds of broadband techniques born in Japan are picked up. About other unique microstrip antennas, they may be introduced in a suitable section each time. As for the RLSA, the history on invention is briefly presented. The radiation mechanisms depending on the slot-set arrangement and the excitation mode are discussed. The slot-coupling analysis to simulate the excitation of a two-dimensional uniformly-excited slot array is explained. The simple design based on the operation with traveling-wave propagation is also described. The technical progress to keep high efficiency in a wide gain range for satellite-TV reception is reviewed. Extensions of the RLSAs to millimeter-wave bands and plasma etching systems are finally summarized.

We propose new language models to represent phrasal structures by patterns extracted from parse trees. First, modified word trigram models are proposed. They are extracted from sentences analyzed by the preprocessing of the parser with knowledge. Since sentences are analyzed to create sub-trees of a few words, these trigram models can represent relations among a few neighbor words more strongly than conventional word trigram models. Second, word pattern models are used on these modified word trigram models. The word patterns are extracted from parse trees and can represent phrasal structures and much longer word-dependency than trigram models. Experimental results show that modified trigram models are more effective than traditional trigram models and that pattern models attain slight improvements over modified trigram models. Furthermore, additional experiments show that pattern models are more effective for long sentences.

This paper presents novel techniques for blind separation and blind extraction of instantaneously mixed binary sources, which are suitable for the case with less sensors than sources. First, a solvability analysis is presented for a general case. Necessary and sufficient conditions for recoverability of all or some part of sources are derived. A new deterministic blind separation algorithm is then proposed to estimate the mixing matrix and separate all sources efficiently in the noise-free or low noise level case. Next, using the Maximum Likelihood (ML) approach for robust estimation of centers of clusters, we have extended the algorithm for high additive noise case. Moreover, a new sequential blind extraction algorithm has been developed, which enables us not only to extract the potentially separable sources but also estimate their number. The sources can be extracted in a specific order according to their dominance (strength) in the mixtures. At last, simulation results are presented to illustrate the validity and high performance of the algorithms.

It is well known that KT method proposed by R. Kumaresan and D. W. Tufts is used as a popular parameter estimation method of exponentially damped signal. It is based on linear backward-prediction method and singular value decomposition (SVD). However, it is difficult to estimate parameters correctly by KT method in the case when high noise exists in the signal. In this paper, we propose a parameter (frequency components and damping factors) estimation method to improve the performance of KT method under high noise. In our proposed method, we find the signal zero groups by calculating zeros with different data record lengths according to the combination of forward-prediction and backward-prediction, the mean value of the zeros in the signal zero groups are calculated to estimate the parameters of the signal. The proposed method can estimate parameters correctly and accurately even when high noise exists in the signal. Simulation results are shown to confirm the effectiveness of the proposed method.

A new blind identification method of transfer functions between variables in feedback systems is introduced for single sweep type of MEG data. The method is based on the viewpoint of stochastic/statistical inverse problems. The required conditions of the model are stationary and linear Gaussian processes. Raw MEG data of the brain activities are heavily contaminated with several noises and artifacts. The elimination of them is a crucial problem especially for the method. Usually, these noises and artifacts are removed by notch and high-pass filters which are preset automatically. In the present paper, we will try two types of more careful preprocessing procedures for the identification method to obtain impulse functions. One is a careful notch filtering and the other is a blind source separation method based on temporal structure. As results, identifiably of transfer functions and their impulse responses are improved in both cases. Transfer functions and impulse responses identified between MEG sensors are obtained by using the method in Appendix A, when eyes are closed with rest state. Some advantages of the blind source separation method are discussed.

Assume that each edge e of a graph G is assigned a list (set) L(e) of colors. Then an edge-coloring of G is called an L-edge-coloring if each edge e of G is colored with a color contained in L(e). It is known that any series-parallel simple graph G has an L-edge-coloring if either (i) |L(e)| max{4,d(v),d(w)} for each edge e=vw or (ii) the maximum degree of G is at most three and |L(e)| 3 for each edge e, where d(v) and d(w) are the degrees of the ends v and w of e, respectively. In this paper we give a linear-time algorithm for finding such an L-edge-coloring of a series-parallel graph G.

In this paper, parallelization methods for quantum circuits are studied, where parallelization of quantum circuits means to reconstruct a given quantum circuit to one which realizes the same quantum computation with a smaller depth, and it is based on using additional bits, called ancillae, each of which is initialized to be in a certain state. We propose parallelization methods in terms of the number of available ancillae, for three types of quantum circuits. The proposed parallelization methods are more general than previous one in the sense that the methods are applicable when the number of available ancillae is fixed arbitrarily. As consequences, for the three types of n-bit quantum circuits, we show new upper bounds of the number of ancillae for parallelizing to logarithmic depth, which are 1/log n of previous upper bounds.

Let each vertex v of a graph G have a positive integer weight ω(v). Then a multicoloring of G is to assign each vertex v a set of ω(v) colors so that any pair of adjacent vertices receive disjoint sets of colors. A partial k-tree is a graph with tree-width bounded by a fixed constant k. This paper presents an algorithm which finds a multicoloring of any given partial k-tree G with the minimum number of colors. The computation time of the algorithm is bounded by a polynomial in the number of vertices and the maximum weight of vertices in G.

A scalable MOSFET parasitic model has been studied using 0.13 µm standard CMOS process. The model consisted of a core BSIM3v3 transistor model and parasitic resistor, capacitor, inductor, and diode. All parasitic components' values were automatically calculated by transistor geometrical parameters, only gate length (Lg), gate width (Wg), and gate multiple numbers (Mg), and some fixed process parameters such as sheet resistance of each part of diffusion layer. This model was confirmed for 0.25 µm to 0.5 µm gate length, 10 to 40 gate multiples with 5 µm gate finger width (Wf), 0.8 V to 1.5 V gate-source voltage (|Vgs|) with 0.6 V threshold voltage (|Vth|), and 1.0 V to 2.5 V drain-source voltage (|Vds|) from the viewpoint of small signal. The measured s-parameter and simulated one are in fairly good agreement in 200 MHz to 20 GHz frequencies range. This model is very simple, scalable, and convenient for RF circuit designers without difficult parameter setting.

This paper describes a three-port power divider with compensation networks for non-ideal isolation resistor. The compensation networks consist of two pairs of transmission lines and cancel out the parasitic reactance of the non-ideal isolation resistor. The design equations to provide perfect return loss and isolation at a center frequency are presented. The availability of the proposed power divider has been verified by the comparison between calculated and experimental results in the Ku-band.

The aim of this paper is to present a new cost estimation technique to synthesis hardware from high level circuit description. The scheduling and allocation processes are performed in alternative manner, while using realistic cost measurements models that account for Functional Unit (FU), registers, and multiplexers. This is an improvement over previous works, were most of them use very simple cost models that primarily focus on FU resources alone. These latest, however, are not accurate enough to allow effective design space exploration since the effects of storage and interconnect resources can indeed dominates the cost function. We tested our technique on several high-level synthesis benchmarks. The results indicate that the tool can generate near-optimal bus-based and multiplexer-based architectural models with lower number of registers and buses, while presenting high throughput.

In an order-specified multisignature scheme, one can verify not only a set of signers who have signed the message but also its signing order. Though we have seen several schemes with such properties proposed, none of them is given the security proof against active adversaries. The scheme can be easily modified to be an order-specified multisignature scheme, but still has the restriction that the possible signing orders are only ones of the type of serial signing. In this paper, we propose the first order-specified multisignature scheme, which is shown to be secure against adaptive chosen-message insider attacks in the random oracle model, and which allows the signing orders to form like any series-parallel graphs. The security is shown by using ID-reduction technique, which reduces the security of multisignature schemes to those of multi-round identification schemes. Furthermore, we discuss the efficiency of the proposed scheme and the upper bound of the possible number of participating signers.

In this paper, two types of multi-stage partial parallel interference cancellation (PIC) receivers are considered for multi-rate DS-CDMA system: multi-stage PIC receiver with partial cancellation factors and multi-stage PIC receiver with decision thresholds. Bit error rate (BER) of the multi-stage partial PIC receivers is obtained by simulation in a Rayleigh fading channel. It is shown that the multi-stage partial PIC receivers achieve smaller BER than the matched filter (MF) receiver, multi-stage PIC receiver, group-wise successive interference cancellation (GSIC) receiver, and extended GSIC receiver (EGSIC) for the multi-rate DS-CDMA system in a Rayleigh fading channel.

In this paper, we describe two approaches to optimize the Phase-Mode pipelined parallel multiplier. One of the approaches is reforming a data distribution for an AND array, which is named the hybrid structure. Another method is applying a Booth encoder as a substitute of the AND array in order to generate partial products. We design a 2-bit 2-bit Phase-Mode Booth encoder and test the circuit by the numerical simulations. The circuit consists of 21 ICF gates and operates correctly at a throughput of 37.0 GHz. The numbers of Josephson junctions and the pipelined stages in each scale of multipliers are reduced remarkably by using the encoder. According to our estimations, the Phase-Mode Booth encoder is the effective component to improve the performance of large-scale parallel multipliers.

This paper addresses a maximum likelihood method for source separation in the case of overdetermined mixtures corrupted by additive white Gaussian noise. We consider an approximate likelihood which is based on the Laplace approximation and develop a natural gradient adaptation algorithm to find a local maximum of the corresponding approximate likelihood. We present a detailed mathematical derivation of the algorithm using the Lie group invariance. Useful behavior of the algorithm is verified by numerical experiments.

When people want to exchange digital money and digital data over the Internet like a market, privacy for the participant's behavior, security against malicious users and fairness for matching must be assured. We propose a new concept "Matching Oblivious Transfer," which can match valuable digital data with hiding the price suggested by participant and securely deliver the digital data to the matched participant. Then we propose a protocol for some general matching rules in which once a participant sends an order to the market, no interaction between each participant and the market is needed.

A number of results on the estimation of direction of arrival have been obtained based on the assumption that the signal sources are point sources. Recently, it has been shown that signal source localization can be accomplished more adequately with distributed source models in some real surroundings. In this paper, we consider modeling of three-dimensional distributed signal sources, in which a source location is represented by the center angles and degrees of dispersion. We address estimation of the elevation and azimuth angles of distributed sources based on the proposed distributed source modeling in the three-dimensional space using two linear arrays. Some examples are included to more explicitly show the estimation procedures under the model: numerical results obtained by a MUSIC-based method with two uniform linear arrays are discussed.