Body bias generators are useful circuits that can reduce variability and power dissipation in LSI circuits. However, the amplifier implemented into the body bias generator is difficult to design because of its complexity. To overcome the difficulty, this paper proposes a clearer cell-based design method of the amplifier than the existing cell-based design methods. The proposed method is based on a simple analytical model, which enables to easily design the amplifiers under various operating conditions. First, we introduce a small signal equivalent circuit of two-stage amplifiers by which we approximate a three-stage amplifier, and introduce a method for determining its design parameters based on the analytical model. Second, we propose a method of tuning parameters such as cell-based phase compensation elements and drive-strength of the output stage. Finally, based on the test chip measurement, we show the advantage of the body bias generator we designed in a cell-based flow over existing designs.

In this paper, we propose a novel group formation scheme which is integrated with an EMGC protocol in order to cope with dynamic group change. It uses a link expiration time and residual energy to form a stable link in a group. It also has a group merging procedure to decrease the number of groups. Furthermore, we develop two additional functions for the protocol, i.e., GL rotation and a stay connection procedure to diminish energy consumption of sensor nodes in the network. Simulation results show that the proposed protocol outperforms MBC, EMGCwoh, and EMGC protocols in terms of data delivery, network lifetime, and energy dissipation per round with various group change probabilities and percentages of groups.

This paper discusses non-ideal issues in a fully passive noise shaping successive approximation register analog-to-digital converter. The fully passive noise shaping techniques are realized by switches and capacitors without operational amplifiers to be scalable and power efficient. However, some non-ideal issues, such as parasitic capacitance, comparator noise, thermal noise, will affect the performance of the noise shaping and then degrade the final achievable resolution. This paper analyzes the effects of the main non-ideal issues and provides the design reference for fully passive noise shaping techniques. The analysis is based on 2nd order fully passive noise shaping SAR ADC with an 8-bit architecture and an OSR of 4.

This paper reviews access system standardization activities and related technologies from the viewpoints of optical-based PON access, mobile access systems including LPWAN, and access network virtualization. Future study issues for the next access systems are also presented.

By incorporating cloud computing capabilities to provide radio access functionalities, Cloud Radio Access Networks (CRANs) are considered to be a key enabling technology of future 5G and beyond communication systems. In CRANs, centralized radio resource allocation optimization is performed over a large number of small cells served by simple access points, the Remote Radio Heads (RRHs). However, the fronthaul links connecting each RRH to the cloud introduce delays and entail imperfect Channel State Information (CSI) knowledge at the cloud processors. In order to satisfy the stringent latency requirements envisioned for 5G applications, the concept of Fog Radio Access Networks (FogRANs) has recently emerged for providing cloud computing at the edge of the network. Although FogRAN may alleviate the latency and CSI quality issues of CRAN, its distributed nature degrades network interference mitigation and global system performance. Therefore, we investigate the design of tailored user pre-scheduling and beamforming for FogRANs. In particular, we propose a hybrid algorithm that exploits both the centralized feature of the cloud for globally-optimized pre-scheduling using imperfect global CSIs, and the distributed nature of FogRAN for accurate beamforming with high quality local CSIs. The centralized phase enables the interference patterns over the global network to be considered, while the distributed phase allows for latency reduction, in line with the requirements of FogRAN applications. Simulation results show that our proposed algorithm outperforms the baseline algorithm under imperfect CSIs, jointly in terms of throughput, energy efficiency, as well as delay.

Wireless communication security has been increasingly important nowadays. Directional modulation (DM) is seen as a promising wireless physical layer security technology. Traditional DM is a transmit-side technology that projects digitally modulated information signals in the desired directions (or at the desired locations) while simultaneously distorting the constellation formats of the same signals in other directions (or at all other locations). However, these directly exposed digitally modulated information signals are easily intercepted by eavesdroppers along the desired directions (or around the desired locations). A new DM scheme for secure point-to-multipoint communication based on the spread spectrum assisted orthogonal frequency diverse array (short for SS-OFDA-M-DM) is proposed in this paper. It can achieve point-to-multipoint secure communication for multiple cooperative receivers at different locations. In the proposed SS-OFDA-M-DM scheme, only cooperative users that use specific DM receivers with right spread spectrum parameters can retrieve right symbols. Eavesdroppers without knowledge of spread spectrum parameters cannot intercept useful signals directly at the desired locations. Moreover, they cannot receive normal symbols at other locations either even if the right spread spectrum parameters are known. Numerical simulation results verify the validity of our proposed scheme.

