Three methods of presenting a three-dimensional (3-D) image – a real object, a protruding stereoscopic display, and the depth-fused 3-D (DFD) display – have different tendencies for the change in perceived depth produced when the visual acuity of the dominant eye is decreased by an occlusion foil. These different tendencies are estimated from the slope and correlation coefficient of the plot of perceived depth difference versus stimuli depth difference. This estimation was derived using the same experimental system setup composed of two displays and a half mirror for all three 3-D display methods. The perceived depth difference was measured for four subjects by calipers using two fingers. The slope and correlation coefficient had almost the same tendencies as follows. The real object had the smallest decrease among the three 3-D display methods when the dominant eye's visual acuity was decreased and the protruding stereoscopic display had the largest decrease. The DFD display method had an intermediate decrease between those of the real object and protruding stereoscopic display. When the dominant eye's visual acuity was high enough, the differences among the three 3-D display methods were small. When its visual acuity was decreased, the differences increased among the three 3-D display methods and became statistically significant.

A novel cooperative spectrum sensing scheme suitable for wireless cognitive radio system with imperfect reporting channels is proposed. In the proposed scheme, binary local decision bits are transmitted to the fusion center and combined to form a soft-valued decision statistics in the fusion center. To form a decision statistics, a majority-decision-aided weighting rule is proposed. The proposed scheme provides a reliable sensing capability even with poor reporting channels.

A scheme that modulates the training sequence is proposed to support two-layer data streams in the time domain synchronous orthogonal frequency division multiplex (TDS-OFDM) systems. A theoretical analysis and computer simulation show that the proposed scheme works well and that the two layer data streams are compatible with each other.

In block transmissions, inter-block interference (IBI) due to delayed waves exceeding a cyclic prefix severely limits the performance. To suppress IBI in downlink MC-CDMA systems, this paper proposes a novel channel shortening method using a time-domain equalizer. The proposed method minimizes a cost function related to equalizer output autocorrelations without the transmission of training symbols. We prove that the method can shorten a channel and suppress IBI completely. Simulation results show that the proposed method can significantly suppress IBI using relatively less number of received blocks than a conventional method when the number of users is moderate.

In this paper, we analyze the existing results to derive the cross-correlation distributions of p-ary m-sequences and their decimated sequences for an odd prime p and various decimations d. Based on the previously known results, a methodology to obtain the distribution of their cross-correlation values is also formulated.

This paper precisely characterizes secret sharing schemes based on arbitrary linear codes by using the relative dimension/length profile (RDLP) and the relative generalized Hamming weight (RGHW). We first describe the equivocation Δm of the secret vector =[s1,...,sl] given m shares in terms of the RDLP of linear codes. We also characterize two thresholds t1 and t2 in the secret sharing schemes by the RGHW of linear codes. One shows that any set of at most t1 shares leaks no information about , and the other shows that any set of at least t2 shares uniquely determines . It is clarified that both characterizations for t1 and t2 are better than Chen et al.'s ones derived by the regular minimum Hamming weight. Moreover, this paper characterizes the strong security in secret sharing schemes based on linear codes, by generalizing the definition of strongly-secure threshold ramp schemes. We define a secret sharing scheme achieving the α-strong security as the one such that the mutual information between any r elements of (s1,...,sl) and any α-r+1 shares is always zero. Then, it is clarified that secret sharing schemes based on linear codes can always achieve the α-strong security where the value α is precisely characterized by the RGHW.

We observe that the state-of-the-art power-saving mechanisms (PSM) for IEEE 802.16e is neither optimal in terms of delay nor in terms of energy consumption. We propose a new PSM which achieves the optimality in terms of the average buffering delay without increasing energy consumption. In order to do so, we derive a formula which relates the average buffering delay to sleep intervals. Simulation results show that our scheme surpasses the BTE algorithm (used by the current IEEE 802.16e Mobile Stations) by 56.75–76% and the PSID algorithm by 8.52–24.39% in terms of the delay-energy consumption product.

