In this paper, a distributed cooperative multicell beamforming algorithm is proposed, and a detail analysis and solving method for instantaneous and statistical channel state information (CSI) are presented. Firstly, an improved distributed iterative beamforming algorithm is proposed for the multiple-input single-output interference channel (MISO IC) scenario which chooses virtual signal-to-interference-and-noise (SINR) as decision criterion to initialize and then iteratively solves the constrained optimization problem of maximizing the virtual SINR for a given level of generated interference to other users. Then, the algorithm is generalized to the multicell date sharing scenario with a heuristics power allocation scheme based on a viewpoint of the layered channel. Finally, the performance is illustrated through numerical simulations.

Traditional cellular networks suffer the so-called “cell-edge problem” in which the user throughput is deteriorated because of pathloss and inter-cell (co-channel) interference. Recently, Base Station Cooperation (BSC) was proposed as a solution to the cell-edge problem by alleviating the interference and improving diversity and multiplexing gains at the cell-edge. However, it has minimal impact on cell-inner users and increases the complexity of the network. Moreover, static clustering, which fixes the cooperating cells, suffers from inter-cluster interference at the cluster-edge. In this paper, dynamic fractional cooperation is proposed to realize dynamic clustering in a shared RRU network. In the proposed algorithm, base station cooperation is performed dynamically at cell edges for throughput improvement of users located in these areas. To realize such base station cooperation in large scale cellular networks, coordinated scheduling and distributed dynamic cooperation are introduced. The introduction of coordinated scheduling in BSC multi-user MIMO not only maximizes the performance of BSC for cell-edge users but also reduces computational complexity by performing simple single-cell MIMO for cell-inner users. Furthermore, the proposed dynamic clustering employing shared RRU network realizes efficient transmission at all cell edges by forming cooperative cells dynamically with minimal network complexity. Owing to the combinations of the proposed algorithms, dynamic fractional cooperation achieves high network performance at all areas in the cellular network. Simulation results show that the cell-average and the 5% cell-edge user throughput can be significantly increased in practical cellular network scenarios.

A two-dimensional shape is generally represented with line drawings or object contours in a digital image. Shapes can be divided into two types, namely ordered and unordered shapes. An ordered shape is an ordered set of points, while an unordered shape is an unordered set. As a result, each type typically uses different attributes to define the local descriptors involved in representing the local distributions of points sampled from the shape. Throughout this paper, we focus on unordered shapes. Since most local descriptors of unordered shapes are not scale-invariant, we usually make the shapes in an image data set the same size through scale normalization, before applying shape matching procedures. Shapes obtained through scale normalization are suitable for such descriptors if the original whole shapes are similar. However, they are not suitable if parts of each original shape are drawn using different scales. Thus, in this paper, we present a scale-invariant descriptor constructed by von Mises distributions to deal with such shapes. Since this descriptor has the merits of being both scale-invariant and a probability distribution, it does not require scale normalization and can employ an arbitrary measure of probability distributions in matching shape points. In experiments on shape matching and retrieval, we show the effectiveness of our descriptor, compared to several conventional descriptors.

For the panoramic video streaming service, this letter proposes a visual perception-based view navigation trick mode (VP-VNTM) that reduces bandwidth requirements by adjusting the quality of transmitting views in accordance with the view navigation velocity without decreasing the user's visual sensitivity. Experiments show that the proposed VP-VNTM reduces bandwidth requirements by more than 44%.

In this paper, we propose a two-step TDC with phase-interpolator and time amplifier to satisfy high resolution at 2.4 GHz input frequency by implementing delay time less than that of an inverter delay. The accuracy of phase-interpolator is improved for process variation using the resistor automatic-tuning circuit. The gain of time amplifier is improved using the delay time difference between two delay cells. It is implemented in a 0.13 µm CMOS process with a die area of 0.68 mm2. And the power consumption is 14.4 mW at a 1.2 V supply voltage. The resolution and input frequency of the TDC are 0.357 ps and 2.4 GHz, respectively.

