In this paper, Epitaxial (Epi) Junction Termination Extension (JTE) technique for silicon carbide (SiC) power device is presented. Unlike conventional JTE, the Epi-JTE doesn't require high temperature (about 500°C) implantation process. Thus, it doesn't require high temperature (about 1700°C) process for implanted dose activation and surface defect curing. Therefore, the manufacturing cost will be decreased. Also, the fabrication process is very simple because the dose of the JTE is controlled by epitaxy growth. The blocking characteristic is analyzed through 2D-simulation for the proposed Epi-JTE. In addition, the effect was validated by experiment of fabricated SiC device with the Single-Zone-Epi-JTE. As a result, it has blocking capability of 79.4% compared to ideal parallel-plane junction breakdown.

This paper proposes an effective continuous super-resolution (CSR) algorithm for the multipath channel estimation. By designing a preamble including up-chirp and down-chirp symbols, the Doppler shift and multipath delay are estimated jointly by using convex programming. Simulation results show that the proposed CSR can achieve better detection probability of the number of multipaths than the eigenvalue based methods. Moreover, compared with conventional super-resolution techniques, such as MUSIC and ESPRIT methods, the proposed CSR algorithm demonstrates its advantage in root mean square error of the Doppler shift and multipath delay, especially for the closely located paths within low SNR.

Image interpolation is one of the image upsampling technologies from a single input image. This technology obtains high resolution images by fitting functions or models. Although image interpolation methods are faster than other upsampling technologies, they tend to cause jaggies and blurs in edge and texture regions. Multi-surface Fitting is one of the image upsampling techniques from multiple input images. This algorithm utilizes multiple local functions and the weighted means of the estimations in each local function. Multi-surface Fitting obtains high quality upsampled images. However, its quality depends on the number of input images. Therefore, this method is used in only limited situations. In this paper, we propose an image interpolation method with both high quality and a low computational cost which can be used in many situations. We adapt the idea of Multi-surface Fitting for the image upsampling problems from a single input image. We also utilize local functions to reduce blurs. To improve the reliability of each local function, we introduce new weights in the estimation of the local functions. Besides, we improve the weights for weighted means to estimate a target pixel. Moreover, we utilize convolutions with small filters instead of the calculation of each local function in order to reduce the computational cost. Experimental results show our method obtains high quality output images without jaggies and blurs in short computational time.

In this paper, we consider a coherently distributed (CD) source model. Since the CD source is characterized by four parameters: central azimuth direction-of-arrival (DOA), azimuth angular spread, central elevation DOA and elevation angular spread, the parameter estimation is normally complex. We propose an algorithm that combines the rotational invariance techniques (ESPRIT) and the generalized ESPRIT algorithm for the 2-dimensional (2D) central DOA estimation of CD sources. Using a pair of uniform circular arrays (UCAs), the proposed solution is able to obtain the central DOAs with both high accuracy and low computational complexity. The central elevation DOAs are estimated by using the rotational invariance relation between the two uniform circular sub-arrays. Based on the centrosymmetric structure of UCA, the generalized ESPRIT algorithm is then applied to estimate the central azimuth DOAs through one-dimensional searching. It is noteworthy that the central DOAs are estimated without any information of the deterministic angular distribution function (DADF). The performance of the proposed algorithm is demonstrated via computer simulations.

Recently, several methods to process continuous queries for mobile objects in broadcast environments have been proposed. We propose a new indexing method for processing continuous queries that uses vector information in broadcast environments. We separate the index structure according to the velocities of the objects to avoid unnecessary accesses. The index structure consists of the index files for the slow moving objects and the fast moving objects. By avoiding unnecessary accesses, we reduce the tuning time to process a query in broadcast environments. To show the superiority of the proposed method, we evaluate its performance from various perspectives.