In this paper, we have investigated the etching selectivity of HfN encapsulating layer for high quality PtHf-alloy silicide (PtHfSi) formation with low contact resistivity on Si(100). The HfN(10 nm)/PtHf(20 nm)/p-Si(100) stacked layer was in-situ deposited by RF-magnetron sputtering at room temperature. Then, silicidation was carried out at 500°C/20 min in N2/4.9%H2 ambient. Next, the HfN encapsulating layer was etched for 1-10 min by buffered-HF (BHF) followed by the unreacted PtHf metal etching. We have found that the etching duration of the 10-nm-thick HfN encapsulating layer should be shorter than 6 min to maintain the PtHfSi crystallinity. This is probably because the PtHf-alloy silicide was gradually etched by BHF especially for the Hf atoms after the HfN was completely removed. The optimized etching process realized the ultra-low contact resistivity of PtHfSi to p+/n-Si(100) and n+/p-Si(100) such as 9.4×10-9Ωcm2 and 4.8×10-9Ωcm2, respectively, utilizing the dopant segregation process. The control of etching duration of HfN encapsulating layer is important to realize the high quality PtHfSi formation with low contact resistivity.

This paper proposes an improved closed-form method for moving source localization using time difference of arrival (TDOA), frequency difference of arrival (FDOA) and differential Doppler rate measurements. After linearizing the measurement equations by introducing three additional parameters, a rough estimate is obtained by using the weighted least-square (WLS) estimator. To further refine the estimate, the relationship between additional parameters and source location is utilized. The proposed method gives a final closed-form solution without iteration or the extra mathematics operations used in existing methods by employing the basic idea of WLS processing. Numerical examples show that the proposed method exhibits better robustness and performance compared with several existing methods.

In this paper, we propose a new technique for the transient scattering problem of periodically arrayed dispersion media for the TE case by using a combination of the Fourier series expansion method (FSEM) and the fast inversion Laplace transform (FILT) method, and analyze the pulse response for various widths of the dispersion media. As a result, we clarified the influence of the dispersion media with an air region on the resulting waveform.

Network virtualization is viewed as a promising approach to facilitate the sharing of physical infrastructure among different kinds of users and applications. In this letter, we propose a topological consistency-based virtual network embedding (TC-VNE) over elastic optical networks (EONs). Based on the concept of topological consistency, we propose a new node ranking approach, named Sum-N-Rank, which contributes to the reduction of optical path length between preferred substrate nodes. In the simulation results, we found our work contributes to improve spectral efficiency and balance link load simultaneously without deteriorating blocking probability.

For the three-user X channel, its degree of freedom (DoF) 9/5 has been shown achievable theoretically through asymptotic model with infinite resources, which is impractical. In this article, we explore the propagation delay (PD) feature among different links to maximize the achievable DoF with the minimum cost. Since perfect interference alignment (IA) is impossible for 9 messages within 5 time-slots, at least one extra time-slot should be utilized. By the cyclic polynomial approach, we propose a scheme with the maximum achievable DoF of 5/3 for 10 messages within 6 time-slots. Feasibility conditions in the Euclidean space are also deduced, which demonstrates a quite wide range of node arrangements.

With the existing of coverage holes, the Quality of Service (such as event response, package delay, and the life time et al.) of a Wireless Sensor Network (WSN) may become weaker. In order to recover the holes, one can locate them by identifying the boundary nodes on their edges. Little effort has been made to distinguish the boundary nodes in a model where wireless sensors are randomly deployed on a three-dimensional surface. In this paper, we propose a distributed method which contains three steps in succession. It first projects the 1-hop neighborhood of a sensor to the plane. Then, it sorts the projected nodes according to their angles and finds out if there exists any ring formed by them. At last, the algorithm validates a circle to confirm that it is a ring surrounding the node. Our solution simulates the behavior of rotating a semicircle plate around a sensor under the guidance of its neighbors. Different from the existing results, our method transforms a three-dimensional problem into a two-dimensional one and maintaining its original topology, and it does not rely on any complex Hamiltonian Cycle finding to test the existence of a circle in the neighborhood of a sensor. Simulation results show our method outperforms others at the correctness and effectiveness in identifying the nodes on the edges of a three-dimensional WSN.

Data-driven untying of a recursive autoencoder (RAE) is proposed for utterance intent classification for spoken dialogue systems. Although an RAE expresses a nonlinear operation on two neighboring child nodes in a parse tree in the application of spoken language understanding (SLU) of spoken dialogue systems, the nonlinear operation is considered to be intrinsically different depending on the types of child nodes. To reduce the gap between the single nonlinear operation of an RAE and intrinsically different operations depending on the node types, a data-driven untying of autoencoders using part-of-speech (PoS) tags at leaf nodes is proposed. When using the proposed method, the experimental results on two corpora: ATIS English data set and Japanese data set of a smartphone-based spoken dialogue system showed improved accuracies compared to when using the tied RAE, as well as a reasonable difference in untying between two languages.

Among the five carrier aggregation (CA) deployment scenarios, the most preferred scenario is Scenario 1, which maximizes CA gain by fully overlapping a primary cell (PCell) and one or more secondary cells (SCells). It is possible since the same frequency band is used between component carriers (CCs) so nearly the same coverage is expected. However, Scenario 1 cannot guarantee high throughput in multi-radio access technology carrier aggregation (multi-RAT CA) which is actively being researched. Different carrier frequency characteristics in multi-RAT CA makes it hard to accurately match different frequency ranges. If the ranges of PCell and SCell differ, high throughput may not be obtained despite the CA operation. We found a coverage mismatch of approximately 37% between the PCell and SCell in the deployed network and realized a reduced CA gain in those areas. In this paper, we propose a novel PCell change approach named “PCell frequency switching (PFS)” to guarantee high throughput against cell coverage mismatch in multi-RAT CA deployment scenario 1. The experiment results show that the throughput increased by 9.7% on average and especially by 80.9% around the cell edge area when PFS is applied instead of the legacy CA handover operation.