The social network model has been regarded as a promising mechanism to defend against Sybil attack. This model assumes that honest peers and Sybil peers are connected by only a small number of attack edges. Detection of the attack edges plays a key role in restraining the power of Sybil peers. In this paper, an attack-resisting, distributed algorithm, named Random walk and Social network model-based clustering (RSC), is proposed to detect the attack edges. In RSC, peers disseminate random walk packets to each other. For each edge, the number of times that the packets pass this edge reflects the betweenness of this edge. RSC observes that the betweennesses of attack edges are higher than those of the non-attack edges. In this way, the attack edges can be identified. To show the effectiveness of RSC, RSC is integrated into an existing social network model-based algorithm called SOHL. The results of simulations with real world social network datasets show that RSC remarkably improves the performance of SOHL.

WSNs (Wireless Sensor Networks) are becoming more widely used in various fields, and localization is a crucial and essential issue for sensor network applications. In this letter, we propose a low-complexity localization mechanism for WSNs that operate in 3D (three-dimensional) space. The basic idea is to use aerial vehicles that are deliberately equipped with anchor nodes. These anchors periodically broadcast beacon signals containing their current locations, and unknown nodes receive these signals as soon as the anchors enter their communication range. We estimate the locations of the unknown nodes based on the proposed scheme that transforms the 3D problem into 2D computations to reduce the complexity of 3D localization. Simulated results show that our approach is an effective scheme for 3D self-positioning in WSNs.

The specific absorption rate (SAR) measurement procedure for wireless communication devices used in close proximity to the human body other than the ear was standardized by the International Electrotechnical Commission (IEC). This procedure is applicable to SAR measurement of data communication terminals that are used with host devices. Laptop PCs are assumed as host devices in this study. First, numerical modeling of laptop PCs and the validity of computations are verified with corresponding measurements. Next, mass averaged SARs are calculated dependent on the dimensions of the laptop PCs and the position of the terminals. The results show that the ratio of the maximum to minimum SARs is at most 2.0 for USB dongle and card-type terminals at 1950 MHz and 835 MHz.

In the near future, interconnection networks of massively parallel computer systems will connect more than a hundred thousands of computing nodes. The performance evaluation of the interconnection networks can provide real insights to help the development of efficient communication library. Hence, to evaluate the performance of such interconnection networks, simulation tools capable of modeling the networks with sufficient details, supporting a user-friendly interface to describe communication patterns, providing the users with enough performance information, completing simulations within a reasonable time, are a real necessity. This paper introduces a novel interconnection network simulator NSIM, for the evaluation of the performance of extreme-scale interconnection networks. The simulator implements a simplified simulation model so as to run faster without any loss of accuracy. Unlike the existing simulators, NSIM is built on the execution-driven simulation approach. The simulator also provides a MPI-compatible programming interface. Thus, the simulator can emulate parallel program execution and correctly simulate point-to-point and collective communications that are dynamically changed by network congestion. The experimental results in this paper showed sufficient accuracy of this simulator by comparing the simulator and the real machine. We also confirmed that the simulator is capable of evaluating ultra large-scale interconnection networks, consumes smaller memory area, and runs faster than the existing simulator. This paper also introduces a simulation service built on a cloud environment. Without installing NSIM, users can simulate interconnection networks with various configurations by using a web browser.

In multiuser cognitive radio (CR) networks, we address the problem of joint transmit beamforming (BF) and power control (PC) for secondary users (SUs) when they are allowed to transmit simultaneously with primary users (PUs). The objective is to optimize the network sum rate under the interference constraints of PUs, which is a nonconvex problem. Iterative dual subgradient (IDuSuG) algorithm is proposed by iteratively performing BF and PC to optimize the sum rate, among which minimum mean square error (MMSE) or virtual power-weighed projection (VIP2) is used to design beamformers and subgradient method is used to control the power. VIP2 algorithm is devised for the case in which the interference caused by MMSE beamformer exceeds the threshold. Moreover, channel uncertainty due to lack of cooperation is considered. A closed-form worst-case expression is derived, with which the uncertainty optimization problem is transformed into a certain one. A robust algorithm based on IDuSuG is provided by modifying updates in iterative process. Furthermore, second-order cone programming approximation (SOCPA) method is proposed as another robust algorithm. Typical network models are approximated to SOCP problems and solved by interior-point method. Finally the network sum rates for different PU and SU numbers are assessed for both certainty and uncertainty channel models by simulation.

