In order to evaluate the effect of Nakagami-Rice fading on Orthogonal Frequency Division Multiplex (OFDM) signal transmission when the delay profile exceeds the guard interval, a simple prediction model is developed by extending the Equivalent Transmission-Path (ETP) model for Rayleigh fading. The validity of the model is demonstrated by comparing the calculated values of BER to those obtained by computer simulation. Using the newly developed ETP-OFDM model, digital transmission characteristics of the OFDM signal in a multipath environment when the delay profile exceeds the guard interval are shown as a function of K factor, delay spread, guard interval and OFDM symbol period.

Ga-doped ZnO thin films were prepared by RF magnetron sputtering. The effects of adding H2 to pure Ar sputtering gas were investigated. In the case of pure Ar at 2 Pa, the resistivity is 7.4510-3 Ωcm, whereas for Ar+1%H2 at 0.3 Pa, it markedly decreases to 2.5210-4 Ωcm. In this case, the carrier density and Hall mobility are 1.121021 cm-3 and 23.4 cm2/Vs, respectively. This conductive film also exhibits a transmittance of 90% within the visible-wavelength range. The addition of H2 and the decrease in the pressure results in the fabrication of a significantly more transparent and conductive film.

In this paper, we suggest that all pairings are in a group from an abstract angle. Based on the results, some new pairings with the short Miller loop are constructed for great efficiency. It is possible that our observation can be applied into other aspects of pairing-based cryptosystems.

This paper gives a survey and comparison of algorithms for the detection of binary data in the presence of two-dimensional (2-D) intersymbol interference. This is a general problem of communication theory, because it can be applied to various practical problems in data storage and transmission. Major results on trellis-based detection algorithms, previously disparate are drawn together, and placed into a common framework. All algorithms have better complexity than optimal detection, and complexity is compared. On the one hand, many algorithms perform within 1.0 dB or better of optimal performance. On the other hand, none of these proposed algorithms can find the optimal solution at high SNR, which is surprising. Extensive discussion outlines further open problems.

Optical anisotropy was induced in azobenzene copolymer film using linearly or elliptically polarized laser beams. The Jones matrix of the anisotropic film was calculated from the change in polarization of the probe light. Two eigenpolarization states were obtained from the matrix. These two eigenstates are useful as a polarization basis for a polarization-tunable component.

In this letter, a theoretical analysis of bit error probability for 4-state convolutional code with Max-Log-maximum a posteriori probability (MAP) decoding is presented. This technique employs an iterative calculation of probability density function of the state metric per one transition, and gives the exact bit error probability for all signal-to-noise power ratio.

Rugate thin film optical filters are useful for designing arbitrary-shaped spectra, such as multistep or triangular spectra. A technique for synthesizing the refractive index distribution of rugate filters was used to suppress unwanted ripples on the spectrum. The refractive index of an amorphous hydrogenated silicon oxide (a-SiOx:H) rugate thin film was minutely controlled with a resolution of 0.001 using radio-frequency (RF) magnetron sputtering. The fabricated rugate filters had multistep bands over a wavelength range of 1260-1670 nm or good linearity over 1290-1650 nm.

Focusing on time correlation of real communication channels, a channel quantization algorithm based on finite state vector quantization (FSVQ) is proposed. Firstly channels are partitioned into finite states, then codebooks corresponding to each state are constructed, which are used to quantize channels transferred from corresponding states. Further, the state transition function is designed to ensure the synchronization between transmitter and receiver. The proposed algorithm can achieve improved performance with the same feedback load compared with classical memoryless channel quantizer without consideration of the influence of time correlation. Simulation results verify the effectiveness of the proposed algorithm.

