In this paper, a threshold-based I-Q diversity combining scheme for ultra-high frequency (UHF) radio frequency identification (RFID) readers with a quadrature receiver is proposed in the aspect of improving the tag detection performance. In addition, the performance of the proposed scheme is evaluated as the closed-form expressions. In particular, its statistical characteristics are detailed and its performance is compared to that of conventional schemes over independent and identically distributed Rician fading conditions in terms of average signal-to-noise ratio (SNR), bit error rate (BER), and the average number of required combining process. Numerical results indicate that the proposed scheme enables processing power control through threshold control while meeting the required quality of service compared to conventional schemes.

Perceptually optimized missing texture reconstruction via neighboring embedding (NE) is presented in this paper. The proposed method adopts the structural similarity (SSIM) index as a measure for representing texture reconstruction performance of missing areas. This provides a solution to the problem of previously reported methods not being able to perform perceptually optimized reconstruction. Furthermore, in the proposed method, a new scheme for selection of the known nearest neighbor patches for reconstruction of target patches including missing areas is introduced. Specifically, by monitoring the SSIM index observed by the proposed NE-based reconstruction algorithm, selection of known patches optimal for the reconstruction becomes feasible even if target patches include missing pixels. The above novel approaches enable successful reconstruction of missing areas. Experimental results show improvement of the proposed method over previously reported methods.

Recent studies on switching fabrics mainly focus on the switching schedule algorithms, which aim at improving the throughput (a key performance metric). However, the delay (another key performance metric) of switching fabrics cannot be well guaranteed. A good switching fabric should be endowed with the properties of high throughput, delay guarantee, low component complexity and high-speed multicast, which are difficult for conventional switching fabrics to achieve. This has fueled great interest in designing a new switching fabric that can support large-scale extension and high-speed multicast. Motivated by this, we reuse the self-routing Boolean concentrator network and embed a model of multicast packet copy separation in front to construct a load-balanced multicast switching fabric (LB-MSF) with delay guarantee. The first phase of LB-MSF is responsible for balancing the incoming traffic into uniform cells while the second phase is in charge of self-routing the cells to their final destinations. In order to improve the throughput, LB-MSF is combined with the merits of erasure codes against packet loss. Experiments and analyses verify that the proposed fabric is able to achieve high-speed multicast switching and suitable for building super large-scale switching fabric in Next Generation Network(NGN) with all the advantages mentioned above. Furthermore, a prototype of the proposed switch is developed on FPGA, and presents excellent performance.

We propose a joint channel, power and rate allocation scheme to minimize the weighted group outage probability of the secondary users (SUs) in a downlink cognitive radio (CR) multicast network coexisting with a primary network, subject to the service outage constraint as well as the interference power constraint and the transmit power constraint. It is validated by simulation results that, compared to the existing schemes, the proposed scheme achieves lower group outage probability.

To achieve more accurate measurements of the mobile station (MS) location, it is possible to integrate many kinds of measurements. In this paper we proposed several hybrid methods that utilized time of arrival (TOA) at seven base stations (BSs) and the angle of arrival (AOA) information at the serving BS to give location estimation of the MS in non-line-of-sight (NLOS) environments. Rather than applying the nonlinear circular lines of position (LOP), the proposed methods are easier by using linear LOP to determine the MS. In addition, the proposed methods can mitigate the NLOS effect, simply by applying the weighted sum of the intersections between different linear LOP and the AOA line, without requiring priori knowledge of NLOS error statistics. Simulation results show that the proposed methods can always yield superior performance in comparison with Taylor series algorithm (TSA) and the hybrid lines of position algorithm (HLOP) and the previous proposed methods employing circular LOP.

Passive SONAR receives a mixed form of signal that is a combination of continuous and discrete line-component spectrum signals. The conventional algorithms, DEMON and LOFAR, respectively target each type of signal, but do not consider the other type of signal also present in the practical environment. Thus when features from two types of signals are presented at the same time, analysis results may cause confusion. In this paper, we propose an integrated analysis algorithm for underwater signals using the modulation spectrogram domain. The proposed domain presents the visual difference between the different types of signal, and therefore can prevent confusion that would otherwise be feasible. Moreover, the proposed algorithm is more efficient than multiband DEMON in terms of computation complexity, while in colored ambient noise environment, it has similar performance to conventional DEMON and LOFAR. We prove the validity of the proposed algorithm through the relevant experiments with synthesized signal and actual underwater recordings.