In this paper, a low complexity hybrid smart antenna system with directional elements and reduced-size digital beamformer is proposed to combat the inter-symbol interference (ISI) problem over frequency-selective fading channel. For the conventional smart antenna system with omni-directional elements, it utilizes the full-size digital beamformer to suppress interference and obtain the optimum performance. However, the proposed hybrid smart antenna system with directional elements can be split the linear array receiver for two branches. One branch is the subarray system with non ISI interference, which can be used for maximum ratio combiner (MRC). Another branch is the reduced-size subarray system with the ISI interference, which can use the reduced-size optimum beamformer to suppress interference. Finally, the output signals of the two branches can be combined to detect the transmitted signals. Simulation results confirm that the proposed low complexity system can provide robust performance under the multipath fading channel.

We propose a novel saliency detection model based on Bayes' theorem. The model integrates the two parts of Bayes' equation to measure saliency, each part of which was considered separately in the previous models. The proposed model measures saliency by computing local kernel density estimation of features in the center-surround region and global kernel density estimation of features at each pixel across the whole image. Under the proposed model, a saliency detection method is presented that extracts DCT (Discrete Cosine Transform) magnitude of local region around each pixel as the feature. Experiments show that the proposed model not only performs competitively on psychological patterns and better than the current state-of-the-art models on human visual fixation data, but also is robust against signal uncertainty.

Accurate channel estimation for multiple cells is essential in downlink coordinated multi-point (CoMP) transmission/reception. Therefore, this paper investigates a technique to improve the channel estimation for downlink CoMP in Long-Term Evolution (LTE)-Advanced. In particular, the performance of data signal muting, i.e., muting data signals that collide with the channel state information reference signal (CSI-RS) of a neighboring cell, is evaluated considering various CoMP schemes and intra-eNodeB and inter-eNodeB CoMP scenarios. In a multi-cell link level simulation, coordinated scheduling and coordinated beamforming (CS/CB) CoMP is employed. The simulation results show that data signal muting is effective in improving the channel estimation accuracy, which is confirmed by numerical analysis. Simulation results also show that it is effective in improving the throughput performance, especially for sets of user equipment at the cell boundary. Furthermore, the tradeoff relationship between accurate channel estimation by muting larger numbers of data signals and a high peak data rate, i.e., low overhead, is investigated. It is shown that when the number of coordinated cells is set to three, the CSI-RS reuse factor is set to three, and the well-planned CSI-RS pattern allocation is employed, the improvement in performance is almost saturated in a synchronized network.

The cooperative relay network exploits the space diversity gain by allowing cooperation among users to improve transmission quality. It is an important issue to identify the cluster-head (or relay node) and its members who are to cooperate. The cluster-head consumes more battery power than an ordinary node since it has extra responsibilities, i.e., ensuring the cooperation of its members' transmissions; thereby the cluster-head has a lower throughput than the average. Since users are joining or departing the clusters from time to time, the network topology is changing and the network may not be stable. How to balance the fairness among users and the network stability is a very interesting topic. This paper proposes an adaptive weighted clustering algorithm (AWCA), in which the weight factors are introduced to adaptively control both the stability and fairness according to the number of arrival users. It is shown that when the number of arrival users is large, AWCA has the life time longer than FWCA and similar to SWCA and that when the number of arrival users is small, AWCA provides fairness higher than SWCA and close to FWCA.

To realize a single or several molecule device, the following are necessary: (1) an electrical wiring method that is not destructive to the molecular aggregates and does not affect the electronic state of the molecules, (2) noncontact and controllable molecular manipulation technology, (3) oriented growth techniques especially to prepare a nanodevice employing an anisotropic molecular system. In this paper, recently developed electric-field assisted growth and its application to molecular device fabrication are presented.

Ridge optical waveguides (OWGs) of fluorinated polyimides were deposited on a quartz crystal microbalance (QCM), and a hybrid sensor employing the OWG spectroscopy and the QCM technique was prepared. A polyvinyl alcohol (PVA) film with CoCl2 was deposited on the OWG, and humidity sensing characteristics were investigated. White light was entered into the waveguide and the output light spectra was observed. The output light intensity markedly changed because of the chromism of CoCl2 by humidity sorption. During the output light measurement, the QCM frequency was monitored simultaneously. The humidity dependences of the QCM frequency and output light were also investigated in a range from 10% to 70%. Furthermore, the response to hydrofluoroether (HFE) was observed, and the change in the output light was hardly observed because CoCl2 does not exhibit chromism in HFE sorption.

