Recently, Haley and Grant introduced the concept of reversible codes – a class of binary linear codes that can reuse the decoder architecture as the encoder and encodable by the iterative message-passing algorithm based on the Jacobi method over F2. They also developed a procedure to construct parity check matrices of a class of reversible codes named type-I reversible codes by utilizing properties specific to circulant matrices. In this paper, we refine a mathematical framework for reversible codes based on circulant matrices through a ring theoretic approach. This approach enables us to clarify the necessary and sufficient condition on which type-I reversible codes exist. Moreover, a systematic procedure to construct all circulant matrices that constitute parity check matrices of type-I reversible codes is also presented.
SeongHan SHIN Kazukuni KOBARA Hideki IMAI
An anonymous password-authenticated key exchange (PAKE) protocol is designed to provide both password-only authentication and client anonymity against a semi-honest server, who honestly follows the protocol. In INDOCRYPT2008, Yang and Zhang [26] proposed a new anonymous PAKE (NAPAKE) protocol and its threshold (D-NAPAKE) which they claimed to be secure against insider attacks. In this paper, we first show that the D-NAPAKE protocol [26] is completely insecure against insider attacks unlike their claim. Specifically, only one legitimate client can freely impersonate any subgroup of clients (the threshold t > 1) to the server. After giving a security model that captures insider attacks, we propose a threshold anonymous PAKE (called, TAP+) protocol which provides security against insider attacks. Moreover, we prove that the TAP+ protocol has semantic security of session keys against active attacks as well as insider attacks under the computational Diffie-Hellman problem, and provides client anonymity against a semi-honest server, who honestly follows the protocol. Finally, several discussions are followed: 1) We also show another threshold anonymous PAKE protocol by applying our RATIONALE to the non-threshold anonymous PAKE (VEAP) protocol [23]; and 2) We give the efficiency comparison, security consideration and implementation issue of the TAP+ protocol.
Masataka OHIRA Zhewang MA Hiroyuki DEGUCHI Mikio TSUJI
In this paper, we propose a novel feeding structure for a coaxial-excited compact waveguide filter, which is composed of planar resonators called frequency-selective surfaces (FSSs). In our proposed feeding structure, new FSSs located at the input and output ports are directly excited by the coaxial line. By using the FSSs, the transition from the TEM mode to the TE10 mode is realized by the resonance of the FSSs. Therefore, the backshort length from the coaxial probe to the shorted waveguide end can be made much shorter than one-quarter of the guided wavelength. Additionally, the coaxial-excited FSS provides one transmission zero at each stopband. As a design example, a three-stage bandpass filter with 4% bandwidth at the X band is demonstrated. The designed filter has a very compact size of one cavity and has high skirt selectivity with six transmission zeros. The effectiveness of the design is confirmed by the comparison of frequency characteristics obtained by the simulation and measurement.
Yasuhiro NAKASHA Naoki HARA Kiyomichi ARAKI
This paper presents the analytical results of the effects of jitter and intersymbol interference (ISI) on a millimeter-wave impulse radio (IR) transceiver, compared with the performance of a developed 10-Gb/s W-band IR-transmitter prototype. The IR transmitter, which is compact and cost-effective, consists of a pulse generator (PG) that creates an extremely short pulse, a band-pass filter (BPF) that shapes the short pulse to the desired millimeter-wave pulse (wavelet), and an optional power amplifier. The jitters of the PG and ISI from the BPF are a hindrance in making the IR transceiver robust and in obtaining excellent performance. One analysis verified that, because of a novel retiming architecture, the random jitter and the data-dependent jitter from the PG give only a small penalty of < 0.5-dB increase in the signal-to-noise ratio (SNR) for achieving a bit error rate (BER) of < 10-12. An alternative analysis on the effect of ISI from the BPF indicated that using a Gaussian BPF enables a transmission with a BER of < 10-12 up to a data rate of 1.4 times as large as the bandwidth of the BPF, which is twice as high as that of a conventional amplitude shift keying (ASK) system. The analysis also showed that the IR system is more sensitive to the ISI than the ASK system and suggested that the mismatching of the skirt characteristics of the developed BPF with those of a Gaussian BPF causes tail lobes following the wavelet, resulting in an on/off ratio of 15 dB and hence, an SNR penalty of 6 dB.
Yang SUN Chang-Jin JEONG In-Young LEE Sang-Gug LEE
In this paper, a highly linear and low noise CMOS active RF tracking filter for a digital TV tuner is presented. The Gm cell of the Gm-C filter is based on a dynamic source degenerated differential pair with an optimized transistor size ratio, thereby providing good linearity and high-frequency operation. The proposed RF tracking filter architecture includes two complementary parallel paths, which provide harmonic rejection in the low band and unwanted signal rejection in the high band. The fabricated tracking filter based on a 0.13 µm CMOS process shows a 48860 MHz tracking range with 30–32 dB 3rd order harmonic rejection, a minimum input referred noise density of 2.4 nV/, and a maximum IIP3 of 0 dBm at 3 dB gain while drawing 39 mA from a 1.2-V supply. The total chip area is 1 mm0.9 mm.
Kazutaka HARA Shunji KIMURA Hirotaka NAKAMURA Naoto YOSHIMOTO Hisaya HADAMA
A 10-Gbit/s-class ac-coupled average-detection-type burst-mode receiver (B-Rx) with an ultra fast response and a high tolerance to the long consecutive identical digits has been developed. Key features of the circuit design are the baseline-wander common-mode rejection technique and the inverted distortion technique adopted in the limiting amplifier to cope with both the fast response and the high tolerance. Our B-Rx with newly developed limiting amplifier IC achieved a settling time of less than 150 ns, a sensitivity of -29.8 dBm, and a dynamic range of 23.8 dB with a 231-1 pseudo random bit sequences. Moreover, we also describe several potential B-Rx applications. We achieved better performance by applying the proposed systems to our B-Rx.
Masato HAYASHI Susumu MATSUI Naoki WAKAMIYA Masayuki MURATA
The delay/disruption tolerant network (DTN) has been researched actively in the last years because of its high applicability to ubiquitous network services such as sensor networks and intelligent transport system (ITS) networks. An efficient data forwarding method for those network services is one of the key components in DTN due to the limitation of wireless network resources. This paper proposes a new DTN scheme for vehicle network systems by introducing the parameter, “approach ratio”, which represents node movement history. The proposal utilizes passive copy strategy, where nodes within one hop area of packet forwarders receive, copy and store packets (namely, passive copies) for future forwarding, in order to obtain higher delivery rate and lower delivery delay whilst suppressing the network resource consumption. Depending on its approach ratio, a node with passive copy decides whether it forwards the passive copy or not by referring to the approach ratio threshold. The approach ratio allows our proposal to adjust the property of both single-copy type scheme, that can lower network resource consumption, and multi-copy type scheme, that can enhance the performance of delivery rate and delay time. In simulation evaluation, the proposal is compared with three typical existing schemes with respect to network consumption, delivery rate and delivery delay. Our proposal shows the superior performance regarding the targeted purpose. It is shown that the approach ratio plays the significant role to obtain the higher delivery rate and lower delay time, while keeping network resource consumption lower.
Makoto YAMADA Masashi SUGIYAMA Gordon WICHERN Jaak SIMM
The least-squares probabilistic classifier (LSPC) is a computationally-efficient alternative to kernel logistic regression. However, to assure its learned probabilities to be non-negative, LSPC involves a post-processing step of rounding up negative parameters to zero, which can unexpectedly influence classification performance. In order to mitigate this problem, we propose a simple alternative scheme that directly rounds up the classifier's negative outputs, not negative parameters. Through extensive experiments including real-world image classification and audio tagging tasks, we demonstrate that the proposed modification significantly improves classification accuracy, while the computational advantage of the original LSPC remains unchanged.
Jung-Yoon KIM Hyoung-Kee CHOI John A. COPELAND
Kim and Chung previously proposed a password-based user authentication scheme to improve Yoon and Yoo's scheme. However, Kim and Chung's scheme is still vulnerable to an offline password guessing attack, an unlimited online password guessing attack, and server impersonation. We illustrate how their scheme can be compromised and then propose an improved scheme to overcome the weaknesses. Our improvement is based on the Rabin cryptosystem. We verify the correctness of our proposed scheme using the BAN logic.
Hong ZHANG Xue LI Suming LAI Pinyi REN
Source-follower-based (SFB) continuous-time low-pass filters (LPF) have the advantages of low power and high linearity over other filter topologies. The second-order SFB filter cells, which are key building blocks for high-order SFB filters, are often realized by composite source follower with positive feedback. For a single branch 2nd-order SFB cell, the linearity drops severely at high frequencies in the pass band because its slew-rate is restricted by the Q factor and the pole frequency. The folded 2nd-order SFB cell provides higher linearity because it has two DC branches, and hence has another freedom to increase the slew rate. However, because of the positive feedback, the folded and unfolded 2nd-order SFB cells, especially those with high Q factors, tend to be unstable and act as relaxation oscillators under given circuit parameters. In order to obtain higher Q factor, a new topology for the 2nd-order SFB cell without positive feedback is proposed in this paper, which is unconditionally stable and can provide high linearity. Based on the folded 2nd-order SFB cell and the proposed high-Q SFB cell, a 264 MHz sixth-order LPF with 3 stages for ultra wideband (UWB) applications is designed in 0.18 µm CMOS technology. Simulation results show that the LPF achieves an IIP3 of above 12.5 dBm in the whole pass band. The LPF consumes only 4.1 mA from a 1.8 V power supply, and has a layout area of 200 µm 150 µm.
Pratkasem VESARACH Poompat SAENGUDOMLERT
We investigate the problem of switch port allocation in WDM networks that use the hybrid optical-electronic switching node architecture. The objective is to support given traffic demands while minimizing the number of electronic switch ports used, or equivalently minimizing the number of established lightpaths. We first formulate the problem as a mixed integer linear programming (MILP) problem. However, due to the high computational complexity of exact optimization, we develop a simulated annealing (SA) algorithm to get an approximate solution. Results from the SA algorithm demonstrate that, compared to the optical-electrical-optical (O-E-O) node architecture, a WDM network that employs the hybrid switching node architecture requires many fewer lightpaths. We also develop a lightpath assignment heuristic which requires much less computation time than the SA algorithm while maintaining close objective values. The lightpath assignment heuristic is used to investigate the switch port allocation behaviors. Simulation results show that nodes with high degrees or with small average node distances require large numbers of optical switch ports. Moreover, nodes with large amounts of terminate (originated/destined) traffic require large numbers of electronic switch ports. Since the lightpath assignment heuristic requires small computation time, it can be used in the network design process in which a large number of network scenarios must be considered.
Takashi HIKIHARA Yuzo MURAKAMI
A regulation of converters connected in parallel is discussed considering their stored energy and passivity characteristics. From the viewpoint of stored energy, a new regulation method to conserve and share the stored energy can be found. The energy stored in inductors and capacitors is transferred to loads so that the load keeps the energy dissipation constant. Though numerical simulation, the method is validated for a parallel converter system.
Mitsuyoshi KISHIHARA Isao OHTA Kensuke OKUBO
A broadband cruciform substrate integrated waveguide coupler is designed based on the planar circuit approach. The broadband property is obtained by widening the crossed region in the same way as rectangular waveguide cruciform couplers. As a result, a 3 dB coupler with fractional bandwidth of 30% is realized at 24 GHz.
Masayoshi TAKAHASHI Keiichi YAMAMOTO Norio CHUJO Ritsurou ORIHASHI
A 2 GHz gain equalizer for analog signal transmission using a novel gain compensation method is described in this paper. This method is based on feedforward compensation by a low-pass filter, which improves the gain-equalizing performance by subtracting low-pass filtered signals from the directly passed signal at the end of a transmission line. The advantage of the proposed method over the conventional one is that the gain is equalized with a smaller THD at higher frequencies by using a low-pass instead of a high-pass filter. In this circuit, the peak gain is adjustable from 0 to 2.4 dB and the frequency of the peak gain can be controlled up to 2 GHz by varying the value of an external capacitor. Also this circuit achieves THD with 5 dB better than the conventional circuits.
Junghyun NAM Juryon PAIK Dongho WON
A group key exchange (GKE) protocol allows a group of parties communicating over a public network to establish a common secret key. As group-oriented applications gain popularity over the Internet, a number of GKE protocols have been suggested to provide those applications with a secure multicast channel. In this work, we investigate the security of Wu and Zhu's password-authenticated GKE protocol presented recently in FC'08. Wu and Zhu's protocol is efficient, supports dynamic groups, and can be constructed generically from any password-authenticated 2-party key exchange protocol. However, despite its attractive features, the Wu-Zhu protocol should not be adopted in its present form. Due to a flaw in its design, the Wu-Zhu protocol fails to achieve authenticated key exchange. We here report this security problem with the Wu-Zhu protocol and show how to solve it.
Yosuke TAKEUCHI Koichi ICHIGE Koichi MIYAMOTO Yoshio EBINE
This paper presents a novel automated microwave filter tuning method based on successive optimization of phase and amplitude characteristics. We develop an optimization procedure to determine how much the adjusting screws of a filter should be rotated. The proposed filter tuning method consists of two stages; coarse and fine tuning stages. In the first stage, called coarse tuning, the phase response error of the target filter is minimized so that the filter roughly approximates almost ideal bandpass characteristics. Then in the second stage, called fine tuning, two different amplitude response errors are minimized in turn and then the resulting filter well approximate the ideal characteristics. Performance of the proposed tuning procedure is evaluated through some experiments of actual filter tuning.
Hangue PARK Jongwook ZEONG Wonsuk CHOI Jung Han CHOI
A Q-enhanced 8th order CMOS active bandpass filter is presented employing a novel two-stage self-calibration technique. The proposed active filter shows the better out-band attenuation performance than other reported CMOS active bandpass filters. The proposed calibration method enables the stable filtering operation affected by neither the input power variation nor the strong interference power. It is fabricated using 65 nm CMOS process. The measured 3 dB bandwidth is 54 MHz at 2.37 GHz. The insertion loss is 2.9 dB and the out-band attenuation is 27.5 dB at 15 MHz offset frequency. The performance of the filter remains unchanged for 5% supply voltage variations.
Multi-hop wireless ad hoc networks suffer from temporary link error due to fading. In order to improve packet transmission reliability and achieve efficient transmission in fading environment, a new cognitive temporary bypassing scheme is proposed based on a cross-layer approach and cognitive behavior of local nodes. The proposed scheme enables neighboring nodes to prepare and create a temporary bypass for lost-packets. This is done by monitoring message packets that include information of the multi-hop route and link-acknowledgement. The scheme also includes an anti-collision function that is necessary to prevent contention among multiple bypassing nodes. Packet success probability with the proposed scheme is studied both by theoretical analysis and time-domain computer simulation for Rayleigh faded single- and multi-hop links. Network simulation using a modified QualNet simulator validate that packet success probability is remarkably improved with the scheme for maximum Doppler frequencies up to 30 Hz.
Jin-Fa LIN Yin-Tshung HWANG Ming-Hwa SHEU
A dual-mode pulse-triggered flip-flop design supporting functional versatility is presented. A low-complexity unified logic module, consisting of only five transistors, for dual-mode pulse generation is devised using pass transistor logic (PTL). Potential threshold voltage loss problem is successfully resolved to ensure the signal integrity. Despite the extra logic for dual-mode operations, the circuit complexity of the proposed design is comparable to those of the single mode designs. Simulations in different process corners and switching activities prove the competitive performance of proposed design against various single mode designs.
Recently, Mooij et al. proposed new sufficient conditions for convergence of the sum-product algorithm, and it was also shown that if the factor graph is a tree, Mooij's sufficient condition for convergence is always activated. In this letter, we show that the converse of the above statement is also true under some assumption, and that the assumption holds for the sum-product decoding. These newly obtained fact implies that Mooij's sufficient condition for convergence of the sum-product decoding is activated if and only if the factor graph of the a posteriori probability of the transmitted codeword is a tree.