A low-voltage quadrature up-conversion CMOS mixer for 5-GHz wireless communication applications is designed with a TSMC 0.18-µm process. The fold-switching technique is used to implement the low-voltage double balanced quadrature mixer. A miniature lumped-element microwave broadband rat-race hybrid and RLC shift network are used for the local oscillator and the intermediate frequency port design, respectively. The measured results demonstrate that the mixer can reach a high conversion gain, a low noise figure (NF), and a high linearity. The mixer exhibits improvement in noise, conversion gain, and image rejection. The mixer shows a conversion gain of 16 dB, a noise figure of 12.8 dB, an image rejection of 45 dB, while dissipating 15.5 mW for an operating voltage at 1 V.

We consider the problem of fast identification of high-rate flows in backbone links with possibly millions of flows. Accurate identification of high-rate flows is important for active queue management, traffic measurement and network security such as detection of distributed denial of service attacks. It is difficult to directly identify high-rate flows in backbone links because tracking the possible millions of flows needs correspondingly large high speed memories. To reduce the measurement overhead, the deterministic 1-out-of-k sampling technique is adopted which is also implemented in Cisco routers (NetFlow). Ideally, a high-rate flow identification method should have short identification time, low memory cost and processing cost. Most importantly, it should be able to specify the identification accuracy. We develop two such methods. The first method is based on fixed sample size test (FSST) which is able to identify high-rate flows with user-specified identification accuracy. However, since FSST has to record every sampled flow during the measurement period, it is not memory efficient. Therefore the second novel method based on truncated sequential probability ratio test (TSPRT) is proposed. Through sequential sampling, TSPRT is able to remove the low-rate flows and identify the high-rate flows at the early stage which can reduce the memory cost and identification time respectively. According to the way to determine the parameters in TSPRT, two versions of TSPRT are proposed: TSPRT-M which is suitable when low memory cost is preferred and TSPRT-T which is suitable when short identification time is preferred. The experimental results show that TSPRT requires less memory and identification time in identifying high-rate flows while satisfying the accuracy requirement as compared to previously proposed methods.

Inductive theorem proving plays an important role in the field of formal verification of systems. The rewriting induction (RI) is a method for inductive theorem proving proposed by Reddy. In order to obtain successful proofs, it is very important to choose appropriate contexts (such as in which direction each equation should be oriented) when applying RI inference rules. If the choice is not appropriate, the procedure may diverge or the users have to come up with several lemmas to prove together with the main theorem. Therefore we have a good reason to consider parallel execution of several instances of the rewriting induction procedure, each in charge of a distinguished single context in search of a successful proof. In this paper, we propose a new procedure, called multi-context rewriting induction, which efficiently simulates parallel execution of rewriting induction procedures in a single process, based on the idea of the multi-completion procedure. By the experiments with a well-known problem set, we discuss the effectiveness of the proposed procedure when searching along various contexts for a successful inductive proof.

A composite right/left-handed (CRLH) transmission line with demultiplexing property is proposed towards short-range functional wireless interconnects. The CRLH line is designed by analyzing dispersion relation of the microstrip line having a split-ring and a double-stub structure to realize frequency selective properties for leaky wave radiation. A prototype device is fabricated and estimated to study feasibility of the demultiplexing operation around ten GHz.

In this work, a divide-by-2 injection locked frequency divider (ILFD) operating in the V-band with a low DC power consumption has been developed in a commercial 0.13-µm Si RFCMOS technology. The bias current path was separated from the injection signal path, which enabled a small supply voltage of 0.5 V, leading to a DC power consumption of only 0.31 mW. To the authors' best knowledge, this is the lowest power consumption reported for mm-wave ILFDs at the point of writing. All inductors and interconnection lines were designed based on EM (electromagnetic) simulator for precise prediction of circuit performance. With varactor tuning voltage ranged for 0-1.2 V, the free-running oscillation frequency varied from 27.43 to 28.06 GHz. At 0 dBm input power, the frequency divider exhibited a locking range of 5.8 GHz from 53 to 58.8 GHz without external tuning mechanism. The fabricated circuit size is 0.72 mm 0.62 mm including the RF and DC supply pads.

