A high-attenuation waveguide filter using electromagnetic bandgap (EBG) substrates is introduced. With a simple design modification on the EBG covers, the waveguide filter produced an almost full Ku-band rejection bandwidth showing better than 20 dB input-to-output isolation from 12.3 to 17.2 GHz.

The DAPDNA®-2 is the world's first general purpose dynamically reconfigurable processor for commercial usage. It is a dual-core processor consisting of a custom RISC core called the Digital Application Processor (DAP), and a two dimensional array of dynamically reconfigurable processing elements referred to as the Distributed Network Architecture (DNA). The DAP has a 32 bit instruction set architecture with an 8 KB instruction cache and 8 KB data cache that can be accessed in one clock cycle. It has an interrupt control function to detect data processing completion in the DNA-Matrix. The DNA-Matrix has different types of data processing elements such as ALU, delay, and memory elements to process fully parallel computations. The DNA-Matrix includes 32 independent 16 KB high speed SRAM elements (in total 512 KB). The DNA-Matrix, even with its parallel computational capability, can be synchronized and co-work at the same clock frequency as the DAP. The processor operates at a 166 MHz working frequency and fabricated with a 0.11 µm CMOS process. The DAPDNA-2 device can be connected directly with up to 16 units with linear scalability in processing performance, provided the bandwidth requirement is within the maximum communication speed between DNAs, which is 32 Gbps. The DAPDNA-2 performs at a level that is two orders of magnitude higher than conventional high performance processors.

Subgraph isomorphism problems have various important applications, while generally being NP-complete. Though Ullmann and Konishi proposed the custom circuit designs to accelerate subgraph isomorphism problem, they require many hardware resources for large problems. This study describes the design of data-dependent circuits for subgraph isomorphism problem with evaluation results on an actual FPGA platform. Data-dependent circuits are logic circuits specialized in specific input data. Such circuits are smaller and faster than the original circuit, although it is not reusable and involves circuit generation for each input. In the present study, the circuits were implemented on Xilinx XC2V3000 FPGA, and they successfully operated at a clock frequency 25 MHz. In the case of graphs with 16 vertices, the average execution time is about 7.0% of the software executed on an up-to-date microprocessor (Athlon XP 2600+ of 2.1 GHz clock). Even if the circuit generation time is included, data-dependent circuits are about 14.4 times faster than the software (for random graphs with 16 vertices). This performance advantage becomes larger for larger graphs. Two algorithms (Ullmann's and Konishi's) were examined, and the data-dependent approach was found to be equally effective for both algorithms. We also examined two types of input graph sets, and found that the data-dependent approach shows advantage in both cases.

In this letter, Multicarrier Code Division Multiple Access (MC-CDMA) technique combined with Space Time Block Code (STBC) is analyzed in the case of two transmit antennas. A multicarrier transmit diversity scheme with antenna selection is proposed. The transmission power is allocated onto the antenna which has larger channel gain instead of the two antennas uniformly. Simulation results show that the new scheme has considerable performance gain compared to the Alamouti's scheme.

Software rejuvenation is a preventive and proactive solution that is particularly useful for counteracting the phenomenon of software aging. In this paper, we consider both the periodic and non-periodic software rejuvenation policies under different dependability measures. As is well known, the steady-state system availability is the probability that the software system is operating in the steady state and, at the same time, is often regarded as the mean up rate in the system operation period. We show that the mean up rate should be defined as the mean value of up rate, but not as the mean up time per mean operation time. We derive numerically the optimal software rejuvenation policies which maximize the steady-state system availability and the mean up rate, respectively, for each periodic or non-periodic model. Numerical examples show that the real mean up rate is always smaller than the system availability in the steady state and that the availability overestimates the ratio of operative time of the software system.

A scheme to evaluate the number of users and cell coverage of a WCDMA supporting multi-rate traffic is newly presented through calculation of the realizable Erlang capacity from a derived blocking probability and the path loss from the COST231 Walfisch-Ikegami (WI) model. Based on this analytical scheme, we evaluate the voice-data Erlang capacities at various data rates of 15 kbps to 480 kbps and the relationship between the cell coverage and the number of active users from them. When the value of Eb/Io is low from 4 dB to 3 dB under voice user capacity of 50 Erlang at 8 kbps, the result shows that the data user capacity is increased to 10 Erlang at low rate of 15 kbps and the cell coverage is enlarged to 100 m, and it is also shown that its capacity is increased to 0.2 Erlang at high rate of 480 kbps and its coverage to 50 m.

In the optimum design of AC contactors, it is necessary to analyze the dynamic behavior. Moreover, movable contacts and core bounce have remarkable effect on the lifetime of contactors. A set of differential equations describes the coupling of the electric circuit, electromagnetic field and mechanical system taking account into bounce and the influence of friction. With virtual prototyping technology, the dynamic behavior, especially for contacts bounce, has been investigated according to different electrical circuit parameters. Two approaches are introduced to solve electromagnetic parameters. Based on 3D finite element static nonlinear analysis, the flux linkage and electromagnetic force can be evaluated with different air gap and exciting current for larger gap. In addition, concerning to the shading coil for smaller gap, magnetic circuit can facilitate the calculation. The validity of the proposed method is confirmed by experiments.

