This article addresses the problem of designing and implementing multigigabit post-detection filters for application in optical communication systems using optical soliton pulses. The designed filters have the main advantages of full integration, electrically adjustable frequency response and active input and output impedance match.

We developed a compact rf receiver subsystem using a high-Tc superconducting sharp skirt band-pass filter with a center frequency tuning function. A 24-pole hairpin-type 2 GHz microstrip-line filter was fabricated with YBa2Cu3Oy thin films deposited on a LaAlO3 substrate. Attenuation characteristics were more than 30 dB at 1 MHz apart from both the lower and the higher pass-band edges. For center frequency tuning, a 1-mm-thick dielectric sapphire plate was stacked on the filter, and the filtering characteristics were tuned by moving the plate using a piezoelectric bending actuator. The range of the center frequency modulation was more than 12 MHz with no degradation of the low-loss and sharp-skirt characteristics.

In the literature, the optimum discrete interpolation approximation is presented. However, this approximation is the optimum for the union of the set of band-limited signals and the set of the corresponding approximation errors. In this paper, under several assumptions, we present two optimum extended discrete interpolation approximations such that the set of the corresponding approximation errors is included in the set of signals if we ignore some negligible component of error. In this paper, we assume that the decimated sampling interval T satisfies T M, where M is the number of paths of the filter bank. The maximally distinct or under sampled filter banks treated in this paper have FIR analysis filters with or without a continuous pre-filter and FIR synthesis filters with a band-limited continuous D/A filter. The first discussion is useful for designing a kind of down-converter which transforms HDTV signal with wide band-width to SDTV signal with narrow band-width, for example. In this discussion, we assume that the SDTV signal is limited in |ω|π/T and the Fourier spectrum of the HDTV signal has wider band but is approximately included in the corresponding narrow band of the SDTV signal. In the well-known scalable coding of signals, if the spectrum of a signal with higher resolution is not included approximately in the spectrum of the corresponding signal with lower resolution, the quality of the quantized output signal with lower resolution will become quite low practically. As shown in [3], however, scalable coding has received much attention recently in the fields of HDTV/SDTV compatibility. Therefore, it will be natural to consider that the spectrum of HDTV signal with higher resolution is similar to and is included approximately in the corresponding spectrum of SDTV signal with lower resolution. The analysis filters are FIR filters with a continuous pre-filter approximately band-limited in |ω|π/T. To improve the quality of the SDTV signal, the whole spectrum component of the HDTV signal is used in the presented down-converter. Another discussion is a general theory of approximation for filter banks using the prescribed analysis filters. In this discussion, although some modification for the band-width is introduced in the process of analysis, the final band-width of the receiver is limited in |ω| π. The FIR analysis filters do not have pre-filter. The condition imposing on the set of signals is more general than the corresponding condition in the first optimum approximation theory. Finally, we present the optimum transmultiplexer TR. In general, under the condition that the receiver filters are prescribed, a transmultiplexer has approximation error between the original signal and the transferred signal. However, the presented TR minimizes approximately the supreme value of arbitrary positive measures of approximation error that can be defined, totally or separately, with respect to all the channels. Note that, in the presented discussion, we can prescribe the degree of FIR filters used in TR, strictly.

In this paper, we address the key enabling technologies for long-span WDM transmissions at 40 Gbit/s. Experimental results of 1.28 Tbit/s (32 40 Gbit/s) unrepeatered transmission over 240 km of conventional 80-µm2 NDSF will be reported. Bi-directional pumped distributed Raman amplification has allowed a record unrepeatered WDM transmission distance over this fibre type, without using effective-area-enlarged fibres or remotely pumped EDFAs.

In this paper, we consider optimal mirror allocation problems for the purpose of load balancing in network servers. We focus on constructing high-reliability networks and propose the optimal mirror allocation model such that the system reliability is maximized subject to costs and delays, in view of the trade-off between the reliability and cost. This optimization model is capable of dealing with various kinds of network topologies, although for simplicity, we assume the read-only situation. We formulate this optimization problem into a 0-1 integer programming model, and we use an approximate method for numerical analysis in order to analyze more large-scale systems. Our objective is to find the optimal mirror allocation by solving this model, and to show quantitatively the general characteristics of the load balancing and the improvement of the system reliability by the distributed mirror allocation.

This paper investigates the accepting powers of one-way alternating and deterministic multi-counter automata operating in realtime. We partially solve the open problem posed in [4], and show that for each k1, there is a language accepted by a realtime one-way deterministic (k+3)-counter automaton, but not accepted by any realtime one-way alternating k-counter automaton.