In this paper, we show exact bit error rates (BERs) for orthogonal space-time block code (OSTBC) decoded-and-forward (DF) relaying networks over independent and non-identically distributed (INID) Rayleigh fading channels. We consider both non-adaptive DF (non-ADF) and adaptive DF (ADF) schemes for OSTBC relay networks with arbitrary multiple-input multiple-output (MIMO) relay antenna configurations. For each scheme, we derive the probability density functions (PDFs) of indirect link and combined links, respectively. Based on the derived PDFs, we express exact BERs and then, their accuracy is verified by the comparison with simulation results. It is confirmed that the transmit diversity gain of the relay node can be obtained when the relay is close to the source and then, the receive diversity gain of the relay node as well as ADF gain over non-ADF can be obtained when the relay is close to the destination.

Communication reliability and energy efficiency are important issues that have to be carefully considered in WBAN design. Due to the large path loss variation of the WBAN channel, transmission power control, which adaptively adjusts the radio transmit power to suit the channel condition, is considered in this paper. Human motion is one of the dominant factors that affect the channel characteristics in WBAN. Therefore, this paper introduces motion-aware temporal correlation model-based transmission power control that combines human motion classification and transmission power control to provide an effective approach to realizing reliable and energy-efficient WBAN communication. The human motion classification adopted in this study uses only the received signal strength to identify the human motion; no additional tool is required. The knowledge of human motion is then used to accurately estimate the channel condition and suitably select the transmit power. A performance evaluation shows that the proposed method works well both in the low and high WBAN network loads. Compared to using the fixed Tx power of -5dBm, the proposed method had similar packet loss rate but 20-28 and 27-33 percent lower average energy consumption for the low network traffic and high network traffic cases, respectively.

Signed networks are ubiquitous in the real world. It is of great significance to study the problem of community detection in signed networks. In general, the behaviors of nodes in a signed network are rational, which coincide with the players in the theory of game that can be used to model the process of the community formation. Unlike unsigned networks, signed networks include both positive and negative edges, representing the relationship of friends and foes respectively. In the process of community formation, nodes usually choose to be in the same community with friends and between different communities with enemies. Based on this idea, we proposed a game theory model to address the problem of community detection in signed networks. Taking nodes as players, we build a gain function based on the numbers of positive edges and negative edges inside and outside a community, and prove the existence of Nash equilibrium point. In this way, when the game reaches the Nash equilibrium state, the optimal strategy space for all nodes is the result of the final community division. To systematically investigate the performance of our method, elaborated experiments on both synthetic networks and real-world networks are conducted. Experimental results demonstrate that our method is not only more accurate than other existing algorithms, but also more robust to noise.

Rotation symmetric Boolean functions which are invariant under the action of cyclic group have been used in many different cryptosystems. This paper presents a new construction of balanced odd-variable rotation symmetric Boolean functions with optimum algebraic immunity. It is checked that, at least for some small variables, such functions have very good behavior against fast algebraic attacks. Compared with some known rotation symmetric Boolean functions with optimum algebraic immunity, the new construction has really better nonlinearity. Further, the algebraic degree of the constructed functions is also high enough.

This report focuses on an optimization scheme of advanced MOSFETs for designing CMOS circuits with high power efficiency. For this purpose the physics-based compact model HiSIM2 is applied so that the relationship between device and circuit characteristics can be investigated properly. It is demonstrated that the short-channel effect, which is usually measured by the threshold-voltage shift relative to long-channel MOSFETs, provides a consistent measure for device-performance degradation with reduced channel length. However, performance degradations of CMOS circuits such as the power loss cannot be predicted by the threshold-voltage shift alone. Here, the subthreshold swing is identified as an additional important measure for power-efficient CMOS circuit design. The increase of the subthreshold swing is verified to become obvious when the threshold-voltage shift is larger than 0.15V.

The large computational complexity makes stereo matching a big challenge in real-time application scenario. The problem of stereo matching in a video sequence is slightly different with that in a still image because there exists temporal correlation among video frames. However, no existing method considered temporal consistency of disparity for algorithm acceleration. In this work, we proposed a scheme called the dynamic disparity range (DDR) to optimize matching cost calculation and cost aggregation steps by narrowing disparity searching range, and a scheme called temporal cost aggregation path to optimize the cost aggregation step. Based on the schemes, we proposed the DDR-SGM and the DDR-MCCNN algorithms for the stereo matching in video sequences. Evaluation results showed that the proposed algorithms significantly reduced the computational complexity with only very slight loss of accuracy. We proved that the proposed optimizations for the stereo matching are effective and the temporal consistency in stereo video is highly useful for either improving accuracy or reducing computational complexity.