When the Akebono (EXOS-D) satellite passed through the plasmasphere, a series of lightning whistlers was observed by its analog wideband receiver (WBA). Recently, we developed an intelligent algorithm to detect lightning whistlers from WBA data. In this study, we analyzed two typical events representing the clear dispersion characteristics of lightning whistlers along the trajectory of Akebono. The event on March 20, 1991 was observed at latitudes ranging from 47.83 (47,83N) to -11.09 (11.09S) and altitudes between ∼2232 and ∼7537 km. The other event on July 12, 1989 was observed at latitudes from 34.94 (34.94N) and -41.89 (41.89S) and altitudes ∼1420–∼7911 km. These events show systematic trends; hence, we can easily determine whether the wave packets of lightning whistlers originated from lightning strikes in the northern or the southern hemispheres. Finally, we approximated the path lengths of these lightning whistlers from the source to the observation points along the Akebono trajectory. In the calculations, we assumed the dipole model as a geomagnetic field and two types of simple electron density profiles in which the electron density is inversely proportional to the cube of the geocentric distance. By scrutinizing the dipole model we propose some models of dispersion characteristic that proportional to the electron density. It was demonstrated that the dispersion D theoretically agrees with observed dispersion trend. While our current estimation is simple, it shows that the difference between our estimation and observation data is mainly due to the electron density profile. Furthermore, the dispersion analysis of lightning whistlers is a useful technique for reconstructing the electron density profile in the Earth's plasmasphere.

This paper proposes a downlink multi-user transmission scheme for the amplify-and-forward(AF)-based multi-relay cellular network, in which Tomlinson-Harashima precoding(TH precoding) and interference alignment(IA) are jointly applied. The whole process of transmission is divided into two phases: TH precoding is first performed at base-station(BS) to support the multiplexing of data streams transmitted to both mobile-stations(MS) and relay-stations(RS), and then IA is performed at both BS and RSs to achieve the interference-free communication. During the whole process, neither data exchange nor strict synchronization is required among BS and RSs thus reducing the cooperative complexity as well as improving the system performance. Theoretical analysis is provided with respect to the channel capacity of different types of users, resulting the upper-bounds of channel capacity. Our analysis and simulation results show that the joint applications of TH precoding and IA outperforms other schemes in the presented multi-relay cellular network.

In this paper, we study how to automatically classify mathematical expressions written in MathML (Mathematical Markup Language). It is an essential preprocess to resolve analysis problems originated from multi-meaning mathematical symbols. We first define twelve equation classes based on chapter information of mathematics textbooks and then conduct various experiments. Experimental results show an accuracy of 94.75%, by employing the feature combination of tags, operators, strings, and “identifier & operator” bigram.

The mode-matching applications to scattering from circular and annular apertures in a thick perfectly conducting plane are reviewed. The Hankel and Weber transforms are utilized to solve the boundary-value problems of circular and annular apertures. Simple electrostatic problems are presented to illustrate the mode-matching method in terms of the Hankel and Weber transforms. Various types of Weber transform are discussed with boundary-value problems. Electromagnetic radiation and scattering from circular and annular aperture geometries are summarized. The utility of the mode-matching method in circular and annular aperture scattering is emphasized.

High-performance FFT processor is indispensable for real-time OFDM communication systems. This paper presents a CORDIC based design of variable-length FFT processor which can perform various FFT lengths of 64/128/256/512/1024/2048/4096/8192-point. The proposed FFT processor employs memory based architecture in which mixed radix 4/2 algorithm, pipelined CORDIC, and conflict-free parallel memory access scheme are exploited. Besides, the CORDIC rotation angles are generated internally based on the transform of butterfly counter, which eliminates the need of ROM making it memory-efficient. The proposed architecture has a lower hardware complexity because it is ROM-free and with no dedicated complex multiplier. We implemented the proposed FFT processor and verified it on FPGA development platform. Additionally, the processor is also synthesized in 0.18 µm technology, the core area of the processor is 3.47 mm2 and the maximum operating frequency can be up to 500 MHz. The proposed FFT processor is better trade off performance and hardware overhead, and it can meet the speed requirement of most modern OFDM system, such as IEEE 802.11n, WiMax, 3GPP-LTE and DVB-T/H.

Nowadays, there are a great deal of e-documents being accessed on the Internet. It would be helpful if those documents and significant extract contents could be automatically analyzed. Similarity analysis and topic extraction are widely used as document relation analysis techniques. Most of the methods being proposed need some processes such as stemming, stop words removal, and etc. In those methods, natural language processing (NLP) technology is necessary and hence they are dependent on the language feature and the dataset. In this study, we propose novel document relation analysis and topic extraction methods based on text compression. Our proposed approaches do not require NLP, and can also automatically evaluate documents. We challenge our proposal with model documents, URCS and Reuters-21578 dataset, for relation analysis and topic extraction. The effectiveness of the proposed methods is shown by the simulations.