This paper proposes list Viterbi equalizers (LVEs) that use two kinds of metric criteria for wide-spread time-dispersive channels to achieve a good trade-off between complexity and bit error rate (BER) performance. For Viterbi equalization employing a state-reduction algorithm, the modified metric criterion proposed by Ungerboeck is not always equivalent to the squared Euclidean distance metric criterion. This paper proposes the following two schemes for the LVE: (1) to combine two kinds of metric criteria like combining diversity; (2) to select the metric criterion like selection diversity according to the channel impulse response. Finally, computer simulation shows that the proposed schemes improve BER performance on wide-spread frequency selective fading channels, even if the proposed schemes have smaller complexity than the conventional one.

A Wireless Sensor Network (WSN, for short) is a distributed system consisting of n sensor nodes and a base station. In this paper, we propose an energy-efficient protocol to initialize the sensor nodes in a WSN, that is, to assign a unique ID to each sensor node. We show that if an upper bound u on the number n of sensor nodes is known beforehand, for any f 1 and any small µ (0<µ<1), a WSN without collision detection capability can be initialized in O((log (1/µ) + log f)u1+µ) time slots, with probability exceeding 1-(1/f), with no sensor node being awake for more than O(log (1/µ)+ log f) time slots.

In this letter, sampling and quantizer design for the Gaussian detection problem are considered. A constraint on the transmission rate from the remote sensor to the optimal discrete detector is assumed. The trade-off between sampling rate and the number of quantization levels is studied and illustrated by means of an example.

A novel rough neural network (RNN) structure and its application are proposed in this paper. We principally introduce its architecture and training algorithms: the genetic training algorithm (GA) and the tabu search training algorithm (TSA). We first compare RNN with the conventional NN trained by the BP algorithm in two-dimensional data classification. Then we compare RNN with NN by the same training algorithm (TSA) in functional approximation. Experiment results show that the proposed RNN is more effective than NN, not only in computation time but also in performance.

In this paper, we propose a probabilistic approach to derive an approximate polyhedral description from range data. We first compare several least-squares-based methods for estimation of local normal vectors and select the most robust one based on a reasonable noise model of the range data. Second, we extract the stable planar regions from the range data by examining the distributions of the local normal vectors together with their spatial information in the 2D range image. Instead of segmenting the range data completely, we use only the geometries of the extracted stable planar regions to derive a polyhedral description of the range data. The curved surfaces in the range data are approximated by their extracted plane patches. With a probabilistic approach, the proposed method can be expected to be robust against the noise. Experimental results on real range data from different sources show the effectiveness of the proposed method.

An on-chip, 64-Mb, embedded, DRAM MPEG-2 encoder LSI with a multimedia processor has been developed. To implement this large-scale and high-speed LSI, we have developed the hierarchical skew control of multi-clocks, with timing verification, in which cross-talk noise is considered, and simple measures taken against the IR drop in the power lines through decoupling capacitors. As a result, the target performance of 263 MHz at 1.5 V has been successfully attained and verified, the cross-talk noise has been considered, and, in addition, it has become possible to restrain the IR drop to 166 mV in the 162 MHz operation block.

This paper proposes a statistical design approach for Non-Return-to-Zero (NRZ) 40 Gbit/s systems with Forward Error Correction (FEC); the approach considers Polarization Mode Dispersion (PMD). We introduce a fluctuating PMD emulator to experimentally clarify FEC performance in PMD-limited systems. By using the proposed design approach, and considering the FEC relaxation effect on PMD, the maximum transmission distance of an NRZ 40 Gbit/s system without PMD compensation is estimated as several hundreds of km depending on the number of cable concatenations per link and the probability threshold of system acceptance.

It has been shown that virtual output queuing (VOQ) and a sophisticated scheduling algorithm enable an input-queued switch to achieve 100% throughput for independent arrival process. Several of the scheduling algorithms that have been proposed can be classified as either iterative scheduling algorithms or symmetric crossbar arbitration algorithms. i-OCF (oldest-cell-first) and TSA (two step arbiter) are well-known examples of iterative scheduling algorithms and symmetric crossbar arbitration algorithms, respectively. However, there are drawbacks in using these algorithms. i-OCF takes long time to find completely a conflict-free match between input ports and output ports because it requires multiple iterations. If i-OCF cannot find a conflict-free match completely, the switch throughput falls. TSA has the possibility that it finds a conflict-free match faster than i-OCF because it does not need any iterations. However, TSA suffers from the starvation problem. In this paper, we propose a new scheduling algorithm. It uses two schedulers, which we call scheduler 1 and scheduler 2, in parallel. After cells were transmitted, the information that input port i granted the offer from output port j in scheduler 2 is mapped to scheduler 1 if and only if input port i has at least one cell destined for output port j. If the information is moved, input port i and output port j are matched in scheduler 1 at the beginning of the next time slot. Our proposed algorithm uses one scheduler based on TSA and the other scheduler based on i-OCF. Numerical results show that the proposed scheduling algorithm does not require multiple iterations to find a conflict-free match completely and suffer from the starvation problem for both uniform and bursty traffic.

