The application of neural networks to the state-feedback guaranteed cost control problem of discrete-time system that has uncertainty in both state and input matrices is investigated. Based on the Linear Matrix Inequality (LMI) design, a class of a state feedback controller is newly established, and sufficient conditions for the existence of guaranteed cost controller are derived. The novel contribution is that the neurocontroller is substituted for the additive gain perturbations. It is newly shown that although the neurocontroller is included in the discrete-time uncertain system, the robust stability for the closed-loop system and the reduction of the cost are attained.

Taking the uplink and downlink cochannel interference and noise into account, we determine the error probability in detecting a binary phase-shift keying (BPSK) signal transmitted over a satellite system containing two high power amplifiers (HPA). The first one is the constituent part of the transmitting ground station and the second one is the constituent part of the satellite station. The emphasis is placed on determining the system performance degradation imposed by the influence of the nonlinear characteristic of the HPA at the transmitting ground station in combination with the negative influences of the uplink and downlink cochannel interference, as well as the nonlinear characteristic of HPA at the satellite station.

This paper introduces 12 channel reservation techniques for medium access control (MAC) protocols suitable for high bit-rate wireless communication systems. The first 7 algorithms, namely CFP, CAP, COP, COP+SPL, CFP+SPL, UNI and UNI+LA, are applicable to systems with single-access chance per frame, whereas the other 5 algorithms, namely MT-CFP, MT-CFP+SPL, MT-UNI, MT-UNI+LUA and MT-UNI+LUT are suitable for systems with multi-access attempts per frame. The performance of these techniques are analytically evaluated and compared with the existing known techniques. The analytical model derived here are also validated through Monte Carlo computer simulations. Numerical results show that all proposed techniques are in general more superior to conventional reservation techniques. Finally when comparing between all proposed schemes in terms of both throughput performance and practical feasibility it is found that the MT-UNI+LA scheme are relatively efficient and suitable for practical applications.

The main contribution of this work is to present several hardware implementations of an "n choose k" counter (C(n,k) counter for short), which lists all n-bit numbers with (n-k) 0's and k 1's, and to show their applications. We first present concepts of C(n,k) counters and their efficient implementations on an FPGA. We then go on to evaluate their performance in terms of the number of used slices and the clock frequency for the Xilinx VirtexII family FPGA XC2V3000-4. As one of the real life applications, we use a C(n,k) counter to accelerate a digital halftoning method that generates a binary image reproducing an original gray-scale image. This method repeatedly replaces an image pattern in small square regions of a binary image by the best one. By the partial exhaustive search using a C(n,k) counter we succeeded in accelerating the task of finding the best image pattern and achieved a speedup factor of more than 2.5 over the simple exhaustive search.

Recent microprocessors have included SIMD (single instruction multiple data) extensions into their instruction set architecture to improve the performance of multimedia applications. SIMD instructions speed up the execution of programs but pose lots of challenges to software developers. An efficient matrix-based splitter (or merger), which can split an N N 2-D DCT block into four N/2 N/2 or two N N/2 (or N/2 N) 2-D DCT blocks (or merger small size blocks into a large size one), specialized for SIMD architectures is presented in this paper. The programming-level complexity of the proposed methods is lower than that of the direct approach. Furthermore, even without using SIMD instructions, the algorithmic-level complexity of the proposed DCT splitter/merger is still lower than that of the direct one and is the same as that of the most efficient approach existed in the literature. When N = 8, our method can be applied to act as a transcoder between the latest video coding standards AVC/H.264 and the older ones, such as MPEG-1, MPEG-2 and MPEG-4 part 2. We also provide the image quality tests to show the performance of the proposed 2-D DCT splitter and merger.

Our goal in this paper is to provide a complete detection analysis for the OS processor along with OSGO and OSSO modified versions, for M postdetection integrated pulses when the operating environment is nonideal. Analytical results of performance are presented in both multiple-target situations and in regions of clutter power transitions. The primary and the secondary interfering targets are assumed to be fluctuating in accordance with the Swerling II target fluctuation model. As the number of noncoherently integrated pulses increases, lower threshold values and consequently better detection performances are obtained in both homogeneous and multiple target background models. However, the false alarm rate performance of OSSO-CFAR scheme at clutter edges is worsen with increasing the postdetection integrated pulses. As predicted, the OSGO-CFAR detector accommodates the presence of spurious targets in the reference window, given that their number is within its allowable range in each local window, and controls the rate of false alarm when the contents of the reference cells have clutter boundaries. The OSSO-CFAR scheme is useful in the situation where there is a cluster of radar targets amongst the estimation cells.