The paper presents a small reversible language R-CORE, a structured imperative programming language with symbolic tree-structured data (S-expressions). The language is reduced to the core of a reversible language, with a single command for reversibly updating the store, a single reversible control-flow operator, a limited number of variables, and data with a single atom and a single constructor. Despite its extreme simplicity, the language is reversibly universal, which means that it is as powerful as any reversible language can be, while it is linear-time self-interpretable, and it allows reversible programming with dynamic data structures. The four-line program inverter for R-CORE is among the shortest existing program inverters, which demonstrates the conciseness of the language. The translator to R-CORE, which is used to show the formal properties of the language, is clean and modular, and it may serve as a model for related reversible translation problems. The goal is to provide a language that is sufficiently concise for theoretical investigations. Owing to its simplicity, the language may also be used for educational purposes.

In this paper, we propose a new paradigm of deterministic PSO, named piecewise-linear particle swarm optimizer (PPSO). In PPSO, each particle has two search dynamics, a convergence mode and a divergence mode. The trajectory of each particle is switched between the two dynamics and is controlled by parameters. We analyze convergence condition of each particle and investigate parameter conditions to allow particles to converge to an equilibrium point through numerical experiments. We further compare solving performances of PPSO. As a result, we report here that the solving performances of PPSO are substantially the same as or superior to those of PSO.

In this letter, a simple and robust synchronization algorithm for second generation terrestrial digital video broadcasting (DVB-T2) receivers is proposed. In the proposed detection scheme, the coarse symbol timing is estimated by decimating a correlation output to give a sharper peak timing detection metric. Such a design can improve the timing synchronization accuracy as well as enhance its robustness to frequency selective channels.

High availability is crucial for industrial Ethernet networks and Ethernet-based control systems, such as automation networks and substation automation systems. Because the standard Ethernet does not support fault tolerance capability, the high availability of Ethernet networks can be increased by using redundancy protocols. Various redundancy protocols for Ethernet networks have been developed and standardized, such as rapid spanning tree protocol (RSTP), media redundancy protocol (MRP), parallel redundancy protocol (PRP), high-availability seamless redundancy (HSR), and others. RSTP and MRP provide redundancy in the network, whereas PRP and HSR provide redundancy in the end nodes. RSTP and MRP have a disadvantage in switchover delay. PRP and HSR provide zero recovery time, but PRP requires a duplicate network infrastructure, and HSR is mainly used in ring-based topologies. Additionally, PRP and HSR provide seamless redundancy in the end nodes and are applied in dedicated HSR networks with dedicated HSR nodes. In this paper, we present a novel seamless redundancy protocol for Ethernet networks, which is called the Redundancy Protocol for Ethernet (RPE). The RPE provides seamless redundancy in the network. This protocol not only provides seamless communications with zero switchover time in case of failure but also supports all topologies. The RPE is transparent and compatible with standard Ethernet nodes. These features make the RPE very useful in time-critical and mission-critical systems, such as substation automation systems, automation networks, and other industrial Ethernet networks.

In general, tunnel diodes exhibit various types of oscillation mode: the sinusoidal mode or the nonsinusoidal mode which is known as the relaxation oscillation (RO) mode. We derive a condition for generating the RO in resonant tunneling diodes (RTDs) with essential components for equivalent circuit model. A conditional equation to obtain sufficient nonlinearity towards the robust RO is clarified. Moreover, its condition also can be applied in case of a bow-tie antenna integrated RTD, thus a design policy to utilize the RO region for the antenna integrated RTD is established by numerical evaluations of time-domain large-signal nonlinear analysis towards a terahertz transmitter for broadband wireless communications.

To improve the quality of waveforms and achieve a high input power factor (IPF) for matrix rectifier, a novel quasi sliding mode control (SMC) with adaptive compensation is proposed in this letter. Applying quasi-SMC can effective obviate the disturbances of time delay and spatial lag, and SMC based on continuous function is better than discontinuous function to eliminate the chattering. Furthermore, compared with conventional compensation, an adaptive quasi-SMC compensation without any accurate detection for internal parameters is easier to be implementated, which has shown a superior advance. Theoretical analysis and experiments are carried out to validate the correctness of the novel control scheme.