This paper presents a method of generating sets of orthogonal and zero-correlation zone (ZCZ) periodic real-valued sequences of period 2n, n ≥ 1. The sequences admit a fast correlation algorithm and the sets of sequences achieve the upper bound on family size. A periodic orthogonal sequence has the periodic autocorrelation function with zero sidelobes, and a set with orthogonal sequences whose mutual periodic crosscorrelation function at zero shift is zero. Similarly, a ZCZ set is the set of the sequences with zero-correlation zone. In this paper, we derive the real-valued periodic orthogonal sequences of period 2n from a real-valued Huffman sequence of length 2ν+1, ν being a positive integer and ν ≥ n, whose aperiodic autocorrelation function has zero sidelobes except possibly at the left and right shift-ends. The orthogonal and ZCZ sets of real-valued periodic orthogonal sequences are useful in various systems, such as synchronous code division multiple access (CDMA) systems, quasi-synchronous CDMA systems and digital watermarkings.

Visibly pushdown automata (VPA), introduced by Alur and Madhusuan in 2004, is a subclass of pushdown automata whose stack behavior is completely determined by the input symbol according to a fixed partition of the input alphabet. Since it was introduced, VPA have been shown to be useful in various contexts, e.g., as specification formalism for verification and as an automaton model for processing XML streams. However, implementation of formal verification based on VPA framework is a challenge. In this paper, we propose on-the-fly algorithms to test universality and inclusion problems of this automata class. In particular, we first present a slight improvement on the upper bound for determinization of VPA. Next, in order to check universality of a nondeterministic VPA, we simultaneously determinize this VPA and apply the P-automata technique to compute a set of reachable configurations of the target determinized VPA. When a rejecting configuration is found, the checking process stops and reports that the original VPA is not universal. Otherwise, if all configurations are accepting, the original VPA is universal. Furthermore, to strengthen the algorithm, we define a partial ordering over transitions of P-automaton, and only minimal transitions are used to incrementally generate the P-automaton. The purpose of this process is to keep the determinization step implicitly for generating reachable configurations as minimum as possible. This improvement helps to reduce not only the size of the P-automaton but also the complexity of the determinization phase. We implement the proposed algorithms in a prototype tool, named VPAchecker. Finally, we conduct experiments on randomly generated VPA. The experimental results show that the proposed method outperforms the standard one by several orders of magnitude.

We propose a transfer gate phase coupler for a low-power multi-phase oscillator (MPOSC). The phase coupler is an nMOS transfer gate, which does not waste charge to the ground and thus achieves low power. The proposed MPOSC can set the number of outputs to an arbitrary number. The test circuit in a 180-nm process and a 65-nm process exhibits 20 phases, including 90 different angles. The designs in a 180-nm CMOS process and a 65-nm CMOS process were fabricated to confirm its process scalability; in the respective designs, we observed 36.6% and 38.3% improvements in a power-delay products, compared with the conventional MPOSCs using inverters and nMOS latches. In a 65-nm process, the measured DNL and 3σ period jitter are, respectively, less than 1.22 and 5.82 ps. The power is 284 µW at 1.85 GHz.

Iterative synthesis methods for making aware of wire congestion are proposed for a multi-context dynamically reconfigurable processor (DRP) with a large number of processing elements (PEs) and programmable-wire connections. Although complex data-paths can be synthesized using the programmable-wire, its delay is long especially when wire connections are congested. We propose two iterative synthesis techniques between a high-level synthesizer (HLS) and the place & route tool to shorten the prolonged wire delay. First, we feed back wire delays for each context to a scheduler in the HLS. The experimental results showed that a critical-path delay was shorten by 21% on average for applications with timing closure problems. Second, we skip the routing and estimate wire delays based on the congestion. The synthesis time was shorten to 1/3 causing delay improvement rate degradation at two points on average.