This paper proposes low-complexity blind detection for orthogonal frequency division multiplexing (OFDM) systems with the differential space-time block code (DSTBC) under time-varying frequency-selective Rayleigh fading. The detector employs the maximum likelihood sequence estimation (MLSE) in cooperation with the blind linear prediction (BLP), of which prediction coefficients are determined by the method of Lagrange multipliers. Interpolation of channel frequency responses is also applied to the detector in order to reduce the complexity. A complexity analysis and computer simulations demonstrate that the proposed detector can reduce the complexity to about a half, and that the complexity reduction causes only a loss of 1 dB in average Eb/N0 at BER of 10-3 when the prediction order and the degree of polynomial approximation are 2 and 1, respectively.

Due to the exponentially increasing threat of cyber attacks, many e-commerce organizations around the world have begun to recognize the importance of information security. When considering the importance of security in e-commerce, we need to train e-commerce security experts who can help ensure the reliable deployment of e-commerce. The purpose of this research is to design and evaluate an e-commerce security curriculum useful in training e-commerce security experts. In this paper, we use a phase of the Delphi method and the Analytic Hierarchy Process (AHP) method. To validate our results, we divide the respondents into two groups and compare the survey results.

A novel high-speed and low-voltage CMOS level shifter circuit is proposed. The proposed circuit is suitable for block-level dynamic voltage and frequency scaling (DVFS) environment or multiple-clock and multiple-power-domain logic blocks. In order to achieve high performance in a chip consisting of logic blocks having different VDD voltages, the proposed circuit uses the circuit techniques to reduce the capacitive loading of input signals and to minimize the contention between pull-up and pull-down transistors through positive feedback loop. The techniques improve the slew rate of output signals, so that the level transient delay and duty distortions can be reduced. The proposed level up/down shifters are designed to operate over a wide range of voltage and frequency and verified with Berkeley's 65 nm CMOS model parameters, which can cover a voltage range from 0.6 to 1.6 V and at least frequency range up to 1000 MHz within 3% duty errors. Through simulation with Berkeley's 65 nm CMOS model parameters, the level shifter circuits can solve the duty distortion preventing them from high speed operation within the duty ratio error of 3% at 1 GHz. For verification through performance comparison with reported level shifts, the simulations are carried out with 0.35 µm CMOS technology, 0.13 µm IBM CMOS technology and Berkeley's 65 nm CMOS model parameters. The compared results show that delay time and duty ratio distortion are improved about 68% and 75%, respectively.

We consider a problem for constructing a minimum cost r-edge-connected multigraph in which degree d(v) of each vertex v ∈ V is specified. In this paper, we propose a 3-approximation algorithm for this problem under the assumption that edge cost is metric, r(u,v) ∈ {1,2} for each u,v ∈ V, and d(v) ≥ 2 for each v ∈ V. This problem is a generalization of metric TSP. We also propose an approximation algorithm for the digraph version of the problem.

The Multiple Access Interference (MAI) and the Multipath Fading (MPF) restrict the performance of Code-Division Multiple-Access (CDMA) systems. The Multiuser Detection (MUD) based on Particle Swarm Optimization algorithm (PSO) with Rake processing is proposed in this paper to overcome these obstacles, followed by full details of how to apply the Binary PSO MUD (BPSO-MUD) on a CDMA system. Simulations show that the BPSO-MUD has significantly better performance than the Conventional Detection (CD).

OBS is a realistic solution to the mismatch of the capacity of optical fiber and electrical switching in backbone photonic networks. One of the critical issues in OBS networks is to avoid burst contention at transit nodes. This problem induces the rapid growth of burst-transmission delay time under heavy traffic loads. In this paper, we propose a low-delay burst transmission scheme using burst segmentation at source node to suppress the growth in burst-transmission delay. In our scheme, a burst is divided and burst-transfer time is determined by the multiple information about reservation of other bursts at all transit nodes. We analyzed capabilities of the proposed scheme and found that it more efficiently suppresses the growth of the burst-transmission delay time in heavy traffic loads compared with some conventional signaling schemes.

