In this paper, the optimal assignment problem which assigns cells in PCS (Personal Communication Service) to switches on ATM (Asynchronous Transfer Mode) network is investigated. The cost considered in this paper has two components: one is the cost of handoff that involves two switches, and the other is the cost of cabling. This problem assumes that each cell in PCS can be assigned to two switches in ATM network. This problem is modelled as dual-homing cell assignment problem, which is a complex integral linear programming (ILP) problem. Since finding an optimal solution of this problem is NP-hard, a hybrid method which combines several heuristics and a stochastic search method (based on a simulated annealing(SA) approach) is proposed to solve this problem. The solution method consists of three phases: Primary Assignment Decision Phase (PADP), Secondary Assignment Decision Phase (SADP) and Refinement Phase (RP). The PADP and SADP are used to find good initial assignment, then domain-dependent heuristics are encoded into perturbations of SA in Refinement Phase to improve the result. Simulation results show that the proposed hybrid method is robust for this problem.

Current IP network has become the dominant paradigm for all networking environments. The significant cause of packet losses in such heterogenous networks is no longer limited to network congestion. Traditional TCP interprets every packet loss as caused by congestion which may be not the case in the current Internet. Misinterpretation of wireless random loss as an indication of network congestion results in TCP slowing down its sending rate unnecessarily. In this paper, we propose a new variant of TCP Vegas named RedVegas. By using the innate nature of Vegas and congestion indications marked by routers, RedVegas may detect random packet losses precisely. Through the packet loss differentiation, RedVegas reacts appropriately to the losses, and therefore the throughput of connection over heterogeneous networks can be significantly improved.

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.

In this paper, we analyzed the performance of dynamic resource allocation with channel de-allocation and buffering in cellular networks. Buffers are applied for data traffic to reduce the packet loss probability while channel de-allocation is exploited to reduce the voice blocking probability. The results show that while buffering data traffic can reduce the packet loss probability, it has negative impact on the voice performance even if channel de-allocation is exploited. Although the voice blocking probability can be reduced with large slot capacity, the improvement decreases as the slot capacity increases. On the contrary, the packet loss probability increases as the slot capacity increases. In addition to the mean value analysis, the delay distribution and the 95% delay of data packets are provided.

In this paper, we consider a location management scheme using Limited Pointer forwarding from Commonly visited sites (LPC) strategy for Personal Communication Services (PCS) networks. The Commonly Visited Site (CVS) is defined as a site in which a mobile user is found with high probability. A feature of the strategy is that it skips updating location information of the mobile user, provided that the mobile user moves within its CVSs. Such a strategy is expected to significantly reduce the location update cost. We evaluate the location management cost of the LPC scheme by employing a Continuous-Time Markov Chain (CTMC) model. We show that the LPC scheme can reduce the location management cost of a highly mobile user who is found in its CVS with high probability.

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.

A good channel assignment scheme in a multihop ad hoc network should not only guarantee successful data transmissions without collisions, but also enhance the channel spatial reuse to maximize the system throughput. It becomes very inefficient to use fixed channel assignment when the network size grows. Therefore, spatial reuse of channels become more important in a large multihop ad hoc network. In this paper, we consider an ad hoc network with an overlaid CDMA/TDMA structure. We divide each code into time slots to form the channels. A dynamic channel assignment (DCA) strategies called Greedy-Based DCA (GB-DCA) is proposed in a clustered wireless multihop ad hoc network. This DCA strategy is designed to make better use of available channels by taking advantage of the spatial reuse concept. In GB-DCA, the increase in spatial reuse is achieved by adding certain control overhead. We show that the bandwidth saving due to channel spatial reuse is higher than the additional bandwidth spent on the control overhead.

Maximizing the throughput of a network while supporting fairness among nodes is one of the most critical issues in designing wireless networks. In single-hop networks, a lot of schemes have been proposed to satisfy this criterion, and efficient protocols like the IEEE 802.11 and the HiperLAN/2 standards have been established for wireless LAN. In multi-hop wireless networks, however, throughput and fairness have different characteristics from those of single-hop networks. In this paper, the tradeoff between throughput and fairness on multi-hop networks is studied by computer simulation, assuming three node distribution models, namely, normal, constant, and uniform distribution and four different bandwidth (channel) scheduling methods, i.e., first-in first-out buffer based, weighted traffic model based, bandwidth reservation based, and maximum throughput based scheduling. Furthermore, as a realistic model, a hybrid scheme is investigated where partial bandwidth is allocated to the bandwidth reservation based scheduling and the remaining to the maximum throughput based one.

