We propose a novel approach for designing a low power datapath in wireless communication systems. Especially, we focus on the digital FIR filter. Our proposed approach can reduce the power consumption and the circuit area of the digital FIR filter by optimizing the bitwidth of the each filter coefficient with keeping the filter calculation accuracy. At first, we formulate the constraints about keeping accuracy of the filter calculations. We define the problem to find the optimized bitwidth of each filter coefficient. Our defined problem can be solved by using the commercial optimization tool. We evaluate the effects of consuming power reduction by comparing the digital FIR filters designed in the same bitwidth of all coefficients. We confirm that our approach is effective for a low power digital FIR filter.

Conventional WDM systems multiplex channels with different signal bandwidths using fixed and equal channel spacing. As a result, their spectral efficiency is rather poor. If the wavelength and the bandwidth of each channel in a WDM system could be freely changed as needed, a variety of services with different signal bandwidths could be accommodated efficiently. This is expected to yield high spectral efficiency. For this purpose, this paper proposes a WDM optically amplified system that combines optical power splitting with homodyne detection; its use in three configurations, point to point, ring (center to remote nodes), and peer to peer, is described. Coherent optical systems generally need a frequency stable local light source in addition to a sending light source in each WDM channel. We improve cost effectiveness by proposing that the output of one light source be divided to yield the local light for frequency selection by homodyne detection and the sending light source whose output is externally modulated by transmission signal. In this configuration, the local light level is low to permit high levels of sending power. The key problem is how to get high SNR with limited low-level local lights. This paper derives the optimum receiving loss condition that can maximize the SNR with local light levels as low as -20 dBm for the point to point configuration. For the ring configuration, the system overcomes the optical power loss created by splitting numbers over 1,000 even if the local lights are as low as 0 dBm. The ring configuration can, therefore, flexibly accommodate many users and services. We also elucidate the relation between SNR and BER for DPSK homodyne detection in a bandwidth-flexible system.

The use of a two-point modulator with variable PLL loop bandwidth as a GFSK signal generator is proposed. Delta-sigma modulation is adopted for the modulator. Through the combination of a variable PLL feedback loop and delta-sigma modulation, both a fast settling time and very clear eye opening are achieved for the modulator. We fabricate it in 0.35-µm BiCMOS process technology. The two-point modulator has a center-frequency drift of only 14.9 kHz, much lower than the 178-kHz result for a single time slot in the case of direct VCO modulation. This is due to the PLL feedback loop. Evaluation also confirmed that the circuit satisfies the various characteristics required of a Bluetooth transmitter. The two-point modulator is also applicable to other transceivers which use FSK or PSK modulation, i.e. forms of modulation where a constant signal level is transmitted, and thus contributes to the simplification of a range of wireless transmitters.

We report tunable optical devices based on fiber Bragg gratings (FBGs), whose filtering characteristics are controlled by strain distributions. These devices include a widely wavelength tunable filter, a tunable group-velocity dispersion (GVD) compensator, a tunable dispersion slope (DS) compensator, and a variable-bandwidth optical add/drop multiplexer (OADM), which will play important roles for next-generation reconfigurable optical networks.

We develop a method of dimensioning and managing the bandwidth of a link on which TCP flows from access links are aggregated. To do this, we extend the application of the processor-sharing queue model to TCP performance evaluation by using flow statistics. To handle various factors that affect actual TCP behavior, such as round-trip time, window-size, and restrictions other than access-link bandwidth, we extend the model by replacing the access-link bandwidth with the actual file-transfer speed of a flow when the aggregation link is not congested. We only use the number of active flows and the link utilization to estimate the file-transfer speed. Unlike previous studies, the extended model based on the actual transfer speed does not require any assumptions/predeterminations about file-size, packet-size, and round-trip times, etc. Using the extended model, we predict the TCP performance when the link utilization increases. We also show a method of dimensioning the bandwidth needed to maintain TCP performance. We show the effectiveness of our method through simulation analysis.

The Generalized Max-Min Fairness policy (GMM) allocates in a fair way the available bandwidth among elastic calls by taking into account their minimum and maximum rate requirements. The GMM has been described in a five-step procedure, which has the advantage of an easy presentation, but does not come into details, as far as its computer implementation is concerned, and fails to describe the policy in a clear mathematical way. We propose a new algorithm for the GMM policy, in a clear mathematical way, based on Linear Programming (LP). The new algorithm is directly convertible into software. Numerical examples clarify our algorithm.