We attempt to achieve corporative behavior of autonomous decentralized agents constructed via Q-Learning, which is a type of reinforcement learning. As such, in the present paper, we examine the piano mover's problem including a find-path problem. We propose a multi-agent architecture that has an external agent and internal agents. Internal agents are homogenous and can communicate with each other. The movement of the external agent depends on the composition of the actions of the internal agents. By learning how to move through the internal agents, avoidance of obstacles by the object is expected. We simulate the proposed method in a two-dimensional continuous world. Results obtained in the present investigation reveal the effectiveness of the proposed method.

In this paper, we will propose a robust watermarking system for digital audio sound to protect the copyright of publication and claim of ownership. The proposed watermarking scheme uses the frequency extent between 1 Hz and 20 Hz, which cannot be heard by the unaided human ear, to embed the watermark. Thus, the original audio quality will not be influenced by the watermark. Currently, the techniques of Perceptual Audio Coder contain MPEG-1, -2, -2.5, MPEG-2 AAC, MPEG-4 AAC and Window Media Audio. From experimental results, the proposed watermarking system can resist attacks of previous audio coders and low bit-rate compression. The watermark is extracted with 100% correction after previous encoder attacks. Furthermore, to authenticate the audio signal, the system can quickly extract the watermark without the knowledge of original audio signals.

In this letter, adaptive multi-stage parallel interference cancellation (PIC) receiver is considered for multi-rate DS-CDMA system. In each stage of the adaptive multi-stage PIC receiver, multiple access interference (MAI) estimates are obtained by the sub-bit estimates from the previous stage and the adaptive weights for the sub-bit estimates. The adaptive weights are obtained by minimizing the mean squared error between the received signal and its estimate through normalized least mean square (LMS) algorithm. It is shown that the adaptive multi-stage PIC receiver achieves smaller BER than the matched filter receiver, multi-stage PIC receiver, and multi-stage partial PIC receiver for the multi-rate DS-CDMA system in a Rayleigh fading channel.

A method of scrambling MPEG video by exchanging the motion vector (MV) in the MPEG bitstream is proposed. It deals directly with the MPEG bitstream and exclusive MPEG encoders are unnecessary. The size of the scrambled bitstream does not increase and image quality is maintained after descrambling. Moreover, the structure of the MPEG bitstream is maintained and can be decoded with a standard MPEG video decoder. We demonstrate the effectiveness of this method through simulation results that reveal unchanged image quality and size of bitstreams.

We have proposed a speculative selection function for adaptive routing, which uses idle cycles of the network physical links to exchange network information between nodes, thus helps to decide the best selection. Previous study on the mesh network showed that SSR gives message selection flexibility that improves network performance by balancing the network traffic in both global and local scopes. This paper evaluates the speculative selection function on 2D torus network with simulation. The simulation compares the network throughput and latency with various traffic patterns. The visualization graphs show how the speculative selection eliminates hotspots and disperses traffic in the global scope. The simulation results demonstrate that by using speculative selection, the network performance is increased by around 7%. Compared to the mesh network, the torus's version has smaller gain due to the high performance nature of the torus network.

In CC-NUMA multiprocessor systems, it is important to reduce the remote memory access time. Based upon the fact that increasing the size of the LRU second-level (L2) cache more than a certain value does not reduce the cache miss rate significantly, in this paper, we propose two split L2 caches to utilize the surplus of the L2 cache. The split L2 caches are composed of a traditional LRU cache and another cache to reduce the remote memory access time. Both work together to reduce total L2 cache miss time by keeping remote (or long-distance) blocks as well as recently used blocks. For another cache, we propose two alternatives: an L2-RVC (Level 2 - Remote Victim Cache) and an L2-DAVC (Level 2 - Distance-Aware Victim Cache). The proposed split L2 caches reduce total execution time by up to 27%. It is also found that the proposed split L2 caches outperform the traditional single LRU cache of double size.

Multiple-input multiple-output (MIMO) systems can improve the spectral efficiency of a wireless link, by transmitting several data streams simultaneously from different transmit antennas. However, at the receiver, multi-stream detection is needed for extracting the transmitted data streams from the received signals. This letter considers ordered successive detection (OSD) for multi-stream detection. OSD consists of several stages, and at each stage only one data stream is chosen to be detected among the remaining streams according to a specified ordering metric. OSD has been formulated using both the zero forcing (ZF) and minimum mean square error (MMSE) criteria. This letter clarifies the reason behind the superiority of OSD using the MMSE criterion to OSD using the ZF criterion through the investigation of the relation between their ordering metrics. For uncorrelated MIMO channels, we show that both ordering metrics yield the same performance for OSD using either ZF or MMSE criterion. Accordingly, the superiority of OSD using the MMSE criterion to OSD using the ZF criterion is clarified to be a direct result of the inherent superiority of MMSE nulling to ZF nulling, and to be independent of the ordering operation. Performance comparisons of OSD and maximum likelihood detection are also given for modulation schemes of different sizes.

