In this article, a simple structure of the Wilkinson power divider which can suppress the nth harmonics of the Wilkinson power divider is proposed. By replacing the quarter wavelength transmission lines of the conventional Wilkinson power divider with the equivalent P-type transmission lines, a compact power divider which can suppress the nth harmonic is achieved. Design equations of proposed P-type line are achieved by ABCD matrices. To verify the design approach, the proposed power divider is designed, simulated (by ADS, CST Studio, and Sonnet simulators), and fabricated at 1 GHz to suppress the fifth harmonic. The proposed structure is 46% of the conventional Wilkinson power divider, while maintaining the characteristics of the conventional Wilkinson power divider at the fundamental frequency. The insertion losses at the fifth harmonic are larger than 35 dB. Furthermore, the second to seventh harmonic are suppressed by least 10 dB. Here is an excellent agreement between simulated results and measured results.
Fractal structures emerge from statistical and hierarchical processes in urban development or network evolution. In a class of efficient and robust geographical networks, we derive the size distribution of layered areas, and estimate the fractal dimension by using the distribution without huge computations. This method can be applied to self-similar tilings based on a stochastic process.
Some new generalized cyclotomic sequences defined by C. Ding and T. Helleseth are proven to exhibit a number of good randomness properties. In this paper, we determine the defining pairs of these sequences of length pm (p prime, m ≥ 2) with order two, then from which we obtain their trace representation. Thus their linear complexity can be derived using Key's method.
This paper presents a novel time-domain design procedure for fast-settling three-stage nested-Miller compensated (NMC) amplifiers. In the proposed design methodology, the amplifier is designed to settle within a definite time period with a given settling accuracy by optimizing both the power consumption and silicon die area. Detailed design equations are presented and the circuit level simulation results are provided to verify the usefulness of the proposed design procedure with respect to the previously reported design schemes.
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper we generalize the framework to geometric problems. To this end, we think of geometric problems as permutation (or rearrangement) problems of arrays, and define the "presortedness" as a distance from the input array to the desired output array. We call an algorithm adaptive if it runs faster when a given input array is closer to the desired output, and furthermore it does not make use of any information of the presortedness. As a case study, we look into the planar convex hull problem for which we discover two natural formulations as permutation problems. An interesting phenomenon that we prove is that for one formulation the problem can be solved adaptively, but for the other formulation no adaptive algorithm can be better than an optimal output-sensitive algorithm for the planar convex hull problem. To further pursue the possibility of adaptive computational geometry, we also consider constructing a kd-tree.
Tetsuo KIRIMOTO Takeshi AMISHIMA Atsushi OKAMURA
ICA (Independent Component Analysis) has a remarkable capability of separating mixtures of stochastic random signals. However, we often face problems of separating mixtures of deterministic signals, especially sinusoidal signals, in some applications such as radar systems and communication systems. One may ask if ICA is effective for deterministic signals. In this paper, we analyze the basic performance of ICA in separating mixtures of complex sinusoidal signals, which utilizes the fourth order cumulant as a criterion of independency of signals. We theoretically show that ICA can separate mixtures of deterministic sinusoidal signals. Then, we conduct computer simulations and radio experiments with a linear array antenna to confirm the theoretical result. We will show that ICA is successful in separating mixtures of sinusoidal signals with frequency difference less than FFT resolution and with DOA (Direction of Arrival) difference less than Rayleigh criterion.
In this paper, we propose two authenticated key exchange(AKE) protocols and prove their security in the extended Canetti-Krawczyk model. The first protocol, called NAXOS+, is obtained by slightly modifying the NAXOS protocol proposed by LaMacchia, Lauter and Mityagin [15]. We prove its security under the Computational Diffie-Hellman (CDH) assumption by using the trapdoor test introduced in [6]. To the authors' knowledge, this is the first AKE protocol which is secure under the CDH assumption in the eCK model. The second protocol, called NETS, enjoys a simple and tight security reduction compared to existing schemes including HMQV and CMQV without using the Forking Lemma. Since each session of the NETS protocol requires only three exponentiations per party, its efficiency is also comparable to MQV, HMQV and CMQV.
Naohide KAMITANI Hiroki KISHIKAWA Nobuo GOTO Shin-ichiro YANAGIYA
A two-dimensional filter for photonic label recognition system using time-to-space conversion and delay compensation was designed using Genetic-Algorithms (GA). For four-bit Binary Phase Shift Keying (BPSK) labels at 160 Gbit/s, contrast ratio of the output for eight different labels was improved by optimization of two-dimentional filtering. The contrast ratio of auto-correlation to cross-correlation larger than 2.16 was obtained by computer simulation. This value is 22% larger than the value of 1.77 with the previously reported system using matched filters.
Yuji OSAKI Tetsuya HIROSE Kei MATSUMOTO Nobutaka KUROKI Masahiro NUMA
A delay-compensation circuit for low-power subthreshold digital circuits is proposed. Delay in digital circuits operating in the subthreshold region of MOSFETs changes exponentially with process and temperature variations. Threshold-voltage monitoring and supply-voltage scaling techniques are adopted to mitigate such variations. The variation in the delay can be significantly reduced by monitoring the threshold voltage of a MOSFET in each LSI chip and exploiting the voltage as the supply voltage for subthreshold digital circuits. The supply voltage generated by the threshold voltage monitoring circuit can be regarded as the minimum supply voltage to meet the delay constraint. Monte Carlo SPICE simulations demonstrated that a delay-time variation can be improved from having a log-normal to having a normal distribution. A prototype in a 0.35-µm standard CMOS process showed that the exponential delay variation with temperature of the ring-oscillator frequency in the range from 0.321 to 212 kHz can remain by using compensation in the range from 5.26 to 19.2 kHz.
The earlier the stage where we perform low power design, the higher the dynamic power reduction we achieve. In this paper, we focus on reducing switching activity in high-level synthesis, especially, in the problem of functional module binding, bus binding or register binding. We propose an effective low power bus binding algorithm based on the table decomposition method, to reduce switching activity. The proposed algorithm is based on the decomposition of the original problem into sub-problems by exploiting the optimal substructure. As a result, it finds an optimal or close-to-optimal binding solution with less computation time. Experimental results show the proposed method obtains a solution 2.3-22.2% closer to optimal solution than one with a conventional heuristic method, 8.0-479.2 times faster than the optimal one (at a threshold value of 1.0E+9).
Sherihan ABU ELENIN Masato KITAKAMI
Recently, Trust has been recognized as an important factor for Grid computing security. In this paper, we propose a trust model in Grid system. It consists of Application Domain (AD), Client Domain (CD), Resource Domain (RD), and Trust Manager (TM). TM controls the relationship between RD and CD depending on the trust level value of each client and classification of each resource. Performance criteria are makespan and utilization. We evaluated our trust model in six scheduling algorithms in nine scenarios. The simulation results show that the proposed trust model improves the performance in all scheduling algorithms.
Shingo MANDAI Taihei MOMMA Makoto IKEDA Kunihiro ASADA
This paper presents an architecture and a circuit design of readout address compression for a high-speed 3-D range-finding image sensor using the light-section method. We utilize a kind of variable-length code which is modified to suit the 3-D range-finder. The best compression rate by the proposed compression technique is 33.3%. The worst compression and the average compression rate is 56.4% and 42.4%, respectively, when we simulated the effectivity by using the example of measured sheet scans. We also show the measurement result of the fabricated image sensor with the address compression.
Haiming WANG Xiqi GAO Bin JIANG Xiaohu YOU Wei HONG
In this letter, an improved channel estimator for MIMO-SCBT systems is proposed. Pilot blocks are constructed using quadriphase complementary sequences (QCSs) which enable both one-sided (OSD) and two-sided (TSD) channel estimation (CE). And OSD-CE and TSD-CE are combined to provide improved performance in frequency-selective fast and slow fading channels and to maintain low-complexity implementations. Simulation results demonstrate the performance merits of the proposed scheme.
Liming ZHENG Jooin WOO Kazuhiko FUKAWA Hiroshi SUZUKI Satoshi SUYAMA
This paper proposes a low-complexity algorithm to calculate log likelihood ratios (LLRs) of coded bits, which is necessary for channel decoding in coded MIMO mobile communications. An approximate LLR needs to find a pair of transmitted signal candidates that can maximize the log likelihood function under a constraint that a coded bit is equal to either one or zero. The proposed algorithm can find such a pair simultaneously, whereas conventional ones find them individually. Specifically, the proposed method searches for such candidates in directions of the noise enhancement using the MMSE detection as a starting point. First, an inverse matrix which the MMSE weight matrix includes is obtained and then the power method derives eigenvectors of the inverse matrix as the directions of the noise enhancement. With some eigenvectors, one-dimensional search and hard decision are performed. From the resultant signals, the transmitted signal candidates to be required are selected on the basis of the log likelihood function. Computer simulations with 44 MIMO-OFDM, 16QAM, and convolutional codes (rate =1/2, 2/3) demonstrate that the proposed algorithm requires only 1.0 dB more Eb/N0 than that of the maximum likelihood detection (MLD) in order to achieve packet error rate of 10-3, while reducing the complexity to about 0.2% of that of MLD.
Junbin ZHANG Yong QI Di HOU Ming LI
Context-aware applications are a key aspect of pervasive computing. The core issue of context-aware application development is how to make the application behave suitably according to the changing context without coupling such context dependencies in the program. Several programming paradigms and languages have been proposed to facilitate the development, but they are either lack of sufficient flexibility or somewhat complex for programming and deploying. A reference programming model is proposed in this paper to make up inadequacy of those approaches. In the model, virtual tables constructed by system and maintained by space manager connect knowledge of both developer and space manager while separating dependency between context and application logic from base program. Hierarchy and architecture of the model are presented, and implementation suggestions are also discussed. Validation and evaluation show that the programming model is lightweight and easy to be implemented and deployed. Moreover, the model brings better flexibility for developing context-aware applications.
In this letter, we generalize the binary sequence introduced by Li et al. in [S. Q. Li et al., On the randomness generalized cyclotomic sequences of order two and length pq, IEICE Trans. Fund, vol. E90-A, no.9, pp.2037-2041, 2007] to sequence over arbitrary prime fields. Furthermore, the auto-correlation distribution and linear complexity of the proposed sequence are presented.
This letter proposes a dynamic phasor-based apparent impedance measuring method for a single-line-to-ground fault. Using the proposed method, the effects of the decaying DC components on the apparent impedance of a single-line-to-ground fault can be completely removed. Compared with previous works, the proposed method uses less computation to measure an accurate apparent impedance.
Jung-Hoon KIM Hye-Kwang KIM Eugene RHEE Sung-Il YANG
This letter presents the field uniformity characteristics of a triangular prism reverberation chamber. A reverberation chamber that generally uses a stirrer to create a uniform electric field inside is an alternative to the semi-anechoic chamber for an electromagnetic compatibility test. To overcome the size and maintenance problems of a stirrer, we propose to replace it with a Quadratic Residue Diffuser which is commonly used in acoustics. To confirm that the diffuser is a valid alternative to the stirrer, a diffuser and an equilateral triangular prism reverberation chamber are designed and fabricated for 2.3-3.0 GHz operation. To investigate the field uniformity characteristics by varying the location of the transmitting antenna, both simulation and measurement in the triangular prism reverberation chamber were also done at its two positions, respectively. A commercial program XFDTD 6.2, engaging the finite difference time domain (FDTD), is used for simulation and a cumulative probability distribution, which the IEC 61000-4-21 recommends, is used to evaluate the field uniformity. Both simulation and measurement results show that the field uniformity in the chamber satisfies the international standard requirement of 6 dB tolerance and 3dB standard deviation, which means that a diffuser can be substituted for a stirrer.
Zhiyan ZHANG Jianhua ZHANG Wei XU Yanyan ZHANG Yi LIU
In the localized Discrete Fourier Transform-Spread-Orthogonal Frequency Division Multiplexing (DFT-S-OFDM) uplink cooperative system, multiple carrier frequency offsets (MCFO), arising from the nodes' separate oscillators and Doppler spreads, drastically degrade the performance of the receiver. To solve the problem, this letter proposes an efficient MCFO compensation method which fully exploits the diversity gain of space frequency block coded (SFBC) and the characteristic of inter-carrier interference (ICI). Moreover, the bit error ratio (BER) lower bound of the proposed algorithm is theoretically derived. Simulation results validate the theoretical analysis and demonstrate that the proposed MCFO compensation method can achieve robust BER performance in a wide range of MCFO in the multipath Rayleigh fading channel.
Yong-Ju LEE Hag-Young KIM Cheol-Hoon LEE
Infrastructure-as-a-Service (IaaS) cloud computing is emerging as a viable alternative to the acquisition and management of physical resources. The new main feature of IaaS cloud computing is the virtual machine (VM) technology which improves the flexibility of resource management. VMs use virtual machine images that are preconfigured and ready to run. Typically, VM image management uses local file copy and distribution via a network file system (NFS). This potentially means that a more efficient method can be used for VM image distribution. For efficient VM image management, we have designed and implemented a BitTorrent-based network block device (namely, BitNBD) for provisioning VM images in IaaS clouds. The BitNBD mainly provides a 'split read/write mechanism' to deal with concurrent VM instances where the same pieces of a VM are shared. With respect to the legacy BitTorrent protocol, the BitNBD enhances the piece picker policy and energy-saving mode. It is very effective in minimizing VM startup delays and providing a hibernating capability.