Deshan CHEN Atsushi MIYAMOTO Shun'ichi KANEKO
This paper describes a robust three-dimensional (3D) surface reconstruction method that can automatically eliminate shadowing errors. For modeling shadowing effect, a new shadowing compensation model based on the angle distribution of backscattered electrons is introduced. Further, it is modified with respect to some practical factors. Moreover, the proposed iterative shadowing compensation method, which performs commutatively between the compensation of image intensities and the modification of the corresponding 3D surface, can effectively provide both an accurate 3D surface and compensated shadowless images after convergence.
Adriano MUNIZ Kazuya TSUKAMOTO Masato TSURU Yuji OIE
With the approval of IEEE 1901 standard for power line communications (PLC) and the recent Internet-enable home appliances like the IPTV having access to a content-on-demand service through the Internet as AcTVila in Japan, there is no doubt that PLC has taken a great step forward to emerge as the preeminent in-home-network technology. However, existing schemes developed so far have not considered the PLC network connected to an unstable Internet environment (i.e. more realistic situation). In this paper, we investigate the communication performance from the end-user's perspective in networks with large and variable round-trip time (RTT) and with the existence of cross-traffic. Then, we address the problem of unfair bandwidth allocation when multiple and different types of flows coexist and propose a TCP rate control considering the difference in terms of end-to-end delay to solve it. We validate our methodology through simulations, and show that it effectively deals with the throughput unfairness problem under critical communication environment, where multiple flows with different RTTs share the PLC and cross-traffic exists on the path of the Internet.
Kazuhiro HONDA Kun LI Koichi OGAWA
This paper presents the shadowing analysis of a body area network (BAN) diversity antenna based on the statistical measurements of the human walking motion. First, the dynamic characteristics of the arm-swing motion were measured using human subjects, and a statistical analysis was then carried out using the measured data to extract useful information for the analysis of a BAN diversity antenna. Second, the analytical results of the shadowing effects of the BAN antenna were shown based on the statistical data of the swing motion. The difference between the typical and the realistic arm-swinging models significantly affected the bit error rate (BER) characteristic of the BAN antenna. To eliminate the shadowing caused by the movement of the arms, a BAN diversity antenna was used. Particular emphasis was placed on the evaluation of the spatial separation of the diversity antennas to attain reduction of the signal-to-noise ratio (SNR) required to achieve a specific BER performance, considering the combined outcome of shadowing and multipath fading unique to BAN antenna systems. We determined that an antenna angle separation of greater than 80° is required to reduce the shadowing effects when the diversity antenna is mounted at the left waist in a symmetrical configuration. Further, an antenna angle separation of 120° is required when the diversity antenna is mounted in an asymmetric configuration.
For face recognition with a single training image per person, Collaborative Representation based Classification (CRC) has significantly less complexity than Extended Sparse Representation based Classification (ESRC). However, CRC gets lower recognition rates than ESRC. In order to combine the advantages of CRC and ESRC, we propose Extended Collaborative Representation based Classification (ECRC) for face recognition with a single training image per person. ECRC constructs an auxiliary intraclass variant dictionary to represent the possible variation between the testing and training images. Experimental results show that ECRC outperforms the compared methods in terms of both high recognition rates and low computation complexity.
Akira SAITOU Kohei HASEGAWA Ryo ISHIKAWA Kazuhiko HONJO
A novel spatially modulated communication method, appropriate for wireless power transmission applications at 5.8GHz, is proposed using dual scatterers embedded with lumped elements. Analytical expression for the received wave in the spatial modulation is derived, and the characteristics are verified with simulation and measurement by varying the embedded capacitor. The maximum measured variation of the received voltage is more than 15dB and that of the phase is more than 270 degrees at 5.8GHz. The estimated amplitude modulation factor is more than 70%. Using the data obtained, we estimate the practical received waveforms modulated by the applied voltage to a varactor for the amplitude modulation scheme.
Ryoichi TAKASHIMA Tetsuya TAKIGUCHI Yasuo ARIKI
This paper presents a voice conversion (VC) technique for noisy environments, where parallel exemplars are introduced to encode the source speech signal and synthesize the target speech signal. The parallel exemplars (dictionary) consist of the source exemplars and target exemplars, having the same texts uttered by the source and target speakers. The input source signal is decomposed into the source exemplars, noise exemplars and their weights (activities). Then, by using the weights of the source exemplars, the converted signal is constructed from the target exemplars. We carried out speaker conversion tasks using clean speech data and noise-added speech data. The effectiveness of this method was confirmed by comparing its effectiveness with that of a conventional Gaussian Mixture Model (GMM)-based method.
Kazi OBAIDULLAH Constantin SIRITEANU Shingo YOSHIZAWA Yoshikazu MIYANAGA
Genetic algorithm (GA) is now an important tool in the field of wireless communications. For multiple-input/multiple-output (MIMO) wireless communications system employing spatial multiplexing transmission, we evaluate the effects of GA parameters value on channel parameters in fading channels. We assume transmit-correlated Rayleigh and Rician fading with realistic Laplacian power azimuth spectrum. Azimuth spread (AS) and Rician K-factor are selected according to the measurement-based WINNER II channel model for several scenarios. Herein we have shown the effects of GA parameters and channel parameters in different WINNER II scenarios (i.e., AS and K values) and rank of the deterministic components. We employ meta GA that suitably selects the population (P), generation (G) and mutation probability (pm) for the inner GA. Then we show the cumulative distribution function (CDF) obtain experimentally for the condition number C of the channel matrix H. It is found that, GA parameters depend on the channel parameters, i.e., GA parameters are the functions of the channel parameters. It is also found that for the poorer channel conditions smaller GA parameter values are required for MIMO detection. This approach will help to achieve maximum performance in practical condition for the lower numerical complexity.
Chenyue MA Hans Jürgen MATTAUSCH Masataka MIYAKE Takahiro IIZUKA Kazuya MATSUZAWA Seiichiro YAMAGUCHI Teruhiko HOSHIDA Akinori KINOSHITA Takahiko ARAKAWA Jin HE Mitiko MIURA-MATTAUSCH
A predictive compact model of p-MOSFET negative bias temperature instability (NBTI) degradation for circuit simulation is reported with unified description of the interface-state-generation and hole-trapping mechanisms. It is found that the hole-trapping is responsible for the initial stage of the stress degradation, and the interface-state generation dominates the degradation afterwards, especially under high stress conditions. The predictive compact model with 8 parameters enables to reproduce the measurement results of the NBTI degradation under a wide range of stress bias conditions. Finally, the developed NBTI model is implemented into the compact MOSFET model HiSIM for circuit degradation simiulation.
Hideki YOSHIKAWA Masahiro KAMINAGA Arimitsu SHIKODA Toshinori SUZUKI
We present a round addition differential fault analysis (DFA) for some lightweight 80-bit block ciphers. It is shown that only one correct ciphertext and two faulty ciphertexts are required to reconstruct secret keys in 80-bit Piccolo and TWINE, and the reconstructions are easier than 128-bit CLEFIA.
In this paper, we present a real-time hand pose recognition method to provide an intuitive user interface through hand poses or gestures without a keyboard and a mouse. For this, the areas of right and left hands are segmented from the depth camera image, and noise compensation is performed. Then, the rotation angle and the centroid point of each hand area are calculated. Subsequently, joint points and end points of a finger are detected by expanding a circle at regular intervals from a centroid point of the hand. Lastly, the hand pose is recognized by matching between the current hand information and the hand model of previous frame and the hand model is updated for the next frame. This method enables users to predict the hidden fingers through the hand model information of the previous frame using temporal coherence in consecutive frames. As a result of the experiment on various hand poses with the hidden fingers using both hands, the accuracy showed over 95% and the performance indicated over 32fps. The proposed method can be used as a contactless input interface in presentation, advertisement, education, and game applications.
Sung-Tai CHOI Ji-Youp KIM Jong-Seon NO
In this paper, for an odd prime p such that p≡3 mod 4, odd n, and d=(pn+1)/(pk+1)+(pn-1)/2 with k|n, the value distribution of the exponential sum S(a,b) is calculated as a and b run through $mathbb{F}_{p^n}$. The sequence family $mathcal{G}$ in which each sequence has the period of N=pn-1 is also constructed. The family size of $mathcal{G}$ is pn and the correlation magnitude is roughly upper bounded by $(p^k+1)sqrt{N}/2$. The weight distribution of the relevant cyclic code C over $mathbb{F}_p$ with the length N and the dimension ${ m dim}_{mathbb{F}_p}mathcal{C}=2n$ is also derived.
Naoya ONIZAWA Atsushi MATSUMOTO Takahiro HANYU
This paper introduces open-wire fault-resilient multiple-valued codes for reliable asynchronous point-to-point global communication links. In the proposed encoding, two communication modules assign complementary codewords that change between two valid states without an open-wire fault. Under an open-wire fault, at each module, the codewords don't reach to one of the two valid states and remains as “invalid” states. The detection of the invalid states makes it possible to stop sending wrong codewords caused by an open-wire fault. The detectability of the open-wire fault based on the proposed encoding is proven for m-of-n codes. The proposed code used in the multiple-valued asynchronous global communication link is capable of detecting a single open-wire fault with 3.08-times higher coding efficiency compared with a conventional multiple-valued code used in a triple-modular redundancy (TMR) link that detects an open-wire fault under the same dynamic range of logical values.
Tsu-Lin LI Masaki HASHIZUME Shyue-Kung LU
NROM is one of the emerging non-volatile-memory technologies, which is promising for replacing current floating-gate-based non-volatile memory such as flash memory. In order to raise the fabrication yield and enhance its reliability, a novel test and repair flow is proposed in this paper. Instead of the conventional fault replacement techniques, a novel fault masking technique is also exploited by considering the logical effects of physical defects when the customer's code is to be programmed. In order to maximize the possibilities of fault masking, a novel data inversion technique is proposed. The corresponding BIST architectures are also presented. According to experimental results, the repair rate and fabrication yield can be improved significantly. Moreover, the incurred hardware overhead is almost negligible.
Yongwon JEONG Sangjun LIM Young Kuk KIM Hyung Soon KIM
We present an acoustic model adaptation method where the transformation matrix for a new speaker is given by the product of bases and a weight matrix. The bases are built from the parallel factor analysis 2 (PARAFAC2) of training speakers' transformation matrices. We perform continuous speech recognition experiments using the WSJ0 corpus.
We propose a fault diagnosis and reconfiguration method based on the Pair and Swap scheme to improve the reliability and the MTTF (Mean Time To Failure) of network-on-chip based multiple processor systems where each processor core has its private memory. In the proposed scheme, two identical copies of a given task are executed on a pair of processor cores and the results are compared repeatedly in order to detect processor faults. If a fault is detected by mismatches, the fault is identified and isolated using a TMR (Triple Module Redundancy) and the system is reconfigured by the redundant processor cores. We propose that each task is quadruplicated and statically assigned to private memories so that each memory has only two different tasks. We evaluate the reliability of the proposed quadruplicated task allocation scheme in the viewpoint of MTTF. As a result, the MTTF of the proposed scheme is over 4.3 times longer than that of the duplicated task allocation scheme.
Keehang KWON Sungwoo HUR Mi-Young PARK
To deal with failures as simply as possible, we propose a new foundation for the core (untyped) C++, which is based on a new logic called task logic or imperative logic. We then introduce a sequential-disjunctive statement of the form S : R. This statement has the following semantics: execute S and R sequentially. It is considered a success if at least one of S, R is a success. This statement is useful for dealing with inessential errors without explicitly catching them.
John W. McBRIDE Chamaporn CHIANRABUTRA Liudi JIANG Suan Hui PU
Multi-Walled CNT (MWCNT) are synthesized on a silicon wafer and sputter coated with a gold film. The planar surfaces are mounted on the tip of a piezo-electric actuator and mated with a gold coated hemispherical surface to form an electrical contact. These switching contacts are tested under conditions typical of MEMS relay applications; 4V, with a static contact force of 1mN, at a low current between 20-50mA. The failure of the switch is identified by the evolution of contact resistance which is monitored throughout the switching cycles. The results show that the contact resistance can be stable for up to 120 million switching cycles, which are 106 orders of higher than state-of-the-art pure gold contact. Bouncing behavior was also observed in each switching cycle. The failing mechanism was also studied in relation to the contact surface changes. It was observed that the contact surfaces undergo a transfer process over the switching life time, ultimately leading to switching failure the number of bounces is also related to the fine transfer failure mechanism.
This paper investigates potential to improve fault-detection coverage by means of on-chip redundancy. The international standard on functional safety, namely, IEC61508 Ed. 2.0 Part 2 Annex E.3 prescribes the upper bound of βIC (common cause failure (CCF) ratio to all failures) is 0.25 to satisfy frequency upper bound of dangerous failure in the safety function for SIL (Safety Integrated Level) 3. On the other hand, this paper argues that the βIC does not necessarily have to be less than 0.25 for SIL 3, and that the upper bound of βIC can be determined depending on failure rate λ and CCF detection coverage. In other words, the frequency upper bound of dangerous failure for SIL3 can also be satisfied with βIC higher than 0.25 if the failure rate λ is lower than 400[fit]. Moreover, the paper shows that on-chip redundancy has potential to satisfy SIL 4 requirement; the frequency upper bound of dangerous failure for SIL4 can be satisfied with feasible ranges of βIC, λ and CCF coverage which can be realized by redundant code.
In this paper, we present an approach for 3D face recognition based on Multi-level Partition of Unity (MPU) Implicits under pose and expression variations. The MPU Implicits are used for reconstructing 3D face surface in a hierarchical way. Three landmarks, nose, left eyehole and right eyehole, can be automatically detected with the analysis of curvature features at lower levels of reconstruted face. Thus, the 3D faces are initially registered to a common coordinate system based on the three landmarks. A variant of Iterative Closest Point (ICP) algorithm is proposed for matching the point surface of a given probe face to the implicits face surface in the gallery. To evaluate the performance of our approach for 3D face recognition, we perform an experiment on GavabDB face database. The results of the experiment show that our method based on MPU Implicits and Adaptive ICP has great capability for 3D face recognition under pose and expression variations.
We propose a low-overhead fault-secure parallel prefix adder. We duplicate carry bits for checking purposes. Only one half of normal carry bits are compared with the corresponding redundant carry bits, and the hardware overhead of the adder is low. For concurrent error detection, we also predict the parity of the result. The adder uses parity-based error detection and it has high compatibility with systems that have parity-based error detection. We can implement various fault-secure parallel prefix adders such as Sklansky adder, Brent-Kung adder, Han-Carlson adder, and Kogge-Stone adder. The area overhead of the proposed adder is about 15% lower than that of a previously proposed adder that compares all the carry bits.