With simultaneous multi-user transmissions, spatial division multiple access (SDMA) provides substantial throughput gain over the single user transmission. However, its implementation in WLANs with contention-based IEEE 802.11 MAC remains challenging. Problems such as coordinating and synchronizing the multiple users need to be solved in a distributed way. In this paper, we propose a distributed MAC protocol for WLANs with SDMA support. A dual-mode CTS responding mechanism is designed to accomplish the channel estimation and user synchronization required for SDMA. We analytically study the throughput performance of the proposed MAC, and dynamic parameter adjustment is designed to enhance the protocol efficiency. In addition, the proposed MAC protocol does not rely on specific physical layer realizations, and can work on legacy IEEE 802.11 equipment with slight software updates. Simulation results show that the proposed MAC outperforms IEEE 802.11 significantly, and that the dynamic parameter adjustment can effectively track the load variation in the network.

This paper proposes a technique for detecting the occurrences of refactoring from source code revisions. In a real software development process, a refactoring operation may sometimes be performed together with other modifications at the same revision. This means that detecting refactorings from the differences between two versions stored in a software version archive is not usually an easy process. In order to detect these impure refactorings, we model the detection within a graph search. Our technique considers a version of a program as a state and a refactoring as a transition between two states. It then searches for the path that approaches from the initial to the final state. To improve the efficiency of the search, we use the source code differences between the current and the final state for choosing the candidates of refactoring to be applied next and estimating the heuristic distance to the final state. Through case studies, we show that our approach is feasible to detect combinations of refactorings.

A novel modal signal decoupling algorithm for multi-coupled transmission lines is developed. Since the proposed method exploits a set of basis vectors associated with the characteristic impedances of the transmission line system, these multi-coupled signals can be efficiently decoupled regardless of dielectric media and conductors. Thus, compact forms of the signal integrity verification CAD models for multi-coupled transmission lines can be readily determined. It is shown that the analytical models are in excellent agreement with those obtained with SPICE simulation and its computation time is much faster than the conventional macro model (W-model) in the order of two.

We demonstrated an automated passive-transmission-line routing tool for single-flux-quantum (SFQ) circuits. The tool is based on the A* algorithm, which is widely used in CMOS LSI design, and tuned for microstrip/strip lines formed in the SRL 4-Nb layer structure. In large-scale SFQ circuits with 10000-20000 Josephson junctions, such as microprocessors, 80-90% of the wires can be automatically routed in about ten minutes. We verified correct operation above 40 GHz for an automatically routed 44 switch circuit from on-chip high-speed tests. The resulting circuit size and operating frequency were comparable to those of a manually designed result. We believe that the tool is useful for large-scale SFQ circuit design using conventional fabrication processes.

Nonlinear distortions in power amplifiers (PAs) generate spectral regrowth at the output, which causes interference to adjacent channels and errors in digitally modulated signals. This paper presents a novel method to evaluate adjacent channel leakage power ratio (ACPR) and error vector magnitude (EVM) from the amplitude-to-amplitude (AM/AM) and amplitude-to-phase (AM/PM) characteristics. The transmitted signal is considered to be complex Gaussian distributed in orthogonal frequency-division multiplexing (OFDM) systems. We use the Mehler formula to derive closed-form expressions of the PAs output power spectral density (PSD), ACPR and EVM for memoryless PA and memory PA respectively. We inspect the derived relationships using an OFDM signal in the IEEE 802.11a WLAN standard. Simulation results show that the proposed method is appropriate to predict the ACPR and EVM values of the nonlinear PA output in OFDM systems, when the AM/AM and AM/PM characteristics are known.

Density ratio estimation has gathered a great deal of attention recently since it can be used for various data processing tasks. In this paper, we consider three methods of density ratio estimation: (A) the numerator and denominator densities are separately estimated and then the ratio of the estimated densities is computed, (B) a logistic regression classifier discriminating denominator samples from numerator samples is learned and then the ratio of the posterior probabilities is computed, and (C) the density ratio function is directly modeled and learned by minimizing the empirical Kullback-Leibler divergence. We first prove that when the numerator and denominator densities are known to be members of the exponential family, (A) is better than (B) and (B) is better than (C). Then we show that once the model assumption is violated, (C) is better than (A) and (B). Thus in practical situations where no exact model is available, (C) would be the most promising approach to density ratio estimation.