In D.O.A. estimation, identification of the signal and the noise subspaces plays an essential role. This identification process was traditionally achieved by the eigenvalue decomposition (EVD) of the spatial correlation matrix of observations or the generalized eigenvalue decomposition (GEVD) of the spatial correlation matrix of observations with respect to that of an observation noise. The framework based on the GEVD is not always an extension of that based on the EVD, since the GEVD is not applicable to the noise-free case which can be resolved by the framework based on the EVD. Moreover, they are not applicable to the case in which the spatial correlation matrix of the noise is singular. Recently, a quotient-singular-value-decomposition-based framework, that can be applied to problems with singular noise correlation matrices, is introduced for noise reduction. However, this framework also can not treat the noise-free case. Thus, we do not have a unified framework of the identification of these subspaces. In this paper, we show that a unified framework of the identification of these subspaces is realized by the concept of proper and improper eigenspaces of the spatial correlation matrix of the noise with respect to that of observations.

This paper deals with a design problem of an observer-based robust preview control system for uncertain discrete-time systems. In this approach, we adopt 2-stage design scheme and we derive an observer-based robust controller with integral and preview actions such that a disturbance attenuation level is satisfactorily small for allowable uncertainties.

We study on the security proof of the improved efficient-Rabin (ERabin) scheme and the F-FDHS scheme. First, we show that the security theorem of the improved ERabin scheme is not correct, and then provide a correct theorem for it. Second, we show that the security theorem of the F-FDHS scheme lacks an assumption. Finally, we present a way to modify the improved ERabin scheme and the F-FDHS scheme.

Band connections employed in active cancellation circuits for effective reduction of digital substrate noise are proposed. An almost-odd-symmetrical noise characteristic is utilized for canceling out noises. Advancing this idea, interlaced connections of four bands are also proposed. Excess cancellation by those bands is more effective for noise reduction in a guard ring than a cancellation by two bands. Use of L-shaped bands on the basis of the interlaced connection suppresses the noise more. Simulation and experimental results show that the proposed band connections reduce the noise.

The uni-traveling-carrier photodiode (UTC-PD) is an innovative PD that has a unique operation mode in which only electrons act as the active carriers, resulting in ultrafast response and high electrical output power at the same time. This paper describes the features of the UTC-PD and its excellent performance. In addition, UTC-PD-based optoelectronic devices integrated with various elements, such as passive and active devices, are presented. These devices are promising for various applications, such as millimeter- and submillimeter-wave generation up to the terahertz range and ultrafast optical signal processing at data rates of up to 320 Gbit/s.

Performance analysis of ultra-fast all-optical analog-to-digital converter using optical multiple-level thresholding module based on self-frequency shift in fiber is described. In analog-to-digital conversion, the purposes of optical sampling and optical quantization are in the possibility of the speed-up of sampling and quantization processes using various ultra-fast nonlinear phenomena depending on an intensity of a light. The result of analysis indicates that the number of achievable quantized levels of the proposed approach is in the increasing tendency with an increase in the peak power of an input pulse.

This paper is intended to provide an alternative approach for the design of FIR filters by using a Hopfield Neural Network (HNN). The proposed approach establishes the error function between the amplitude response of the desired FIR filter and the designed one as a Lyapunov energy function to find the HNN parameters. Using the framework of HNN, the optimal filter coefficients can be obtained from the output state of the network. With the advantages of local connectivity, regularity and modularity, the architecture of the proposed approach can be applied to the design of differentiators and Hilbert transformer with significantly reduction of computational complexity and hardware cost. As the simulation results illustrate, the proposed neural-based method is capable of achieving an excellent performance for filter design.

A microwave photonic mixer utilizing an InGaAs photoconductor for radio over fiber applications is proposed and fabricated. Static and dynamic characteristics of the fabricated microwave photonic mixer were investigated. The microwave photonic mixer showed an optical bandwidth of approximately 300 MHz and a uniform conversion loss characteristic for the electrical input frequency up to 20 GHz.

A tri-template-based codes (TTBC) method is proposed to reduce test cost of intellectual property (IP) cores. In order to reduce test data volume (TDV), the approach utilizes three templates, i.e., all 0, all 1, and the previously applied test data, for generating the subsequent test data by flipping the inconsistent bits. The approach employs a small number of test channels I to supply a large number of internal scan chains 2I-3 such that it can achieve significant reduction in test application time (TAT). Furthermore, as a non-intrusive and automatic test pattern generation (ATPG) independent solution, the approach is suitable for IP core testing because it requires neither redesign of the core under test (CUT) nor running any additional ATPG for the encoding procedure. In addition, the decoder has low hardware overhead, and its design is independent of the CUT and the given test set. Theoretical analysis and experimental results for ISCAS 89 benchmark circuits have proven the efficiency of the proposed approach.

