It is an innovative idea for modern PLL generation to control the bandwidth proportionally to the reference frequency. Recently, a frequency of the operating clock in microprocessors has been required to be changed frequently and widely in order to manage power consumption and throughput. A new compact switched capacitor (SC) filter which has fully flat response has been developed for adaptive biased PLLs. We have also developed a new digital control method for achieving the wider frequency range. The measured performances of the test chip were good enough for the use in the microprocessors.

This paper proposes an OFDM mobile radio packet system that employs a new protocol of automatic repeat request (ARQ) for nonlinear multiuser detection (MUD) with log likelihood ratio combining (LC) on the appropriate bits. The conventional metric combining (MC) MUD separates collided packets by using nonlinear MUD, accumulates the Euclidian distance metrics of the received subcarrier symbols in the packets, and then achieves throughput improvement. However, when MC-MUD detects a packet error, it makes user terminals retransmit the same packets so as to reproduce the collision of the same packets. The proposed LC-MUD scheme simplifies the ARQ protocol and requires no reproduction of the same packet collision. The computer simulations demonstrate the superior throughput of LC-MUD to that of MC-MUD, and further improvement due to adaptive modulation and coding (AMC) optimized for the nonlinear MUD in LC-MUD.

To improve the channel estimation accuracy of multiple-input multiple-output (MIMO) multiplexing, we previously proposed iterative QR-decomposition with M-algorithm (QRD-M) with decision directed channel estimation. In this paper, to keep the computational complexity low while further improving the transmission performance, we will modify previously proposed iterative QRD-M by incorporating cyclic redundancy check (CRC) coding. In the proposed method, transmitted signals are ranked according to their results of CRC decoding and the received signal-to-interference plus noise power ratio (SINR). In the modified M-algorithm, since the results of Turbo decoding and CRC decoding are used to generate the surviving symbol replica, the accuracy of signal detection in the following steps can be improved. Furthermore, based on the results of CRC decoding, iterative process can be terminated before reaching the maximum allowable number of iterations. Computer simulation results show that the loss in the required average received signal energy per bit-to-noise power spectrum density ratio Eb/N0 for average packet error rate (PER) = 10-2 is only about 0.4 dB from maximum likelihood detection (Full MLD) with ideal channel estimation.

We address the problem of routing and wavelength assignment (RWA) considering differentiated reliability (DiR) in WDM mesh networks. The backup resource can be shared by the primary lightpaths. However, both the primary-backup sharing and the different levels of fault tolerance requirement have never been considered together in the literature. In the paper, we consider the dynamic character of the link availability, which is caused by primary-backup sharing. Moreover, the priority of traffic is considered in the paper. The paper focuses on routing under dynamic availability of wavelength resource while the requested reliability of traffic has to be met, using the modified shortest path algorithm. A layered availability model is established based on wavelength layered graph model. Using this model, we propose a new algorithm called dynamic layered availability (DLA) algorithm. We evaluate the performance of the proposed algorithm on the NSFNET.

We measured the complex permittivities of whole blood and blood plasma in quasi millimeter and millimeter wave bands using a coaxial probe method. The validity of these measurements was confirmed by comparing with those of a different measurement method, i.e., a dielectric tube method. It is shown that the complex permittivities of the blood samples are similar to those of water in quasi millimeter and millimeter wave bands. Furthermore, the temperature dependences of the complex permittivities of the samples were measured.

A proactive cluster-based distance vector routing protocol based on DSDV protocol is proposed for mobile ad hoc networks. A network is divided into a number of clusters, each cluster having a clusterhead that directly connects the other nodes in the same cluster. Each clusterhead broadcasts update request (UREQ) messages at reqular intervals or in an event driven manner to its neighbor clusterheads. In this way, clusterheads update their own global routing tables that give a path among all clusterheads. In this process, multiple local paths from source clusterhead to its neighbor clusterheads are established as well. A node having a packet to send forwards the packet to its own clusterhead. The clusterhead determines next clusterhead with respect to the destination clusterhead by looking up its own global routing table. Then, the packet is delivered to the next clusterhead along a local path. The advantages of this protocol are threefold. The size of a global routing table is small since it has entries only for clusterheads. A UREQ message travels up from the initiating clusterhead to neighbor clusterheads. Hence, the convergence range of a update request is at least nine times as wide as that of DSDV or CGSR, increasing the correctness of routing. Lastly, a technique to bypass clusterheads, whenever possible, on the fly during packet transmission is presented, to reduce route length as well as to prevent clusterheads from becoming congested. Simulation results show that PCDV outperforms some key protocols of the same category greatly.

