A Time Hopping Pulse Spacing Modulation (TH-PSM) system, which combines the pulse position modulation system with code shift keying, is proposed. The following performances are analyzed; (1) data transmission rate, (2) error rate in a single-user case, (3) error rate in a multi-user case, and (4) spectral efficiency. Consequently, the data transmission rate of the proposed system is higher than that of the conventional Spread Spectrum Pulse Position Modulation (SS-PPM) system. The proposed system can improve the probability of block error by increasing the number of information bits per spreading code. Moreover, the spectral efficiency of the proposed system is higher than that of the conventional system. The proposed system is more attractive than the conventional SS-PPM system for optical communications, power-line communications, and UWB communications.
NK-Landscapes are stochastically generated fitness functions on bit strings, parameterized with N bits and K epistatic interactions between bits. The term epistasis describes nonlinearities in fitness functions due to changes in the values of interacting bits. Empirical studies have shown that the overall performance of random bit climbers on NK-Landscapes is superior to the performance of some simple and enhanced genetic algorithms (GAs). Analytical studies have also lead to suggest that NK-Landscapes may not be appropriate for testing the performance of GAs. In this work we study the effect of selection, drift, mutation, and recombination on NK-Landscapes for N = 96. We take a model of generational parallel varying mutation GA (GA-SRM) and switch on and off its major components to emphasize each of the four processes mentioned above. We observe that using an appropriate selection pressure and postponing drift make GAs quite robust on NK-Landscapes; different to previous studies, even simple GAs with these two features perform better than a random bit climber (RBC+) for a broad range of classes of problems (K 4). We also observe that the interaction of parallel varying mutation with crossover improves further the reliability of the GA, especially for 12 < K < 32. Contrary to intuition, we find that for small K a mutation only evolutionary algorithm (EA) is very effective and crossover may be omitted; but the relative importance of crossover interacting with varying mutation increases with K performing better than mutation alone (K > 12). This work indicates that NK-Landscapes are useful for testing each one of the major processes involved in a GA and for assessing the overall behavior of a GA on complex non-linear problems. This study also gives valuable guidance to practitioners applying GAs to real world problems of how to configure the GA to achieve better results as the non-linearity and complexity of the problem increases.
Mostafa SOLIMAN Stanislav SEDUKHIN
Within a few years it will be possible to integrate a billion transistors on a single chip operating at frequency more than 10 GHz. At this integration level, we propose using a multi-level ISA to express fine-grain data parallelism to hardware instead of using a huge transistor budget to dynamically extract it. Since the fundamental data structures for a wide variety of data parallel applications are scalar, vector, and matrix, our proposed Trident processor extends a scalar ISA with vector and matrix instruction sets to effectively process matrix formulated applications. Like vector architectures, the Trident processor consists of a set of parallel lanes (each lane contains a set of vector pipelines and a slice of register file) combined with a fast scalar core. However, Trident processor can effectively process on the parallel lanes not only vector but also matrix data. One key point of our architecture is the local communication within and across lanes to overcome the limitations of the future VLSI technology. Another key point is the effective execution of a mixture of scalar, vector, and matrix operations. This paper describes the architecture of the Trident processor and evaluates its performance on BLAS and on the standard matrix bidiagonalization algorithm. The last one is evaluated as an example of an entire application based on a mixture of scalar, vector, and matrix operations. Our results show that many data parallel applications, such as scientific, engineering, multimedia, etc., can be speeded up on the Trident processor. Besides, the scalability of the Trident processor does not require more fetch, decode, or issue bandwidth, but requires only replication of parallel lanes.
Let us introduce n ( 2) nonlinear mappings fi (i = 1,2,,n) defined on complete linear metric spaces (Xi-1,ρ) (i = 1,2,,n), respectively, and let fi: Xi-1 Xi be completely continuous on bounded convex closed subsets Xi-1,(i = 1,2,,n 0), such that fi() . Moreover, let us introduce n fuzzy-set-valued nonlinear mappings Fi: Xi-1 Xi {a family of all non-empty closed compact fuzzy subsets of Xi}. Here, we have a fixed point theorem on the recurrent system of β-level fuzzy-set-valued mapping equations: xi Fiβ(xi-1,fi(xi-1)), (i = 1,2,,n 0), where the fuzzy set Fi is characterized by a membership function µFi(xi): Xi [0,1], and the β-level set Fiβ of the fuzzy set Fi is defined as Fiβ {ξi Xi | µFi(ξi) β}, for any constant β (0,1]. This theorem can be applied immediately to discussion for characteristics of ring nonlinear network systems disturbed by undesirable uncertain fluctuations and to fine estimation of available behaviors of those disturbed systems. In this paper, its mathematical situation and proof are discussed, in detail.
Kwan-Ho YOU Jiecai LUO Jee-Hyong LEE
It is shown that bounded impulse action can be combined with usual bang-bang control input to minimize the performance index. Especially for unstable oscillators, the size of controllable region can be increased. We present results on how to minimize the performance index using both ordinary bang-bang control and impulse actions with a recharge constraint on impulse firing. Following the maximum principle and necessary conditions induced from usual perturbation arguments, the mixed control input (bang-bang and impulse actions) is represented in adjoint state and then state variable feedback form. Simulation results show how the switch curves can be used to determine the optimal control value.
Koji EGUCHI Keizo OYAMA Emi ISHIDA Noriko KANDO Kazuko KURIYAMA
This paper proposes the evaluation methods for measuring retrieval effectiveness of Web search engine systems, attempting to make them suitable for real Web environment. With this objective, we constructed 100-gigabyte and 10-gigabyte document sets that were mainly gathered from the '.jp' domain, and conducted an evaluation workshop at the third NTCIR Workshop from 2001 to 2002, where we assessed the retrieval effectiveness of a certain number of Web search engine systems using the common data set. Conventional evaluation workshops assessed the relevance of the retrieved documents, which were submitted by the workshop participants, by considering the contents of individual pages. On the other hand, we assessed the relevance of the retrieved pages by considering the relationship between the pages referenced by hyperlinks.
Joonsung LEE Changheon OH Chungyong LEE Dae-Hee YOUN
A new beamforming method based on simplex downhill optimaization process has been presented for the reverse link CDMA systems. The proposed system performs code-filtering at each antenna for each user. The new beamforming method gives lower computations and faster convergence properties than existing algorithms. The simulation results show that the proposed algorithm has a better BER performance in the case of the time-varing channel.
In this paper, we consider the problem of estimating the time-varying directions-of-arrival (DOAs) of coherent narrowband cyclostationary signals impinging on a uniform linear array (ULA). By exploiting the cyclostationarity of most communication signals, we investigate a new computationally efficient subspace-based direction estimation method without eigendecomposition and spatial smoothing (SS) processes. The proposed method uses the inherently temporal property of incident signals and a subarray scheme to decorrelate the signal coherency and to suppress the noise and interfering signals, while the null subspace is obtained from the resulting cyclic correlation matrix through a linear operation. Then an on-line implementation of this method is presented for tracking the DOAs of slowly moving coherent signals. The proposed algorithm is computationally simple and has a good tracking performance. The effectiveness of the proposed method is verified through numerical examples.
Kazutaka SHIMADA Atsushi FUKUMOTO Tsutomu ENDO
This paper proposes a method to integrate computer specifications retrieved from multiple Web sites, to extract characteristic-data of each computer based on integrated information, and to present products suitable for a user's request. The specifications written in HTML are converted into normal forms called table structure. The quantitative attributes such as speed, capacity and dimensions are extracted by comparing them with the mean or mode of all sample data, and the qualitative ones such as kind of processor and graphics chip are extracted using knowledge provided manually. The recommended products are dynamically determined from the extracted data by a user's request and relevance feedback. Experimental results show the effectiveness of our method.
Youji FUKUTA Yoshiaki SHIRAISHI Masakatu MORII
A nonlinear combiner random number generator is a general keystream generator for certain stream ciphers. The generator is composed of several linear feedback shift registers and a nonlinear function; the output is used as a keystream. A fast correlation attack is a typical attack for such keystream generators. Mihaljevi, Fossorier, and Imai have proposed an improved fast correlation attack. The attack is based on error correction of information bits only in the corresponding binary linear block code; APP threshold decoding is employed for the error correction procedure. In this letter, we propose a method which improves the success rate of their attacks with similar complexity. The method adds some intentional error to original parity check equations. Those equations are then used in APP threshold decoding.
Salvador SALES Jose CAPMANY Beatriz ORTEGA Daniel PASTOR
Efficient mixing of microwave signals is an important issue for new radio over fiber telecommunications systems. In this paper, we propose a novel device based on two cascaded semiconductor optical amplifiers working in a non-linear regime and a loss section in between Results show potential performance improvement as compared to other technological approaches for photonic microwave mixers.
Akio KATO Tomotaka NAGAOSA Kazuo MORI Hideo KOBAYASHI
The CDMA/NC-PRMA protocol has been proposed to deal with multimedia traffic flexibly in mobile communications systems. The Load-Balancing (LB) method has been investigated for information slot assignment in CDMA/NC-PRMA systems. However, the LB method may be not effective in multi-cell environments due to inter-cell interference although this method is effective for single cell environments. In this paper, we propose new information slot assignment methods for multi-cell environments; a total reception power based assignment method and a signal to interference ratio (SIR) based assignment method. The former one assigns information slots based on the total reception power from both inside and outside the cell for each slot in the previous frame. The latter one predicts the SIR of receiving packets and assigns information slots to MSs only when predicted SIR exceeds the target SIR. The results of computer simulation show that the proposed schemes have superior transmission performance to the conventional scheme.
Hiroyuki KAWAI Shinzo OHKUBO Toru OTSU Hirohito SUDA Yasushi YAMAO
A novel interference reduction method, transmit power and window control (TPWC), is proposed to enhance the system capacity in the downlink of code division multiple access (CDMA) cellular packet systems. TPWC measures the propagation conditions and calculates the required instantaneous transmit power between a base station (BS) and a mobile station (MS). Then, TPWC sends packets only during a transmit time-window, in which the packets can be sent with less power than a predetermined threshold. TPWC reduces the average transmit power at the cost of an extra transmission delay at the BS. Computer simulations show that TPWC enhances the system capacity by two-fold in a CDMA cellular packet system when each MS has a loading ratio of 0.5 and an average delay allowance of 5 ms for the unit packet length of 1 ms. Furthermore, this paper proposes a multi-link packet transmission (MLPT) scheme in order to reduce the delay caused by TPWC. When an MS is at the cell edge, packets are distributed by MLPT to multiple BSs, from which packets are sent to the MS; thus, the transmission delay can be reduced by utilizing the transmit windows of each BS.
European research Framework Programs and in particular their impact on international standardization for the development of third generation mobile communication systems are reviewed, which are currently being deployed. In 2002 the European Commission launched the 6th Framework Program. In parallel, research on systems beyond third generation started already. Therefore, international organizations such as the Wireless World Research Forum (WWRF) were established. WWRF and other international activities are presented. The vision of the Wireless World is developed from the user perspective, where already a high degree of international harmonization was achieved. The building blocks of the Wireless World and the resulting necessary major research areas are summarized. Future research projects on systems beyond third generation will focus on these topics. Global cooperation will be an important prerequisite to achieve harmonized future standards. Therefore, the 6th Framework Program of the European Commission will provide an important platform for international cooperation. The 6th Framework Program is described in detail.
Xuan Nam TRAN Tetsuki TANIGUCHI Yoshio KARASAWA
A novel scheme of subband adaptive array for multicode Direct Sequence Code Division Multiple Access (DS-CDMA) is proposed in this paper. The proposed scheme has a flexible configuration which allows basestation to be able to dynamically adapt to multirate transmission requests from subscribers. It is shown that the novel scheme can effectively suppress multiple access interferences (MAI) by appropriately forming main beam toward the desired user while pointing beampattern nulls toward MAI sources. Moreover, the combination of the subband adaptive array with the so-called cyclic prefix spreading code CDMA is also proposed to mitigate multipath fading and maximize diversity gain in multipath fading environment.
Christina LIM Ampalavanapillai NIRMALATHAS Dalma NOVAK Rodney WATERHOUSE
We investigate the capacity limitations of a WDM ring fiber-radio backbone incorporating wavelength interleaving where each base station drives a sectorized antenna interface. We also investigate the issues related to the merging of such networks with standard WDM infrastructures. The investigations show that re-allocating the interleaved WDM channels to fit within a 100 GHz block enables the millimeter-wave (mm-wave) fiber-radio system with sectorized antenna interfaces to integrate easily with WDM systems. The performance of a variety of channel allocations for the merged fiber-radio network is examined and simulation studies of the transmission of multiple channels are carried out. The overall network capacity of the merged mm-wave fiber-radio network is improved with the proposed channel allocation schemes.
Pham Manh LAM Keattisak SRIPIMANWAT
The use of concatenated codes in non-coherent synchronous optical fiber CDMA networks is proposed. The concatenated code sequences are generated using Walsh code sequences and balanced Walsh code sequences, which are selected from Walsh code sequences. The selection of balanced Walsh code sequences is presented and the design of fully programmable electro-optical transmitter and receiver is reported. In the proposed network, sequence-inversion keying of intensity modulated unipolar concatenated code sequences is employed at the transmitter and unipolar-bipolar correlation is implemented at the receiver. The analysis of the system BER performance is presented and it is proved that multiple-access interference is completely eliminated. It is also shown that the BER performance of the proposed system is better than that of non-coherent synchronous optical fiber CDMA system using optical orthogonal codes with double hard-limiters.
Nam-Chul HUH Byeong Man KIM Jong Wan KIM Seung Ryul MAENG
Many fuzzy traffic controllers adjust the extension time of the green phase with the fuzzy input variables, arrival and queue. However, in our experiments, we found that the two input variables are not sufficient for an intersection where traffic flow rates change and thus, in this paper, traffic volume is used as an additional variable. Traffic volume is defined as the number of vehicles entering an intersection every second. In designing a fuzzy traffic controller, an ad-hoc approach is usually used to find membership functions and fuzzy control rules showing good performance. That is, initial ones are generated by human operators and modified many times based on the results of simulation. To partially overcome the limitations of the ad-hoc approach, we use genetic algorithms to automatically determine the membership functions for terms of each fuzzy variable when fuzzy control rules are given by hand. The experimental results indicate that a fuzzy logic controller with volume variable outperforms conventional ones with no volume variable in terms of the average delay and the average velocity. Also, the controller shows better performance when membership functions generated by a genetic algorithms instead of ones generated by hand are used.
Zhang-Jian LI Shin-ichi NAKANO
A "rooted" plane triangulation is a plane triangulation with one designated vertex r and one designated edge incident to r on the outer face. In this paper we give a simple algorithm to generate all connected rooted plane triangulations with at most m edges. The algorithm uses O(m) space and generates such triangulations in O(1) time per triangulation without duplications. The algorithm does not output entire triangulations but the difference from the previous triangulation. By modifying the algorithm we can generate all connected (non-rooted) plane triangulations with at most m edges in O(m3) time per triangulation.
Tae-il CHAE Hark YOO Seong-sik MIN Yong-hyub WON
The autocorrelation peak reduction due to wavelength mismatches between an encoder and a decoder in wavelength hopping-time spreading (WH-TS) two-dimensional optical CDMA systems is analyzed and verified by experiments. The tolerance of the wavelength mismatch is then obtained through the analysis of the system bit error rate (BER) performance. The results show that no significant BER performance is degraded only by the wavelength mismatches less than 0.1 nm which corresponds to 25 percent of the typical fiber Bragg gratings' spectral width.