We give an overview of the computational complexity of linear and mesh-connected cellular and iterative arrays with respect to well known models of sequential and parallel computation. We discuss one-way communication versus two-way communication, serial input versus parallel input, and space-efficient simulations. In particular, we look at the parallel complexity of cellular arrays in terms of the PRAM theory and its implications, e.g., to the parallel complexity of recurrence equations and loops. We also point out some important and fundamental open problems that remain unresolved. Next, we investigate the solvability of some reachability and safety problems concerning machines operating in parallel and cite some possible applications. Finally, we briefly discuss the complexity of the "commutativity analysis" technique that is used in the areas of parallel computing and parallelizing compilers.

A 2-GHz down-converter for wide-band wireless communication systems is described. To achieve both wide-band output characteristic and LO signal suppression, an on-chip LC series resonator which is resonated at LO signal frequency and a transimpedance amplifier which is used in the output buffer circuit are used. To achieve a low sensitivity to temperature, two kinds of bias circuits; a VT reference current source and a bandgap reference current source are used. The measured 3-dB bandwidth of 600 MHz is achieved. The conversion gain varies less than 0.2 dB within 200 MHz 10 MHz and 400 MHz 10 MHz band and 0.7 dB for the temperature range from -34 to 85. At room temperature, conversion gain of 15 dB, NF of 9.5 dB and IIP3 of -5 dBm are obtained respectively. The down-converter is fabricated using Si BiCMOS process with ft=20 GHz, and it occupies approximately 1 mm2.

A near-optimum parallel algorithm for bipartite subgraph problem using gradient ascent learning algorithm of the Hopfield neural networks is presented. This parallel algorithm, uses the Hopfield neural network updating to get a near-maximum bipartite subgraph and then performs gradient ascent learning on the Hopfield network to help the network escape from the state of the near-maximum bipartite subgraph until the state of the maximum bipartite subgraph or better one is obtained. A large number of instances have been simulated to verify the proposed algorithm, with the simulation result showing that our algorithm finds the solution quality is superior to that of best existing parallel algorithm. We also test the proposed algorithm on maximum cut problem. The simulation results also show the effectiveness of this algorithm.

In this paper, we propose a universal biquad filter that can realize all types of 2nd-order functions, such as Low-pass Filters (LPF), High-Pass Filters (HPF), Band-Pass Filters (BPF), Band-Elimination Filters (BEF), and All-Pass Filters (APF). Also, the filter types can be programmable digitally with built-in switches. The proposed circuit can be realized by using a CMOS technology that is suitable for a mixed digital-analog LSI. In addition, the circuit can operate in high frequencies with a low power supply voltage because it is based on a current-mode circuit. Finally, the proposed circuit is simulated by PSpice to confirm its characteristics.

A highly stable oven-controlled crystal oscillator (OCXO) with low phase-noise characteristics has been developed using a dual-mode SC-cut quartz crystal oscillator. The OCXO uses a conventional oven-control system for coarse compensation and a digital-correction system, which uses B-mode signal in an SC-cut resonator as a temperature sensor, for fine compensation. Combining these two forms of compensation greatly improves the stability of the C-mode frequency without requiring a double-oven system. The experimental results indicated that the frequency stability of the proposed OCXO, including the frequency-temperature hysteresis, is ten times better than that of a conventional, free-running OCXO. The results also indicated that the proposed OCXO has good frequency retraceability and low phase-noise characteristics.

Today, an ultra-high capacity transmission system based on N40 Gb/s channel rate is the most promising approach to achieve multi-terabit/s of capacity over a single fiber. We have demonstrated 5.12 Tbit/s transmission of 128 channels at 40 Gbit/s over 3100 km and 10.24 Tbit/s transmission of 256 channels at 42.6 Gbit/s (using FEC) over 100 km, based on four main technologies: 40 Gbit/s electrical time-division multiplexing (ETDM), vestigial sideband demultiplexing (VSB), advanced amplifier technology including Raman amplification and TeraLightTM fiber. A record spectral efficiency of 1.28 bit/s/Hz is applied to achieve 10.24 Tbit/s transmission within the C- and L-band.