The issue of scalable Differentiated Services (DiffServ) admission control now is still an open research problem. We propose a new admission control model that can not only provide coarse grain Quality of Services (QoS), but also guarantee end-to-end QoS for assured service without per-flow state management at core routers within DiffServ domain. Associated with flow aggregation model, a hybrid signaling protocol is proposed to select the route satisfying the end-to-end QoS requirements. Simulation result shows that the proposed model can accurately manage resource, leading to much better performance when compared to other schemes.

This paper proposes an inter-symbol interference (ISI) suppression scheme using only the even-numbered sub-carriers for the fixed-rate OFDM systems with the 2-dimensional modulation. The proposed scheme is based on the principle that the first half of the waveform in the time domain is the same as the second half when an OFDM symbol is composed of only the even-numbered sub-carriers. The feature of the proposed scheme is that, in the case of the maximum multipath delay beyond the duration of the guard interval, the OFDM symbol with only the even-numbered sub-carriers is transmitted in order to generate the extended virtual guard interval and that the high-level modulation with the sub-carrier power enhancement is applied to achieve the constant data rate. In addition, at the receiver, only the second half of the OFDM symbol is used for the FFT processing to avoid the ISI. Moreover, the condition of the maximum multipath delay is notified to the transmitter by using the feedback channel. Numerical results given by computer simulation showed that the proposed scheme provides far better bit error rate (BER) performance than the traditional OFDM transmission using all sub-carriers under the multipath delay beyond the duration of the guard interval.

Classical studies of Asynchronous Transfer Mode (ATM) switching elements and in particular the buffer behavior of the Shared Buffer Memory (SBM), assume that all read and write operations of cells to, respectively from, the SBM are executed simultaneously. However, in a real switching element, the inlets (outlets) are scanned sequentially for arriving (departing) cells during the so-called input (output) cycle. Furthermore, the input and output cycles are intermingled, each read operation being followed by a write operation. This is referred to as the Timeslot Interchange Mechanism (TIM). In this paper, we present the analysis of a queueing model that includes the TIM. We model the cell arrival processes on the inlets of the switching element as independent Bernoulli arrival processes. Moreover, we assume that cells are routed from the inlets to the outlets of the switching element according to an independent and uniform process, i.e., the destinations of consecutive cell arrivals on any given inlet are independent and for a given cell all destinations are equiprobable. Under these assumptions, we will derive expressions for the probability generating functions of the queue length in an individual routing group (a logical queue that contains all cells scheduled for the same destination), the (total) queue length in the SBM, and the cell waiting time. From these results, expressions for the mean values and the tail distributions of these quantities are calculated, and the influence of the TIM on the buffer behavior is studied through comparison with a model where all read and write operations occur simultaneously.

The classification time required by conventional multi-class SVMs greatly increases as the number of pattern classes increases. This is due to the fact that the needed set of binary class SVMs gets quite large. In this paper, we propose a method to reduce the number of classes by using nearest neighbor rule (NNR) in the principle component analysis and linear discriminant analysis (PCA+LDA) feature subspace. The proposed method reduces the number of face classes by selecting a few classes closest to the test data projected in the PCA+LDA feature subspace. Results of experiment show that our proposed method has a lower error rate than nearest neighbor classification (NNC) method. Though our error rate is comparable to the conventional multi-class SVMs, the classification process of our method is much faster.