A routing algorithm, utilizing two-hop relaying when necessary, is proposed to enhance the system capacity of code division multiple access (CDMA) cellular systems. Up to now, multihop relaying is applied to cellular systems mainly with the aim of decreasing the transmit power of each mobile station or extending the cell coverage area. Here, in this paper, potential benefit of multihop relaying is studied so as to increase the system capacity. A condition for the interference to be reduced by changing single-hop connections to two-hop connections is analyzed. In addition, a new route selection criterion maximizing the amount of interference reduction is proposed. Simulation results reveal that the proposed criterion is superior to the conventional criterion minimizing the total transmit power in respect of the amount of interference reduction. By using this criterion, an efficient routing algorithm for two-hop CDMA cellular systems is proposed to enhance the system capacity. Simulation results also indicate that by using the proposed routing algorithm in combination with a call admission control, the system capacity is increased even under heavy traffic conditions.

The market for IP convergence services is expanding rapidly due to the rising number of Internet users. To respond to market trends, service systems must provide services quickly. This paper discusses that application server called the service agent which provides IP convergence services. The service agent meets the requirements for four application servers, centralized intelligence, supporting various interfaces: service creativity and scalability. The architecture is based on that of AIN systems, but whole system is written in Java especially to achieve service creativity and scalability. As a result of trial manufacture, feasibility of the service agent and scalability was achieved. Enough performance was also confirmed to obtain for commercial services.

Using ultrafast nonlinear-optical response of organic dye films, a train of picosecond optical pulses can be converted into a space pattern of a mm scale. As applications of this technique we demonstrate a single-shot multichannel optical switching for 1 Tbit/s pulse trains, and a timing jitter suppression of pulse trains using a control system with femtoseconds time resolution.

Over the last twenty years, 3-D audio technologies have advanced significantly despite the difficulties in implementing them. However, their performance in providing information, especially about the distance of a sound source, remains imperfect. Therefore, more researches on distance cues are indispensable to achieve more effective technology. In this paper, we try to show how the conventional cues change as the distance of a sound source varies, by means of measured impulse responses using the swept-sine method and modeled impulse responses using CATT Acoustics. It is well known that the conventional cues comprise loudness, spectral information, reverberation and binaural information. Among these, we focus on the reverberation cue to describe the distance of a sound source. Some researches have shown that reverberation can give listeners absolute distance information, but the implementation using this cue is unfeasible because there are no well-defined parameters. In this paper, we also try to validate reverberation as a feasible distance cue by suggesting early decay time (EDT) and clarity index, C80, as the parameters for controlling the perceived distance with the reverberation cue.

This paper proposes an analytical model to demonstrate the benefit of data service in wireless networks using dynamic multi-channel scheme with channel de-allocation. The performance of a system providing buffers to voice calls to reduce the raised voice blocking probability caused by data contention is investigated. The effect of the cell dwell time and overlap area with adjacent cells on system performance are studied. All free channels are allocated to data users dynamically. For those data users using more than one channel, channels would be de-allocated for new requests, voice or data. Buffers are provided for voice calls to reduce the voice blocking probability caused by data packets contention. Handoff calls are given priority to be queued in the front of the buffer instead of providing guard channels to reduce their dropping probability. Meanwhile, the reneging time for new calls and the handoff dwell time for handoff calls are considered in our analysis to obtain an appropriate amount of buffer to voice. To compensate the blocking probability in data, guard channels are provided for data traffic. Numerical results show that the dynamic multi-channel scheme with possible de-allocation, compared with the single channel scheme, can enhance data traffic performance significantly in terms of the mean transmission time and blocking probability. A system providing an appropriate amount of buffer to voice traffic and giving priority to queued handoff calls can indeed reduce new call blocking probability and handoff call dropping probability. In addition, the proposed scheme can reduce the incomplete transmission probability of data packets.

A chaotic neural network consisting of chaotic neurons exhibits such rich dynamical behaviors as nonperiodic associative memory. But it is difficult to distinguish the stored patterns from others, since the chaotic neural network shows chaotic wandering around the stored patterns. In order to apply the nonperiodic associative memory to information search or pattern identification, it is necessary to control chaotic dynamics. In this paper, we propose a delay feedback control method for the chaotic neural network. Computer simulation shows that, by means of the control method, the chaotic dynamics in the chaotic neural network are changed. The output sequence of the controlled network wanders around one stored pattern and its reverse pattern.