In this paper, the posterior matching scheme proposed by Shayevits and Feder is extended to the Gaussian broadcast channel with feedback, and the error probabilities and achievable rate region are derived for this coding strategy by using the iterated random function theory. A variant of the Ozarow-Leung code for the general two-user broadcast channel with feedback can be realized as a special case of our coding scheme. Furthermore, for the symmetric Gaussian broadcast channel with feedback, our coding scheme achieves the linear-feedback sum-capacity like the LQG code and outperforms the Kramer code.

Fuzzy techniques can implement the fine-grained access control of encrypted data in the Cloud because they support error-tolerance. In this system, using biometric attributes such as fingerprints, faces and irises as pubic parameters is advantageous over those systems based on Public Key Infrastructure (PKI). This is because biometric information is unique, unforgettable and non-transferable. However the biometric-attribute measurements are noisy and most of the existing encryption systems can not support the biometric-attribute encryption. Additionally, the previous fuzzy encryption schemes only achieve the selective security which is a weak security model. To overcome these drawbacks, we propose a new fuzzy encryption scheme based on the lattice in this letter. The proposed scheme is based on a hierarchical identity-based encryption with fixed-dimensional private keys space and thus has short public parameters and short private keys, which results in high computation efficiency. Furthermore, it achieves the strong security, i.e., adaptive security. Lastly, the security is reduced to the learning with errors (LWE) problem in the standard model.

The biometrical identification system, introduced by Willems et al., is a system to identify individuals based on their measurable physical characteristics. Willems et al. characterized the identification capacity of a discrete memoryless biometrical identification system from information theoretic perspectives. Recently, Mori et al. have extended this scenario to list-decoding whose list size is an exponential function of the data length. However, as the data length increases, how the maximum identification error probability (IEP) behaves for a given rate has not yet been characterized for list-decoding. In this letter, we investigate the reliability function of the system under fixed-size list-decoding, which is the optimal exponential behavior of the maximum IEP. We then use Arimoto's argument to analyze a lower bound on the maximum IEP with list-decoding when the rate exceeds the capacity, which leads to the strong converse theorem. All results are derived under the condition that an unknown individual need not be uniformly distributed and the identification process is done without the knowledge of the prior distribution.

With the advances in computer processing that have yielded an enormous increase in performance, numerical analytical approaches based on electromagnetic theory have recently been applied to mobile radio propagation analysis. One such approach is the ray-tracing method based on geometrical optics and the uniform geometrical theory of diffraction. In this paper, ray-tracing techniques that have been proposed in order to improve computational accuracy and speed are surveyed. First, imaging and ray-launching methods are described and their extended methods are surveyed as novel fundamental ray-tracing techniques. Next, various ray-tracing acceleration techniques are surveyed and categorized into three approaches, i.e., deterministic, heuristic, and brute force. Then, hybrid methods are surveyed such as those employing Physical optics, the Effective Roughness model, and the Finite-Difference Time-Domain method that have been proposed in order to improve analysis accuracy.

This paper proposes a null-space expansion scheme for multiuser massive MIMO transmission in order to suppress inter-user interference (IUI) triggered by the temporal variation of the channel. The downlink multiuser MIMO channel capacity of time varying channels is severely degraded since IUI must be suppressed at the transmitter side by using past estimated channel state information at the transmitter side (CSIT). Massive MIMO has emerged as one of the most promising technologies for further capacity enhancement by increasing the number of base station (BS) antenna elements. Exploiting the excess degrees of freedom (DoFs) inherent in massive MIMO, a BS with the proposed IUI suppression scheme performs multiple null-steering for each UE (User Equipment) antenna element, which expands the null-space dimension. Computer simulations show that the proposed scheme has superior IUI suppression performance to the existing channel prediction scheme in time varying channels.