Ring signature scheme enables a signer to sign a message anonymously. In the ring signature scheme, the signer who wants to sign a document anonymously first chooses some public keys of entities (signers) and then generates a signature which ensures that one of the signer or entities signs the document. In some situations, however, the ring signature scheme allows the signer to shift the blame to victims because of the anonymity. The group signature scheme may be a solution for the problem; however, it needs an electronic big brother, called a group manager, who can violate the signer anonymity by himself, and a complicated key setting. This paper introduces a new notion of a signature scheme with signer anonymity, a deniable ring signature scheme (DRS), in which no group manager exists, and the signer should be involved in opening the signer anonymity. We also propose a concrete scheme proven to be secure under the assumption of the DDH (decision Diffie Hellman) problem in the random oracle model.

This paper presents a secure and simple content-based digital signature method for verifying the image authentication under JPEG, JPEG2000 compression and scaling based on a novel concept named lowest authenticable difference (LAD). The whole method, which is extended from the crypto-based digital signature scheme, mainly consists of statistical analysis and signature generation/verification. The invariant features, which are generated from the relationship among image blocks in the spatial domain, are coded and signed by the sender's private key to create a digital signature for each image, regardless of the image size. The main contributions of the proposed scheme are: (1) only the spatial domain is adopted during feature generation and verification, making domain transformation process unnecessary; (2) more non-malicious manipulated images (JPEG, JPEG2000 compressed and scaled images) than related studies can be authenticated by LAD, achieving a good trade-off of image authentication between fragile and robust under practical image processing; (3) non-malicious manipulation is clearly defined to meet closely the requirements of storing images or sending them over the Internet. The related analysis and discussion are presented. The experimental results indicate that the proposed method is feasible and effective.

ID-SP-M4M scheme means ID-based series-parallel multisignature schemes for multi-messages. In this paper, we investigate series-parallel multisignature schemes for multi-messages and propose an ID-SP-M4M scheme based on pairings in which signers in the same subgroup sign the same message, and those in different subgroups sign different messages. Our new scheme is an improvement over the series-parallel multisignature schemes introduced by Doi et al.[6]-[8] and subsequent results such as the schemes proposed by Burmester et al.[4] and the original protocols proposed by Tada [20],[21], in which only one message is to be signed. Furthermore, our ID-SP-M4M scheme is secure against forgery signature attack from parallel insiders under the BDH assumption.

It is known that for any general access structure, a secret sharing scheme (SSS) can be constructed from an (m,m)-threshold scheme by using the so-called cumulative map or from a (t,m)-threshold SSS by a modified cumulative map. However, such constructed SSSs are not efficient generally. In this paper, a new method is proposed to construct a SSS from a (t,m)-threshold scheme for any given general access structure. In the proposed method, integer programming is used to derive the optimal (t,m)-threshold scheme and the optimal distribution of the shares to minimize the average or maximum size of the distributed shares to participants. From the optimality, it can always attain lower coding rate than the cumulative maps because the cumulative maps cannot attain the optimal distribution in many cases. The same method is also applied to construct SSSs for incomplete access structures and/or ramp access structures.

Traffic sign detection is a valuable part of future driver support system. In this paper, we present a novel framework to accurately detect traffic signs from a single color image by analyzing geometrical, physical and text/symbol features of traffic signs. First, we utilize an elaborate edge detection algorithm to extract edge map and accurate edge pixel gradient information. Then, we extract 2-D geometric primitives (circles, ellipses, rectangles and triangles) efficiently from image edge map. Third, the candidate traffic sign regions are selected by analyzing the intrinsic color features, which are invariant to different illumination conditions, of each region circumvented by geometric primitives. Finally, a text and symbol detection algorithm is introduced to classify true traffic signs. Experimental results demonstrated the capabilities of our algorithm to detect traffic signs with respect to different size, shape, color and illumination conditions.