Kenji TAKATSUKASA Shinya MATSUFUJI Yoshiaki WATANABE Noriyoshi KUROYANAGI Naoki SUEHIRO
ZCZ sets are families of sequences, whose periodic auto/cross-correlation functions have zero correlation zone at the both side of the zero-shift. They can provide approximately synchronized CDMA systems without intra-cell interference for cellular mobile communications. This paper presents ternary ZCZ sets achieving a mathematical bound, and investigates the average interference parameters for the sets in order to evaluate inter-cell interference. It is shown that they can provide AS-CDMA systems with efficiency frequency usage.
Terrestrial radio links with sparsely distributed multipath delays can be represented by a tapped-delay line with a few significant tap coefficients. This letter presents criteria and performance of identification methods that determine channel taps with significant power. In particular, a tap identification method derived from the maximum-likelihood criterion and its closed form error probabilities are presented. Performance improvement over a previously reported scheme is quantified using the derived error probabilities.
Baoming BAI Kin Shing HO Li PING
In this letter, we introduce a two-state turbo-TCM scheme based on the concatenated tree codes. The proposed scheme can achieve near capacity performance yet has considerably lower decoding complexity compared with other existing turbo-TCM codes.
Atsushi UCHIDA Koji TAKAHASHI Makito KAWANO Shigeru YOSHIMORI
We have demonstrated synchronization of chaos in a pair of one-way coupled Colpitts oscillators by both experiment and numerical simulation. We have investigated parameter regions for achieving chaos-synchronization when one of the internal parameters is mismatched between the master and slave oscillators, and clarify the tolerance of parameter regions for synchronization against parameter mismatching.
Kazuhiko KAKEHI Robert GLUCK Yoshihiko FUTAMURA
Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is the inability to deforest programs using accumulating parameters. We show how certain kinds of intermediate lists produced by accumulating parameters can be deforested. In this paper we introduce an accumulative variant of foldr, called rdlof, and show the composition of functions defined by foldr and rdlof. As a simplified instance of foldr and rdlof, we then examine dmap, an accumulative extension of map, and give the corresponding fusion rules. While the associated composition rules cannot capture all deforestation problems, they can handle accumulator fusion of fold- and map-style functions in a simple manner. The rules for accumulator fusion presented here can also be viewed as a restricted composition scheme for attribute grammars, which in turn may help us to bridge the gap between the attribute and functional worlds.
Masanori FURUTA Shoji KAWAHITO Daisuke MIYAZAKI
A digital calibration technique, which corrects errors due to capacitor mismatch in pipelined ADC and directly measures the error coefficients using the ADC INL plot, is described. The proposed technique can be applied for various types of pipelined ADC architectures. Test results using an implemented 10-bit pipelined ADC show that the ADC achieves a peak signal-to-noise-and-distortion ratio of 56.5 dB, a peak integral non-linearity of 0.3 LSB, and a peak differential non-linearity of 0.3 LSB using the digital calibration.
Woong SUN Seung-Hoon HWANG Duk Kyung KIM Keum-Chan WHANG
This paper introduces an improved multistage parallel interference cancellation (PIC) technique that uses the reverse-link synchronous transmission technique (RLSTT) to improve the estimation of data at the initial stage. Because the subtraction of an interfering signal based on an incorrect bit decision quadruples the interference power for that signal, the relatively high decision bit error rate (BER) may lead to a poor cancellation or even a higher BER at the following stages. The RLSTT is a robust approach which takes into account the fact the tentative decision at the earlier stages is less reliable than the following stages and makes the earlier cancellation more reliable. The analysis demonstrates that a better transmission performance can be achieved by using the RLSTT at the initial stage of PIC.
Mitsuhiro OHSAKI Mitsuhiro TATEDA Takashige OMATSU Hiroshige OHNO
An effective spatial resolution enhancement method for distributed strain measurement by BOTDR is proposed. An optical fiber is glued to a structure by a length less than the spatial resolution defined by the pulse width, and the Brillouin spectrum of the light scattered from the glued optical fiber is investigated theoretically. The apparent strain xp observed in the fiber is found to be proportional to the accurate strain a. The ratio r=xp/a coincides with the ratio of the glued length to the spatial resolution. Spatial resolution as small as 0.2 m is demonstrated experimentally for small strains of less than 10-3.
Yasushi YUMINAKA Shinya SAKAMOTO
This paper investigates multiple-valued code-division multiple access (MV-CDMA) techniques and circuits for intra/inter-chip communication to achieve efficient data transmission in VLSI systems. To address the problems caused by interconnection complexity, we transmit multiplexed signals inside LSI systems employing pseudo-random orthogonal m-sequences as information carriers. A new class of multiple-valued CDMA techniques for intra-chip communication is discussed to demonstrate the feasibility of eliminating co-channel interference caused by a propagation delay of signals, e.g., clock skew. This paper describes the circuit configuration and performance evaluation of MV-CDMA systems for intra-chip communication. We first explain the principle of MV-CDMA technique, and then propose a bidirectional current-mode CMOS technique to realize compact correlation circuits for CDMA. Finally, we show the Spice and MATLAB simulation results of MV-CDMA systems, which indicate the excellent capabilities of eliminating co-channel interference.
Yao-Lin JIANG Richard M. M. CHEN
In this letter we present a new way for computing generalized eigenvalue problems in engineering applications. To transform a generalized eigenvalue problem into an associated problem for solving nonlinear dynamic equations by using optimization techniques, we can determine all eigenvalues and their eigenvectors for general complex matrices. Numerical examples are given to verify the formula of dynamic equations.
The Fat-Btree which is a new parallel B-tree structure has been proposed to improve the access performance of shared-nothing parallel database systems. Since the Fat-Btree has only a part of index nodes on each processing element, it can reduce the synchronization cost in update operations. For these reasons, both retrieval and update operations can be processed at high throughput compared to previously proposed parallel B-tree structures for shared-nothing computers. Though we tried to apply some conventional concurrency control methods to the Fat-Btree, e.g., B-OPT and ARIES/IM, which were designed for shared-everything machines, we found that these methods are not always appropriate for the Fat-Btree. In this paper, it is shown that the conventional methods are not suitable for the Fat-Btree and other parallel B-trees. We propose a new deadlock free concurrency control protocol, named INC-OPT, to improve the performance of the Fat-Btree more effectively than the B-OPT and ARIES/IM. Furthermore, in order to prove that the Fat-Btree provides the impact on the performance of shared-nothing parallel databases, we compare the real performance of three types of parallel B-tree structures, Fat-Btree, Copy-Whole-Btree, and Single-Index-Btree, on an nCUBE3 machine where the INC-OPT is applied.
Hideyuki IMAI Yuying YUAN Yoshiharu SATO
It is widely known that the family of projection filters includes the generalized inverse filter, and that the family of parametric projection filters includes parametric generalized projection filters. However, relations between the family of parametric projection filters and constrained least squares filters are not sufficiently clarified. In this paper, we consider relations between parameter estimation and image restoration by these families. As a result, we show that the restored image by the family of parametric projection filters is a maximum penalized likelihood estimator, and that it agrees with the restored image by constrained least squares filter under some suitable conditions.
MOSFETs can be used as capacitors, but its capacitance can vary by 5 to 7 times as its terminal voltage varies. To reduce the voltage dependence of the capacitance, this paper proposed two types of devices: one is called accumulation MOSFET (AMOS) and the other is formed by two conventional PMOS connected in anti-parallel. These two devices are readily available in the standard digital CMOS processes. The proposed capacitors were implemented in three different CMOS processes. The measured results show that the capacitances of both devices have less voltage dependence than a single PMOS. The voltage dependence of the AMOS capacitance can be as small as 17%. The minimum capacitance per unit area of the AMOS is 1.8 times that of the double-poly capacitor in an analog/mixed-mode CMOS process. To verify the usefulness of these two types of capacitors, they are used as compensation capacitors in a conventional two-stage amplifier. The measured results show that the amplifier compensated by the AMOS capacitor has little variation (6%) of the unity-gain frequency over the input common-mode range. Due to its smaller die area and cheaper digital process, AMOS can be used as compensation capacitor without resorting to more expensive analog process.
We examine a concatenated code which consists of a rate 1/2, 4-state turbo code (an inner code) and a single-parity-check product code (an outer code), and discuss the decoding structure called a double concatenated decoding scheme. From our Monte Carlo simulation trials, we show the advantage of the concatenated codes over turbo codes alone. Specifically, when we use an interleaver of 4096 bits, the Eb/No to obtain a BER of 10-6 is about 1.45 dB for the concatenated code. On the other hand, it is more than 2.5 dB for the turbo code alone. So, the Eb/No improvement can be achieved by about 1 dB. This improvement in Eb/No was also obtained for the interleavers of 8192 and 2048 bits. Therefore, the concatenated codes using a double concatenated decoding scheme can solve the problem of the BER flattening in decoding of turbo codes.
Qing HAN Keizo INAGAKI Kyouichi IIGUSA Robert SCHLUB Takashi OHIRA
Reactive near field reflection characteristics of commercial RF absorbers are investigated to determine the minimum size of a reactive-field anechoic box necessary for measuring the reactive near field of an ESPAR antenna. The reflectivity of the absorber placed in close proximity to an antenna is inversely proportional to the distance between the antenna and the absorber. For carbon filled urethane foam tapered absorbers, we find that the backscattered reflection characteristics mainly depend on their tapered height rather than the thickness of absorber base. As a result, we show that carbon filled urethane foam pyramidal and wave surface shaped absorbers can be used to make reactive-field anechoic boxes. A prototype of a reactive-field anechoic box is presented and the distance from the absorber to the antenna is reduced to a wavelength. The prototype is verified by comparing its performance with that obtained from a large anechoic chamber.
Takeshi KAMIO Hisato FUJISAKA Mititada MORISUE
Associative memories composed of sparsely interconnected neural networks (SINNs) are suitable for analog hardware implementation. However, the sparsely interconnected structure also gives rise to a decrease in the capability of SINNs for associative memories. Although this problem can be solved by increasing the number of interconnections, the hardware cost goes up rapidly. Therefore, we propose associative memories consisting of multilayer perceptrons (MLPs) with 3-valued weights and SINNs. It is expected that such MLPs can be realized at a lower cost than increasing interconnections in SINNs and can give each neuron in SINNs the global information of an input pattern to improve the storage capacity. Finally, it is confirmed by simulations that our proposed associative memories have good performance.
Sang-Hoon LEE Seung-Jun BAE Hong-June PARK
The radix-64 encoding scheme was used to reduce the number of partial products in the 5454 CMOS parallel multiplier. The transistor counts, the chip area and the power-delay product were reduced by 28%, 22%, and 17%, respectively, compared to any of the published 5454 CMOS parallel multipliers. A redundant binary (RB) number system was used to represent any of the 65 multiplying coefficients as a RB number which consists of two of 9 fundamental multiplying coefficients and their complements. The resultant RB partial products were added by using optimized RB adders. The total transistor count of the proposed multiplier was 43,579. The chip area in 0.25 µm CMOS process with 5 metal layers was 0.99 mm2. The power consumption and the multiplication time were 111 mW and 6.9 ns, respectively.
In this paper, a Turbo codec with reduced number of iterations is proposed. By inserting an even parity-check bit every six information bit, the coder can increase the minimum distance of the codewords and the number of iterations is reduced. Furthermore, this codec accommodates automatic repeat request (ARQ) scheme easily.
Masahiro HIRAMOTO Ichiro SATO Masaaki YOKOYAMA
Metal nanostructure of organic/metal interface showing photocurrent multiplication phenomenon more than 105-fold was investigated. Au films deposited on organic films were revealed to be a gathering of nanoparticles and the multiplication rate can be tuned by the particle size. Spatial gaps formed between Au sphere and organic surface, which provide the hole accumulation sites (structural trap), was concluded to be indispensable for the photocurrent multiplication.
Akira TANAKA Hideyuki IMAI Masaaki MIYAKOSHI
Practical image restoration filters usually include a parameter that controls regularizability, trade-off between fidelity of a restored image and smoothness of it, and so on. Many criteria for choosing such a parameter have been proposed. However, the relation between these criteria and the squared error of a restored image, which is usually used to evaluate the restoration performance, has not been theoretically substantiated. Sugiyama and Ogawa proposed the subspace information criterion (SIC) for model selection of supervised learning problems and showed that the SIC is an unbiased estimator of the expected squared error between the unknown model function and an estimated one. They also applied it to restoration of images. However, we need an unbiased estimator of the unknown original image to construct the criterion, so it can not be used for general situations. In this paper, we present a modified version of the SIC as a new criterion for choosing a parameter of image restoration filters. Some numerical examples are also shown to verify the efficacy of the proposed criterion.