Kenta NIWA Takanori NISHINO Kazuya TAKEDA
A sound field reproduction method is proposed that uses blind source separation and a head-related transfer function. In the proposed system, multichannel acoustic signals captured at distant microphones are decomposed to a set of location/signal pairs of virtual sound sources based on frequency-domain independent component analysis. After estimating the locations and the signals of the virtual sources by convolving the controlled acoustic transfer functions with each signal, the spatial sound is constructed at the selected point. In experiments, a sound field made by six sound sources is captured using 48 distant microphones and decomposed into sets of virtual sound sources. Since subjective evaluation shows no significant difference between natural and reconstructed sound when six virtual sources and are used, the effectiveness of the decomposing algorithm as well as the virtual source representation are confirmed.
Recently, there has been growing interest in the design of wireless cooperative protocol to achieve higher diversity-multiplexing tradeoff among single antenna devices. We propose an automatic request for cooperation (ARC) scheme for wireless networks which can achieve higher order diversity by selecting the best relay. In this scheme, a source transmits a data packet towards a destination and a group of relays. The destination tries to decode the information from the source and if the detection is correct the process will stop. Otherwise, the destination transmits an ARC towards the relays. We utilize this ARC signal for selecting the best relay from the set of relays that have successfully decoded the source packet. The selected relay generates and transmits redundant information for the source packet. The destination combines the two packets received from the source and the best relay to improve the reliability of the packet. We analyze the packet error rate, spectral efficiency and diversity-multiplexing tradeoff of our proposal and compare them with some existing protocols. Analysis shows that our proposal can achieve higher diversity multiplexing tradeoff than conventional cooperative protocols.
Peng-Yang HUNG Ying-Shu LOU Yih-Lang LI
This work presents a full-chip RLC crosstalk budgeting routing flow to generate a high-quality routing design under stringent crosstalk constraints. Based on the cost function addressing the sensitive nets in visited global cells for each net, global routing can lower routing congestion as well as coupling effect. Crosstalk-driven track routing minimizes capacitive coupling effects and decreases inductive coupling effects by avoiding placing sensitive nets on adjacent tracks. To achieve inductive crosstalk budgeting optimization, the shield insertion problem can be solved with a minimum column covering algorithm which is undertaken following track routing to process nets with an excess of inductive crosstalk. The proposed routing flow method can identify the required number of shields more accurately, and process more complex routing problems than the linear programming (LP) methods. Results of this study demonstrate that the proposed approach can effectively and quickly lower inductive crosstalk by up to one-third.
Hoon HUR Hyunmyung WOO Won-Young YANG Seungjae BAHNG Youn-Ok PARK Jaekwon KIM
In this letter, we propose a computationally efficient search space for QRM-MLD that is used for spatially multiplexed multiple antenna systems. We perform a set of computer simulations to show that the proposed method achieves a performance that is near to that of the original QRM-MLD, while its computational complexity is near to that of rank-QRM-MLD.
Keiichi TANAKA Akikazu ODAWARA Atsushi NAGATA Yukari BABA Satoshi NAKAYAMA Shigenori AIDA Toshimitsu MOROOKA Yoshikazu HOMMA Izumi NAKAI Kazuo CHINONE
The Transition Edge Sensor (TES)-Energy Dispersive Spectrometer (EDS) is an X-ray detector with high-energy resolution (12.8 eV). The TES can be mounted to a scanning electron microscope (SEM). The TES-EDS is based on a cryogen-free dilution refrigerator. The high-energy resolution enables analysis of the distribution of various elements in samples under low acceleration voltage (typically under 5 keV) by using K-lines of light elements and M lines of heavy elements. For example, the energy of the arsenic L line differs from the magnesium K line by 28 eV. When used to analyze the spore of the Pteris vittata L plant, the TES-EDS clearly reveals a different distribution of As and Mg in the micro region of the plant. The TES-EDS with SEM yields detailed information about the distribution of multi-elements in a sample.
Hideharu KOJIMA Juichi TAKAHASHI Tomoyuki OHTA Yoshiaki KAKUDA
A typical feature of MANETs is that network topology is dynamically changed by node movement. When we execute state transition testing for such protocols, first we draw the Finite State Machine (FSM) with respect to each number of neighbor nodes. Next, we create the state transition matrix from the FSMs. Then, we generate test cases from the state transition matrix. However, the state transition matrix is getting much large because the number of states and the number of transitions increase explosively with increase of the number of neighbor nodes. As a result, the number of test cases increases, too. In this paper, we propose a new method to reduce the number of test cases by using equivalent division method. In this method, we decide a representative input to each state, which is selected from equivalent inputs to the states. By using our proposed method, we can generate state transition matrix which is hard to affect increasing the number of neighbor nodes. As a consequence, the number of test cases can be reduced.
Hung-Min SUN Cheng-Ta YANG Mu-En WU
In some applications, a short private exponent d is chosen to improve the decryption or signing process for RSA public key cryptosystem. However, in a typical RSA, if the private exponent d is selected first, the public exponent e should be of the same order of magnitude as φ(N). Sun et al. devised three RSA variants using unbalanced prime factors p and q to lower the computational cost. Unfortunately, Durfee & Nguyen broke the illustrated instances of the first and third variants by solving small roots to trivariate modular polynomial equations. They also indicated that the instances with unbalanced primes p and q are more insecure than the instances with balanced p and q. This investigation focuses on designing a new RSA variant with balanced p and q, and short exponents d and e, to improve the security of an RSA variant against the Durfee & Nguyen's attack, and the other existing attacks. Furthermore, the proposed variant (Scheme A) is also extended to another RSA variant (Scheme B) in which p and q are balanced, and a trade-off between the lengths of d and e is enable. In addition, we provide the security analysis and feasibility analysis of the proposed schemes.
In this paper, we derive the exact average symbol error probability (SEP) of M-ary phase-shift keying and quadrature amplitude modulation signals over Stacy fading channels. The Stacy fading is modelled by a three-parameter generalized gamma or physically α-µ fading distribution, spanning a wide range of small-scale fading such as Rayleigh, Nakagami-m, and Weibull fading. The average SEP is generally expressed in terms of (generalized) Fox's H-functions, which particularizes to the previously known results for some special cases. We further analyze the diversity order achieved by orthogonal space-time block codes in multiple-input multiple-output (MIMO) Stacy fading channels.
Ik Rae JEONG Jeong Ok KWON Dong Hoon LEE
In 2006, Tanaka has proposed an efficient variant of Maurer-Yacobi's identity-based non-interactive key sharing scheme. In Tanaka's scheme, the computational complexity to generate each user's secret information is much smaller than that of Maurer-Yacobi's scheme. Tanaka's original key sharing scheme does not provide completeness, and so Tanaka has corrected the original scheme to provide completeness. In this paper, we show that Tanaka's corrected key sharing scheme is not secure against collusion attacks. That is, two users can collaborate to factorize a system modulus with their secret information and thus break the key sharing scheme.
Takashi NOSE Makoto TACHIBANA Takao KOBAYASHI
This paper presents methods for controlling the intensity of emotional expressions and speaking styles of an arbitrary speaker's synthetic speech by using a small amount of his/her speech data in HMM-based speech synthesis. Model adaptation approaches are introduced into the style control technique based on the multiple-regression hidden semi-Markov model (MRHSMM). Two different approaches are proposed for training a target speaker's MRHSMMs. The first one is MRHSMM-based model adaptation in which the pretrained MRHSMM is adapted to the target speaker's model. For this purpose, we formulate the MLLR adaptation algorithm for the MRHSMM. The second method utilizes simultaneous adaptation of speaker and style from an average voice model to obtain the target speaker's style-dependent HSMMs which are used for the initialization of the MRHSMM. From the result of subjective evaluation using adaptation data of 50 sentences of each style, we show that the proposed methods outperform the conventional speaker-dependent model training when using the same size of speech data of the target speaker.
Huan CHEN Bo-Chao CHENG Po-Kai TSENG
With quick topology changes due to mobile node movement or signal fading in MANET environments, conventional routing restoration processes are costly to implement and may incur high flooding of network traffic overhead and long routing path latency. Adopting the traditional shortest path tree (SPT) recomputation and restoration schemes used in Internet routing protocols will not work effectively for MANET. An object of the next generation SPT restoration system is to provide a cost-effective solution using an adaptive learning control system, wherein the SPT restoration engine is able to skip over the heavy SPT computation. We proposed a novel SPT restoration scheme, called Cognitive Shortest Path Tree Restoration (CSPTR). CSPTR is designed based on the Network Simplex Method (NSM) and Sensitivity Analysis (SA) techniques to provide a comprehensive and low-cost link failure healing process. NSM is used to derive the shortest paths for each node, while the use of SA can greatly reduce the effort of unnecessary recomputation of the SPT when network topology changes. In practice, a SA range table is used to enable the learning capability of CSPTR. The performance of computing and communication overheads are compared with other two well-known schemes, such as Dijstra's algorithm and incremental OSPF. Results show that CSPTR can greatly eliminate unnecessary SPT recomputation and reduce large amounts of the flooding overheads.
In this paper, we propose a novel Hidden-terminal and Exposed-terminal Interference aware routing metric (HEI-ETT) for Multi-Radio and Multi-Rate wireless mesh networks in which each stationary mesh node is equipped with multi-radio interfaces that relays traffic to the extend networks by using multi-hop transmissions. We have two main design goals for HEI-ETT. First, we will characterize interferences as Hidden-terminal Interference and Exposed-terminal Interference regardless of inter- or intra-flow interference and should take into account both interference effects while computing the path metric. Second, an efficient transmission rate adaptation should be employed in HEI-ETT to enhance the network throughput. We incorporated our metric in well known Optimized Link State Routing protocol version 2 (OLSRv2) which is one of the two standard routing protocols for MANETs and evaluated the performance of our metric by simulation. The results show that our metric outperforms existing metrics such as ETX, ETT and WCETT.
Yousuke NARUSE Jun-ichi TAKADA
We address the issue of MIMO channel estimation with the aid of a priori temporal correlation statistics of the channel as well as the spatial correlation. The temporal correlations are incorporated to the estimation scheme by assuming the Gauss-Markov channel model. Under the MMSE criteria, the Kalman filter performs an iterative optimal estimation. To take advantage of the enhanced estimation capability, we focus on the problem of channel estimation from a partial channel measurement in the MIMO antenna selection system. We discuss the optimal training sequence design, and also the optimal antenna subset selection for channel measurement based on the statistics. In a highly correlated channel, the estimation works even when the measurements from some antenna elements are omitted at each fading block.
In RFID systems, collision resolution is a significant issue in fast tag identification. This letter presents a dynamic frame-slotted ALOHA algorithm that uses a collision factor (DFSA-CF). This method enables fast tag identification by estimating the next frame size with the collision factor in the current frame. Simulation results show that the proposed method reduces slot times Required for RFID identification. When the number of tags is larger than the frame size, the efficiency of the proposed method is greater than those of conventional algorithms.
Optical burst switching (OBS) is a promising approach for the realization of future flexible high-speed optical networks. In particular, a multicast forwarding method for optical bursts is important if an efficient high-speed grid computing network is to be realized. In OBS networks, the number of burst replicas generated at each node is strongly restricted due to optical power impairment of multicast bursts. Moreover, unrestricted replication of multicast bursts at each OBS node may not be advantageous because an increase in the number of multicast bursts within the network causes more frequent deflection forwarding of both multicast and unicast bursts. This paper proposes an efficient hop-by-hop multicast forwarding method for optical bursts, where idle output ports are selected based on scores simply calculated using a routing table that each OBS node holds. This method can mitigate increases in loss rate and transfer delay of multicast bursts, even if the number of burst replicas generated at each OBS node is strongly restricted. Moreover, this method can efficiently mitigate an increase in the number of multicast bursts within the network by avoiding unnecessary replication of multicast bursts at each OBS node. Simulation results show that the proposed method can actually mitigate degradation of the loss rate and transfer delay for multicast bursts under the restricted number of burst replicas at each OBS node. Moreover, when the arrival rate of multicast bursts is large relative to that of unicast bursts, the proposed method is able to improve the loss rates of both multicast and unicast bursts by switching the forwarding method for the multicast bursts to the simple unicast forwarding method without burst replication.
Naohiro KAWABATA Hisao KOGA Osamu MUTA Yoshihiko AKAIWA
As a method to realize a high-speed communication in the home network, the power-line communication (PLC) technique is known. A problem of PLC is that leakage radiation interferes with existing systems. When OFDM is used in a PLC system, the leakage radiation is not sufficiently reduced, even if the subcarriers corresponding to the frequency-band of the existing system are never used, because the signal is not strictly band-limited. To solve this problem, each subcarrier must be band-limited. In this paper, we apply the OQAM based multi-carrier transmission (OQAM-MCT) to a high-speed PLC system, where each subcarrier is individually band-limited. We also propose a pilot-symbol sequence suitable for frequency offset estimation, symbol-timing detection and channel estimation in the OQAM-MCT system. In this method, the pilot signal-sequence consists of a repeated series of the same data symbol. With this method, the pilot sequence approximately becomes equivalent to OFDM sequence and therefore existing pilot-assisted methods for OFDM are also applicable to OQAM-MCT system. Computer simulation results show that the OQAM-MCT system achieves both good transmission rate performance and low out-of-band radiation in PLC channels. It is also shown that the proposed pilot-sequence improves frequency offset estimation, symbol-timing detection and channel estimation performance as compared with the case of using pseudo-noise sequence.
Tetsuyuki MICHIYAMA Yoshio NIKAWA
The body area network (BAN) has attracted attention because of its potential for high-grade wireless communication technology and its safety and high durability. Also, human area transmission of a BAN propagating at an ultra-wide band (UWB) has been demonstrated recently. When considering the efficiency of electromagnetic (EM) propagation inside the human body for BAN and hyperthermia treatment using RF, it is important to determine the mechanism of EM dissipation in the human body. A body heating system for hyperthermia must deposit EM energy deep inside the body. Also, it is important that the EM field generated by the implant system is sufficiently strong. In this study, the specific absorption rate (SAR) distribution is simulated using an EM simulator to consider the biological transmission mechanism and its effects. To utilize the EM field distribution using an implant system for hyperthermia treatment, the SAR distribution inside the human body is simulated. As a result, the SAR distribution is concentrated on the surface of human tissue, the muscle-bolus interface, the pancreas, the stomach, the spleen and the regions around bones. It can also be concentrated in bone marrow and cartilage. From these results, the appropriate location for the implant system is revealed on the basis of the current distribution and differences in the wave impedance of interfacing tissues. The possibility of accurate data transmission and suitable treatment planning is confirmed.
Dong-Chul GO Jong-Moon CHUNG Su Young LEE
An adaptive algorithm to optimize the packet size in wireless mobile networks with Gauss-Markov mobility is presented. The proposed control algorithm conducts adaptive packet size control for mobile terminals that experience relatively fast changing channel conditions, which could be caused by fast mobility or other rapidly changing interference conditions. Due to the fast changing channel conditions, the packet size controller uses short channel history for channel status estimation and takes advantage of a pre-calculated probability density function (PDF) of the distance of the mobile nodes in the estimation process. The packet size is adapted to maximize the communication performance through automatic repeat request (ARQ). The adaptive packet size controlling algorithm is based on an estimation of the channel error rate and the link statistics obtained from the mobility pattern. It was found that the distribution of the link distance among mobile nodes following the Markov-Gauss mobility pattern in a circular communication range well fits the Beta PDF. By adapting the Beta PDF from the mobility pattern, the results show that it is possible to estimate the channel condition more accurately and thereby improve the throughput and utilization performance in rapidly changing wireless mobile networking systems.
JiYing WU QiuQi RUAN Gaoyun AN
A novel bimodal method for face recognition under low-level lighting conditions is proposed. It fuses an enhanced gray level image and an illumination-invariant geometric image at the feature-level. To further improve the recognition performance under large variations in attributions such as poses and expressions, discriminant features are extracted from source images using the wavelet transform-based method. Features are adaptively fused to reconstruct the final face sample. Then FLD is used to generate a supervised discriminant space for the classification task. Experiments show that the bimodal method outperforms conventional methods under complex conditions.
Chien-Sheng CHEN Szu-Lin SU Yih-Fang HUANG
In this paper we present hybrid positioning schemes that combine time of arrival (TOA) and angle of arrival (AOA) measurements from only two base stations (BSs) to locate the mobile station (MS) in non-line-of-sight (NLOS) environments. The proposed methods utilize two TOA circles and two AOA lines to find all the possible intersections to locate the MS without requiring a priori information about the NLOS error. The commonly known Taylor series algorithm (TSA) and the hybrid lines of position algorithm (HLOP) have convergence problems, and the relative positioning between the MS and the BSs greatly affects the location accuracy. The resulting geometry creates a situation where small measurement errors can lead to significant errors in the estimated MS location. Simulation results show that the proposed methods always perform better than TSA and HLOP for different levels of NLOS errors, particularly when the MS/BSs have an undesirable geometric layout.