In this paper, a 65 nm 1.2 V 7-bit 1GSPS folding-interpolation A/D converter with a digitally self-calibrated vector generator is proposed. The folding rate is 2 and the interpolation rate is 8. A self-calibrated vector generation circuit with a feedback loop and a recursive digital code inspection is described. The circuit reduces the variation of the offset voltage caused by process mismatches, parasitic resistors, and parasitic capacitances. The chip has been fabricated with a 65 nm 1-poly 6-metal CMOS technology. The effective chip area is 0.87 mm2 and the power consumption is about 110 mW with a 1.2 V power supply. The measured SNDR is about 39.1 dB when the input frequency is 250 MHz at a 1 GHz sampling frequency. The measured SNDR is drastically improved in comparison with the same ADC without any calibration.
Yoo Rhee OH Yong Guk KIM Mina KIM Hong Kook KIM Mi Suk LEE Hyun Joo BAE
In this paper, we propose a text corpus design method for a Korean stereo super-wideband speech database. Since a small-sized text corpus for speech coding is generally required for speech coding, the corpus should be designed to comply with the pronunciation behavior of natural conversation in order to ensure efficient speech quality tests. To this end, the proposed design method utilizes a similarity measure between the phoneme distribution occurring from natural conversation and that from the designed text corpus. In order to achieve this goal, we first collect and refine text data from textbooks and websites. Next, a corpus is designed from the refined text data based on the similarity measure to compare phoneme distributions. We then construct a Korean stereo super-wideband speech (K-SW) database using the designed text corpus, where the recording environment is set to meet the conditions defined by ITU-T. Finally, the subjective quality of the K-SW database is evaluated using an ITU-T super-wideband codec in order to demonstrate that the K-SW database is useful for developing and evaluating super-wideband codecs.
Naoto YANAI Eikoh CHIDA Masahiro MAMBO
Verifying the signing order is sometimes very important in multisignature schemes. A multisignature scheme in which the signing order can be verified is called structured multisignature scheme and many such schemes have been proposed so far. However, there are not many structured multisignature schemes utilizing an algebraic structure of underlying algebraic operation. Ohmori, Chida, Shizuya and Nishizeki have proposed a structured multisignature scheme by utilizing a non-commutative ring homomorphism. Since their scheme does not fully reflect the structure of signers and its rigorous security analysis is not provided, we construct an improved structured multisignature scheme overcoming these problems by utilizing the non-commutative ring homomorphism in a different way and discuss its rigorous security against various attacks, including signer structure forgery, rogue key attack and attack-0 under the discrete logarithm assumption. As far as we know, the scheme in [30], which does not use non-commutative ring homomorphism, guarantees the most rigorous security but the number of signers is restricted in order to prevent attack-0. In contrast, our scheme overcomes attack-0 by virtue of a ring homomorphism and no restriction is imposed on the number of signers.
Naoki KANAYAMA Tadanori TERUYA Eiji OKAMOTO
In the present paper, we propose elliptic curve scalar multiplication methods on pairing-friendly elliptic curves. The proposed method is efficient on elliptic curves on which Atei pairing or optimal pairing is efficiently computed.
Oren ELIEZER Robert Bogdan STASZEWSKI
Digital RF solutions have been shown to be advantageous in various design aspects, such as accurate modeling, design reuse, and scaling when migrating to the next CMOS process node. Consequently, the majority of new low-cost and feature cell phones are now based on this approach. However, another equally important aspect of this approach to wireless transceiver SoC design, which is instrumental in allowing fast and low-cost productization, is in creating the inherent capability to assess performance and allow for low-cost built-in calibration and compensation, as well as characterization and final-testing. These internal capabilities can often rely solely on the SoCs existing processing resources, representing a zero cost adder, requiring only the development of the appropriate algorithms. This paper presents various examples of built-in measurements that have been demonstrated in wireless transceivers offered by Texas Instruments in recent years, based on the digital-RF processor (DRPTM) technology, and highlights the importance of the various types presented; built-in self-calibration and compensation, built-in self-characterization, and built-in self-testing (BiST). The accompanying statistical approach to the design and productization of such products is also discussed, and fundamental terms related with these, such as 'soft specifications', are defined.
We analyze linear channel estimation for MIMO-OFDM systems and propose a spherical linear interpolator in closed-form for the beamforming codewords. We also suggest a hybrid interpolator using a simplified version of the derived interpolator. Simulation results show that the proposed schemes are efficient and competitive with respect to the feedback overhead and have low complexity.
Yongqiang LIU Qing CHANG Huagang XIONG
Vehicle routing is an important combinatorial optimization problem. In real transport networks,the travel speed and travel time of roads have large time-variability and randomness. The study of vehicle routing problem in time-dependent network has even more practical value than static network VRP problem. This paper combines the features of time-dependent networks and gives the mathematical models of the time-dependent vehicle routing problem. On this basis, the traditional ant colony optimization algorithm is improved. A new path transfer strategy of ants and new dynamic pheromone update strategy applicable to time-dependent network are proposed. Based on these strategies, the improved ant colony algorithm is given for solving the vehicle routing problem in time-dependent networks. The simulation results show that the algorithm can effectively solve the vehicle routing problem in time-dependent network and has better computational efficiency and convergence speed.
Due to the reuse factor reduction, the attendant increase in co-channel interference (CCI) becomes the limiting factor in the performance of the orthogonal frequency division multiplexing (OFDM) based cellular systems. In the previous work, we proposed the least mean square-blind joint maximum likelihood sequence estimation (LMS-BJMLSE) algorithm, which is effective for CCI cancellation in OFDM systems with only one receive antenna. However, LMS-BJMLSE requires a long training sequence (TS) for channel estimation, which reduces the transmission efficiency. In this paper, we propose a subcarrier identification and interpolation algorithm, in which the subcarriers are divided into groups based on the coherence bandwidth, and the slowest converging subcarrier in each group is identified by exploiting the correlation between the mean-square error (MSE) produced by LMS and the mean-square deviation (MSD) of the desired channel estimate. The identified poor channel estimate is replaced by the interpolation result using the adjacent subcarriers' channel estimates. Simulation results demonstrate that the proposed algorithm can reduce the required training sequence dramatically for both the cases of single interference and dual interference. We also generalize LMS-BJMLSE from single antenna to receiver diversity, which is shown to provide a huge improvement.
Jinjia ZHOU Dajiang ZHOU Gang HE Satoshi GOTO
In this paper, we present a cache based motion compensation (MC) architecture for Quad-HD H.264/AVC video decoder. With the significantly increased throughput requirement, VLSI design for MC is greatly challenged by the huge area cost and power consumption. Moreover, the long memory system latency leads to performance drop of the MC pipeline. To solve these problems, three optimization schemes are proposed in this work. Firstly, a high-performance interpolator based on Horizontal-Vertical Expansion and Luma-Chroma Parallelism (HVE-LCP) is proposed to efficiently increase the processing throughput to at least over 4 times as the previous designs. Secondly, an efficient cache memory organization scheme (4S×4) is adopted to improve the on-chip memory utilization, which contributes to memory area saving of 25% and memory power saving of 3949%. Finally, by employing a Split Task Queue (STQ) architecture, the cache system is capable of tolerating much longer latency of the memory system. Consequently, the cache idle time is saved by 90%, which contributes to reducing the overall processing time by 2440%. When implemented with SMIC 90 nm process, this design costs a logic gate count and on-chip memory of 108.8 k and 3.1 kB respectively. The proposed MC architecture can support real-time processing of 3840×2160@60 fps with less than 166 MHz.
Liang LI Akira ASANO Chie MURAKI ASANO Mitsuji MUNEYASU Yoshiko HANADA
A method of estimating dual primitives in a textural image is proposed. This method is based on the Primitive, Grain, and Point Configuration (PGPC) texture model, which regards a texture as an arrangement of grains derived from one or a few primitives. Appropriate primitives can be represented by morphological structuring elements estimated from a texture. Conventional primitive estimation methods estimate only one primitive from each textural image. However, they do not work well on textural images that contain more than one basic structure, since two or more types of grain cannot be generated from only one primitive. The proposed method simultaneously estimates two optimal structuring elements of a texture. The experimental results show that the proposed method provides more representative estimations than the conventional method.
This paper introduces a practical color filter array (CFA) interpolation technique. Among the many technologies proposed in this field, the inter-color methods that exploit correlation between color planes generally outperform the intra-color approaches. We have found that the filtering direction, e.g., horizontal or vertical, is among the most decisive factors for the performance of the CFA interpolation. However, most of the state-of-the-art technologies are not flexible enough in determining the filtering direction. For example, filtering only in the upper direction is not usually supported. In this context, we propose an inter-color CFA interpolation using a local map called unified geometry map (UGM). In this method, the filtering direction is determined based on the similarity of the local map data. Thus, it provides more choices of the filtering directions, which enhances the probability of finding the most appropriate direction. It is confirmed through simulations that the proposal outperforms the state-of-the-art algorithms in terms of objective quality measures. In addition, the proposed scheme is as inexpensive as the conventional methods with regard to resource consumption.
We present a simple technique for enhancing multi-modal images. The unsharp masking (UM) is at first nonlinearized to prevent halos around large edges. This edge-preserving UM is then extended to cross-sharpening of multi-modal images where a component image is sharpened with the aid of more clear edges in another component image.
Yong-Kyu KIM Chang-Seok CHOI Hanho LEE
This paper presents a low complexity partially folded architecture of transposed FIR filter and cubic B-spline interpolator for ATSC terrestrial broadcasting systems. By using the multiplexer, the proposed FIR filter and interpolator can provide high clock frequency and low hardware complexity. A binary representation method was used for designing the high order FIR filter. Also, in order to compensate the truncation error of FIR filter outputs, a fixed-point range detection method was used. The proposed partially folded architecture was designed and implemented with 90-nm CMOS technology that had a supply voltage of 1.1 V. The implementation results show that the proposed architectures have 12% and 16% less hardware complexity than the other kinds of architecture. Also, both the filter and the interpolator operate at a clock frequency of 200 MHz and 385 MHz, respectively.
Naoki MATSUDA Hirotaka OKABE Masaki FUJII Masayoshi MATSUI Yusuke AYATO Akiko TAKATSU Kenji KATO
In situ observation of the adsorption process and the states of cytochrome c on glass/solution interfaces, and the functionality of the reduction reaction of adsorbed cytochorome c were performed by using slab optical waveguide (SOWG) spectroscopy. The peak position of the absorption band of cytochorome c adsorbed on a bare glass surface was almost the same as that of that in solution. The cytochorome c adsorbed on glass/solution interface was reduced by sodium dithionite solution. The adsorbed cytochorome c was still maintained its functionality after immobilization.
Bingbing ZHUANG Hiroshi NAGAMOCHI
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two different plane embeddings of a rooted outerplanar graphs are called symmetric copies. Given integers n ≥ 3 and g ≥ 3, we give an O(n)-space and O(1)-time delay algorithm that generates all biconnected rooted outerplanar graphs with exactly n vertices such that the size of each inner face is at most g without delivering two symmetric copies of the same graph.
Seong-Hyun JANG Yeong-Sam KIM Sang-Hoon YOON Jong-Wha CHONG
In this letter, we analyze the effect of the size of observed data on the performance of time delay estimation (TDE) in the chirp spread spectrum (CSS) system. By adjusting the size of observed data, we reduce the effect of DC offsets, which would otherwise degrade the performance of TDE based on CSS, and we optimize the performance of TDE in CSS system. Finally, we derive the optimal size of observed data of TDE in CSS system.
Eiji ITOH Yuji HIGUCHI Daisuke FURUHATA
We investigated the photovoltaic properties of multilayered devices consisting of ITO/oxide/Tetraphenyl porphyrin (H2TPP)/Fullerene (C60)/Bathocuproine (BCP)/Al structures. The VOC markedly increases with the insertion of NiO and MoO3 hole collection layers. However, the "kink" behaviors and temperature dependent properties are observed for the devices with and without MoO3 especially for the thick H2TPP film. We demonstrated the analysis of the photovoltaic properties using the Poole-Frenkel and Schottky models based on the dielectric behaviors of porphyrin and MoO3 layers.
Hao NI Dongju LI Tsuyoshi ISSHIKI Hiroaki KUNIEDA
It is theoretically impossible to restore the original fingerprint image from a sequence of line images captured by a line sensor. However, in this paper we propose a unique fingerprint-image-generation algorithm, which derives fingerprint images from sequences of line images captured at different swipe speeds by the line sensor. A continuous image representation, called trajectory, is used in modeling distortion of raw fingerprint images. Sequences of line images captured from the same finger are considered as sequences of points, which are sampled on the same trajectory in N-dimensional vector space. The key point here is not to reconstruct the original image, but to generate identical images from the trajectory, which are independent of the swipe speed of the finger. The method for applying the algorithm in a practical application is also presented. Experimental results on a raw fingerprint image database from a line sensor show that the generated fingerprint images are independent of swipe speed, and can achieve remarkable matching performance with a conventional minutiae matcher.
The nanoporosity installed in conjugated polymer films prepared by electrophoretic deposition makes it difficult to measure the amount of polymer deposited on a substrate. Here, an alternative approach, the estimation of material efficiency of the electrophoretic deposition from the optical absorption spectra of the residual suspensions has been studied. The ultimate recovery rate, which becomes smaller in suspensions with lower acetonitrile content, does not depend on the deposition voltage. The light scattering by the colloidal particles seems to be absent in residual suspensions after a deposition long enough to reach the ultimate recovery rate, indicating the exhaustion of the colloidal particles. Although the deposition rate of the polymer markedly lowers upon coating of the deposition electrode with PEDOT, the ultimate recovery rate remains unchanged. These results suggest that the material efficiency in this deposition method is limited by the generation rate of the colloidal particles in the suspension.
In this paper we unveil basic properties of a code Γq for digital fingerprinting based on a projective plane of order q. We consider a situation where a coalition of malicious users generates a pirated digital content in which a binary sequence w is embedded subject to the marking assumption. Here, the size of the coalition is assumed to be less than or equal to a known constant c ≥ 2. We evaluate the number of candidates of the coalition that can also generate w subject to the marking assumption. It is shown that the number of such candidates is completely determined as a function of w for the case of c = 2. In addition, we give a sufficient condition under which all the malicious users are correctly identified from w for the case of c ≥ 3. Relationships between Γq and other existing classes of codes are discussed as well.