Selective visual attention is an integral mechanism of the human visual system that is often neglected when designing perceptually relevant image and video quality metrics. Disregarding attention mechanisms assumes that all distortions in the visual content impact equally on the overall quality perception, which is typically not the case. Over the past years we have performed several experiments to study the effect of visual attention on quality perception. In addition to gaining a deeper scientific understanding of this matter, we were also able to use this knowledge to further improve various quality prediction models. In this article, I review our work with the aim to increase awareness on the importance of visual attention mechanisms for the effective design of quality prediction models.

In this study, we propose a two-step approach to evaluate electromagnetic interference (EMI) with a wearable vital signal sensor. The two-step approach combines a quasi-static electromagnetic (EM) field analysis and an electric circuit analysis, and is applied to the EMI evaluation at frequencies below 1 MHz for our developed wearable electrocardiogram (ECG) to demonstrate its usefulness. The quasi-static EM field analysis gives the common mode voltage coupled from the incident EM field at the ECG sensing electrodes, and the electric circuit analysis quantifies a differential mode voltage at the differential amplifier output of the ECG detection circuit. The differential mode voltage has been shown to come from a conversion from the common mode voltage due to an imbalance between the contact impedances of the two sensing electrodes. When the contact impedance is resistive, the induced differential mode voltage increases with frequency up to 100kHz, and keeps constant after 100kHz, i.e., exhibits a high pass filter characteristic. While when the contact impedance is capacitive, the differential mode voltage exhibits a band pass filter characteristic with the maximum at frequency of around 150kHz. The differential voltage may achieve nearly 1V at the differential amplifier output for an imbalance of 30% under 10V/m plane-wave incident electric field, and completely mask the ECG signal. It is essential to reduce the imbalance as much as possible so as to prevent a significant interference voltage in the amplified ECG signal.

We demonstrated generation of arbitrarily patterned optical pulse trains and frequency tunable terahertz (THz) pulses by spectral synthesis of optical combs generated by a Mach-Zehnder-modulator-based flat comb generator (MZ-FCG). In our approach, THz pulses were generated by photomixing of a multi-tone signal, which is elongated pulse train, and a single-tone signal. Both signals were extracted from a comb signal by using optical tunable bandpass filters. In the case of optical pulse train generation, the MZ-FCG generated comb signals with 10 GHz-spacing and 330 GHz-width, which was converted to a 2.85 ps-width pulse train by chirp compensation using a single-mode fiber. By combining the MZ-FCG with a pulse picker composed of a 40 Gbps intensity modulator, divided pulse trains and arbitrarily bit sequences were successfully generated. The single-mode light was extracted by an optical bandpass filter and the band-controlled pulse train was extracted by an optical bandpass filter. By photomixing them, a THz pulse was successfully generated. In the case of THz pulse generation, by photomixing a single-tone and a multi-tone signals extracted by tunable bandpass filters, THz pulses with a center frequency of 300 GHz was successfully generated. Furthermore, frequency tunability of the center frequency was also demonstrated.

The Satellite/Terrestrial Integrated mobile Communication System (STICS), which allows terrestrial mobile phones to communicate directly through a satellite, has been studied [1]. Satellites are unaffected by the seismic activity that causes terrestrial damage, and therefore, the STICS can be expected to be a measure that ensures emergency call connection. This paper first describes the basic characteristics of call blocking rates of terrestrial mobile phone systems in areas where non-functional base stations are geographically clustered, as investigated through computer simulations that showed an increased call blocking rate as the number of non-functional base stations increased. Further simulations showed that restricting the use of the satellite system for emergency calls only ensures the STICS's capacity to transmit emergency communications; however, these simulations also revealed a weakness in the low channel utilization rate of the satellite system [2]. Therefore, in this paper, we propose increasing the channel utilization rate with a priority channel framework that divides the satellite channels between priority channels for emergency calls and non-priority channels that can be available for emergency or general use. Simulations of this priority channel framework showed that it increased the satellite system's channel utilization rate, while continuing to ensure emergency call connection [3]. These simulations showed that the STICS with a priority channel framework can provide efficient channel utilization and still be expected to provide a valuable secondary measure to ensure emergency communications in areas with clustered non-functional base stations during large-scale disasters.