Data compression is popularly applied to computer systems and communication systems in order to reduce storage size and communication time, respectively. Since large data are used frequently, string matching for such data takes a long time. If the data are compressed, the time gets much longer because decompression is necessary. Long string matching time makes computer virus scan time longer and gives serious influence to the security of data. From this, CPM (Compression Pattern Matching) methods for several compression methods have been proposed. This paper proposes CPM method for PPM which achieves fast virus scan and improves dependability of the compressed data, where PPM is based on a Markov model, uses a context information, and achieves a better compression ratio than BW transform and Ziv-Lempel coding. The proposed method encodes the context information, which is generated in the compression process, and appends the encoded data at the beginning of the compressed data as a header. The proposed method uses only the header information. Computer simulation says that augmentation of the compression ratio is less than 5 percent if the order of the PPM is less than 5 and the source file size is more than 1 M bytes, where order is the maximum length of the context used in PPM compression. String matching time is independent of the source file size and is very short, less than 0.3 micro seconds in the PC used for the simulation.

Point Pattern Matching (PPM) is an essential problem in many image analysis and computer vision tasks. This paper presents a two-stage algorithm for PPM problem using ellipse fitting and dual Hilbert scans. In the first matching stage, transformation parameters are coarsely estimated by using four node points of ellipses which are fitted by Weighted Least Square Fitting (WLSF). Then, Hilbert scans are used in two aspects of the second matching stage: it is applied to the similarity measure and it is also used for search space reduction. The similarity measure named Hilbert Scanning Distance (HSD) can be computed fast by converting the 2-D coordinates of 2-D points into 1-D space information using Hilbert scan. On the other hand, the N-D search space can be converted to a 1-D search space sequence by N-D Hilbert Scan and an efficient search strategy is proposed on the 1-D search space sequence. In the experiments, we use both simulated point set data and real fingerprint images to evaluate the performance of our algorithm, and our algorithm gives satisfying results both in accuracy and efficiency.

Under the assumption that the clock can be inputted to each register at an arbitrary timing, the minimum feasible clock period might be reduced by register relocation while maintaining the circuit behavior and topology. However, if the minimum feasible clock period is reduced, then the number of registers tends to be increased. In this paper, we propose a gate-level register relocation method that reduces the number of registers while keeping the target clock period. In experiments, the proposed method reduces the number of registers in the practical time in most circuits.

This paper proposes a DCT-based steganographic method named StegErmelc in the JPEG domain. Three strategies are proposed, namely (i) edge-like block selection, (ii) recursive matrix encoding, and (iii) largest coefficient serving, to form a novel steganographic method for achieving scalable carrier capacity, low detectability by universal blind steganalyzer, and high image quality, simultaneously. For a given message length, StegErmelc flexibly scales its carrier capacity to accommodate the message while trading off with stego detectability. At full capacity, StegErmelc has comparable carrier capacity relative to the existing methods. When embedding the same amount of information, StegErmelc remarkably reduces the stego detection rate to about 0.3-0.5 lower than that of the existing methods considered, and consequently StegErmelc can withstand blind steganalyzer when embedding up to 0.10 bpc. Under the same condition, StegErmelc produces stego image with quality higher than that of the existing methods considered. Graphical comparison with three additional evaluation metrics is also presented to show the relative performance of StegErmelc with respect to the existing methods considered.

This paper evaluates three inter-domain redundancy path computation methods based on PCE (Path Computation Element). Some inter-domain paths carry traffic that must be assured of high quality and high reliability transfer such as telephony over IP and premium virtual private networks (VPNs). It is, therefore, important to set inter-domain redundancy paths, i.e. primary and secondary paths. The first scheme utilizes an existing protocol and the basic PCE implementation. It does not need any extension or modification. In the second scheme, PCEs make a virtual shortest path tree (VSPT) considering the candidates of primary paths that have corresponding secondary paths. The goal is to reduce blocking probability; corresponding secondary paths may be found more often after a primary path is decided; no protocol extension is necessary. In the third scheme, PCEs make a VSPT considering all candidates of primary and secondary paths. Blocking probability is further decreased since all possible candidates are located, and the sum of primary and secondary path cost is reduced by choosing the pair with minimum cost among all path pairs. Numerical evaluations show that the second and third schemes offer only a few percent reduction in blocking probability and path pair total cost, while the overheads imposed by protocol revision and increase of the amount of calculation and information to be exchanged are large. This suggests that the first scheme, the most basic and simple one, is the best choice.