In the mobile Internet, a handover brings significant performance degradation of TCP due to bursty packet losses during handover processing. In this paper, we propose a new bandwidth control for improving the TCP performance. In the proposed system, when a mobile node changes its accessing base station, an intermediate router suppresses an available bandwidth to the corresponding TCP flow. Because suppressing the bandwidth results in reducing mis-forwarded packets to the old base station, the bursty packet losses can be avoided. In the hierarchical mobile network structure, which is recently developed in order to realize micro-mobility protocol, all packets transferred to mobile nodes are converged to several gateways such as mobility anchor points (MAP) in hierarchical Mobile IPv6 (HMIPv6). Therefore, the proposed system is suited to the hierarchical structure because it can be easily implemented at such gateways. Computer simulation results show that the proposed system can improve the TCP performance degradation especially in a situation where handovers frequently occur.

This paper proposes a cell layout synthesis method via Boolean Satisfiability (SAT). Cell layout synthesis problems are first transformed into SAT problems by our formulations. Our method realizes a high-speed layout synthesis for CMOS logic cells and guarantees to generate the minimum-width cells with routability under our layout styles. It considers complementary P-/N-MOSFETs individually during transistor placement, and can generate smaller width layout compared with pairing the complementary P-/N-MOSFETs case. To demonstrate the effectiveness of our SAT-based cell synthesis, we present experimental results which compare it with the 0-1 ILP-based transistor placement method and a commercial cell generation tool. The experimental results show that our SAT-based method can generate minimum-width placements in much shorter run time than the 0-1 ILP-based transistor placement method, and can generate the cell layouts of 32 static dual CMOS logic circuits in 54% run time compared with the commercial tool. Area increase of our method without compaction is only 3% compared with the commercial tool with compaction.

The notion of effective bandwidth provides an elegant and powerful mathematical basis for the provision of QoS-assured services over IP networks. In this paper, we propose a semi-parametric estimator of effective bandwidth, called Gaussian estimator using buffer masurement, for superposition of sources in IP networks. In contrast to most existing proposals concerning the effective bandwidth estimator, our proposal works based on a small set of measurements of the workload in the buffer of a router. We analytically show the property of the proposed estimator with respect to the dependence on the service rate. We provide numerical results to show that our proposed estimator is more accurate than estimators that rely only on the amount of traffic from sources.

This paper presents circuit techniques using pulse-width and pulse-phase modulation (PWM/PPM) approaches for VLSI implementation of nonlinear dynamical systems. The proposed circuits implement discrete-time continuous-state dynamics by means of analog processing in a time domain, and also approximately implement continuous-time dynamics. Arbitrary nonlinear transformation functions are generated by the process in which a PPM signal samples a voltage or current source whose waveform in the time domain has the same shape as the desired transformation function. Because a shared arbitrary nonlinear voltage or current waveform generator can be constructed by digital circuits and D/A converters, high flexibility and real-time controllability are achieved. By using one of these new techniques, we have designed and fabricated a CMOS chaos circuit with arbitrary 1-D maps using a 0.6 µm CMOS process, and demonstrate from the experimental results that the new chaos circuit successfully generated various chaos with 7.5-7.8 bit precision by using logistic, tent and chaotic-neuron maps.

Next generation wireless networks are expected to support multimedia applications (audio phone, video on demand, video conference, file transfer, etc.). Multimedia applications make a great demand for bandwidth and impose stringent quality of service (QoS) requirements on the wireless networks. In order to provide mobile hosts with high QoS, efficient and better bandwidth reservation is necessary in multimedia wireless networks. This paper presents a novel hybrid dynamic-grouping bandwidth reservation scheme to support QoS guarantees in the next generation wireless networks. The proposed scheme is based on probabilistic resource estimation to provide QoS guarantees for multimedia traffic in cellular networks. We establish several reservation time-sections, called groups, according to the mobility information of mobile hosts (MHs) of each base station (BS). The amount of reserved bandwidth for each BS is dynamically adjusted for each reservation group. We use the hybrid dynamic-grouping bandwidth reservation scheme to decrease the connection-dropping probability (CDP) and connection-blocking probability (CBP), while increasing the bandwidth utilization. The simulation results show that the hybrid dynamic-grouping bandwidth reservation scheme provides less CDP and less CBP, and achieves high bandwidth utilization.