The technological development of wireless environment has made real-time multimedia communications possible in wireless networks. Many studies have been done on real-time communications in wireless networks in order to overcome a higher bit error rate in wireless channels. However, none of work deals with firm real-time communications which can be applied to multimedia communications. In this paper, we propose an adaptive error correcting scheme for firm real-time multimedia communications in wireless networks in order to maximize the expected net profit. The proposed scheme adaptively selects an error correcting code under the current air state and the message state of a message stream. Throughout simulation results, we show that the suggested scheme provides more profit than single error-correcting code schemes.

Future wireless/mobile system is expected to have heterogeneous wireless overlay networks for ubiquitous multimedia communication. In a such network environment, mobile users are likely to try to get attached to higher bandwidth network as bandwidth-hungry multimedia applications are increasing. However, the users have to perform vertical handoff to lower bandwidth network, as high bandwidth network become unavailable due to various reasons (such as its limited coverage, network congestion, etc.). In this paper, we discuss the problem of vertical handoff from a user's perspective. For this purpose, we formulate user satisfaction as a function of bandwidth utility and handoff latency. Then, we investigate the effect of call holding time, user movement probability, etc. on the satisfaction that a user derives from the use of network service for multimedia applications. In addition, based on the evaluation, we present an algorithm for selecting a wireless network, which maximizes the effective user satisfaction.

The shared time division multiplexing (shared-TDD) scheme has been proposed to accommodate asymmetric communications between uplink and downlink. The accommodation of connection-less services in Shared-TDD systems causes a difficulty of TDD boundary control. This paper proposes a TDD boundary control (resource assignment) scheme, which can optimize a position of the TDD boundary based on the ratio of uplink to downlink traffic in code division multiple access (CDMA)/shared-TDD systems with connection-less services. The proposed scheme controls the TDD boundary based on the estimated uplink and downlink traffic. Computer simulations show that the proposed scheme effectively controls the radio resource, and thus improves total system throughput performance.

Future broadband mobile communication systems are necessary to achieve the bit rates of 100 Mbit/s. Orthogonal Frequency Division Multiplexing (OFDM) transmission is an attractive technology because it can remove the influence of frequency selective fading in broadband transmission by adding a suitable guard interval to each OFDM symbol. However, peak-to-average power ratio (PAPR) is very large in OFDM transmission. In this paper, we propose a new PAPR reduction method which can be applied even when unusable bands are inside the system band. In the proposed method, peak reduction signals are generated by iterative signal processing only in the usable frequency band, and filtering to remove out-of-band components of the peak reduction signals is incorporated into the iterative signal processing. The results of computer simulation show that the proposed method can effectively reduce peak power without expanding the spectrum both outside the system band and into unusable bands inside the system band. By using the proposed method, the broadband mobile communication system with low peak power and high flexibility of frequency band use can be realized.

A method is proposed to compute moments of distributed coupled RLC interconnects. Both uniform line models and non-uniform line models will be developed. Considering both self inductances and mutual inductances in multi-conductors, recursive moment computations formulae of lumped coupled RLC interconnects are extended to those of distributed coupled RLC interconnects. By using the moment computation technique in conjunction with the projection-based order reduction method, the inductive crosstalk noise waveform can be accurately and efficiently estimated. Fundamental developments of the proposed approach will be described. Simulation results demonstrate the improved accuracy of the proposed method over the traditional lumped methods.

Data accessed by many sites are replicated in distributed environments for performance and availability. In this paper, replication schemes are examined in parallel image convolution processing. This paper presents a system architecture that we have developed with CORBA (Common Object Request Broker Architecture) for the processing. Employing CORBA enables us to make use of a cluster of workstations, each of which has a different level of computing power. The paper also describes a parallel and distributed image convolution processing model using replicas stored in a network of workstations, and reports some experimental results showing that our analytical model can agree with practical situations.

Recently, efficient algorithms have been proposed for finding all characteristic curves of one-port piecewise-linear resistive circuits. Using these algorithms, a middle scale one-port circuit can be represented by a piecewise-linear resistor that is neither voltage nor current controlled. In this letter, an efficient algorithm is proposed for finding all dc operating points of piecewise-linear circuits containing such neither voltage nor current controlled resistors.

