Akio YONEYAMA Yasuhiro TAKISHIMA Yasuyuki NAKAJIMA Yoshinori HATORI
We propose a method to prevent the degradation of decoded MPEG pictures caused by video transmission over error-prone networks. In this paper, we focus on the error concealment that is processed at the decoder without using any backchannels. Though there have been various approaches to this problem, they generally focus on minimizing the degradation measured frame by frame. Although this frame-level approach is effective in evaluating individual frame quality, in the sense of human perception, the most noticeable feature is the spatio-temporal discontinuity of the image feature in the decoded video image. We propose a novel error concealment algorithm comprising the combination of i) A spatio-temporal error recovery function with low processing cost, ii) A MB-based image fidelity tracking scheme, and iii) An adaptive post-filter using the fidelity information. It is demonstrated by experimental results that the proposed algorithm can significantly reduce the subjective degradation of corrupted MPEG video quality with about 30 % of additional decoding processing power.
Waka NAGAO Yoshifumi MANABE Tatsuaki OKAMOTO
KEM (Key Encapsulation Mechanism) and DEM (Data Encapsulation Mechanism) were introduced by Shoup to formalize the asymmetric encryption specified for key distribution and the symmetric encryption specified for data exchange in ISO standards on public-key encryption. Shoup defined the "semantic security (IND) against adaptive chosen ciphertext attacks (CCA2)" as a desirable security notion of KEM and DEM, that is, IND-CCA2 KEM and IND-CCA2 DEM. This paper defines "non-malleability (NM)" for KEM, which is a stronger security notion than IND. We provide three definitions of NM for KEM, and show that these three definitions are equivalent. We then show that NM-CCA2 KEM is equivalent to IND-CCA2 KEM. That is, we show that NM is equivalent to IND for KEM under CCA2 attacks, although NM is stronger than IND in the definition (or under some attacks like CCA1). In addition, this paper defines the universally composable (UC) security of KEM and DEM, and shows that IND-CCA2 KEM (or NM-CCA2 KEM) is equivalent to UC KEM and that "IND against adaptive chosen plaintext/ciphertext attacks (IND-P2-C2)" DEM is equivalent to UC DEM.
Ryo NISHIMAKI Yoshifumi MANABE Tatsuaki OKAMOTO
Identity-based encryption (IBE) is one of the most important primitives in cryptography, and various security notions of IBE (e.g., IND-ID-CCA2, NM-ID-CCA2, IND-sID-CPA etc.) have been introduced. The relations among them have been clarified recently. This paper, for the first time, investigates the security of IBE in the universally composable (UC) framework. This paper first defines the UC-security of IBE, i.e., we define the ideal functionality of IBE, FIBE. We then show that UC-secure IBE is equivalent to conventionally-secure (IND-ID-CCA2-secure) IBE.
Suckchel YANG Dongwoo KANG Young NAMGOONG Yoan SHIN
We propose a simple asynchronous UWB (Ultra Wide Band) position location algorithm with low complexity, power consumption and processing delay. In the proposed algorithm, only a single RTTX (Round-Trip Transmission) of UWB pulses is utilized based on the ToA (Time of Arrival) principle. Hence, the proposed algorithm decreases power consumption and processing delay as compared to the basic ToA based on triple RTTXs. Moreover, unlike the TDoA (Time Difference of Arrival) algorithm, the proposed algorithm can perform the position location with low complexity since it does not require strict synchronization between multiple beacons. Simulation results using IEEE 802.15.4a UWB channel models reveal that the proposed algorithm achieves closely comparable position location performance of the basic ToA and TDoA algorithms.
Byeong-Seok SHIN Dong-Ryeol OH Daniel KANG
Because of its simplicity and intuitive approach, point-based rendering has been a very popular research area. Recent approaches have focused on hardware-accelerated techniques. By applying a deferred shading scheme, both high-quality images and high-performance rendering have been achieved. However, previous methods showed problems related to depth-based visibility computation. We propose an extended point-based rendering method using a visibility map. In our method we employ a distance-based visibility technique (replacing depth-based visibility), an averaged position map and an adaptive fragment processing scheme, resulting in more accurate and improved image quality, as well as improved rendering performance.
Yibo FAN Jidong WANG Takeshi IKENAGA Yukiyasu TSUNOO Satoshi GOTO
H.264/AVC is the newest video coding standard. There are many new features in it which can be easily used for video encryption. In this paper, we propose a new scheme to do video encryption for H.264/AVC video compression standard. We define Unequal Secure Encryption (USE) as an approach that applies different encryption schemes (with different security strength) to different parts of compressed video data. This USE scheme includes two parts: video data classification and unequal secure video data encryption. Firstly, we classify the video data into two partitions: Important data partition and unimportant data partition. Important data partition has small size with high secure protection, while unimportant data partition has large size with low secure protection. Secondly, we use AES as a block cipher to encrypt the important data partition and use LEX as a stream cipher to encrypt the unimportant data partition. AES is the most widely used symmetric cryptography which can ensure high security. LEX is a new stream cipher which is based on AES and its computational cost is much lower than AES. In this way, our scheme can achieve both high security and low computational cost. Besides the USE scheme, we propose a low cost design of hybrid AES/LEX encryption module. Our experimental results show that the computational cost of the USE scheme is low (about 25% of naive encryption at Level 0 with VEA used). The hardware cost for hybrid AES/LEX module is 4678 Gates and the AES encryption throughput is about 50 Mbps.
Hirotoshi HONMA Shigeru MASUYAMA
Let G =(V, E) be an undirected simple graph with u ∈ V. If there exist any two vertices in G whose distance becomes longer when a vertex u is removed, then u is defined as a hinge vertex. Finding the set of hinge vertices in a graph is useful for identifying critical nodes in an actual network. A number of studies concerning hinge vertices have been made in recent years. In a number of graph problems, it is known that more efficient sequential or parallel algorithms can be developed by restricting classes of graphs. In this paper, we shall propose a parallel algorithm which runs in O(log n) time with O(n/log n) processors on EREW PRAM for finding all hinge vertices of a circular-arc graph.
Doo-Hwan KIM Sung-Hyun YANG Kyoung-Rok CHO
This paper proposes a dual-level low voltage differential signaling (DLVDS) circuit aimed at low power consumption and reducing transmission lines for LCD driver IC's. We apply two-bit binary data to the DLVDS circuit as inputs, and then the circuit converts these two inputs into two kinds of fully differential signal levels. In the DLVDS circuit, two transmission lines are sufficient to transfer two-bit binary inputs while keeping the conventional LVDS features. The receiver recovers the original two-bit binary data through a level decoding circuit. The proposed circuit was fabricated using a commercial 0.25 µm CMOS technology. Under a 2.5 V supply voltage, the circuit shows a data rate of 1-Gbps/2-line and power consumption of 35 mW.
Junichi NAKAYAMA Yasuhiko TAMURA
A transverse magnetic (TM) plane wave is diffracted by a periodic surface into discrete directions. However, only the reflection and no diffraction take place when the angle of incidence becomes a low grazing limit. On the other hand, the scattering occurs even at such a limit, if the periodic surface is finite in extent. To solve such contradiction, this paper deals with the scattering from a perfectly conductive sinusoidal surface with finite extent. By the undersampling approximation introduced previously, the total scattering cross section is numerically calculated against the angle of incidence for several corrugation widths up to more than 104 times of wavelength. It is then found that the total scattering cross section is linearly proportional to the corrugation width in general. But an exception takes place at a low grazing limit of incidence, where the total scattering cross section increases almost proportional to the square root of the corrugation width. This suggests that, when the corrugation width goes to infinity, the total scattering cross section diverges and the total scattering cross section per unit surface vanishes at a low grazing limit of incidence. Then, it is concluded that, at a low grazing limit of incidence, no diffraction takes place by a periodic surface with infinite extent and the scattering occurs from a periodic surface with finite extent.
Toshihide AJIKI Toyohiko ISHIHARA
We have derived the novel extended UTD (Uniform Geometrical Theory of Diffraction) solution and the novel modified UTD solution for the back scattering of an incident whispering gallery (WG) mode on the edge of a cylindrically curved conducting sheet. By comparing with the reference solution obtained from the integral representation of the scattered field by integrating numerically along the integration path, we have confirmed the validity and the utility of the novel asymptotic solutions proposed in the present study. It is shown that the extended UTD solution can be connected smoothly to the modified UTD solution on the geometrical boundary separating the edge-diffracted ray and the surface-diffracted ray.
A concurrent model of computation and a language based on the model for bit-level operation are useful for developing asynchronous and concurrent programs compositionally, which frequently use bit-level operations. Some examples are programs for video games, hardware emulation (including virtual machines), and signal processing. However, few models and languages are optimized and oriented to bit-level concurrent computation. We previously developed a visual programming language called A-BITS for bit-level concurrent programming. The language is based on a dataflow-like model that computes using processes that provide serial bit-level operations and FIFO buffers connected to them. It can express bit-level computation naturally and develop compositionally. We then devised a concurrent computation model called APEC (Asynchronous Program Elements Connection) for bit-level concurrent computation. This model enables precise and formal expression of the process of computation, and a notion of primitive program elements for controlling and operating can be expressed synthetically. Specifically, the model is based on a notion of uniform primitive processes, called primitives, that have three terminals and four ordered rules at most, as well as on bidirectional communication using vehicles called carriers. A new notion is that a carrier moving between two terminals can briefly express some kinds of computation such as synchronization and bidirectional communication. The model's properties make it most applicable to bit-level computation compositionally, since the uniform computation elements are enough to develop components that have practical functionality. Through future application of the model, our research may enable further research on a base model of fine-grain parallel computer architecture, since the model is suitable for expressing massive concurrency by a network of primitives.
Soonhak KWON Taekyoung KWON Young-Ho PARK
We propose a new linear array for multiplication in GF(2m) which outperforms most of the existing linear multipliers in terms of the area and time complexity. Moreover we will give a very detailed comparison of our array with other existing architectures for the five binary fields GF(2m), m=163,233,283,409,571, recommended by NIST for elliptic curve cryptography.
Mikio HASEGAWA Ha Nguyen TRAN Goh MIYAMOTO Yoshitoshi MURATA Hiroshi HARADA Shuzo KATO
We propose a neurodynamical approach to a large-scale optimization problem in Cognitive Wireless Clouds, in which a huge number of mobile terminals with multiple different air interfaces autonomously utilize the most appropriate infrastructure wireless networks, by sensing available wireless networks, selecting the most appropriate one, and reconfiguring themselves with seamless handover to the target networks. To deal with such a cognitive radio network, game theory has been applied in order to analyze the stability of the dynamical systems consisting of the mobile terminals' distributed behaviors, but it is not a tool for globally optimizing the state of the network. As a natural optimization dynamical system model suitable for large-scale complex systems, we introduce the neural network dynamics which converges to an optimal state since its property is to continually decrease its energy function. In this paper, we apply such neurodynamics to the optimization problem of radio access technology selection. We compose a neural network that solves the problem, and we show that it is possible to improve total average throughput simply by using distributed and autonomous neuron updates on the terminal side.
Chunsheng HUA Qian CHEN Haiyuan WU Toshikazu WADA
This paper presents an RK-means clustering algorithm which is developed for reliable data grouping by introducing a new reliability evaluation to the K-means clustering algorithm. The conventional K-means clustering algorithm has two shortfalls: 1) the clustering result will become unreliable if the assumed number of the clusters is incorrect; 2) during the update of a cluster center, all the data points belong to that cluster are used equally without considering how distant they are to the cluster center. In this paper, we introduce a new reliability evaluation to K-means clustering algorithm by considering the triangular relationship among each data point and its two nearest cluster centers. We applied the proposed algorithm to track objects in video sequence and confirmed its effectiveness and advantages.
Keehang KWON Dae-Seong KANG Jinsoo KIM
We propose a query language based on extended regular expressions. This language extends texts with text-generating macros. These macros make it possible to define languages in a compressed, elegant way. This paper also extends queries with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form D —ο G and G1&G2 where D is a text or a macro and G is a query. The first goal is solved by adding D to the current text and then solving G. This goal is flexible in controlling the current text dynamically. The second goal is solved by solving both G1 and G2 from the current text. This goal is particularly useful for internet search.
Transmission line metamaterials on coplanar waveguide with series-capacitive and shunt-inductive distributed loading in periodical intervals are characterized using our developed fullwave self-calibrated method of moments. Firstly, the two effective per-unit-length transmission parameters, i.e., complex propagation constant and characteristic impedance, are numerically extracted. The results provide a straightforward insight into the forward- and backward-wave propagation characteristics in several distinctive bands, including the left- and right-handed stopbands and passbands. In particular, it is demonstrated that in the whole left-handed passband, the propagation constant has purely negative phase constant while the characteristic impedance has only positive real quantity. Next, varied left- and right-handed passbands are studied in terms of lower/higher cut-off frequencies based on ideal equivalent circuit model and practical distributed CPW elements, respectively. Of particular importance, the left-handed and right-handed passbands find to be able to be directly connected with a seamless bandgap under the condition that normalized inductance and capacitance of loaded CPW inductive and capacitive elements become exactly the same with each other. Finally, the 9-cell metamaterial circuits on CPW with actual 50 Ω feed lines are designed and implemented for experimental validation on the derived per-unit-length parameters.
In this paper, an architecture of MIMO mesh network which avoids co-channel interference and supplies link multiplexing simultaneously, namely MIMO spatial spectrum sharing, is proposed. As a MIMO transmission scheme, linear (such as zero-forcing) and nonlinear (such as dirty paper coding and successive interference cancellation) MIMO algorithm are developed for the proposed mesh network. It is found from numerical analysis that the proposed MIMO mesh network achieves significantly higher channel capacity than that of conventional mesh networks.
Suhua TANG Naoto KADOWAKI Sadao OBANA
In this paper we analyze the characteristics of vehicle mobility and propose a novel Mobility Prediction Progressive Routing (MP2R) protocol for Inter-Vehicle Communication (IVC) that is based on cross-layer design. MP2R utilizes the additional gain provided by the directional antennas to improve link quality and connectivity; interference is reduced by the directional transmission. Each node learns its own position and speed and that of other nodes, and performs position prediction. (i) With the predicted progress and link quality, the forwarding decision of a packet is locally made, just before the packet is actually transmitted. In addition the load at the forwarder is considered in order to avoid congestion. (ii) The predicted geographic direction is used to control the beam of the directional antenna. The proposed MP2R protocol is especially suitable for forwarding burst traffic in highly mobile environments. Simulation results show that MP2R effectively reduces Packet Error Ratio (PER) compared with both topology-based routing (AODV [1], FSR [2]) and normal progressive routing (NADV [18]) in the IVC scenarios.
Shinichi FURUKAWA Wataru SATOU Takashi HINATA Nao SHIMIZU
In this paper, a fiber with two inhomogeneous sector holes around the core is proposed, and propagation characteristics of polarization maintaining region and single-polarization region are numerically analyzed by circular Fourier expansion method. In each case of the single-polarization region and the polarization maintaining region, a fiber is designed so as to satisfy the zero total dispersion at wavelength of 1.55 µm. Then, the single-polarization bandwidth for the single-polarization region and the modal birefringence for the polarization maintaining region are examined as the specific characteristics in each region. In addition, the power concentrating into the core region and distributions of Poynting vector is also discussed.
Ho-Yin LEE Shih-Lun CHEN Ching-Hsing LUO
This paper describes a smart thermal sensing chip with an integrated vertical bipolar transistor sensor, a Sigma Delta Modulator (SDM), a Micro-Control Unit (MCU), and a bandgap reference voltage generator for biomedical application by using 0.18 µm CMOS process. The npn bipolar transistors with the Deep N-Well (DNW) instead of the pnp bipolar transistor is first adopted as the sensor for good isolation from substrate coupling noise. In addition to data compression, Micro-Control Unit (MCU) plays an important role for executing auto-calibration by digitally trimming the bipolar sensor in parallel to save power consumption and to reduce feedback complexity. It is different from the present analog feedback calibration technologies. Using one sensor, instead of two sensors, to create two differential signals in 180phase difference input to SDM is also a novel design of this work. As a result, in the range of 0 to 80 or body temperature (375), the inaccuracy is less than 0.1 or 0.05 respectively with one-point calibration after packaging. The average power consumption is 268.4 µW with 1.8 V supply voltage.