In order to benefit from the advantages of soft handoff (SHO), it is important that the SHO parameters (the SHO thresholds; T_ADD and T_DROP are well assigned. T_ADD is the threshold used for triggering a pilot with high strength to be added to the Active Set (AS) list. The AS means the pilots associated with the forward traffic channels assigned to mobile station. In contrast, T_DROP is the threshold used for triggering a pilot with low strength to be dropped from the AS list. This paper analyzes the effects of varying SHO thresholds in a cellular code division multiple access (CDMA) system on the blocking probability based on traffic load and geometrical distances in hexagonal layout of base stations (BSs). In addition, the previously proposed traffic load equation is applied to the proposed SHO model for balancing the numbers of new and handoff calls on the forward link capacity in case of uniform traffic load. The results show that the blocking probability is more sensitive to T_DROP than to T_ADD variations.

In this paper, the space time transmit diversity (STTD) decoding combined with minimum mean square error (MMSE) equalization is presented for MC-CDMA downlink and uplink in the presence of multiple receive antennas. The equalization weights that minimize the MSE for each subcarrier are derived. From computer simulation, it was found that the BER performance of STTD decoding combined with MMSE equalization and Mr-antenna diversity reception using the weights derived in this paper provides the same diversity order as 2Mr-antenna receive diversity with MMSE equalization but with 3 dB performance penalty and is always better than that with no diversity. The uplink BER performance can also be improved with STTD, but the error floor still exists. However, with 2-receive antennas in addition to 2-antenna STTD, the BER floor can be reduced to around 10-5 even for the uplink.

We developed a compact, 16-channel integrated optical subscriber module for one-fiber bi-directional optical access systems. They can support more subscribers in a limited mounting space. For ultimate compactness, we created 8-channel integrated super-compact optical modules, 4-channel integrated limiting amplifiers, and 4-channel integrated LD drivers for Fast Ethernet. We introduce a new simulation method to analyze the electrical crosstalk that degrades sensitivity of the optical module. A new IC architecture is applied to reduce electrical crosstalk. We manufactured the optical subscriber module with these optical modules and ICs. Experiments confirm that the module offers a sensitivity of -27.3 dBm under 16-channel 125 Mbit/s simultaneous operation.

It is a critical design process to estimate the fractional errors of the Synthetic Aperture Radar (SAR) processor before implementation. The contribution of this paper is to identify the chief sources and types and to suggest an estimation technique for overall fractional errors of the space-based SAR processor using Range-Doppler Algorithm (RDA). Also, simulation is performed to the Experimental-SAR (E-SAR) processor to examine the practicability and efficiency of the technique, the results are discussed, and the solutions for problems are recommended. Therefore, this technique can be used to estimate the fractional errors of the space-based SAR processor using RDA.

Flexible Resource Allocation (FRA) strategies selectively control the transmission rates of users allowing them to specify maximum and minimum bandwidth requirements for the service type requested ensuring a minimum quality of service (QoS) is met. Complete, Partial, and Non Resource Sharing are the three types of resource sharing policies that can be used in systems with integrated services (voice, video and data) with different QoS and elasticities requirements. In this paper, an FRA strategy with Partial Resource Sharing, called Primary Unavailable Secondary Minimum (PUSMin), is presented. An analytical method is developed to assess its performance in an environment where several service types (with different bandwidth and elasticities requirements) exist. Results show that PUSMin decreases the resource reassignment rate as the offered traffic increases. This decreases the signalling overhead and computational complexity in the Base Station Controller (BSC) or Base Transceiver Station (BTS).

In this letter we verify that a blind adaptive algorithm operating at a low intermediate frequency (Low-IF) can be applied to a system where carrier phase synchronization has not been achieved. We consider a quadrature amplitude shift keyed (QPSK) signal as the transmitted signal, and assume that the orthogonal low intermediate sinusoidal frequency used to generate the transmitted signal is well known. The proposed algorithm combines two algorithms: Namely, the least mean square (LMS) algorithm which has a cost function with unique minimum, and the constant modulus algorithm (CMA), which was first proposed by Godard. By doing this and operating the equalizer at a rate greater than the symbol rate, we take advantage of the variable amplitude of the sub-carriers and the fast convergence of LMS algorithm, so as to achieve a faster convergence speed. When the computer simulation results of the proposed algorithm are compared with the constant modulus algorithm (CMA) and the modified CMA (MCMA), we observed that the proposed algorithm exhibited a faster convergence speed.

The paper presents a novel stroke decomposition approach based on a directional filtering technique for recognizing Chinese characters. The proposed filtering technique uses a set of the second-order Gaussian derivative (SOGD) filters to decompose a character into a number of stroke segments. Moreover, a new Gaussian function is proposed to overcome the general limitation in extracting stroke segments along some fixed and given orientations. The Gaussian function is designed to model the relationship between the orientation and power response of the stroke segment in the filter output. Then, an optimal orientation of the stroke segment can be estimated by finding the maximal power response of the stroke segment. Finally, the effects of decomposition process are analyzed using some simple structural and statistical features extracted from the stroke segments. Experimental results indicate that the proposed SOGD filtering-based approach is very efficient to decompose noisy and degraded character images into a number of stroke segments along an arbitrary orientation. Furthermore, the recognition performance from the application of decomposition process can be improved about 17.31% in test character set.

In this paper, performance of chaos and burst noises injected to the Hopfield Neural Network for quadratic assignment problems is investigated. For the evaluation of the noises, two methods to appreciate finding a lot of nearly optimal solutions are proposed. By computer simulations, it is confirmed that the burst noise generated by the Gilbert model with a laminar part and a burst part achieved the good performance as the intermittency chaos noise near the three-periodic window.

Two simple frequency offset estimators based on projection approaches for multicarrier code-division multiple access systems are proposed, without using specific training sequences. It is not only can estimate and correct frequency offset, but also has less computational load. Several computer simulations are provided for illustrating the effectiveness of the blind estimate approaches.

Lasers have been established as a unique nanoprocessing tool due to its intrinsic three-dimensional (3D) fabrication capability and the excellent compatibility to various functional materials. Here we report two methods that have been proved particularly promising for tailoring 3D photonic crystals (PhCs): pinpoint writing via two-photon photopolymerization and multibeam interferential patterning. In the two-photon fabrication, a finely quantified pixel writing scheme and a method of pre-compensation to the shrinkage induced by polymerization enable high-reproducibility and high-fidelity prototyping; well-defined diamond-lattice PhCs prove the arbitrary 3D processing capability of the two-photon technology. In the interference patterning method, we proposed and utilized a two-step exposure approach, which not only increases the number of achievable lattice types, but also expands the freedom in tuning lattice constant.

In future mobile networks, new technologies will be needed to enable a mobile host to move across heterogeneous wireless access networks without disruption of the connection. In the past, many researchers have studied handover in such IP networks. In almost all cases, special network devices are needed to maintain the host's mobility. Moreover, a host cannot move across heterogeneous wireless access networks without degradation of the goodput for real-time communication, although a mobile host with multiple network interfaces can connect to multiple wireless access networks. For these reasons, we consider that a mobile host needs to manage seamless handover on an end-to-end basis. In this paper, we propose a multi-path transmission algorithm for end-to-end seamless handover. The main purpose of this algorithm is to improve the goodput during handover by sending the same packets along multiple paths, minimizing unnecessary consumption of network resources. We evaluate our algorithm through simulations and show that a mobile host gains a better goodput.

The IP routing lookup problem is equivalent to finding the longest prefix of a packet's destination address in a routing table. It is a challenging problem to design a high performance IP routing lookup architecture, because of increasing traffic, higher link speed, frequent updates and increasing routing table size. At first, increasing traffic and higher link speed require that the IP routing can be executed at wire speed. Secondly, frequent routing table updates require that the insertion and deletion operations should be simple and low delay. At last, increasing routing table size hopes that less memory is used in order to reduce cost. Although many schemes to achieve fast lookup exist, less attention is paid on the latter two factors. This paper proposed a novel pipelined IP routing lookup architecture using selective binary search on hash table organized by prefix lengths. The evaluation results show that it can perform IP lookup operations at a maximum rate of one lookup per cycle. The hash operation ratio for one lookup can be reduced to about 1%, less than two hash operations are needed for one table update and only 512 kbytes SRAM is needed for a routing table with about 43000 prefixes. It proves to have higher performance than the existing schemes.

This paper provides a review on the optimal design of photonic bandgap structures by inverse problem techniques. An overview of inverse problems techniques is given, with a special focus on topology design methods. A review of first applications of inverse problems techniques to photonic bandgap structures and waveguides is given, as well as some model problems, which provide a deeper insight into the structure of the optimal design problems.

This paper deals with the statistical modeling of a Time-Frequency Series of Speech (TFSS), obtained by Short-Time Fourier Transform (STFT) analysis of the speech signal picked up by a linear microphone array with two elements. We have attempted to find closer match between the distribution of the TFSS and theoretical distributions like Laplacian Distribution (LD), Gaussian Distribution (GD) and Generalized Gaussian Distribution (GGD) with parameters estimated from the TFSS data. It has been found that GGD provides the best models for real part, imaginary part and polar magnitudes of the time-series of the spectral components. The distribution of the polar magnitude is closer to LD than that of the real and imaginary parts. The distributions of the real and imaginary parts of TFSS correspond to strongly LD. The phase of the TFSS has been found uniformly distributed. The use of GGD based model as PDF in the fixed-point Frequency Domain Independent Component Analysis (FDICA) provides better separation performance and improves convergence speed significantly.

The descriptional complexity of iterative arrays (IAs) is studied. Iterative arrays are a parallel computational model with a sequential processing of the input. It is shown that IAs when compared to deterministic finite automata or pushdown automata may provide savings in size which are not bounded by any recursive function, so-called non-recursive trade-offs. Additional non-recursive trade-offs are proven to exist between IAs working in linear time and IAs working in real time. Furthermore, the descriptional complexity of IAs is compared with cellular automata (CAs) and non-recursive trade-offs are proven between two restricted classes. Finally, it is shown that many decidability questions for IAs are undecidable and not semidecidable.

In this paper we study a classical firing squad synchronization problem on a model of fault-tolerant cellular automata that have possibly some defective cells. Several fault-tolerant time-efficient synchronization algorithms are developed based on a simple freezing-thawing technique. It is shown that, under some constraints on the distribution of defective cells, any cellular array of length n with p defective cell segments can be synchronized in 2n - 2 + p steps.