Tomoaki SASAKI Junya SEKIKAWA Takayoshi KUBONO
Break arcs are generated in a DC48 V and 10 A resistive circuit. The external transverse magnetic field of a permanent magnet is applied to the break arcs. The position and shape of the break arc are investigated. As a result, it is confirmed that the cathode spot region was shifted upward earlier than the anode spot region. This result shows that the cathode spot region is easily driven by the transverse magnetic field than the anode spot region.
Chang-Jun AHN Ken-ya HASHIMOTO
Orthogonal space-time block code (OSTBC) can achieve full diversity with a simple MLD, but OSTBC only achieves 3/4 of the maximum rate if more than two transmit antennas are used. To solve this problem, a quasi-orthogonal STBC (QOSTBC) scheme has been proposed. Even though a QOSTBC scheme can achieve the full rate, there are interference terms resulting from neighboring signals during detection. The existing QOSTBC using the pairs of transmitted symbols can be detected with two parallel MLD. Therefore, MLD based QOSTBC has higher complexity than OSTBC. To reduce the detection complexity, in this paper, we propose the heterogeneous constellation based QOSTBC for improving the detection property of QRD-MLD with maintaining a simple decoding structure.
Tadayoshi DEGUCHI Hideshi TOMITA Atsushi KAMADA Manabu ARAI Kimiyoshi YAMASAKI Takashi EGAWA
Current collapse of AlGaN/GaN heterostructure field-effect transistors (HFETs) formed on qualified epitaxial layers on Si substrates was successfully suppressed using graded field-plate (FP) structures. To improve the reproducibility of the FP structure manufacturing process, a simple process for linearly graded SiO2 profile formation was developed. An HFET with a graded FP structure exhibited a significant decrease in an on-resistance increase ratio of 1.16 even after application of a drain bias of 600 V.
Kai BLEKKER Rene RICHTER Ryosuke ODA Satoshi TANIYAMA Oliver BENNER Gregor KELLER Benjamin MUNSTERMANN Andrey LYSOV Ingo REGOLIN Takao WAHO Werner PROST
We report on the fabrication and analysis of basic digital circuits containing InAs nanowire transistors on a host substrate. The nanowires were assembled at predefined positions by means of electric field-assisted self-assembly within each run generating numerous circuits simultaneously. Inverter circuits composed of two separated nanowire transistors forming a driver and an active load have been fabricated. The inverter circuits exhibit a gain (>1) in the MHz regime and a time constant of about 0.9 ns. A sample & hold core element is fabricated based on an InAs nanowire transistor connected to a hold capacitor, both on a Silicon and an InP isolating substrate, respectively. The low leakage read-out of the hold capacitor is done by InP-based metal-insulator heterojunction FET grown on the same substrate prior to nanowire FET fabrication. Experimental operation of the circuit is demonstrated at 100 MHz sampling frequency. The presented approach enables III/V high-speed, low-voltage logic circuits on a wide variety of host substrates which may be up scaled to high volume circuits.
Yasuhisa FUJII Kazumasa YAMAMOTO Seiichi NAKAGAWA
In this paper, we propose Hidden Conditional Neural Fields (HCNF) for continuous phoneme speech recognition, which are a combination of Hidden Conditional Random Fields (HCRF) and a Multi-Layer Perceptron (MLP), and inherit their merits, namely, the discriminative property for sequences from HCRF and the ability to extract non-linear features from an MLP. HCNF can incorporate many types of features from which non-linear features can be extracted, and is trained by sequential criteria. We first present the formulation of HCNF and then examine three methods to further improve automatic speech recognition using HCNF, which is an objective function that explicitly considers training errors, provides a hierarchical tandem-style feature and includes a deep non-linear feature extractor for the observation function. We show that HCNF can be trained realistically without any initial model and outperforms HCRF and the triphone hidden Markov model trained by the minimum phone error (MPE) manner using experimental results for continuous English phoneme recognition on the TIMIT core test set and Japanese phoneme recognition on the IPA 100 test set.
Xuesong MAO Daisuke INOUE Hiroyuki MATSUBARA Manabu KAGAMI
The power of laser radar received echoes varies over a large range due to many factors such as target distance, size, reflection ratio, etc, which leads to the difficulty of decoding codes from the received noise buried signals for spectrum code modulated laser radar. Firstly, a pseudo-random noise (PN) code modulated laser radar model is given, and the problem to be addressed is discussed. Then, a novel method based on Inter Symbol Interference (ISI) is proposed for resolving the problem, providing that only Additive White Gaussian Noise (AWGN) exists. The ISI effect is introduced by using a high pass filter (HPF). The results show that ISI improves laser radar receiver decoding ratio, thus the peak of the correlation function of decoded codes and modulation codes. Finally, the effect of proposed method is verified by a simple experiment.
Jung-Hoon KIM Tae-Heon JANG Sung-Kuk LIM Songjun LEE Sung-Il YANG
This paper presents a method to improve field uniformity using two TX antennas in a reverberation chamber with less steps of a stirrer. A mode-stirred reverberation chamber (MSRC) is considered as an alternative to the semi-anechoic chamber for an electromagnetic compatibility test because it provides a large test volume, a statistically uniform field, and a high maximum electric field. To improve field uniformity, we introduce two transmitting antennas for excitation in an MSRC, and predict statistical distribution of the complex reflection coefficients (scattering parameters). To prove the validation of our theory and the reliability of measurement results, three kinds of stirrers with different shape and sizes were fabricated and their efficiencies were measured in an MSRC, and then field uniformities have been investigated for 1–3 GHz frequency within the maximum number of independent samples that stirrers can provide. The measurement results show that the average received power is about 1.5 times as high as when using one transmitting antenna, and field uniformity is improved. Use of two transmitting antennas in an MSRC is regarded as a useful method to improve field uniformity at less stirrer steps, for radiated immunity tests.
Jegoon RYU Sei-ichiro KAMATA Alireza AHRARY
In this paper, we propose a novel gait recognition framework - Spherical Space Model with Human Point Clouds (SSM-HPC) to recognize front view of human gait. A new gait representation - Marching in Place (MIP) gait is also introduced which preserves the spatiotemporal characteristics of individual gait manner. In comparison with the previous studies on gait recognition which usually use human silhouette images from image sequences, this research applies three dimensional (3D) point clouds data of human body obtained from stereo camera. The proposed framework exhibits gait recognition rates superior to those of other gait recognition methods.
Qingyong LI Yaping HUANG Zhengping LIANG Siwei LUO
Automatic thresholding is an important technique for rail defect detection, but traditional methods are not competent enough to fit the characteristics of this application. This paper proposes the Maximum Weighted Object Correlation (MWOC) thresholding method, fitting the features that rail images are unimodal and defect proportion is small. MWOC selects a threshold by optimizing the product of object correlation and the weight term that expresses the proportion of thresholded defects. Our experimental results demonstrate that MWOC achieves misclassification error of 0.85%, and outperforms the other well-established thresholding methods, including Otsu, maximum correlation thresholding, maximum entropy thresholding and valley-emphasis method, for the application of rail defect detection.
Kazuya ZAITSU Koji YAMAMOTO Yasuto KURODA Kazunari INOUE Shingo ATA Ikuo OKA
Ternary content addressable memory (TCAM) is becoming very popular for designing high-throughput forwarding engines on routers. However, TCAM has potential problems in terms of hardware and power costs, which limits its ability to deploy large amounts of capacity in IP routers. In this paper, we propose new hardware architecture for fast forwarding engines, called fast prefix search RAM-based hardware (FPS-RAM). We designed FPS-RAM hardware with the intent of maintaining the same search performance and physical user interface as TCAM because our objective is to replace the TCAM in the market. Our RAM-based hardware architecture is completely different from that of TCAM and has dramatically reduced the costs and power consumption to 62% and 52%, respectively. We implemented FPS-RAM on an FPGA to examine its lookup operation.
Yutaro YAMASHITA Hiroyuki TORIKAI
A generalized version of a piece-wise constant (ab. PWC) spiking neuron model is presented. It is shown that the generalization enables the model to reproduce 20 activities in the Izhikevich model. Among the activities, we analyze tonic bursting. Using an analytical one-dimensional iterative map, it is shown that the model can reproduce a burst-related bifurcation scenario, which is qualitatively similar to that of the Izhikevich model. The bifurcation scenario can be observed in an actual hardware.
Chenhuang WU Zhixiong CHEN Xiaoni DU
We define a family of 2e+1-periodic binary threshold sequences and a family of p2-periodic binary threshold sequences by using Carmichael quotients modulo 2e (e > 2) and 2p (p is an odd prime), respectively. These are extensions of the construction derived from Fermat quotients modulo an odd prime in our earlier work. We determine exact values of the linear complexity, which are larger than half of the period. For cryptographic purpose, the linear complexities of the sequences in this letter are of desired values.
The scattering from a phase change disk that is illuminated by an optical near field through a ridged-square nano-aperture was analyzed. A finite-difference time-domain (FDTD) method installed with motion equations of free electrons was used in the analysis and a three dimensional disk structure was taken into consideration. The far-field scattering patterns from the phase change disk were analyzed and the sum-signal output through a condenser lens was calculated. The crosstalk between plural marks and the readout characteristics of mark trains were investigated.
Latsamy SAYSOURINHONG Bilan ZHU Masaki NAKAGAWA
This paper describes on-line recognition of handwritten Lao characters by adopting Markov random field (MRF). The character set to recognize includes consonants, vowels and tone marks, 52 characters in total. It extracts feature points along the pen-tip trace from pen-down to pen-up, and then sets each feature point from an input pattern as a site and each state from a character class as a label. It recognizes an input pattern by using a linear-chain MRF model to assign labels to the sites of the input pattern. It employs the coordinates of feature points as unary features and the transitions of the coordinates between the neighboring feature points as binary features. An evaluation on the Lao character pattern database demonstrates the robustness of our proposed method with recognition rate of 92.41% and respectable recognition time of less than a second per character.
Dae-Hwan KIM Young-Hwan YOU We-Duke CHO
We study threshold-based relaying in an amplify-and-forward (AF) cooperative diversity network. For the network, the relay helps the communication from the source to the destination only if the signal-to-noise ratio (SNR) of the link from the source to the relay is greater than or equal to a pre-determined threshold value; otherwise, the relay remains silent. We derive the exact bit-error rate (BER) of the threshold-based relaying for M-pulse amplitude modulation (PAM) and M-quadrature amplitude modulation (QAM). The obtained BER expression can help the design of the threshold-based relaying in determining the system parameters such as the transmission power, the amplifying coefficient at the relay, and the pre-determined threshold value.
This report focuses on a design method for gradient index (GRIN) lens antennas with controllable aperture field distributions. First, we derive differential equations representing optical paths in a gradient index medium with two optical surfaces by using geometrical optics, and then we formulate a novel design method for GRIN lens antennas based on these equations. The Levenberg-Marquardt algorithm is applied as a nonlinear least squares method to satisfy two conditions-focusing and shaping the aperture field distribution-thus realizing a prescribed radiation pattern. The conditions can be fulfilled by optimizing only the index (or permittivity) distribution, whereas the shapes of the optical surfaces remain as free parameters that can be utilized for other purposes, such as reducing reflection losses that occur on the surfaces, as illustrated in this report. A plano-concave GRIN lens is designed as an example, applying the proposed method, to realize a sidelobe level of -30 dB pseudo Taylor distribution, and a maximum sidelobe level of -29.1 dB was observed, indicating it is sufficiently accurate for practical use. In addition, we discuss the convergence of this method considering the relationship between the number of the initial conditions and the differential order of the design equations, factoring in scale invariance of the design equations.
Wei LIN Baoming BAI Xiao MA Rong SUN
A simplified algorithm for check node processing of extended min-sum (EMS) q-ary LDPC decoders is presented in this letter. Compared with the bubble check algorithm, the so-called dynamic bubble-check (DBC) algorithm aims to further reduce the computational complexity for the elementary check node (ECN) processing. By introducing two flag vectors in ECN processing, The DBC algorithm can use the minimum number of comparisons at each step. Simulation results show that, DBC algorithm uses significantly fewer comparison operations than the bubble check algorithm, and presents no performance loss compared with standard EMS algorithm on AWGN channels.
Hyungjin KIM Min-Chul SUN Hyun Woo KIM Sang Wan KIM Garam KIM Byung-Gook PARK
Although the Tunnel Field-Effect Transistor (TFET) is a promising device for ultra-low power CMOS technology due to the ability to reduce power supply voltage and very small off-current, there have been few reports on the control of VT for TFETs. Unfortunately, the TFET needs a different technique to adjust VT than the MOSFET by channel doping because most of TFETs are fabricated on SOI substrates. In this paper, we propose a technique to control VT of the TFET by putting an additional VT-control doping region (VDR) between source and channel. We examine how much VT is changed by doping concentration of VDR. The change of doping concentration modulates VT because it changes the semiconductor work function difference, ψs,channel-ψs,source, at off-state. Also, the effect of the size of VDR is investigated. The region can be confined to the silicon surface because most of tunneling occurs at the surface. At the same time, we study the optimum width of this region while considering the mobility degradation by doping. Finally, the effect of the SOI thickness on the VDR adjusted VT of TFET is also investigated.
Keigo TAKEUCHI Toshiyuki TANAKA Tsutomu KAWABATA
Kudekar et al. proved an interesting result in low-density parity-check (LDPC) convolutional codes: The belief-propagation (BP) threshold is boosted to the maximum-a-posteriori (MAP) threshold by spatial coupling. Furthermore, the authors showed that the BP threshold for code-division multiple-access (CDMA) systems is improved up to the optimal one via spatial coupling. In this letter, a phenomenological model for elucidating the essence of these phenomenon, called threshold improvement, is proposed. The main result implies that threshold improvement occurs for spatially-coupled general graphical models.
Shi-Ze GUO Zhe-Ming LU Guang-Yu KANG Zhe CHEN Hao LUO
Small-world is a common property existing in many real-life social, technological and biological networks. Small-world networks distinguish themselves from others by their high clustering coefficient and short average path length. In the past dozen years, many probabilistic small-world networks and some deterministic small-world networks have been proposed utilizing various mechanisms. In this Letter, we propose a new deterministic small-world network model by first constructing a binary-tree structure and then adding links between each pair of brother nodes and links between each grandfather node and its four grandson nodes. Furthermore, we give the analytic solutions to several topological characteristics, which shows that the proposed model is a small-world network.