Jun HUANG Yoshiaki TANAKA Yan MA
Multicast routing with Quality-of-Service (QoS) guarantees is the key to efficient content distribution and sharing. Developing QoS-aware multicast routing algorithm is an important open topic. This paper investigates QoS-aware multicast routing problem with K constraints where K > 2. The contributions made in this paper include a heuristic that employs the concept of nonlinear combination to extend the existing well-known algorithm for fast computation of a QoS multicast tree, and a Fully Polynomial Time Approximation Scheme (FPTAS) to approximate a multicast routing tree with QoS guarantees. The theoretical analyses and simulations conducted on both algorithms show that the algorithms developed in this paper are general and flexible, thus are applicable to the various networking systems.
Yohei MORISHITA Noriaki SAITO Koji TAKINAMI Kiyomichi ARAKI
The Direct Sampling Mixer (DSM) with a complex coefficient transfer function is demonstrated. The operation theory and the detail design methodology are discussed for the high order complex DSM, which can achieve large image rejection ratio by introducing the attenuation pole at the image frequency band. The proposed architecture was fabricated in a 65 nm CMOS process. The measured results agree well with the theoretical calculation, which proves the validity of the proposed architecture and the design methodology. By using the proposed design method, it will be possible for circuit designers to design the DSM with large image rejection ratio without repeated lengthy simulations.
A user identity anonymity is an important property for roaming services. In 2011, Kang et al. proposed an improved user authentication scheme that guarantees user anonymity in wireless communications. This letter shows that Kang et al.'s improved scheme still cannot provide user anonymity as they claimed.
Young-Sik EOM Jong Wook KWAK Seong Tae JHANG Chu Shik JHON
In Chip Multi-Processors (CMPs), private L2 caches have potential benefits in future CMPs, e.g. small access latency, performance isolation, tile-friendly architecture and simple low bandwidth on-chip interconnect. But the major weakness of private cache is the higher cache miss rate caused by small private cache capacity. To deal with this problem, private caches can share capacity through spilling replaced blocks to other private caches. However, indiscriminate spilling can make capacity problem worse and influence performance negatively. This letter proposes throttling capacity sharing (TCS) for effective capacity sharing in private L2 caches. TCS determines whether to spill a replaced block by predicting reuse possibility, based on life time and reuse time. In our performance evaluation, TCS improves weighted speedup by 48.79%, 6.37% and 5.44% compared to non-spilling, Cooperative Caching with best spill probability (CC) and Dynamic Spill-Receive (DSR), respectively.
Hongyan WANG Guisheng LIAO Jun LI Liangbing HU Wangmei GUO
In this paper, we consider the problem of waveform optimization for multi-input multi-output (MIMO) radar in the presence of signal-dependent noise. A novel diagonal loading (DL) based method is proposed to optimize the waveform covariance matrix (WCM) for minimizing the Cramer-Rao bound (CRB) which improves the performance of parameter estimation. The resulting nonlinear optimization problem is solved by resorting to a convex relaxation that belongs to the semidefinite programming (SDP) class. An optimal solution to the initial problem is then constructed through a suitable approximation to an optimal solution of the relaxed one (in a least squares (LS) sense). Numerical results show that the performance of parameter estimation can be improved considerably by the proposed method compared to uncorrelated waveforms.
Power consumption due to transmissions in base stations (BSs) has been a major contributor to communication-related CO2 emissions. A power optimization model is developed in this study with respect to radio resource allocation and activation in a multiple Component Carrier (CC) environment. We formulate and solve the power-minimization problem of the BS transceivers for multiple-CC networks with carrier aggregation, while maintaining the overall system and respective users' utilities above minimum levels. The optimized power consumption based on this model can be viewed as a lower bound of that of other algorithms employed in practice. A suboptimal scheme with low computation complexity is proposed. Numerical results show that the power consumption of our scheme is much better than that of the conventional one in which all CCs are always active, if both schemes maintain the same required utilities.
It is well known that Boolean functions used in stream and block ciphers should have high algebraic immunity to resist algebraic attacks. Up to now, there have been many constructions of Boolean functions achieving the maximum algebraic immunity. In this paper, we present several constructions of rotation symmetric Boolean functions with maximum algebraic immunity on an odd number of variables which are not symmetric, via a study of invertible cyclic matrices over the binary field. In particular, we generalize the existing results and introduce a new method to construct all the rotation symmetric Boolean functions that differ from the majority function on two orbits. Moreover, we prove that their nonlinearities are upper bounded by .
Junqi ZHANG Lina NI Chen XIE Shangce GAO Zheng TANG
This paper presents an inertial estimator learning automata scheme by which both the short-term and long-term perspectives of the environment can be incorporated in the stochastic estimator – the long term information crystallized in terms of the running reward-probability estimates, and the short term information used by considering whether the most recent response was a reward or a penalty. Thus, when the short-term perspective is considered, the stochastic estimator becomes pertinent in the context of the estimator algorithms. The proposed automata employ an inertial weight estimator as the short-term perspective to achieve a rapid and accurate convergence when operating in stationary random environments. According to the proposed inertial estimator scheme, the estimates of the reward probabilities of actions are affected by the last response from environment. In this way, actions that have gotten the positive response from environment in the short time, have the opportunity to be estimated as “optimal”, to increase their choice probability and consequently, to be selected. The estimates become more reliable and consequently, the automaton rapidly and accurately converges to the optimal action. The asymptotic behavior of the proposed scheme is analyzed and it is proved to be ε-optimal in every stationary random environment. Extensive simulation results indicate that the proposed algorithm converges faster than the traditional stochastic-estimator-based S ERI scheme, and the deterministic-estimator-based DGPA and DPRI schemes when operating in stationary random environments.
Roderick Jaehoon WHANG Sherlie PORTUGAL Intae HWANG Huaping LIU
Cooperative relaying, while effective in mitigating fading effects, might reduce the overall network throughput since its overhead such as additional time slot and frequency band can be significant. In order to overcome this problem, this paper proposes a superposition coding based cooperative relay scheme to provide reliable transmission with little or no overhead. This scheme exploits the superimposed messages for users in the network to achieve the simultaneous transmission of two or more independent data streams. This scheme reduces the number of transmission phases to the same as that of conventional cooperative relay schemes. The symbol error performance of the proposed scheme is analyzed and simulated.
Bin SONG Haixiao LIU Hao QIN Jie QIN
A direct inter-mode selection algorithm for P-frames in fast homogeneous H.264/AVC bit-rate reduction transcoding is proposed in this paper. To achieve the direct inter-mode selection, we firstly develop a low-complexity distortion estimation method for fast transcoding, in which the distortion is directly calculated from the decoded residual together with the reference frames. We also present a linear estimation method to approximate the coding rate. With the estimated distortion and rate, the rate-distortion cost can be easily computed in the transcoder. In our algorithm, a method based on the normalized rate difference of P-frames (RP) is used to detect the high motion scene. To achieve fast transcoding, only for the P-frames with RP larger than a threshold, the rate-distortion optimized (RDO) mode decision is performed; meanwhile, the average cost of each inter-mode (ACM) is calculated. Then for the subsequent frames transcoding, the optimal coding mode can be directly selected using the estimated cost and the ACM threshold. Experiments show that the proposed method can significantly simplify the complex RDO mode decision, and achieve transcoding time reductions of up to 62% with small loss of rate-distortion performance.
Takashi NAGAMATSU Yukina IWAMOTO Ryuichi SUGANO Junzo KAMAHARA Naoki TANAKA Michiya YAMAMOTO
We have proposed a novel geometric model of the eye in order to avoid the problems faced while using the conventional spherical model of the cornea for three dimensional (3D) model-based gaze estimation. The proposed model models the eye, including the boundary region of the cornea, as a general surface of revolution about the optical axis of the eye. Furthermore, a method for calculating the point of gaze (POG) on the basis of our model has been proposed. A prototype system for estimating the POG was developed using this method. The average root mean square errors (RMSEs) of the proposed method were experimentally found to be smaller than those of the gaze estimation method that is based on a spherical model of the cornea.
Yechao BAI Xinggan ZHANG Lan TANG Yao WEI
The lateral velocity is of importance in cases like target identification and traffic management. Conventional Doppler methods are not capable of measuring lateral velocities since they quantify only the radial component. Based on the spectrogram characteristic of laterally moving targets, an algorithm based on fractional Fourier transform has been studied in the signal processing literature. The algorithm searches the peak position of the transformation, and calculates the lateral velocity from the peak position. The performance analysis of this algorithm is carried out in this paper, which shows that this algorithm approaches Cramer-Rao bound with reasonable computational complexity. Simulations are conducted at last to compare the analytical performance and the experimental result.
Takayuki NISHIO Ryoichi SHINKUMA Tatsuro TAKAHASHI Narayan B. MANDAYAM
Conventional mechanisms proposed for enhancing quality of service (QoS) in 802.11 networks suffer from a lack of backward compatibility and fairness with and to legacy devices. In this paper, we present a cooperative mechanism, called TXOP (transmission opportunity) Exchange, that provides a legacy-neutral solution in which only stations (STAs) participating in TXOP Exchange cooperatively use their available bandwidth to satisfy their required throughputs, while other legacy devices continue to get the same throughput performance as before. Specifically, we discuss the implementation of TXOP Exchange in legacy 802.11 networks. We show that this mechanism can be realized with minor modifications to the RTS (request-to-send) frames of only the STAs participating in TXOP Exchange and without any replacement of legacy access points or STAs. We show an example of a proportional fair algorithm for fair and efficient MAC cooperation using a Nash bargaining solution (NBS). A simulation study using a realistic simulator verifies that the TXOP Exchange mechanism ensures legacy neutrality and fair and efficient cooperation even when a large number of legacy STAs coexist.
Lechang LIU Takayasu SAKURAI Makoto TAKAMIYA
A 315 MHz power-gated ultra low power transceiver for wireless sensor network is developed in 40 nm CMOS. The developed transceiver features an injection-locked frequency multiplier for carrier generation and a power-gated low noise amplifier with current second-reuse technique for receiver front-end. The injection-locked frequency multiplier implements frequency multiplication by edge-combining and thereby achieves 11 µW power consumption at 315 MHz. The proposed low noise amplifier achieves the lowest power consumption of 8.4 µW with 7.9 dB noise figure and 20.5 dB gain in state-of-the-art designs.
We propose a 2Nr MIMO ARQ scheme that uses multi-strata space-time codes composed of two layers. The phase and transmit power of each layer are assigned adaptively at each transmission round to mitigate the inter-layer interference and improve the block error rate by retransmission. Simulation results show that the proposed scheme achieves better performance than the conventional schemes in terms of the throughput and the block error rate.
Toru SAI Shoko SUGIMOTO Yasuhiro SUGIMOTO
We propose a fast and precise transient response and frequency characteristics simulation method for switching converters. This method uses a behavioral simulation tool without using a SPICE-like analog simulator. The nonlinear operation of the circuit is considered, and the nonlinear function is realized by defining the nonlinear formula based on the circuit operation and by applying feedback. To assess the accuracy and simulation time of the proposed simulation method, we designed current-mode buck and boost converters and fabricated them using a 0.18-µm high-voltage CMOS process. The comparison in the transient response and frequency characteristics among SPICE, the proposed program on a behavioral simulation tool which we named NSTVR (New Simulation Tool for Voltage Regulators) and experiments of fabricated IC chips showed good agreement, while NSTVR was more than 22 times faster in transient response and 85 times faster in frequency characteristics than SPICE in CPU time in a boost converter simulation.
Keiichi MIZUTANI Takehiro MIYAMOTO Kei SAKAGUCHI Kiyomichi ARAKI
This paper develops the first prototype hardware for a TDD two-way multi-hop relay network with MIMO network coding. Since conventional wireless multi-hop relay networks have the drawback of low data rate, TDD two-way multi-hop relay networks have been studied as a solution to realize high data rate recently. In these networks, forward and backward streams are spatially multiplexed by using interference cancellation techniques such as MIMO beamforming or MIMO network coding. In this paper, a demonstration system for the TDD two-way multi-hop relay network with MIMO network coding (called 2-way relay network hereafter) is developed using the prototype hardware. In the demonstration system, each transmitter and receiver performs network coded broadcast and MIMO multiple access, respectively. By using the demonstration system, network throughput is measured in an indoor environment to prove the realization and effectiveness of the 2-way relay network. From the results of network throughput, it is found that the 2-way relay network can achieve high network throughput approaching theoretical upper bound even in low average end-to-end SNR area where network throughput of the direct link degrades severely. From these results, the realization and effectiveness of the 2-way relay network can be proved in the real indoor environment.
In this paper, we propose an optimized virtual re-convergence system especially to reduce the visual fatigue caused by binocular stereoscopy. Our unique idea to reduce visual fatigue is to utilize the virtual re-convergence based on the optimized disparity-map that contains more depth information in the negative disparity area than in the positive area. Therefore, our system facilitates a unique search-range scheme, especially for negative disparity exploration. In addition, we used a dedicated method, using a so-called Global-Shift Value (GSV), which are the total shift values of each image in stereoscopy to converge a main object that can mostly affect visual fatigue. The experimental result, which is a subjective assessment by participants, shows that the proposed method makes stereoscopy significantly comfortable and attractive to view than existing methods.
Speaker change detection involves the identification of the time indices of an audio stream, where the identity of the speaker changes. This paper proposes novel measures for speaker change detection over the centroid model, which divides the feature space into non-overlapping clusters for effective speaker-change comparison. The centroid model is a computationally-efficient variant of the widely-used mixture-distribution based background models for speaker recognition. Experiments on both synthetic and real-world data were performed; the results show that the proposed approach yields promising results compared with the conventional statistical measures.
Kwanho KIM Jae-Yoon JUNG Jonghun PARK
Information diffusion analysis in social networks is of significance since it enables us to deeply understand dynamic social interactions among users. In this paper, we introduce approaches to discovering information diffusion process in social networks based on process mining. Process mining techniques are applied from three perspectives: social network analysis, process discovery and community recognition. We then present experimental results by using a real-life social network data. The proposed techniques are expected to employ as new analytical tools in online social networks such as blog and wikis for company marketers, politicians, news reporters and online writers.