Quantum cryptography reaches a decisive phase to innovate secure communications technology beyond a subject reserved for scientists. Every core technology of quantum cryptography should be unified with photonic network technology and contemporary cryptography to realize secure photonic network. As another important avenue, new quantum crypto-schemes taking every merit of known schemes and quantum node technology for fully quantum networking must be pursued for new generation quantum cryptography.

We exhibit a simple procedure to find how classical signals should be processed in cluster-state quantum computation. Using stabilizers characterizing a cluster state, we can easily find a precise classical signal-flow that is required in performing cluster-state computation.

Quantum key distribution (QKD) systems can generate unconditionally secure common keys between remote users. Improvements of QKD performance, particularly in key generation rate, have been required to meet current network traffic. A high-speed QKD system should be equipped with low-loss receivers with high visibility, highly efficient photon detectors with small dark count probability. A solution to these issues is to employ planar lightwave circuit (PLC) interferometers, single photon detection circuits and modules, together with multi-wavelength channels transmission using wavelength division multiplexing (WDM) technique.

We propose a new speech enhancement method suitable for mobile devices used in the presence of various types of noise. In order to achieve high-performance speech recognition and auditory perception in mobile devices, various types of noise have to be removed under the constraints of a space-saving microphone arrangement and few computational resources. The proposed method can reduce both the directional noise and the diffuse noise under the abovementioned constraints for mobile devices by employing a square microphone array and conducting low-computational-cost processing that consists of multiple null beamforming, minimum power channel selection, and Wiener filtering. The effectiveness of the proposed method is experimentally verified in terms of speech recognition accuracy and speech quality when both the directional noise and the diffuse noise are observed simultaneously; this method reduces the number of word errors and improves the log-spectral distances as compared to conventional methods.

Quantum key distribution (QKD) is a way to securely expand the secret key to be used in One-time pad, and it is attracting great interest from not only theorists but also experimentalists or engineers who are aiming for the actual implementations. In this paper, we review the theoretical aspect of QKD, especially we focus on its security proof, and we briefly mention the possible problems and future directions.

In this paper, an efficient radio resource allocation scheme for OFDMA systems is proposed, which follows two steps to take care of real-time traffic characterized with multi-level delay constraints. Urgent packets, those with imminent deadlines, are released first in step 1. After that the remaining channel resources are managed in such a way that overall throughput is maximized at Step 2. In this work, 2-dimensional diversity over multiple sub-bands and multiple users are jointly considered. The proposed scheme is compared with existing schemes designed for real-time traffic such as Exponential Scheduling (EXP) scheme, Modified Largest Weighted Delay First (M-LWDF) scheme, and Round robin scheme in terms of the packet discard probability and throughput. Numerical results show that the proposed scheme performs much better than the aforementioned ones in terms of the packet discard probability, while slightly better in terms of throughput.

Histogram equalization is the most popular method for image enhancement. However it has some drawbacks: i) it causes undesirable artifacts and ii) it can degrade the visual quality. To overcome the drawbacks, in this letter, multi-histogram equalization on smoothed histogram using a Gaussian kernel is proposed. To demonstrate the effectiveness, the method is tested on several images and compared with conventional methods.

The proportionate normalized least mean square algorithm (PNLMS) greatly improves the convergence of the sparse impulse response. It exploits the shape of the impulse response to decide the proportionate step gain for each coefficient. This is not always suitable. Actually, the proportionate step gain should be determined according to the difference between the current estimate of the coefficient and its optimal value. Based on this idea, an approach is proposed to determine the proportionate step gain. The proposed approach can improve the convergence of proportionate adaptive algorithms after a fast initial period. It even behaves well for the non-sparse impulse response. Simulations verify the effectiveness of the proposed approach.

Traditional double auction protocols only concern the price information of participants without considering their QoS requirements, which makes them unsuitable for the service grid. In this paper we first introduce QoS information into double auction to present the QoS-enabled Double Auction Protocol (QDAP). QDAP tries to assign the asks which have the least candidate bids firstly to make more participants trade and provides QoS guarantee at the same time. Simulation experiments have been performed to compare QDAP with two traditional double auction protocols and the result shows that QDAP is more suitable for the service grid.

