Visual Cryptography Based on an Interferometric Encryption Technique

This paper presents a new method for a visual cryptography scheme that uses phase masks and an interferometer. To encrypt a binary image, we divided it into an arbitrary number of slides and encrypted them using an XOR process with a random key or keys. The phase mask for each encrypted image was fabricated under the proposed phase‐assignment rule. For decryption, phase masks were placed on any path of the Mach‐Zehnder interferometer. Through optical experiments, we confirmed that a secret binary image that was sliced could be recovered by the proposed method.     

New Type of 2-D Laser Doppler Vibrometer

The fundamentals and method of 2-D laser Doppler vibrometer are introduced.The factors influencing the measuring accuracy are analyzed.Moreover,the circuit for signal processing is designed.The vibrating amplitude and frequency of 2-D vibration in wider range can be measured simultaneously in non-contact means,the measuring results are accurate.     

Chaos-based feedforward output functions for combining keystream generators

The chaos-based feedforward output functions for combining keystream generators are proposed according to chaotic dynamic theory. The generated binary signals are independently and identically distributed, and have predictable periods. All experiments correspond to the theoretical prediction very well.     

High‐Performance Transition Metal Dichalcogenide Photodetectors Enhanced by Self‐Assembled Monolayer Doping

Most doping research into transition metal dichalcogenides (TMDs) has been mainly focused on the improvement of electronic device performance. Here, the effect of self‐assembled monolayer (SAM)‐based doping on the performance of WSe₂‐ and MoS₂‐based transistors and photodetectors is investigated. The achieved doping concentrations are ≈1.4 × 10¹¹ for octadecyltrichlorosilane (OTS) p‐doping and ≈10¹¹ for aminopropyltriethoxysilane (APTES) n‐doping (nondegenerate). Using this SAM doping technique, the field‐effect mobility is increased from 32.58 to 168.9 cm² V^?1 s in OTS/WSe₂ transistors and from 28.75 to 142.2 cm² V^?1 s in APTES/MoS₂ transistors. For the photodetectors, the responsivity is improved by a factor of ≈28.2 (from 517.2 to 1.45 × 10⁴ A W^?1) in the OTS/WSe₂ devices and by a factor of ≈26.4 (from 219 to 5.75 × 10³ A W^?1) in the APTES/MoS₂ devices. The enhanced photoresponsivity values are much higher than that of the previously reported TMD photodetectors. The detectivity enhancement is ≈26.6‐fold in the OTS/WSe₂ devices and ≈24.5‐fold in the APTES/MoS₂ devices and is caused by the increased photocurrent and maintained dark current after doping. The optoelectronic performance is also investigated with different optical powers and the air‐exposure times. This doping study performed on TMD devices will play a significant role for optimizing the performance of future TMD‐based electronic/optoelectronic applications.     

A resilient buffer allocation scheme in active queue management: a stochastic cooperative game theoretic approach

During the last decade, a plentiful number of active queue management schemes have been proposed, but their main objectives are simply allocating the buffer resource to all flows evenly, or protecting responsive flows from being degraded by unresponsive flows. However, the sending rates of the responsive flows can be determined diversely, and not all unresponsive flows have aggressively high sending rates. Furthermore, it is rational to reserve a portion of the buffer resource for certain privileged traffic. Grounded by these evidences, in this paper, we present a resilient active queue management algorithm, named Prior‐Core‐based Buffer Allocation considering diverse congestion control algorithms, fair‐unresponsive flows, and some privileged traffic. Our approach is based on stochastic cooperative game theory, where the payoffs yielded by cooperation are described by random variables, and the core is defined only over the distribution of these random payoffs; the core in this situation is called the prior‐core. As a result, it is shown that our buffer allocation, yielded by the prior‐core, achieves completely fair allocation for those flows whose requirement does not exceed the fair‐share regardless of the responsiveness, whereas aggressive flows are restricted according to availability of the buffer; all these are verified through ns‐2 simulation experiments. Copyright © 2014 John Wiley & Sons, Ltd.     

一种任意图形编码的（0，π）型二维位相光栅的设计

基于分析和比较各种编码图形的二维二值位相光栅的优缺点．提出了一种设计任意图形编码的二值位相光栅的方法。该方法主要分为两步．首先以获得最高衍射效率为基准．寻求任意图形编码的二维二值位相光栅的初始结构．然后采用一种迭代算法优化初始结构获得期望的光强分布。设计了７个可等强分束的二维二值位相光栅，其衍射效率均大于８０％，均匀性偏差均小于０．０１％。     

Cavity length and absorption dependent longitudinal beat in iodine photodissociation laser

As the cavity length of the iodine photodissociation laser (iodine PDL) is varied, the number of neighboring coherent modes increases and the time-dependent mode-competition effect gives rise to typical changes in the pulse shape. The ratio of the number of all coherent modes to that of all oscillating modes is found to be as high as 80 percent when the cavity length is 450 cm. The frequency width in which the neighboring modes are coherent is approximately 0.1 GHz for all cavity lengths used. The effect of a BDN absorber placed in the cavity is distinct in the shorter cavities.     

Improved Scalar Multiplication on Elliptic Curves Defined over F2mn

We propose two improved scalar multiplication methods on elliptic curves over F_qn where q = 2^m using Frobenius expansion. The scalar multiplication of elliptic curves defined over subfield F_q can be sped up by Frobenius expansion. Previous methods are restricted to the case of a small m. However, when m is small, it is hard to find curves having good cryptographic properties. Our methods are suitable for curves defined over medium‐sized fields, that is, 10 ≤ m ≤ 20. These methods are variants of the conventional multiple‐base binary (MBB) method combined with the window method. One of our methods is for a polynomial basis representation with software implementation, and the other is for a normal basis representation with hardware implementation. Our software experiment shows that it is about 10% faster than the MBB method, which also uses Frobenius expansion, and about 20% faster than the Montgomery method, which is the fastest general method in polynomial basis implementation.     

Performance of Efficient Signal Detection for LED-ID Systems

In this paper, effects of reader-to-reader interference are investigated for LED identification (LED-ID) system in a multi-reader environment. The LED-ID readers typically use different channels to avoid collision between readers. However, in-channel collision usually happens in terms of interrogation range. A reader-to-reader interference scenario is proposed, and nominal interrogation range of a desired reader is derived from this model. In order to evaluate the LED-ID reader-to-reader interference quantitatively, an efficient detection scheme is proposed and simulated by employing spreading sequence. The spreading sequence is inserted between each user’s frame formats. In the receiver, the desired signal is detected by using correlation among inserted spreading sequences. From simulation results, it is confirmed that the proposed scheme is very effective to enhance reliability of LED-ID communication systems.     

Design and Architecture of Low‐Latency High‐Speed Turbo Decoders

In this paper, we propose and present implementation results of a high‐speed turbo decoding algorithm. The latency caused by (de)interleaving and iterative decoding in a conventional maximum a posteriori turbo decoder can be dramatically reduced with the proposed design. The source of the latency reduction is from the combination of the radix‐4, center to top, parallel decoding, and early‐stop algorithms. This reduced latency enables the use of the turbo decoder as a forward error correction scheme in real‐time wireless communication services. The proposed scheme results in a slight degradation in bit error rate performance for large block sizes because the effective interleaver size in a radix‐4 implementation is reduced to half, relative to the conventional method. To prove the latency reduction, we implemented the proposed scheme on a field‐programmable gate array and compared its decoding speed with that of a conventional decoder. The results show an improvement of at least five fold for a single iteration of turbo decoding.