Han-Ok CHOI Yeon-Joong KIM Dongjin HAN Sunshin AN
Today's market share of Intelligent Network (IN) service is growing rapidly in wireless networks due to the rapid advances in wireless telecommunication and IN technology. To guarantee network independent IN services, mobility of IN service subscribers has to be taken into account. This paper proposes new designs of Global Service Logic for the IN service enhancement, which increase call completion rates in wired and wireless intelligent networks. In order to apply this logic to wireless service subscribers as well as wired service subscribers, we implement a Queue Manager applied to the call queuing service feature in the Service Control Point (SCP). In the case of wireless service subscribers, the Home Location Register (HLR) handles the service registration flags to notify the Queue Manager of the corresponding service subscribers' mobility. In addition, we present a dynamic queue management mechanism, which dynamically manages the queue size based on the parallel server queuing model as the wireless subscribers roam the service groups due to their mobility characteristics. In order to determine the queue size allocated by the dynamic queue manager, we simulate the relationship between the number of the subscriber's terminals and the drop rate by considering the service increment rate. Moreover, the appropriate waiting time in the queue as required is simulated according to the above relationship. We evaluate call completion rates of the proposed mechanism in the paper by comparing to that of the existing mechanism.
A simple phase compensation technique with improved power supply rejection ratio (PSRR) for CMOS opamps is proposed. This technique is based on feeding back a current proportional to a derivative of the voltage difference between an output and an input, and does not require a common-gate circuit or a noise-free bias for the circuit. The proposed technique requires only two additional transistors, which are connected to the differential pair of transistors in a cascade manner, and the compensation capacitor is connected to the source node of the additional transistor. Experimental results show an improvement of more than 20 dB in the PSRR at high frequencies, comparing the technique with a Miller compensation. This technique also improves the unity gain frequency and the phase margin from 0.9 MHz and 17 to 1.8 MHz and 44 for 200 pF load capacitance, respectively.
Hiroshi HASEGAWA Masao KASUGA Shuichi MATSUMOTO Atsushi KOIKE
HRTFs (head-related transfer functions) are available for sound field reproduction with spatial fidelity, since HRTFs involve the acoustic cues such as interaural time difference, interaural intensity difference and spectral cues that are used for the perception of the location of a sound image. Generally, FIR filters are used in the simulation of HRTFs. However, this method is not useful for a simply system, since the orders of the FIR filters are high. In this paper, we propose a method using IIR filter for simply realization of sound image localization. The HRTFs of a dummy-head were approximated by the following filters: (A) fourth to seventh-order IIR filters and (B) third-order IIR filters. In total, the HRTFs of 24 different directions on the horizontal plane were used as the target characteristics. Sound localization experiments for the direction and the elevation angle of a sound image were carried out for 3 subjects in a soundproof chamber. The binaural signal sounds using the HRTFs simulated by FIR filters and approximated by IIR filters (A) and (B) were reproduced via two loudspeakers, and sound image localization on the horizontal plane was realized. As the result of the experiments, the sound image localization using the HRTFs approximated by IIR filters (A) is the same accuracy as the case of using the FIR filters. This result shows that it is possible to create sound fields with binaural reproduction more simply.
Takeshi MATSUDA Yoshifumi NISHIO Yoshihiro YAMAGAMI Akio USHIDA
We propose here a time-domain shooting algorithm for calculating the steady-state responses of nonlinear RF circuits containing parasitic elements that is based on both a modified Newton and a secant methods. Bipolar transistors and MOSFETs in ICs have small parasitic capacitors among their terminals. We can not neglect them because they will gives large effects to the shooting algorithm at the high frequency. Since our purpose is to develop a user friendly simulator, we mainly take into account the relatively large normal capacitors such as coupling and/or by-pass capacitors and so on, because the parasitic capacitors are usually smaller and contained in the device models. We have developed a very simple simulator only using the fundamental tools of SPICE, which can be applied to relatively large scale ICs, efficiently.
Software radio has emerged as a focus of both academic research and commercial development for future wireless systems. This paper briefly reviews the foundation concepts of the software radio. It then characterizes the tradeoffs among core software-radio technologies. Object-oriented analysis leads to the definition of the radio reference platform and the related layered object-oriented architecture supporting simultaneous hardware and software evolution. Research issues include layering, tunneling, virtual machines and intelligent agents.
Hiroshi KUBO Atsushi IWASE Makoto MIYAKE
This paper proposes a survivor-correction Viterbi algorithm (SCVA) and presents its application to an iterative sequence estimation in order to improve bit error rate performance of decision-feedback sequence estimation (DFSE) in the presence of intersymbol interference. The SCVA can mitigate erroneous survivor selections due to DFSE, because it modifies the add-compare-select operation to an add-correct-compare-select operation. Finally, it is confirmed by computer simulation that complexity of the proposed scheme is independent of delay of the main delayed ray and its performance is superior to that of DFSE at the same number of states.
Norio MATSUFURU Kouji NISHIMURA Reiji AIBARA
In this paper, we study efficient scheduling algorithms that are suitable for ATM networks. In ATM networks, all packets have a fixed small length of 53 bytes and they are transmitted at very high rate. Thus time complexity of a scheduling algorithm is quite important. Most scheduling algorithms proposed so far have a complexity of O(log N) per packet, where N denotes the number of connections sharing the link. In contrast, weighted round robin (WRR) has the advantage of having O(1) complexity; however, it is known that its delay property gets worse as N increases. To solve this problem, in this paper we propose two new variants of WRR, uniform round robin (URR) and idling uniform round robin (I-URR). Both disciplines provide end-to-end delay and fairness bounds which are independent of N. Complexity of URR, however, slightly increases as N increases, while I-URR has complexity of O(1) per packet. I-URR also works as a traffic shaper, so that it can significantly alleviate congestion on the network. We also introduce a hierarchical WRR discipline (H-WRR) which consists of different WRR servers using I-URR as the root server. H-WRR efficiently accommodates both guaranteed and best-effort connections, while maintaining O(1) complexity per packet. If several connections are reserving the same bandwidth, H-WRR provides them with delay bounds that are close to those of weighted fair queueing.
We report on a novel micromechanical photonic integrated circuits (PIC) for integrating free-space optical systems on a chip. Using polysilicon surface-micromachining technique, micro-optical elements, three-dimensional optomechanical structures, and microactuators are monolithically integrated on silicon substrate. We will discuss the basic building blocks of the micromechanical PIC, including XYZ micropositioners, 2-axis tilting micromirrors, scanning microlenses, and their integration with vertical cavity surface-emitting lasers. We will also discuss their applications in reconfigurable optical interconnect and active alignment in parallel free-space optical interconnect systems.
Teruhiko KUDOU Kenji SHIMIZU Yuuji TAKIMOTO Takeshi OZEKI
We propose a novel Bragg grating filter synthesis method using a Fourier transform of the target scattering matrix. Multiple scattering processes are taken into account by iteration to improve the synthesis accuracy.
Takafumi AOKI Ichiro KITAORI Tatsuo HIGUCHI
This paper presents a constant-scale-factor radix-2-4-8 CORDIC algorithm for fast vector rotation and sine/cosine computation. The CORDIC algorithm is a well-known hardware algorithm for computing various elementary functions. Due to its sequential nature of computation, however, significant reduction in processing latency is required for real-time signal processing applications. The proposed radix-2-4-8 CORDIC algorithm dynamically changes the radix of computation during operation, and makes possible the reduction in the number of iterations by 37% for 64-bit precision. This paper also describes the hardware implementation of radix-2-4-8 CORDIC unit that can be installed into practical digital signal processors.
Tracking many targets simultaneously using a search radar has been one of the major research areas in radar signal processing. The primary difficulty in this problem arises from the noise characteristics of the incoming data. Hence it is crucial to obtain an accurate association between targets and noisy measurements in multi-target tracking. We introduce a new scheme for optimal data association, based on a MAP approach, and thereby derive an efficient energy function. Unlike the previous approaches, the new constraints between targets and measurements can manage the cases of target missing and false alarm. Presently, most algorithms need heuristic adjustments of the parameters. Instead, this paper suggests a mechanism that determines the parameters in an automated manner. Experimental results, including PDA and NNF, show that the proposed method reduces position errors in crossing trajectories by 32.8% on the average compared to NNF.
Kazuo IKEDA Yoshiaki NEMOTO Takayasu SHIOKAWA
Interference suppression is one of the important functions for mobile communications and software radio. First, this paper shows a new type of interference suppression method by P-RCE (Probability-Restricted Coulomb Energy) which is applicable to mobile communications and software radio. P-RCE is one of the neural networks and mainly used in the field of pattern classification. Secondly, this paper presents several characteristics of this method. For example, it is found from our studies that good suppression effects can be performed even when the interference signals exist closely adjacent to the desired signal and/or total number of signals is more than that of the antenna elements. Next, this paper discusses two types of improvement of processing speed for new suppression method. One is the setting up the learning and non-learning intervals, and the other is the restriction of the number of prototype cells. According to the results, fairly good improvement is realized.
Ming-Hsien CHOU Krishnan R. PARAMESWARAN Martin M. FEJER Igal BRENER
We present three-wave mixing devices useful for signal processing functions in WDM and TDM systems, including wavelength conversion, spectral inversion, and gated mixing. These mixers exhibit extremely wide bandwidth, low noise, high efficiency, and format transparency.
Taking traveling salesman problems (TSPs) as examples of combinatorial optimization problems, an "optimal" Hopfield network for ("optimal" neural representation of) TSPs is presented, where a vertex of state hypercube of the network is asymptotically stable if and only if it is an optimal solution. Of all the Hopfield networks for TSPs, this network most sharply distinguishes an optimal solution from other nonoptimal solutions and infeasible solutions. In this sense, we call this network "optimal" for TSPs. Whenever the network converges to a vertex, we can always obtain an optimal solution. However, we can not design such network without knowing an optimal solution to the problem. So, its approximate realization, which can be designed without a-priori knowledge of an optimal solution, is proposed. Simulations show that the "optimal" network and its approximate realization obtain optimal or good feasible solutions more frequently than familiar Hopfield networks. We can also design such "optimal" Hopfield networks for many combinatorial optimization problems as well as for TSPs.
Toshinori TAKABATAKE Keiichi KANEKO Hideo ITO
In this paper, a new network structure called generalized Hierarchical Completely-Connected networks (HCCs) is proposed, and its properties and features are evaluated. Simple routing strategies for HCCs are also developed for shortest-paths routing algorithms. A set of HCCs constructed by the proposed method includes some conventional hierarchical networks, then it is called generalized one. The construction of an HCC starts from a basic block (a level-1 block) which consists of n nodes of constant degree. Then a level-h block for h 2 is constructed recursively by interconnecting any pair of macro nodes (n level-(h-1) blocks) completely. An HCC has a constant node-degree regardless of an increase in its size (the number of nodes). Furthermore, since an HCC has a hierarchically structured topology and the feature of uniformity, a wide variety of inter-cluster connections is possible. Evaluation results show that an HCC is suitable for very large computer systems.
A rigorous modal approach based on the transmission-line description has developed to explore effectively the filtering characteristics of planar optical DFB guiding structures. Using the modal transmission-line theory, the leakage and filtering characteristics of metal-strip gratings and dielectric gratings with gain or loss are first evaluated in details at the first- and third-order Bragg regimes. It can thus serve as a powerful template for computational algorithms to determine systematically and rigorously the optical effects of multilayered periodic guiding structures, which are not readily obtained by other methods.
Koichi AKIYAMA Nobuyuki TOMITA Yoshinori NOMURA Toshiro ISU Hajime ISHIHARA Kikuo CHO
We demonstrate a large nonlinear optical response of GaAs thin films using degenerate four-wave mixing (DFWM) with picosecond pulses. The obtained DFWM signal is thickness-dependent and peaks at around 110 nm. The nonlocal theory fully explains these results.
Cheol-Young PARK Koji NAKAJIMA
In this paper, we propose the majority algorithm to choose the connection weights for the neural networks with quantized connection weights of 1 and 0. We also obtained the layered network to solve the parity problem with the input of arbitrary number N through an application of this algorithm. The network can be expected to have the same ability of generalization as the network trained with learning rules. This is because it is possible to decide the connection weights, regardless of the size of the training set. One can decide connection weights without learning according to our case study. Thus, we expect that the proposed algorithm may be applied for a real-time processing.
This article shows a Boolean Multivalued logical model of varying confirmation by observation of events in human inference and, as an introductory example, applies the model to solve Hempel's paradox of the ravens.
Songyot SUREERATTANAN Huynh Ngoc PHIEN
A new algorithm is proposed for improving the convergence of backpropagtion networks. This algorithm is obtained by combining the conjugate gradient method and the Kalman filter algorithm. Simulation results show that the proposed algorithm can perform satisfactorily in all cases considered.