Convolutional spreading CDMA with cyclic prefix (CS-CDMA/CP) is a multiuser interference-free (MUI-free) CDMA scheme proposed for multipath channels based on the convolution between user data and zero correlation zone (ZCZ) code, and its characteristics depend on the employed ZCZ codes. Although ternary ZCZ codes have more sequences than binary ZCZ codes in general, transmitted signal with ternary ZCZ codes give a slightly higher peak-to-average power ratio (PAPR). In this paper we propose the use of periodic ZCZ codes generated from an M-sequence which not only provides the same user capacity as ternary ZCZ codes but allows more design flexibility. Simulation results show that the new ZCZ code shows stronger robustness against an imperfect transmitter with clipping and enjoys better BER performances when used in CS-CDMA/CP compared to the conventional DS-CDMA with MRC-RAKE.

Traffic markers differentiate among packets from senders based on their service profile in the differentiated service networks. Researchers have previously revealed that the existing marking mechanism causes the unfairness in aggregates. This study presents a new marking algorithm. Simulation results demonstrate that the fairness of the proposed scheme exceeds that of SRTCM, TRTCM, TSWTCM and ITSWTCM for medium to high network provision levels.

This paper presents a method for blind identification of a system whose transfer matrix is non-invertible at infinity, based on independent component analysis. In the proposed scheme, the transfer matrix to be identified is pre-multiplied by an appropriate polynomial matrix, named interactor, in order to compensate the row relative degrees and obtain a biproper system. It is then pre-multiplied by a demixing matrix via an existing approximate method. Both of these matrices are estimated blindly, i.e. with the input signals being unknown. The identified system is thus obtained as the inverse of the multiplication of these matrices.

In this paper, we introduce a syntactically embedded (s-embedded) language, and consider its principal congruence. The following three results are proved, where PL is the principal congruence of a language L, and W(L) is the residual of L. (1) For a language K, s-embedded in M, K is equal to a PM class. (2) For a language K, s-embedded in an infix language M, K is equal to a PW(M) class. (3) For a nonempty s-embedded language L, if L is double-unitary, then L is equal to a PW(M) class. From the above results, we can obtain those for principal congruence of some codes. For example, Ln is equal to a PLn+1 class for an inter code L of index n.

In arithmetic circuits for digital signal processing, radixes other than two are often used to make circuits faster. In such cases, radix converters are necessary. However, in general, radix converters tend to be complex. This paper considers design methods for p-nary to binary converters. First, it considers Look-Up Table (LUT) cascade realizations. Then, it introduces a new design technique called arithmetic decomposition by using LUTs and adders. Finally, it compares the amount of hardware and performance of radix converters implemented by FPGAs. 12-digit ternary to binary converters on Cyclone II FPGAs designed by the proposed method are faster than ones by conventional methods.

A new digital calibration scheme for a 14 bit binary weighted current-steering digital-to-analog converter (DAC) is presented. This scheme uses a simple current comparator for the current measurement instead of a high-resolution ADC. Therefore, a faster calibration cycle and smaller additional circuits are possible compared to the scheme with the high-resolution ADC. In the proposed calibration scheme, the lowest 8 bit part of the DAC is used for both error correction and normal operation. Therefore, the extra DACs required for calibration are only a 3 bit DAC and a 6 bit DAC. Nevertheless, a large calibration range is achieved. Full 14 bit resolution is achieved with a small chip-area. The simulation results show that DNL and INL after calibration are 0.26 LSB and 0.46 LSB, respectively. They also show that the spurious free dynamic range is 83 dB (57 dB) for signals of 24 kHz (98 MHz) at 200 Msps update rate.

A new radio-frequency (RF) radiated immunity/susceptibility test method using four-septum TEM cell is proposed. A rotating-EM field can be generated inside the cell by feeding four-different RF DSB-SC signals to four septa arranged in the cell. Since a polarization plane of the rotating-EM field rotates in a low speed, the immunity/susceptibility test for the EM field with various polarizations can be conducted more easily. In this paper, a technique for generating the rotating-EM field in the cell is investigated. The basic characteristics of the cell and the rotating-EM field by using the technique are clarified. To verify the validity of this test method, a RF radiated susceptibility of a printed circuit board is measured. The measured results are verified by comparing with the theoretical results based on modified telegrapher's equations.