Quantum cryptography has become a subject of widespread interest. In particular, quantum key distribution, which provides a secure key agreement by using quantum systems, is believed to be the most important application of quantum cryptography. Quantum key distribution has the potential to achieve the "unconditionally" secure infrastructure. We also have many cryptographic tools that are based on "modern cryptography" at the present time. They are being used in an effort to guarantee secure communication over open networks such as the Internet. Unfortunately, their ultimate efficacy is in doubt. Quantum key distribution systems are believed to be close to practical and commercial use. In this paper, we discuss what we should do to apply quantum cryptography to our communications. We also discuss how quantum key distribution can be combined with or used to replace cryptographic tools based on modern cryptography.

Silicon-quantum-dots (Si-QDs) with an areal density as high as 1012 cm - 2 were self-assembled on thermally-grown SiO2 by low pressure CVD using Si2H6, in which OH-terminated SiO2 surface prior to the Si CVD was exposed to GeH4 to create nucleation sites uniformly. After thermal oxidation of Si-QDs surface, two-dimensional electronic transport through the Si-QDs array was measured with co-planar Al electrodes evaporated on the array surface. Random telegraph signals were clearly observed at constant applied bias conditions in dark condition and under light irradiation at room temperature. The result indicates the charging and discharging of a dot adjacent to the percolation current path in the dots array.

In this paper, we propose four new general constructions of LCZ/ZCZ sequence sets based on interleaving technique and affine transformations. A larger family of LCZ/ZCZ sequence sets with longer period are generated by these constructions, which are more flexible among the selection of the alphabet size, the period of the sequences and the length of LCZ/ZCZ, compared with those generated by the known constructions. Especially, two families of the newly constructed sequences can achieve or almost achieve the theoretic bound.

We have studied transmission property of electron in vertical MOSFET (V-MOSFET) from the viewpoint of quantum electro-dynamics. To obtain the intuitive picture of electron transmission property through channel of the V-MOSFET, we solve the time-dependent Schrodinger equation in real space by employing the split operator method. We injected an electron wave packet into the body of the V-MOSFET from the source, and traced the time-development of electron-wave function in the body and drain region. We successfully showed that the electron wave function propagates through the resonant states of the body potential. Our suggested approaches open the quantative and intuitive discussion for the carrier dynamics in the V-MOSFET on quantum limit.

In this paper, we show that the termination and the innermost termination properties are decidable for the class of term rewriting systems (TRSs for short) all of whose dependency pairs are right-linear and right-shallow. We also show that the innermost termination is decidable for the class of TRSs all of whose dependency pairs are shallow. The key observation common to these two classes is as follows: for every TRS in the class, we can construct, by using the dependency-pairs information, a finite set of terms such that if the TRS is non-terminating then there is a looping sequence beginning with a term in the finite set. This fact is obtained by modifying the analysis of argument propagation in shallow dependency pairs proposed by Wang and Sakai in 2006. However we gained a great benefit that the resulted procedures do not require any decision procedure of reachability problem used in Wang's procedure for shallow case, because known decidable classes of reachability problem are not larger than classes discussing in this paper.

A dependency structure interprets modification relationships between words or phrases and is recognized as an important element in semantic information analysis. With the conventional approaches for extracting this dependency structure, it is assumed that the complete sentence is known before the analysis starts. For spontaneous speech data, however, this assumption is not necessarily correct since sentence boundaries are not marked in the data. Although sentence boundaries can be detected before dependency analysis, this cascaded implementation is not suitable for online processing since it delays the responses of the application. To solve these problems, we proposed a sequential dependency analysis (SDA) method for online spontaneous speech processing, which enabled us to analyze incomplete sentences sequentially and detect sentence boundaries simultaneously. In this paper, we propose an improved SDA integrating a labeling-based sentence boundary detection (SntBD) technique based on Conditional Random Fields (CRFs). In the new method, we use CRF for soft decision of sentence boundaries and combine it with SDA to retain its online framework. Since CRF-based SntBD yields better estimates of sentence boundaries, SDA can provide better results in which the dependency structure and sentence boundaries are consistent. Experimental results using spontaneous lecture speech from the Corpus of Spontaneous Japanese show that our improved SDA outperforms the original SDA with SntBD accuracy providing better dependency analysis results.