A regional protection system based on a wireless Ad-Hoc network has been in operation since 2008 in Shiojiri City, Japan. Wireless terminals transmit data packets to a server via transponders situated around the city. In this paper, a new routing algorithm that takes into account the level of congestion of the transponders is proposed. Using computer simulations, the proposed algorithm is shown to reduce the packet loss rate compared to the previous algorithm which is based on minimization of the number of hops to the server. Also, the proposed algorithm is shown be have almost the same packet loss rate as the best routing decisions obtained by an exhaustive search. Furthermore, the simulations used recreate the actual movement of terminals, so the results show what will happen in a realistic environment.

In wireless LANs, wireless clients are associated with one of access points (APs) to obtain network connectivity, and the AP performs network traffic relay between the wired infrastructure and wireless clients. If a client with a low transmission rate is associated with an AP, the throughput performance of all the clients that are associated with the AP is significantly degraded because of the long channel usage time of the low-rate client. Therefore, it is important to select an appropriate AP when a new client joins the wireless LAN to prevent the performance degradation. In this paper, we propose a traffic control that determines the feasible data traffic from an AP to the clients on the basis of the trade-off relationship between the equal-throughput and equal-airtime traffic allocation policies. We then propose a network-wide association algorithm that allows a client to be associated with the AP that can provide the highest throughput improvement. Simulation results indicate that the proposed algorithm achieves the better aggregate throughput and throughput fairness performances in IEEE 802.11 WLANs.

With recent developments in machine learning technology, the predictions by systems incorporating machine learning can now have a significant impact on the lives and activities of individuals. In some cases, predictions made by machine learning can result unexpectedly in unfair treatments to individuals. For example, if the results are highly dependent on personal attributes, such as gender or ethnicity, hiring decisions might be discriminatory. This paper investigates the neutralization of a probabilistic model with respect to another probabilistic model, referred to as a viewpoint. We present a novel definition of neutrality for probabilistic models, η-neutrality, and introduce a systematic method that uses the maximum likelihood estimation to enforce the neutrality of a prediction model. Our method can be applied to various machine learning algorithms, as demonstrated by η-neutral logistic regression and η-neutral linear regression.

We propose an energy-efficient real-time scheduling algorithm based on T-L Plane abstraction. The algorithm is designed to exploit Dynamic Power Management and generates a new event called event-s to render longer idle intervals, which increases the chances of switching a processor to the sleep mode. We compare the proposed algorithm with previous work and show that it is effective for energy management.

In order to tackle the rapidly increasing traffic, the 5th generation (5G) mobile communication system will introduce small cells using higher frequency bands with wider bandwidth to achieve super high bit rate transmission of several tens of Gbps. Massive multiple input multiple output (MIMO) beamforming (BF) is promising as one of the technologies that can compensate for larger path-loss in the higher frequency bands. Joint analog fixed BF and digital precoding have been proposed to reduce the cost of a Massive MIMO transceiver. However, the conventional scheme assumes the transmission of a few streams using well-known codebook-based precoding as the digital precoding, and both a selection method of the fixed BF weights and a digital precoder design, which are suitable for super high bit rate transmission using multiple streams, have not been studied. This paper proposes a joint fixed BF and CSI-based precoding (called FBCP) scheme for the 5G Massive MIMO systems. FBCP first selects the analog fixed BF weights based on a maximum total received power criterion, and then it calculates an eigenmode (EM) precoding matrix by exploiting CSI. This paper targets a 5G system achieving over 20Gbps in the 20GHz band as one example. Throughput performances of the Massive MIMO using the proposed FBCP are evaluated by link level simulations using adaptive modulation and coding and it is shown that the proposed FBCP with the optimum number of selected beams (baseband chains) can use higher level modulation, up to 256QAM, and higher coding rates and achieve throughputs close to 30Gbps while the cost and complexity can be reduced compared with the fully digital Massive MIMO.

