Yang YU Shiro HANDA Fumihito SASAMORI Osamu TAKYU
In this paper, through extrinsic information transfer (EXIT) band chart analysis, an adaptive iterative decoding approach (AIDA) is proposed to reduce the iterative decoding complexity and delay for finite-length differentially encoded Low-density parity-check (DE-LDPC) coded systems with multiple-symbol differential detection (MSDD). The proposed AIDA can adaptively adjust the observation window size (OWS) of the MSDD soft-input soft-output demodulator (SISOD) and the outer iteration number of the iterative decoder (consisting of the MSDD SISOD and the LDPC decoder) instead of setting fixed values for the two parameters of the considered systems. The performance of AIDA depends on its stopping criterion (SC) which is used to terminate the iterative decoding before reaching the maximum outer iteration number. Many SCs have been proposed; however, these approaches focus on turbo coded systems, and it has been proven that they do not well suit for LDPC coded systems. To solve this problem, a new SC called differential mutual information (DMI) criterion, which can track the convergence status of the iterative decoding, is proposed; it is based on tracking the difference of the output mutual information of the LDPC decoder between two consecutive outer iterations of the considered systems. AIDA using the DMI criterion can adaptively adjust the out iteration number and OWS according to the convergence situation of the iterative decoding. Simulation results show that compared with using the existing SCs, AIDA using the DMI criterion can further reduce the decoding complexity and delay, and its performance is not affected by a change in the LDPC code and transmission channel parameters.
Masataka MORIYA Hiroyuki TAKIZAWA Yoshinao MIZUGAKI
The three-bit balanced ternary quantum voltage generator was designed and tested. This voltage generator is based on zero-crossing Shapiro steps (ZCSSs) in asymmetric two-junction SQUID. ZCSSs were observed on the current-voltage curves, and maximum and minimum current of ZCSSs were almost same, respectively for the three bits. 27-step quantum voltages from -13Φ0f to +13 Φ0f were observed by combinations of inputs of bit1, bit2 and bit3.
Ji-Won HUH Shuji ISOBE Eisuke KOIZUMI Hiroki SHIZUYA
In this paper, we investigate a relationship between the length-decreasing self-reducibility and the many-one-like reducibilities for partial multivalued functions. We show that if any parsimonious (many-one or metric many-one) complete function for NPMV (or NPMVg) is length-decreasing self-reducible, then any function in NPMV (or NPMVg) has a polynomial-time computable refinement. This result implies that there exists an NPMV (or NPMVg)-complete function which is not length-decreasing self-reducible unless P = NP.
This paper presents a novel decision feedback equalizer (DFE) with block delay detection for the joint transceiver design that uses channel state information (CSI). The block delay detection in the proposed DFE offers a degree of freedom for optimizing the precoder of the transmitter, provided the transmission power is constrained. In the proposed DFE, the feedforward matrix is devised to enable a block-based equalizer that can be cooperated with an intrablock decision feedback equalizer for suppressing the intersymbol interference (ISI) for the transmitted block with a certain block delay. In this design, the interblock interference (IBI) for the delay block is eliminated in advance by applying the recently developed oblique projection framework to the implementation of the feedforward matrix. With knowledge of full CSI, the block delay and the associated block-based precoder are jointly designed such that the average bit-error-rate (BER) is minimized, subject to the transmission power constraint. Separate algorithms are derived for directly determining the BER-minimized block delays for intrablock minimum mean-squared error (MMSE) and zero-forcing (ZF) equalization criteria. Theoretical derivations indicate that the proposed MMSE design simultaneously maximize the Gaussian mutual information of a transceiver, even under the cases of existing IBI. Simulation results validate the proposed DFE for devising an optimum transceiver with CSI, and show the superior BER performance of the optimized transceiver using proposed DFE. Relying on analytic results and simulation cases also builds a sub-optimum MMSE design of the proposed DFE using the BER-minimized block delay for ZF criterion, which exhibits almost identical BER performance as the proposed MMSE design in most of the signal-to-noise ratio (SNR) range.
Linear Discriminant Analysis (LDA) is a well-known feature extraction method for supervised subspace learning in statistical pattern recognition. In this paper, a novel method of LDA based on a new L1-norm optimization technique and its variances are proposed. The conventional LDA, which is based on L2-norm, is sensitivity to the presence of outliers, since it used the L2-norm to measure the between-class and within-class distances. In addition, the conventional LDA often suffers from the so-called small sample size (3S) problem since the number of samples is always smaller than the dimension of the feature space in many applications, such as face recognition. Based on L1-norm, the proposed methods have several advantages, first they are robust to outliers because they utilize the L1-norm, which is less sensitive to outliers. Second, they have no 3S problem. Third, they are invariant to rotations as well. The proposed methods are capable of reducing the influence of outliers substantially, resulting in a robust classification. Performance assessment in face application shows that the proposed approaches are more effectiveness to address outliers issue than traditional ones.
This paper considers online vertex exploration problems in a simple polygon where starting from a point in the inside of a simple polygon, a searcher is required to explore a simple polygon to visit all its vertices and finally return to the initial position as quickly as possible. The information of the polygon is given online. As the exploration proceeds, the searcher gains more information of the polygon. We give a 1.219-competitive algorithm for this problem. We also study the case of a rectilinear simple polygon, and give a 1.167-competitive algorithm.
Pei-Chun LIN Junzo WATADA Berlin WU
The objective of our research is to build a statistical test that can evaluate different risks of a portfolio selection model with fuzzy data. The central points and radiuses of fuzzy numbers are used to determine the portfolio selection model, and we statistically evaluate the best return by a fuzzy statistical test. Empirical studies are presented to illustrate the risk evaluation of the portfolio selection model with interval values. We conclude that the fuzzy statistical test enables us to evaluate a stable expected return and low risk investment with different choices for k, which indicates the risk level. The results of numerical examples show that our method is suitable for short-term investments.
Hathaithip NINSONTI Weerasak CHOMKITICHAI Akira BABA Wiyong KANGWANSUPAMONKON Sukon PHANICHPHANT Kazunari SHINBO Keizo KATO Futao KANEKO
We report enhanced photocurrent properties of dye/Au-loaded titanium dioxide (TiO2) films on Au gratings. Au-loaded TiO2 nanopowders were first synthesized by a modified sol-gel method and then prepared by the impregnation method. We also fabricated dye-sensitized solar cells, which were composed of Au grating/Au-TiO2/TMPyP-SCC LbL (20 bilayers)/electrolyte/ITO substrates. Short-circuit photo-current measurements showed that Au-loaded TiO2 with grating-coupled surface plasmon excitation can enhance the short-circuit photocurrentof the fabricated cells.
Hiroyuki OGATA Kenji ICHIJO Kenji KONDO Akito HARA
A multigate polycrystalline-silicon (poly-Si) thin-film transistor (TFT) is a recently popular topic in the field of Si devices. In this study, self-aligned planar metal double-gate poly-Si TFTs consisting of an embedded bottom metal gate, a top metal gate fabricated by a self-alignment process, and a lateral poly-Si film with a grain size greater than 2 µm were fabricated on a glass substrate at 550. The nominal field-effect mobility of an n-channel TFT is 530 cm2/Vs, and its subthreshold slope is 140 mV/dec. The performance of the proposed TFTs is superior to that of top-gate TFTs fabricated using equivalent processes.
Yaohua WANG Shuming CHEN Hu CHEN Jianghua WAN Kai ZHANG Sheng LIU
The efficiency of ubiquitous SIMD (Single Instruction Multiple Data) media processors is seriously limited by the bottleneck effect of the scalar kernels in media applications. To solve this problem, a dual-core framework, composed of a micro control unit and an instruction buffer, is proposed. This framework can dynamically decouple the scalar and vector pipelines of the original single-core SIMD architecture into two free-running cores. Thus, the bottleneck effect can be eliminated by effectively exploiting the parallelism between scalar and vector kernels. The dual-core framework achieves the best attributes of both single-core and dual-core SIMD architectures. Experimental results exhibit an average performance improvement of 33%, at an area overhead of 4.26%. What's more, with the increase of the SIMD width, higher performance gain and lower cost can be expected.
The author developed a wideband precise I/Q modulator using GaAs pHEMT technology. In this technology, pHEMT has 0.22 µm metallurgical gate length and ft=51 GHz at Vds=5V. With the careful design of the wideband phase shifter, this IQ modulator achieved a large wideband frequency range of 250 MHz to 8 GHz and good EVM performance after calibration. For overall frequency range, low distortion performance is obtained, where third order intermodulation is less than -42 dBc. Also the ACPR at 2.2 GHz for W-CDMA application is less than -74 dBc.
Cesar AZURDIA-MEZA Kyujin LEE Kyesan LEE
In this letter we proposed the linear combination of two ISI-free pulses with different decay rates in order to obtain a new Nyquist pulse. The proposed pulse contains a new design parameter β, giving an additional degree of freedom to minimize the bit error probability performance in the presence of symbol-timing errors, for a given roll-off factor α. Several practical tools are implemented for evaluating the performance of the proposed filter. The novel pulse is evaluated in terms of the bit error probability performance in the presence of symbol-timing errors. Eye diagrams are presented to visually assess the vulnerability of the transmission system to ISI, and the maximum distortion is estimated as a quantitative measure of performance.
Xuefeng BAI Tiejun ZHANG Chuanjun WANG Ahmed A. ABD EL-LATIF Xiamu NIU
Player detection is an important part in sports video analysis. Over the past few years, several learning based detection methods using various supervised two-class techniques have been presented. Although satisfactory results can be obtained, a lot of manual labor is needed to construct the training set. To overcome this drawback, this letter proposes a player detection method based on one-class SVM (OCSVM) using automatically generated training data. The proposed method is evaluated using several video clips captured from World Cup 2010, and experimental results show that our approach achieves a high detection rate while keeping the training set construction's cost low.
Satoru OCHIIWA Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE
A timed Petri net, an extended model of an ordinary Petri net with introduction of discrete time delay in firing activity, is practically useful in performance evaluation of real-time systems and so on. Unfortunately though, it is often too difficult to solve (efficiently) even most basic problems in timed Petri net theory. This motivates us to do research on analyzing complexity of Petri net problems and on designing efficient and/or heuristic algorithms. The minimum initial marking problem of timed Petri nets (TPMIM) is defined as follows: “Given a timed Petri net, a firing count vector X and a nonnegative integer π, find a minimum initial marking (an initial marking with the minimum total token number) among those initial ones M each of which satisfies that there is a firing scheduling which is legal on M with respect to X and whose completion time is no more than π, and, if any, find such a firing scheduling.” In a production system like factory automation, economical distribution of initial resources, from which a schedule of job-processings is executable, can be formulated as TPMIM. The subject of the paper is to propose two pseudo-polynomial time algorithms TPM and TMDLO for TPMIM, and to evaluate them by means of computer experiment. Each of the two algorithms finds an initial marking and a firing sequence by means of algorithms for MIM (the initial marking problem for non-timed Petri nets), and then converts it to a firing scheduling of a given timed Petri net. It is shown through our computer experiments that TPM has highest capability among our implemented algorithms including TPM and TMDLO.
Junichi HAMAZAKI Norihiko SEKINE Iwao HOSAKO
To obtain an ultra-short high-intensity pulse source, we investigated the amplification characteristics of two types of pulses (dissipative soliton and stretched pulses) produced by our Yb-doped fiber laser oscillator. Our results show that the dissipative soliton pulse can be amplified with less deterioration than the stretched pulse.
Xianglei XING Sidan DU Hua JIANG
We extend the Nonparametric Discriminant Analysis (NDA) algorithm to a semi-supervised dimensionality reduction technique, called Semi-supervised Nonparametric Discriminant Analysis (SNDA). SNDA preserves the inherent advantages of NDA, that is, relaxing the Gaussian assumption required for the traditional LDA-based methods. SNDA takes advantage of both the discriminating power provided by the NDA method and the locality-preserving power provided by the manifold learning. Specifically, the labeled data points are used to maximize the separability between different classes and both the labeled and unlabeled data points are used to build a graph incorporating neighborhood information of the data set. Experiments on synthetic as well as real datasets demonstrate the effectiveness of the proposed approach.
Kazu MISHIBA Masaaki IKEHARA Takeshi YOSHITOME
In this paper, we propose an improved seam merging method for content-aware image resizing. This method merges a two-pixel-width seam element into one new pixel in image reduction and inserts a new pixel between the two pixels in image enlargement. To preserve important contents and structure, our method uses energy terms associated with importance and structure. Our method preserve the main structures by using a cartoon version of the original image when calculating the structure energy. In addition, we introduce a new energy term to suppress the distortion generated by excessive reduction or enlargement in iterated merger or insertion. Experimental results demonstrate that the proposed method can produce satisfactory results in both image reduction and enlargement.
Rashmi TURIOR Danu ONKAEW Bunyarit UYYANONVARA
Automatic vessel tortuosity measures are crucial for many applications related to retinal diseases such as those due to retinopathy of prematurity (ROP), hypertension, stroke, diabetes and cardiovascular diseases. An automatic evaluation and quantification of retinal vascular tortuosity would help in the early detection of such retinopathies and other systemic diseases. In this paper, we propose a novel tortuosity index based on principal component analysis. The index is compared with three existant indices using simulated curves and real retinal images to demonstrate that it is a valid indicator of tortuosity. The proposed index satisfies all the tortuosity properties such as invariance to translation, rotation and scaling and also the modulation properties. It is capable of differentiating the tortuosity of structures that visually appear to be different in tortuosity and shapes. The proposed index can automatically classify the image as tortuous or non tortuous. For an optimal set of training parameters, the prediction accuracy is as high as 82.94% and 86.6% on 45 retinal images at segment level and image level, respectively. The test results are verified against the judgement of two expert Ophthalmologists. The proposed index is marked by its inherent simplicity and computational attractiveness, and produces the expected estimate, irrespective of the segmentation approach. Examples and experimental results demonstrate the fitness and effectiveness of the proposed technique for both simulated curves and retinal images.
Kentaro KAWANISHI Kazuyoshi ITOH Tsuyoshi KONISHI
We report a 40-Gb/s and highly accurate intensity limiter with a single Erbium-Doped Fiber Amplifier (EDFA) for low-power-consumption driving intensity limiting. The intensity limiter based on self-phase modulation with an appropriate pre-chirping procedure makes it possible, which provides a highly accurate limiting of less than 0.01 dB. We fed 40-Gb/s signals with 2.69 dB intensity fluctuation and 4.7 dB improvement on the receiver sensitivity was obtained for a bit error rate of 10-9 by using a numerical simulation.
Yong ZHANG Shi-Ze GUO Zhe-Ming LU Hao LUO
Reversible data hiding has been a hot research topic since both the host media and hidden data can be recovered without distortion. In the past several years, more and more attention has been paid to reversible data hiding schemes for images in compressed formats such as JPEG, JPEG2000, Vector Quantization (VQ) and Block Truncation Coding (BTC). Traditional data hiding schemes in the BTC domain modify the BTC encoding stage or BTC-compressed data according to the secret bits, and they have no ability to reduce the bit rate but may reduce the image quality. This paper presents a novel reversible data hiding scheme for BTC-compressed images by further losslessly encoding the BTC-compressed data according to the secret bits. First, the original BTC technique is performed on the original image to obtain the BTC-compressed data which can be represented by a high mean table, a low mean table and a bitplane sequence. Then, the proposed reversible data hiding scheme is performed on both the high mean table and low mean table. Our hiding scheme is a lossless joint hiding and compression method based on 22 blocks in mean tables, thus it can not only hide data in mean tables but also reduce the bit rate. Experiments show that our scheme outperforms three existing BTC-based data hiding works, in terms of the bit rate, capacity and efficiency.