Performance of selective Rake (SRake) receiver is evaluated for direct sequence ultra wideband (DS-UWB) communications considering an independent Rayleigh channel having exponentially decaying power delay profile (PDP). BEP performances are shown. The results obtained are compared with similar results in a channel having flat PDP. Assumption of a flat PDP is found to predict the optimum spreading bandwidth to be lower and sub-optimum operating performance beyond optimum spreading bandwidth to be severely worse than that is achievable in a channel having exponentially decaying PDP by employing an SRake receiver having fixed number of combined paths. Optimum spreading bandwidth for SRake in a channel having exponentially decaying PDP is shown to be much larger than the one in a channel having flat PDP; that is specifically a good-news for UWB communications. Effects of partial band interference are also investigated. Interference is found to be less effective in exponentially decaying PDP.

In this paper we propose a parallel composition based adaptive notch filter for eliminating sinusoidal signals whose frequencies are unknown. The proposed filter which is implemented using second order all-pass filter and a band-pass filter can achieve high convergence speed by using the output of an additional band-pass filter to update the coefficients of the notch filter. The high convergence speed of the proposed notch filter is obtained by reducing an effect that an updating term of coefficient for adaptation of a notch filter significantly increases when the notch frequency approaches the sinusoidal frequency. In this paper, we analyze such effect obtained by the additional band-pass filter. We also present an analysis of a convergence performance of cascaded system of the proposed notch filter for eliminating multiple sinusoids. Simulation results have shown the effectiveness of the proposed adaptive notch filter.

In this paper, we present a design and implementation of the M-channel linear-phase filter banks with unequal-length and same center of symmetry. The filter banks are separated into paraunitary and biorthogonal case. We discuss both cases. A novel filter bank can be regarded as a special class of generalized lapped transform with arbitrary number of channels M. In image coding applications, long basis functions should be used to avoid the blocking artifacts in low-frequency bands, while short basis functions should be used to reduce the ringing artifacts in high-frequency bands. Having the same center of symmetry is suitable for progressive image coder [SPIHT]. Filter banks with such characteristics can be achieved structurally by taking acount of the lattice structure. Finally, several design and image coding examples are shown.

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.

In this paper a new watermarking technique which is combined with joint photographic experts group (JPEG) encoding system is presented. This method operates in the frequency domain by embedding a pseudo-random sequence of real numbers in a selected set of discrete cosine transform (DCT) coefficients. The embedded sequence is extracted without restoring the original image to fit the trend in the digital still camera (DSC) system. The proposed technique represents a major improvement on methods relying on the comparison between the watermarked and original images. Experimental results show that the proposed watermarking method is robust to several common image processing techniques, including JPEG compression, noise, and blurring. We also implement the whole design by synthesizing with TSMC 1P4M 0.35 µm standard cell. The chip size is 3.0643.064 mm² for 46374 gate counts. The simulation speed can reach 50 MHz. The power dissipation is 69 mW at 3.3 V 50 MHz.

A novel high speed, low voltage BiCMOS tristate buffer is presented and its performance characteristics are investigated by using PSPICE simulation. The results obtained are compared with a general CMOS and a couple of previous BiCMOS tristate buffer circuits which are conventional BiCMOS and complementary BiCMOS tristate buffer circuits. It is shown that the proposed BiCMOS tristate buffer circuit outperforms other previous tristate buffer circuits. At lower supply voltage, the proposed circuit has been shown more advantageous speed over previous circuits and it guarantees speed advantage over previous circuits even supply voltage application is at 1.5 volt. The pass transistor technique with a single MOS transistor driving is used to improve the driving capability. Furthermore, a complementary BiCMOS charge pump technique is used to eliminate the voltage loss due to base-emitter turn on voltage and to enhance the driving capability. With the positive and negative charge pump, it can be realized a high speed at low voltage with full swing operation without performance degradation due to shunt CMOS circuit as same as previous complementary BiCMOS tristate buffer circuit.