This paper proposed the advantages of using a 2D/3D hybrid imagery system over the use of 3D by itself. A hybrid imagery system was created by projecting a 3D (stereo) image in between and overlapping onto two adjacent 2D images. The negative effect where 2D and 3D images overlap was studied and resolved. Then sensations subject experienced from the visual cues under the different conditions were attained. Participant's sensations while looking at the different forms of imagery on both a flat screen and a flat/inclined screen combination were then attained. The data for the 2D/3D hybrid system were compared with that attained for a 3D image system on its own (without 2D images). Results indicate that there are benefits to using a 2D/3D hybrid system over 3D by itself.

The Internet has become an important medium for effective marketing and efficient operations for many institutions. Visitors of a particular web site leave behind valuable information on their preferences, requirements, and demands regarding the offered products and/or services. Understanding these requirements online, i.e., during a particular visit, is both a difficult technical challenge and a tremendous business opportunity. Web sites that can provide effective online navigation suggestions to their visitors can exploit the potential inherent in the data such visits generate every day. However, identifying, collecting, and maintaining the necessary knowledge that navigation suggestions are based on is far from trivial. We propose a methodology for acquiring and maintaining this knowledge efficiently using data mart and web mining technology. Its effectiveness has been shown in an application for a bank's web site.

When an application code is downloaded from an unknown server to the mobile device, it is important to authenticate the code. Usually, code execution is overlapped with downloading to reduce transfer/invocation delay. In this letter, we present an efficient code authentication scheme that permits overlapping of execution and downloading when the sequence of code execution is determined during the execution time. The proposed scheme is based on authentication trees. Compared with the tree chaining scheme, the proposed scheme has lower communication overhead and shorter average verification delay. Also, the computation cost of the proposed scheme on the receiver is much smaller than that of the tree chaining scheme.

The history of forward error correction in optical communications is reviewed. The various types of FEC are classified as belonging to three generations. The first generation FEC represents the first to be successful in submarine systems, when the use of RS(255, 239) became widespread as ITU-T G.975, and also as G.709 for terrestrial systems. As WDM systems matured, a quest began for a stronger second generation FEC. Several types of concatenated code were proposed for this, and were installed in commercial systems. The advent of third-generation FEC opened up new vistas for the next generation of optical communication systems. Thanks to soft decision decoding and block turbo codes, a net coding gain of 10.1 dB has been demonstrated experimentally. That brought us a number of positive impacts on existing systems. Each new generation of FEC was compared in terms of the ultimate coding gain. The Shannon limit was discussed for hard or soft decision decoding. Several functionalities employing the FEC framing were introduced, such as overall wrapping by the FEC frame enabling the asynchronous multiplexing of different clients' data. Fast polarization scrambling with FEC was effective in mitigating polarization mode dispersion, and the error monitor function proved useful for the adaptive equalization of both chromatic dispersion and PMD.

We present and demonstrate a novel method of generating a π phase-alternated return-to-zero (RZ) signal together with pulse-amplitude equalization in a rational harmonic mode-locked fiber ring laser, by using a dual-drive Mach-Zehnder modulator. By adjusting the voltages applied to both arms of the modulator, amplitude-equalization and π phase shift can be achieved successfully at a 9.95 GHz repetition rate. The generated alternate-phase RZ signals show enhanced transmission performance in the single-mode fiber (SMF) links without dispersion compensation.

Modulator output and fiber transmission characteristics of optical single sideband (SSB) modulations are analyzed under the assumption that SSB modulators are constructed using Mach-Zehnder (MZ) interferometers. The fiber input signal and the detected signal are derived theoretically for SSB modulation with and without an optical carrier. Optical SSB fiber transmission simulations show that the received signal waveform is degraded by harmonic components due to non-linear switching curve of MZ interferometer as a component of SSB modulators even if the Hilbert transformers is ideal for the definition. The optical SSB suppressed carrier is preferred to the SSB with an optical carrier from a viewpoint of waveform degradation.

The playout delay for voice over IP applications is adjusted on every talkspurt. The parameter β that controls the delay/packet loss ratio is usually fixed, based on high jitter conditions. In this letter, a β-adaptive playout algorithm is presented, where the β is adjusted. The buffering delays and lateness rates are compared against the existing algorithm with the fixed β. We show that the β-adaptive system improves the lateness loss performance, especially for low jitter conditions, while maintaining almost identical buffering delay/lateness loss performance when jitter is high.