A new common-bus architecture with temporal and spatial parallel access capabilities under wire-resource constraint is proposed to transfer vast quantities of data between modules inside a VLSI chip. Since bus controllers are distributed into modules, the proposed bus architecture can directly transfer data from one module to another without any central bus control unit like a Direct Memory Access (DMA) controller, which enables to reduce communication steps for data transfer between modules. Moreover, when a start address and the number of block data in both source/destination modules are determined at the first step of a data-transfer scheme, no additional address setting for the data transfer is required in the rest of the scheme, which allows us to use all the wire resources as only the "data bus." Therefore, the bus function is dynamically programmed, which results in achieving high throughput of bus communication. For example, in case of a 64-line common bus, it is evaluated that the maximum data throughput in the proposed architecture with dynamic bus-function programming is four times higher than that in the conventional DMA bus architecture with fixed 32-bit-address/32-bit-data buses.

This paper proposes a bandwidth allocation algorithm and a demand accommodation algorithm guaranteeing utility max-min fairness under bandwidth constraints. We prove that the proposed algorithms can fairly split network resources among connections and achieve call admission control considering the fairness among different types of applications. We then formulate three different network design problems to maximize the total utility of all customers, the number of users accommodated in the network, and the average utility of the customers accommodated in the network. To solve the problems, we extend the conventional network design algorithms considering utility max-min fair share, and numerically evaluate and compare their performance. Finally, we summarize the best algorithms to design the utility max-min fair share networks considering the operation policy of network providers.

We study the statistical multiplexing performance of self-similar traffic. We consider that input streams have different QoS (Quality of Service) requirements such as loss and delay jitter. By applying the FBM (fractal Brownian motion) model, we present methods of estimating the effective bandwidth of aggregated traffic. We performed simulations to evaluate the QoS performances and the bandwidths required to satisfy them. The comparison between the estimation and the simulation confirms that the estimation could give rough data of the effective bandwidth. Finally, we analyze the bandwidth gain with priority multiplexing against non-prioritized multiplexing and suggest how to get better performance with the right configuration of QoS parameters.

In this letter, we propose an iterative decoding with LDPC based unitary matrix modulated OFDM with splitting the diagonal components over the coherence bandwidth. The proposed system can obtain a frequency diversity gain by splitting the diagonal components of unitary matrix modulated symbols, and also obtain large coding gain by using LDPC code.

In finding the optimal solution of virtual-path bandwidth allocation for large-scale networks, existing searching algorithms frequently call the process which calculate the bandwidth for given call blocking probability (CBP) and traffic loads. This is an inverse process of calculating CBP for given traffic loads and bandwidth. Because there is no analytic expression of calculating CBP, the process of calculating bandwidth with given CBP and traffic adopts an iteration algorithm. It leads to a tedious computation process. In this letter, a fast bandwidth evaluation algorithm is proposed and applied to the field of virtual path bandwidth allocation that aims at minimizing the worst call blocking probabilities in the network. The algorithm is proved to be accurate and fast. Finally, we provide comparison curves for the exact optimal CBPs obtained in the case of using OPBM against that of DCLPBM aided by the fast bandwidth evaluation algorithm.

In this paper, a meander-type microstrip patch antenna for application in 5 GHz-band is designed and fabricated. To obtain enough bandwidth in VSWR<2, the foam is inserted between substrate and ground plane, the coaxial probe source is used. The measured result of fabricated antenna is obtained 1 GHz (17.5%) of bandwidth in VSWR<2, the gain of 7.3-9.5 dBi and unidirectional pattern.

The oscillation characteristics of a 40 GHz, 1-3 ps regeneratively and harmonically mode-locked erbium-doped fiber laser have been investigated in detail with respect to stability, linewidth, and mode hopping. We show that because the Q value of the microwave filter in the feedback loop is limited to around 1000, which is almost the same as that in a 10 GHz laser, the cavity length should not be greatly increased as this would result in as much as a fourfold increase in the number of longitudinal beat signals. We undertook a detailed stability analysis by using three cavity lengths, 60, 80, and 230 m. The 80 m long cavity greatly improved the long-term stability of the laser because the supermode noise was suppressed and there were not too many longitudinal modes. We measured the linewidth of the longitudinal mode of the laser using a heterodyne method, and it was less than 1 kHz. We also point out that there is a longitudinal mode hopping effect with time that is induced by very small changes in temperature.

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.

This paper presents the improvement of the transient response and stability for a two-stage DC-DC converter by removing the output inductor. The conventional two-stage converter consists of a buck converter used as the first stage and a half-bridge converter used as the second stage. The proposed circuit topology removing the output inductor and the conventional topology are compared. Removing the output inductor results in the system-order reduction of the transfer function. As a result, the stability is improved, and the crossover frequency of the open-loop transfer function becomes higher. The effectiveness of the proposed circuit topology was experimentally confirmed.