This paper describes diffusion of electric vehicles and novel social infrastructure from the viewpoint of systems innovation theory considering both human society aspects and elemental technological aspects. Firstly, fundamentals of the systems innovation theory and the platform theory are mentioned. Secondly, discussion on mobility from the viewpoint of the human-society layer and discussion of electrical vehicles from the viewpoint of the elemental techniques are carried out. Thirdly, based on those, R & D, measures are argued such as establishment of the ubiquitous noncontact feeding and authentication payment system is important. Finally, it is also insisted that after the establishment of this system the super smart grid with temporal and spatial control including demand itself with the low social cost will be expected.

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.

In this letter we propose a novel resource allocation and admission control strategy for OFDMA-based emerging LTE systems. Considering users' reneging and migration between service providers, we first prove that the optimal resource allocation problem, which maximizes the service provider's gross income is, NP-complete. Subsequently, we propose two different heuristics based on dynamic programming and greedy algorithms to get a near-optimal resource allocation and admission control strategy in computationally feasible time. Simulation results point out that the solutions offer increased gross income of the service provider, while offering low latency, adequate throughput and session acceptance.

The current Internet is not capable of meeting the future communication requirements of society, i.e., reliable connectivity in a ubiquitous networking environment. The shortcomings of the Internet are due to the lack of support for mobility, multihoming, security and heterogeneous network layer protocols in the original design. Therefore, to provide ubiquitous networking facilities to the society for future innovation, we have to redesign the future Internet, which we call the New Generation Network. In this paper, we present the Heterogeneity Inclusion and Mobility Adaptation through Locator ID Separation (HIMALIS) architecture for the New Generation Network. The HIMALIS architecture includes a new naming scheme for generating host names and IDs. It also includes a logical control network to store and distribute bindings between host names, IDs, locators and other information useful for providing support for network operation and control. The architecture uses such information to manage network dynamism (i.e., mobility, multihoming) and heterogeneity in network layer protocols. We verify the basic functions of the architecture by implementing and testing them using a testbed system.

Performance of band-limited baseband synchronous CDMA using orthogonal Independent Component Analysis (ICA) spreading sequences is investigated. The orthogonal ICA sequences have an orthogonality condition in a synchronous CDMA like the Walsh-Hadamard sequences. Furthermore, these have useful correlation properties like the Gold sequences. These sequences are obtained easily by using the ICA which is one of the brain-style signal processing algorithms. In this study, the ICA is used not as a separator for received signal but as a generator of spreading sequences. The performance of the band-limited synchronous CDMA using the orthogonal ICA sequences is compared with the one using the Walsh-Hadamard sequences. For limiting bandwidth, a Root Raised Cosine filter (RRC) is used. We investigate means and variances of correlation outputs after passing the RRC filter and the Bit Error Rates (BERs) of the system in additive white Gaussian noise channel by numerical simulations. It is found that the BER in the band-limited system using the orthogonal ICA sequences is much lower than the one using the Walsh-Hadamard sequences statistically.

A cooperative relaying system with transmission scheduling is investigated. Cooperative relaying is composed of multiple links because the source sends the data to more than one receiver, and the destination receives multiple data transmitted by more than one transmitter. Therefore, if the source can transmit the data when the channel gains of the links are high, it is not clear which channel gains should be high in order to achieve high spectral efficiency. In the present letter, the spectral efficiency of a cooperative relaying system is theoretically derived under the assumption that the source transmits the data only when the channel gains of links are above certain threshold values. Numerical results reveal that a high spectral efficiency can be achieved by assuring a high channel gain for the link with the highest average received power among links to the destination.