In this paper, we introduce the new concept of temporal diversity utilization based on asymmetric transmission to minimize network interference in wireless ad-hoc networks with a two-hop half-duplex relaying (HDR) protocol. Asymmetric transmission is an interference-aware backoff technique, in which each communication session (source-relay-destination link) adaptively chooses a certain subset of spectrally-orthogonal data streaming which should be delayed by the duration of one time-slot (i.e., half of one subframe). We design the problem in the HDR scenario by applying the concept of asymmetric transmission, and evaluate the game-theoretical algorithm, called asymmetric transmission game (ATG), to derive the suboptimal solution. We show that ATG is an exact potential game, and derive its convergence and optimality properties. Furthermore, we develop an approximated version of ATG (termed A-ATG) in order to reduce signaling and computational complexity. Numerical results verify that two algorithms proposed show significant synergistic effects when collaborating with the conventional methods in terms of interference coordination. Ultimately, the energy consumption to satisfy the rate requirement is reduced by up to 17.4% compared to the conventional schemes alone.

We propose a wideband reconfigurable circular-polarized single-port antenna to realize high-density linear integration for use in ground penetrating radars. We switch PIN diodes at a T-shaped probe to change its polarization. The forward- and reverse-biased probes work in cooperation to generate circular polarization. Experiments demonstrate the working bandwidths of 20.0% and 18.6% in the left- and right-hand polarization states, respectively, with 7.2 GHz center frequency. They are wider than those of conventional reconfigurable single-port circular-polarized antennas.

For IP-based mobile networks, efficient mobility management is vital to provision seamless online service. IP address starvation and scalability issue constrain the wide deployment of existing mobility schemes, such as Mobile IP, Proxy Mobile IP, and their derivations. Most of the studies focus on the scenario of mobility among public networks. However, most of current networks, such as home networks, sensor networks, and enterprise networks, are deployed with private networks hard to apply mobility solutions. With the rapid development, Software Defined Networking (SDN) offers the opportunity of innovation to support mobility in private network schemes. In this paper, a novel mobility management scheme is presented to support mobile node moving from public network to private network in a seamless handover procedure. The centralized control manner and flexible flow management in SDN are utilized to provide network-based mobility support with better QoS guarantee. Benefiting from SDN/OpenFlow technology, complex handover process is simplified with fewer message exchanges. Furthermore, handover efficiency can be improved in terms of delay and overhead reduction, scalability, and security. Analytical analysis and implementation results showed a better performance than mobile IP in terms of latency and throughput variation.

The purpose of DNA sequencing is to determine the order of nucleotides within a DNA molecule of target. The target DNA molecules are fragmented into short reads, which are short fixed-length subsequences composed of ‘A’, ‘C’, ‘G’ ‘T’, by next generation sequencing (NGS) machine. To reconstruct the target DNA from the short reads using a reference genome, which is a representative example of a species that was constructed in advance, it is necessary to determine their locations in the target DNA from where they have been extracted by aligning them onto the reference genome. This process is called short read mapping, and it is important to improve the performance of the short read mapping to realize fast DNA sequencing. We propose three types of FPGA acceleration methods based on hash table; (1) sorting and parallel comparison, (2) matching that allows one mutation to reduce the number of the candidates, (3) optimized hash function using variable masks. The first one reduces the number of accesses to off-chip memory to avoid the bottleneck by access latency. The second one enables to reduce the number of the candidates without degrading mapping sensitivity by allowing one mutation in the comparison. The last one reduces hash collisions using a table that was calculated from the reference genome in advance. We implemented the three methods on Xilinx Virtex-7 and evaluated them to show their effectiveness of them. In our experiments, our system achieves 20 fold of processing speed compared with BWA, which is one of the most popular mapping tools. Furthermore, we shows that the our system outperforms one of the fastest FPGA short read mapping systems.