A 60 GHz direct conversion transceiver which employs amplitude/phase imbalance cancellation technique is newly proposed. By using the proposed technique, the receive path of the transceiver achieves less than 0.2 dB of amplitude error and less than 3 of phase error at 60 GHz bands over a 10 GHz bandwidth, which relaxes the design accuracy required for baluns used in the transceiver. It also employs a simple and fast calibration algorithm to adjust the locking range of the divide-by-3 injection locked divider in the phase locked loop. Fabricated in 90 nm CMOS technology, the transceiver achieves a low power consumption of 230 mW in transmit mode and 173 mW in receive mode. The output spectrum of 1.76 Gsps π/2-BPSK/QPSK modulation shows the excellent distortion and spurious suppression that meet the IEEE802.11ad draft standard.

For maximum-likelihood (ML) estimation to jointly track carrier frequency offset (CFO) and channel impulse response (CIR) in orthogonal frequency division multiplexing (OFDM) systems, we present a finite high order approximation method utilizing the MATLAB ‘roots' command on the log-likelihood function derived from the OFDM received signal, coupled with an adaptive iteration algorithm. The tracking performance of this high order approximation algorithm is found to be excellent, and as expected, the algorithm outperforms the other existing first order approximation algorithms.

This paper addresses conjugate-gradient (CG) based pilot-assisted channel estimation and equalization in doubly selective channels for orthogonal frequency division multiplexing (OFDM) block transmissions. With the help of the discrete prolate spheroidal sequence, which shows flat mean-square error (MSE) curves for the reconstructed channels in the presence of Doppler frequency mismatch, a basis expansion model for a parsimonious channel representation over multiple OFDM blocks is developed, a system equation for the least square channel estimation under widely used pilot lattices, where the pilot symbols are irregularly placed in the subcarrier domain, is formulated by introducing carving matrices, and the standard CG method is applied to the system. Relying on the CG method again, the linear minimum mean-square error channel equalization is pursued without performing any matrix inversion, while elevating the convergence speed of the iterative algorithm with a simple preconditioner. Finally, we validate our schemes with numerical experiments on the integrated services digital broadcasting-terrestrial system in doubly-selective channels and determine the normalized MSE and uncoded bit error rate.

Reinforcement learning (RL) is a flexible framework for learning a decision rule in an unknown environment. However, a large number of samples are often required for finding a useful decision rule. To mitigate this problem, the concept of transfer learning has been employed to utilize knowledge obtained from similar RL tasks. However, most approaches developed so far are useful only in low-dimensional settings. In this paper, we propose a novel transfer learning idea that targets problems with high-dimensional states. Our idea is to transfer knowledge between state factors (e.g., interacting objects) within a single RL task. This allows the agent to learn the system dynamics of the target RL task with fewer data samples. The effectiveness of the proposed method is demonstrated through experiments.

Linear Discriminant Analysis (LDA) is one of the most popular dimensionality reduction techniques in existing handwritten Chinese character (HCC) recognition systems. However, when used for unconstrained handwritten Chinese character recognition, the traditional LDA algorithm is prone to two problems, namely, the class separation problem and multimodal sample distributions. To deal with these problems,we propose a new locally linear discriminant analysis (LLDA) method for handwritten Chinese character recognition.Our algorithm operates as follows. (1) Using the clustering algorithm, find clusters for the samples of each class. (2) Find the nearest neighboring clusters from the remaining classes for each cluster of one class. Then, use the corresponding cluster means to compute the between-class scatter matrix in LDA while keeping the within-class scatter matrix unchanged. (3) Finally, apply feature vector normalization to further improve the class separation problem. A series of experiments on both the HCL2000 and CASIA Chinese character handwriting databases show that our method can effectively improve recognition performance, with a reduction in error rate of 28.7% (HCL2000) and 16.7% (CASIA) compared with the traditional LDA method.Our algorithm also outperforms DLA (Discriminative Locality Alignment,one of the representative manifold learning-based dimensionality reduction algorithms proposed recently). Large-set handwritten Chinese character recognition experiments also verified the effectiveness of our proposed approach.

In this paper, we constructed a class of low correlation zone sequence sets derived from the interleaved technique and DFT matrices. When p is a prime such that p > 3, p-ary LCZ sequence sets with parameters LCZ(pn-1,pm-1,(pn-1)/(pm-1),1) are constructed based on a DFT matrix with order pp, which is optimal with respect to the Tang-Fan-Matsufuji bound. When p is a prime such that p ≥ 2, pk-ary LCZ sequence sets with parameters LCZ(pn-1,pk-1,(pn-1)/(pk-1),1) are constructed based on a DFT matrix with order pkpk, which is also optimal. These sequence sets are useful in certain quasi-synchronous code-division mutiple access (QS-CDMA) communication systems.

In this letter, we present a general construction of sequence sets with low correlation zone, which is based on finite fields and the balance property of some functions. The construction is more flexible as far as the partition of parameters is concerned. A simple example is also given to interpret the construction.