We study the performances of a synchronous chip-interleaved, block spread (CIBS) code division multiple access (CDMA) with space-time block-coding (STBC) in the presence of frequency-selective fading. For providing the space diversity gain due to STBC, we introduce the optimum precoding for the STBC. Zero-forcing and minimum mean square error equalizers for CIBS-CDMA are derived. Simulation results confirm that the proposed precoder is valid under the frequency selective fading.

We obtained blue photoluminescence from tantalum oxide films deposited by radio-frequency magnetron sputtering after annealing. The maximum peak intensity of the photoluminescence was observed from a sample annealed at 600 for 20 min, and the peak wavelength was approximately 430 nm. Tantalum oxide films that emit blue light may be useful materials for novel active optical devices utilizing Ta2O5/SiO2 multilayered photonic crystals.

Multipath energy capture and inter-symbol interference (ISI) are two intractable problems in high-data-rate Ultra-wideband (UWB) systems. To tackle the problems and simplify the receiver, we propose an adaptive interference avoidance scheme based on Pre-RAKE combining technique. The symbol repetition period (SRP) is regarded a changeable parameter in an ordered set to avoid severe interference paths and guarantee high data-rate. The set is known to both the transmitter and receiver. The index of the selected SRP is then sent to the receiver to coordinate the transmitter and receiver. The SRP can be updated adaptively according to the variations of the channels. Both theoretical analysis and simulations show that the ISI is mitigated and the transmission rate is improved simultaneously compared to the constant SRP transmission scheme.

In 2006, Miranda et al. proposed an anonymity scheme to achieve peers' anonymity in Peer-to-Peer (P2P) reputation systems. In this paper, we show that this scheme can not achieve peers' anonymity in two cases. We also propose an improvement which solves the problem and improves the degree of anonymity.

This letter proposes an efficient uplink scheduling algorithm for the voice over Internet protocol (VoIP) service with variable frame-duration according to the voice activity in IEEE 802.16e/m systems. The proposed algorithm dynamically changes the grant-interval to save the uplink bandwidth, and it uses the random access scheme when the voice activity changes from silent-period to talk-spurt. Numerical results show that the proposed algorithm can increase the VoIP capacity by 26 percent compared to the conventional extended real-time polling service (ertPS).

A novel electronically tunable high input impedance voltage-mode multifunction filter with single inputs and three outputs employing two single-output-operational transconductance amplifiers, one differential difference current conveyor and two capacitors is proposed. The presented filter can be realized the highpass, bandpass and lowpass functions, simultaneously. The input of the filter exhibits high input impedance so that the synthesized filter can be cascaded without additional buffers. The circuit needs no any external resistors and employs two grounded capacitors, which is suitable for integrated circuit implementation.

With the ubiquitous application of Internet and wireless networks, H.264 video communication becomes more and more common. However, due to the high-efficiently predictive coding and the variable length entropy coding, it is more sensitive to transmission errors. The current error concealment (EC) scheme, which utilizes the spatial and temporal correlations to conceal the corrupted region, produces unsatisfied boundary artifacts. In this paper, first we propose variable block size error concealment (VBSEC) scheme inspired by variable block size motion estimation (VBSME) in H.264. This scheme provides four EC modes and four sub-block partitions. The whole corrupted macro-block (MB) will be divided into variable block size adaptively according to the actual motion. More precise motion vectors (MV) will be predicted for each sub-block. Then MV refinement (MVR) scheme is proposed to refine the MV of the heterogeneous sub-block by utilizing three step search (TSS) algorithm adaptively. Both VBSEC and MVR are based on our directional spatio-temporal boundary matching algorithm (DSTBMA). By utilizing these schemes, we can reconstruct the corrupted MB in the inter frame more accurately. The experimental results show that our proposed scheme can obtain better objective and subjective EC quality, respectively compared with the boundary matching algorithm (BMA) adopted in the JM11.0 reference software, spatio-temporal boundary matching algorithm (STBMA) and other comparable EC methods.