The design of the finite impulse response (FIR) notch filter with controlled null width is expressed as a derivatively contrained quadratic optimization problem. The problem is transformed into an unconstrained one by choosing a null matrix orthogonal to the derivative constraint matrix. In this paper, subband decomposition using wavelet filters is employed to construct the null matrix. Taking advantage of the vanishing moment property of the wavelet filters, the proposed method can adjust the null width of the notch filter for eliminating the intractable iterference by controlling the regularity of the wavelet filters. Simulation results show that the new method can offer comparable performance as those of the existing full-rank-based ones and thus provides a promising alternative to the existing works.

We propose a digital carrier recovery loop employing both a frequency detector and a phase detector for M-ary phase shift keying (MPSK) systems. A new frequency error correction function is also derived to increase the acquisition range. It is shown through computer simulation that the proposed scheme can reduce the acquisition time at large frequency offsets, unlike the existing ones.

For a digitally controlled phase-locked loop (PLL), we evaluate the use of a clock-period comparator (CPC). In this PLL, only the frequency lock operation should be performed; however, the phase lock operation is also simultaneously achieved by performing the clock-period comparison when the phases of the reference signal and the output signal approach each other. Theoretically a lock-up operation was conducted. In addition, we succeeded in digitizing a voltage controlled oscillator (VCO) with a linear characteristic. We confirmed a phase lock operation with a slight loop characteristic through SPICE simulation.

In this paper, a novel independent component analysis (ICA) approach is proposed, which is robust against the interference of impulse noise. To implement ICA in a noisy environment is a difficult problem, in which traditional ICA may lead to poor results. We propose a method that consists of noise detection and image signal recovery. The proposed approach includes two procedures. In the first procedure, we introduce a self-organizing map (SOM) network to determine if the observed image pixels are corrupted by noise. We will mark each pixel to distinguish normal and corrupted ones. In the second procedure, we use one of two traditional ICA algorithms (fixed-point algorithm and Gaussian moments-based fixed-point algorithm) to separate the images. The fixed-point algorithm is proposed for general ICA model in which there is no noise interference. The Gaussian moments-based fixed-point algorithm is robust to noise interference. Therefore, according to the mark of image pixel, we choose the fixed-point or the Gaussian moments-based fixed-point algorithm to update the separation matrix. The proposed approach has the capacity not only to recover the mixed images, but also to reduce noise from observed images. The simulation results and analysis show that the proposed approach is suitable for practical unsupervised separation problem.

In real-time systems, deadline misses of the tasks cause a degradation in the quality of their results. To improve the quality, we have to allocate CPU utilization for each task adaptively. Recently, Buttazzo et al. address a feedback scheduling algorithm, which dynamically adjusts task periods based on the current workloads by applying a linear elastic task model. In their model, the utilization allocated to each task is treated as the length of a linear spring and its flexibility is described by a constant elastic coefficient. In this paper, we first consider a nonlinear elastic task model, where the elastic coefficient depends on the utilization allocated to the task. We propose a simple iterative method for calculating the desired allocated resource and derive a sufficient condition for the convergence of the method. Next, we apply the nonlinear elastic model to an adaptive fair sharing controller. Finally, we show the effectiveness of the proposed method by computer simulation.

Since Smart Antenna technology has powerful spatial processing ability; it is regarded as a promising approach to enhancing the data rates and capacity of wireless LAN systems. In this paper, a small size, practical switched-beam antenna system, well suited for domestic in-home networking in the 2.4 GHz band, is designed and tested. The system has the configuration of regular nine-prism, and nine 1/4 wavelength rectangular patches are symmetrically distributed on the nine sides of the prism. The switching process is based on control of the microstrip used to feed the patch radiators, by placing PIN diodes at the microstrip feeding lines. The antenna array can generate nine beams with a gain of 11 dB. All the beams generated by the system are cophasal excited and have a 40°beamwidth. Compared to the uniform array, the system can guarantee the consistency of every beam and is preferable in shape.

The realization of k-nearest-matches search capability in fully-parallel mixed digital-analog associative memories by a sequential autonomous search mode is reported. The proposed concept and circuit implementation can be applied with all types of distance measures such as Hamming, Manhattan or Euclidean distance search, and the k value can be freely selected during operation. A test chip for concept verification has been designed in 0.35 µm CMOS technology with two-poly, three-metal layers, realizes k-nearest-matches Euclidean distance search and consumes 5.12 mm2 of the chip area for 64 reference patterns each with 16 units of 5-bit.