One Super Hi-Vision (SHV) 4k4k@60 fps fractional motion estimation (FME) engine is proposed in our paper. Firstly, two complexity reduction schemes are proposed in the algorithm level. By analyzing the integer motion cost of sub blocks in each inter mode, the mode reduction based mode pre-filtering scheme can achieve 48% clock cycle saving compared with previous algorithm. By further check the motion cost of search points around best integer candidate, the motion cost oriented directional one-pass scheme can provide 50% clock cycle saving and 36% reduction in the number of processing units (PU). Secondly, in the hardware level, two parallel improved schemes namely 16-Pel processing and MB-parallel scheme are given out in our paper, which reduces design effort to only 145 MHz for SHV FME processing. Also, quarter sub-sampling is adopted in our design and 75% hardware cost is reduced for each PU. Thirdly, one unified pixel block loading scheme is proposed. About 28.67% to 86.39% pixels are reused and the related memory access is saved. Furthermore, we also give out one parity pixel organization scheme to solve memory access conflict of MB-parallel scheme. By using TSMC 0.18 µm technology in worst work conditions (1.62 V, 125), our FME engine can achieve real-time processing for SHV 4k4k@60 fps with 412k gates hardware.

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.

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.

Cooperative transmission protocols attract a great deal of attention in recent years as an efficient way to increase the capacity of multi-hop wireless networks in fading environments. In this paper, we propose and analyze a cooperative transmission method, called Cooperative-Aided Skipping multi-Hop protocol (CASH), for multi-hop wireless networks with Rayleigh fading environments. For performance evaluation, we compare and verify the results of the theoretical analysis with the results of simulations.

Introducing adaptive online data compression at network-internal nodes is considered for alleviating traffic congestion on the network. In this paper, we assume that advanced relay nodes, which possess both a relay function (network resource) and a processing function (computational and storage resources), are placed inside the network, and we propose an adaptive online lossless packet compression scheme utilized at these nodes. This scheme selectively compresses a packet according to its waiting time in the queue during congestion. Through preliminary investigation using actual traffic datasets, we investigate the compression ratio and processing time of packet-by-packet compression in actual network environments. Then, by means of computer simulations, we show that the proposed scheme reduces the packet delay time and discard rate and investigate factors necessary in achieving efficient packet relay.

A technique for reducing the footprints of HMM-based speech synthesis systems by tying all covariance matrices of state distributions is described. HMM-based speech synthesis systems usually leave smaller footprints than unit-selection synthesis systems because they store statistics rather than speech waveforms. However, further reduction is essential to put them on embedded devices, which have limited memory. In accordance with the empirical knowledge that covariance matrices have a smaller impact on the quality of synthesized speech than mean vectors, we propose a technique for clustering mean vectors while tying all covariance matrices. Subjective listening test results showed that the proposed technique can shrink the footprints of an HMM-based speech synthesis system while retaining the quality of the synthesized speech.

This paper proposes an efficient fingerprint recognition algorithm combining phase-based image matching and feature-based matching. In our previous work, we have already proposed an efficient fingerprint recognition algorithm using Phase-Only Correlation (POC), and developed commercial fingerprint verification units for access control applications. The use of Fourier phase information of fingerprint images makes it possible to achieve robust recognition for weakly impressed, low-quality fingerprint images. This paper presents an idea of improving the performance of POC-based fingerprint matching by combining it with feature-based matching, where feature-based matching is introduced in order to improve recognition efficiency for images with nonlinear distortion. Experimental evaluation using two different types of fingerprint image databases demonstrates efficient recognition performance of the combination of the POC-based algorithm and the feature-based algorithm.

The rate-distortion optimization (RDO) method in the H.264/AVC encoder is an informative technology that improves the coding efficiency, but increases the computational complexity. In this letter, a fast Intra mode decision algorithm using DCT (Discrete Cosine Transform) coefficients distribution is proposed to reduce the H.264 encoder complexity. The proposed method reduces the encoder complexity on average 63.44%, while the coding efficiency is slightly decreased compared with the H.264/AVC encoder.