For automatic repeat request (ARQ)-aided TSTD (Time Switched Transmit Diversity) system, a receiver sends the acknowledgement signal (ACK or NACK) to a transmitter in order to predict the condition of the channel. In this paper, two antenna switching schemes, in which the NACK trigger the transmit antenna switching in the proposed antenna switching patterns, are proposed for the TSTD with the ARQ in WCDMA LCR-TDD systems. In addition, the system performances are investigated. Simulation results demonstrate that the performances of the TSTD systems can be improved by applying the ARQ scheme. Furthermore, the performances of ARQ-aided TSTD systems may be significantly improved by applying the proposed antenna switching schemes, especially when the mobile's speed is low.
Haibo SU Shijun LIN Yong LI Li SU Depeng JIN Lieguang ZENG
In network tomography, most work to date is based on exploiting probe packet level correlations to infer the link loss rates and delay distributions. Some other work focuses on identifying the congested links using uncorrelated end-to-end measurements and link prior probability of being congested. In their work, the prior probabilities are identified by the matrix inversion with a number of measurement snapshots, and the algorithm to find the congested links is heuristic and not optimal. In this letter, we present a new estimator for the prior probabilities that is computationally simple, being an explicit function of the measurement snapshots. With these prior probabilities, the identification of the congested link set is equivalent to finding the solution for a probability maximization problem. We propose a fast bottom-up approach named FBA to find the solution for this problem. The FBA optimizes the solution step by step from the bottom up. We prove that the solution by the FBA is optimal.
In this letter, we present a route discovery protocol for ad hoc multi-hop cellular networks which uses directional information towards the base station. The proposed protocol, based on the reactive approach, reduces flooding as much as possible. To quantify this, we analyze its performance in terms of how much progress it makes per hop and how much reduction in routing packet number it achieves per route discovery. The analytical, as well as simulation, results demonstrate that the proposed protocol significantly reduces flooding overheads and finds a route to the base station in a robust manner.
Yuichi TANJI Takayuki WATANABE
This paper presents generating stable and sparse reluctance/inductance matrix from the inductance matrix which is extracted under insufficient discretization. To generate the sparse reluctance matrix with guaranteed stability, the original matrix has to be (strictly) diagonally dominant M matrix. Hence, the repeated inductance extractions with a smaller grid size are necessary in order to obtain the well-defined matrix. Alternatively, this paper provides some ideas for generating the sparse reluctance matrix, even if the extracted reluctance matrix is not diagonally dominant M matrix. These ease the extraction tasks greatly. Furthermore, the sparse inductance matrix is also generated by using double inverse methods. Since reluctance components are not still supported in SPICE-like simulators, generating the sparse inductance matrix is more useful than the sparse reluctance one.
Jing HUANG Ying WANG Tong WU Gen LI Ping ZHANG
In this paper, we investigate the antenna and node selection issues for amplify-and-forward (AF) and decode-and-forward (DF) multi-antenna relay networks in correlated channels. Based on the channel statistics, optimal selection criteria for antenna and relay node are derived jointly, aiming to maximize the ergodic capacity. Instantaneous channel knowledge-based selection schemes, motivated by traditional antenna selection algorithms, are investigated as well. It is shown that the proposed node selection schemes derived from antenna selection on relay nodes are feasible and effective in relay systems. Statistical selection shows considerable capacity gain compared to full complexity scheme and random selection strategy in AF mode, while instantaneous selection performs better in DF relaying. Furthermore, the proposed schemes are shown to be robust to channel estimation errors due to their correlation-oriented nature.
Megumi SHIBUYA Tomohiko OGISHI Shu YAMAMOTO
P2P (Peer-to-Peer) file sharing architectures have scalable and cost-effective features. Hence, the application of P2P architectures to media streaming is attractive and expected to be an alternative to the current video streaming using IP multicast or content delivery systems because the current systems require expensive network infrastructures and large scale centralized cache storage systems. In this paper, we investigate the P2P progressive download enabling Internet video streaming services. We demonstrated the capability of the P2P progressive download in both laboratory test network as well as in the Internet. Through the experiments, we clarified the contribution of the FTTH links to the P2P progressive download in the heterogeneous access networks consisting of FTTH and ADSL links. We analyzed the cause of some download performance degradation occurred in the experiment and discussed about the effective methods to provide the video streaming service using P2P progressive download in the current heterogeneous networks.
Kenneth Wing Kin LUI Hing Cheung SO
In this Letter, we explore semi-definite relaxation (SDR) program for finding the real roots of a real polynomial. By utilizing the square of the polynomial, the problem is approximated using the convex optimization framework and a real root is estimated from the corresponding minimum point. When there is only one real root, the proposed SDR method will give the exact solution. In case of multiple real roots, the resultant solution can be employed as an accurate initial guess for the iterative approach to get one of the real roots. Through factorization using the obtained root, the reminding real roots can then be solved in a sequential manner.
Lin WANG Qiang CHEN Qiaowei YUAN Kunio SAWAYA
The modulated scattering antenna array (MSAA) is composed of one normal antenna element and several modulated scattering elements (MSEs). In this paper, a 2-element MSAA is used as the receiving antenna in a 2 2 multiple input multiple output (MIMO) system. MIMO performance of MSAA with various array spacing is measured to investigate the relation between the array spacing and the MIMO performance of the MSAA experimentally in the non-line-of-sight (NLOS) indoor environment. It is found that the error vector magnitude (EVM) and the channel capacity, which reflect MIMO performance, can be affected by the array spacing. The measured results of the MSAA were compared with that of two-dipole antenna array at the same condition.
Atsushi NAGATE Kenji HOSHINO Teruya FUJII
It is important to improve a cell-edge throughput of next generation mobile communication systems. Frequency reuse schemes such as three-cell reuse or fractional frequency reuse are suitable for achieving this goal. Another candidate is multi-link transmission; signals on different sub-carriers from adjacent base stations are received by a mobile. However, the orthogonality of these signals can collapse if a frequency offset between adjacent base stations is excessive; this loss triggers adjacent-channel interference. This paper proposes an interference canceller to solve this problem and confirms the effectiveness of the method through numerical analysis and computer simulations.
Amane MIURA Masataka OHIRA Shoichi KITAZAWA Masazumi UEBA
This paper proposes a new switched-beam eight-sector antenna for multi-gigabit wireless LAN in the 60-GHz band. Our antenna system introduces access-point (AP) and user-terminal (UT) antennas having the same secθ pattern in the elevation plane so that the received signal power at the receiver is kept constant, independent of the position of the UT. For this system, an eight-sector antenna, a single-pole eight-throw (SP8T) switch, and a beam control unit are integrated as the switched-beam eight-sector antenna. The specifications of the antenna are wide bandwidth ( ≥3 GHz), high-gain ( ≥13 dBi at θ =66), and wide coverage area in both azimuth (0 ≤ φ ≤ 180) and elevation planes (0 ≤ θ ≤ 66). The antenna beam is steered within the specified response time (which is short) by the Media Access Control (MAC). In our antenna, both high gain for a wide elevation angle and wide bandwidth are obtained by using the proposed closely spaced waveguide slot array antenna, which is used as each sector of the eight-sector antenna. The SP8T switch with the beam control unit enables 180 beam scan in the azimuth plane. In a component evaluation, the eight-sector antenna achieves a 10-dB return loss bandwidth of 8 GHz with more than 40-dB port-to-port isolation. Radiation characteristics of the eight-sector antenna indicate that it covers 82% of the entire coverage area at the center frequency and that the coverage rate in the operating frequency band is from 78% to 88%. The performance of the SP8T switch and the beam control unit is verified by measuring the insertion loss at all eight ports and the switching response time. In the antenna system evaluation, measurement by using two prototype antennas as the AP and the UT antennas in the usage condition indicates that the measured received signal power meets the specified constant power for the specified wide elevation angle range, independent of the position of the UT. These experimental results verify the effectiveness of our proposed antenna for multi-gigabit WLAN.
Fan JIANG Guijin WANG Chang LIU Xinggang LIN Weiguo WU
Various observation models have been introduced into the object tracking community, and combining them has become a promising direction. This paper proposes a novel approach for estimating the confidences of different observation models, and then effectively combining them in the particle filter framework. In our approach, spatial Likelihood distribution is represented by three simple but efficient parameters, reflecting the overall similarity, distribution sharpness and degree of multi peak. The balance of these three aspects leads to good estimation of confidences, which helps maintain the advantages of each observation model and further increases robustness to partial occlusion. Experiments on challenging video sequences demonstrate the effectiveness of our approach.
IP-- is proposed as an Internet Protocol suitable for optical packet networking. As optical routers require much faster control than electric ones and lack of optical buffers other than those by fiber delay lines requires fixed time control, Internet Protocols must be at least as simple as IPv4 and much simpler than IPv6. IP-- also addresses issues of IP address space exhaustion and IP routing table explosion.
Ming DING Shi LIU Hanwen LUO Wuyang JIANG Jing LV
In this letter, we propose a novel antenna selection algorithm for amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay systems with Zero-Forcing (ZF) processing applied both at the source node and at the destination node. We obtain the optimum antenna selection criterion by deriving an iterative closed-form expression for capacity maximization.
This paper investigates the autonomous decision-making process of the selection of alternative countermeasures against threats in electronic warfare settings. We introduce a threat model, which represents a specific threat pattern, and a methodology that decides the best countermeasure against real-time threats using the decision theory. To determine the optimal countermeasure, we model the probabilities of the effects of countermeasures, if executed, and combine the probabilities with their utilities. This methodology based upon the inductive threat model calculates the expected utilities of countermeasures which are applicable given a situation, and provide an intelligent command and control agent with the best countermeasure to threats. We present empirical results that demonstrate the agent's capabilities of choosing countermeasures to threats in simulated electronic warfare settings.
Takumi UEZONO Kazuya MASU Takashi SATO
A time-slicing ring oscillator (TSRO) which captures time-dependent delay degradation due to periodic transient voltage drop on a power supply network is proposed. An impact of the supply voltage fluctuations, including voltage drop and overshoot, on logic circuit delay is evaluated as a change of oscillation frequency. The TSRO is designed using standard logic cells so that it can be placed almost anywhere in a digital circuit wherein supply voltage fluctuation is concerned. We also propose a new procedure for reconstructing supply voltage waveform. The procedure enables us to accurately monitor time-dependent, effective supply voltages. The -1 dB bandwidth of the TSRO is simulated to be 15.7 GHz, and measured time resolution is 131 ps. Measurement results of a test chip using 90-nm standard CMOS process successfully proved the feasibility of both delay degradation and effective supply voltage fluctuation measurements. Measurement of spatial voltage drop fluctuation is achieved.
Wei-Cheng PAO Yung-Fang CHEN Dah-Chung CHANG
A simple suboptimal power allocation method is proposed for SC-FDMA systems. It is known that the performance of constant power-based allocation methods is close to that of optimal solutions. In this letter, by utilizing the waterfilling condition inequality derived for SC-FDMA systems, a threshold is set to select subcarriers for loading constant power to these selected subcarriers. It offers competitive performance as confirmed by the simulation results.
Guan PANG Guijin WANG Xinggang LIN
Human detection has witnessed significant development in recent years. The introduction of cascade structure and integral histogram has greatly improved detection speed. But real-time detection is still only possible for sparse scan of 320 240 sized images. In this work, we propose a matrix-based structure to reorganize the computation structure of window-scanning detection algorithms, as well as a new pre-processing method called Hierarchical HOG Matrices (HHM) in place of integral histogram. Our speed-up scheme can process 320 240 sized images by dense scan (≈ 12000 windows per image) at the speed of about 30 fps, while maintaining accuracy comparable to the original HOG + cascade method.
Sho SHIMIZU Wouter TAVERNIER Kou KIKUTA Masahiro NISHIDA Daisuke ISHII Satoru OKAMOTO Didier COLLE Mario PICKAVET Piet DEMEESTER Naoaki YAMANAKA
The first global interoperability experiment of GMPLS controlled Ethernet with VLAN tag swapping between two different implementations is successfully demonstrated. High definition video streaming is realized through a newly established Layer 2 Label Switched Path (L2-LSP). The results of this experiment can be applied to designing reliable Layer 2 networks.
The National Institute of Information and Communications Technology (NICT) vision and five network targets of research and development (R&D) of the NeW-Generation Network (NWGN) are presented in this letter. The NWGN is based on new design concepts that look beyond the next generation network (NGN). The NWGN will maintain the sustainability of our prosperous civilization and help resolve various social issues and problems by using information and communication technologies (ICTs). NICT's vision for NWGN is also presented in this letter. Based on this vision, 19 items concerning social issues and future social outlook are analyzed, and the functional requirements of the NWGN are extracted. The requirements are refined and categorized into five network targets that must be developed for realizing the vision.
Many learning machines that have hierarchical structure or hidden variables are now being used in information science, artificial intelligence, and bioinformatics. However, several learning machines used in such fields are not regular but singular statistical models, hence their generalization performance is still left unknown. To overcome these problems, in the previous papers, we proved new equations in statistical learning, by which we can estimate the Bayes generalization loss from the Bayes training loss and the functional variance, on the condition that the true distribution is a singularity contained in a learning machine. In this paper, we prove that the same equations hold even if a true distribution is not contained in a parametric model. Also we prove that, the proposed equations in a regular case are asymptotically equivalent to the Takeuchi information criterion. Therefore, the proposed equations are always applicable without any condition on the unknown true distribution.