In 1987, Ito, Saito and Nishizeki proposed a secret sharing scheme realizing general access structures, called the multiple assignment secret sharing scheme (MASSS). In this paper, we propose new MASSS's which are perfect secret sharing schemes and include Shamir's (k,n)-threshold schemes as a special case. Furthermore, the proposed schemes are more efficient than the original MASSS from the viewpoint of the number of shares distributed to each participant.

In the process of visual servoing, images are often blurred when the camera is moving. To solve this problem, a visual servoing system is proposed based on image moments of a planar target. According to image moment errors, the system can drive a camera to approach a static target with a 3D translational velocity. In this paper, it was proved that 0- and 1-order image moments are not only image's blur invariants, but also include the information of a target's position relative to the camera. Besides, the state equation of a moving image was deduced, based on which the control structure and an adaptive control strategy of our visual servoing system were designed. At last, some simulation results were presented to demonstrate the validity of the system.

Many applications of digital image processing require the evaluation of fast Fourier transforms. Therefore, for the more conventional rectangular grid image systems, FFT algorithms have been largely developed so far. For users of hexagonal grid image systems, unfortunately, life is less easier since they generally have to write the hexagonal FFT codes by themselves. This complexity tends to hinder the development and use of the hexagonal imaging system. In this short paper, we propose, without a mathematical proof, a method to simulate hexagonal FFTs based on the relations between the two grid systems. And this is done with only the use of regular rectangular FFT schemes. By this method, a hexagonally sampled image can be easily transformed via the many FFT programs available in the market.

This paper proposes the use of the ratio of wavelet extrema numbers taken from the horizontal and vertical counts respectively as a texture feature, which is called aspect ratio of extrema number (AREN). We formulate the classification problem upon natural and synthesized texture images as an optimization problem and develop a coevolving approach to select both scalar wavelet and multiwavelet feature spaces of greater discriminatory power. Sequential searches and genetic algorithms (GAs) are comparatively investigated. The experiments using wavelet packet decompositions with the innovative packet-tree selection scheme ascertain that the classification accuracy of coevolutionary genetic algorithms (CGAs) is acceptable enough.

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, C₈₀, as the parameters for controlling the perceived distance with the reverberation cue.

In, Okeya and Sakurai proposed the recovery of the y-coordinate on a Montgomery-form elliptic curve. With their method, it can calculate efficiently coordinates of scalar multiplication of point, in which we need only x-coordinate and finally, (x,y) of the terminal point can be recovered. The method is very suitable for some applications such as ECDSA-V and MQV, etc. Unfortunately, there is a significant fault in that paper. Thus, many results about computation amount are wrong due to the significant fault. First, we will show this fault, and then raise the correction of the significant fault. Finally, Table A・1 about comparison of computation amount in is also corrected.

The codes by the u/u+v construction have the extended error capacity for additional Hamming weight. It is a simple way to construct a large size block code using smaller ones. In this letter, low density parity check (LDPC) codes on u/u+v construction are investigated. Consequently, the study can enrich the family of LDPC codes and provide some special LDPC implementations.

This letter considers multiple access systems without bandwidth expansion. To improve the spectral efficiency, each user employs a QPSK modulation. The orientation of QPSK constellations is designed to maximize the minimum distance of the superimposed symbol constellation. The upper and lower bounds for the error performance of the proposed design demonstrate its advantage.

A face recognition system based on the hard-limited eigenfunctions derived from the Karhunen-Loeve transform is proposed. The key of this approach is to change the inner product of the face image and the selected eigenvectors from floating point arithmetic to integer arithmetic. A database with 1000 facial images corresponding to 100 subjects is collected for system evaluation. It is demonstrated that 92% correct classification rate and 6-fold computational time saving can be achieved by the use of the first 150 hard-limited features.

A new scheme for watermarking based on vector quantization (VQ) over a binary symmetric channel is proposed. By optimizing VQ indices with genetic algorithm, simulation results not only demonstrate effective transmission of watermarked image, but also reveal the robustness of the extracted watermark.