Physical layer security is effective in wireless communications because it makes a transmission secure from the beginning of protocols. We have proposed a chaos multiple-input multiple-output (C-MIMO) transmission scheme that achieves both physical layer security and channel coding gain using chaos signals. C-MIMO is a type of encryption modulation and it obtains the coding gain in conjunction with encryption without a decrease in the transmission efficiency. Thus, the error rate performance is improved in C-MIMO. However, decoding complexity increases exponentially with code length because of the use of maximum likelihood sequence estimation (MLSE), which restricts the code length of C-MIMO and thus the channel coding gain. Therefore, in this paper, we consider outer channel code concatenation instead of code length expansion for C-MIMO, and propose an iterative turbo decoding scheme for performance improvement by introducing a log-likelihood ratio (LLR) into C-MIMO and by utilizing turbo principle. The improved performances of the proposed scheme, compared to the conventional scheme when the outer channel codes are convolutional code and low-density parity check (LDPC) code, are shown by computer simulations.

In this letter, a new analysis technique for finding the convexity of iterative maximum likelihood (IML) methods for direction-of-arrival (DOA) estimation is presented. The proposed technique can pave the way in avoiding the local solution when the IML methods are utilized to estimate DOA, especially for the scenarios of array with large antennas. From the derivation, we can see that as long as the initial DOA belongs to the approximate convex range estimated by our proposed technique, the IML methods can estimate the DOA very well without entering into local minima, which is particularly true for the large arrays. Furthermore, numerical experiments show us the results tallied well with our theoretical derivations.

Collective motion stems from the coordinated behaviors among individuals of crowds, and has attracted growing interest from the physics and computer vision communities. Collectiveness is a metric of the degree to which the state of crowd motion is ordered or synchronized. In this letter, we present a scheme to measure collectiveness via link prediction. Toward this aim, we propose a similarity index called superposed random walk with restarts (SRWR) and construct a novel collectiveness descriptor using the SRWR index and the Laplacian spectrum of a network. Experiments show that our approach gives promising results in real-world crowd scenes, and performs better than the state-of-the-art methods.

The emerging three-dimensional (3D) technology is considered as a promising solution for achieving better performance and easier heterogeneous integration. However, the thermal issue becomes exacerbated primarily due to larger power density and longer heat dissipation paths. The thermal issue would also be critical once FPGAs step into the 3D arena. In this article, we first construct a fine-grained thermal resistive model for 3D FPGAs. We show that merely reducing the total power consumption and/or minimizing the power density in vertical direction is not enough for a thermal-aware 3D FPGA backend (placement and routing) flow. Then, we propose our thermal-aware backend flow named TherWare considering location-based heat balance. In the placement stage, TherWare not only considers power distribution of logic tiles in both lateral and vertical directions but also minimizes the interconnect power. In the routing stage, TherWare concentrates on overall power minimization and evenness of power distribution at the same time. Experimental results show that TherWare can significantly reduce the maximum temperature, the maximum temperature gradient, and the temperature deviation only at the cost of a minor increase in delay and runtime as compared with present arts.

Much research which has shown the usage of social ties could improve the location predictive performance, but as the strength of social ties is varying constantly with time, using the movement data of user's close friends at different times could obtain a better predictive performance. A hybrid Markov location prediction algorithm based on dynamic social ties is presented. The time is divided by the absolute time (week) to mine the long-term changing trend of users' social ties, and then the movements of each week are projected to the workdays and weekends to find the changes of the social circle in different time slices. The segmented friends' movements are compared to the history of the user with our modified cross-sample entropy to discover the individuals who have the relatively high similarity with the user in different time intervals. Finally, the user's historical movement data and his friends' movements at different times which are assigned with the similarity weights are combined to build the hybrid Markov model. The experiments based on a real location-based social network dataset show the hybrid Markov location prediction algorithm could improve 15% predictive accuracy compared with the location prediction algorithms that consider the global strength of social ties.