We propose Polarization-Shift-Keying (POLSK) homodyne system using phase-diversity receivers and theoretically analyze its bit-error-rate (BER) performance. Since the proposed system uses polarization modulation and homodyne detection, it can cancel the phase noise and is attractive at a high bit-rate transmission. It is found that the receiver sensitivity of the proposed POLSK homodyne system is the same as that of POLSK heterodyne system and is much better than that of DPSK phase-diversity homodyne systems at high signal-to-noise ratio (SNR). We also cosider theoretically the effect of the fluctuation of state of polarization (SOP) on the BER performance of POLSK homodyne system.

The nonuniformity of signal constellation on coded phase/frequency modulation is investigated to obtain further improvement on the error performance over conventional uniformly spaced coded phase/frequency modulation. The analytical method for evaluating the Euclidean distance of nonuniform FSK/PSK signal is presented. In particular, the joint design of m/(m1) systematic convolutional encoders and nonuniform 2FSK/2mPSK are considered, and especially for 2FSK/4PSK and 2FSK/8PSK the behavior of the free Euclidean distance is evaluated by varying the modulation index, the rotation angles which determine the nonuniform signal constellation, and the mapping rule by set partitioning. The results show that by designing compared with the conventional coded uniform phase/frequency modulation may be obtained without increasing average or peak power or changing the bandwidth of the transmitted signals. The maximum value of the free Euclidean distance of codes can be obtained when the PSK signal constellation of one carrier frequency is the same as those of the other carrier frequency, and the mapping rule used in coded uniform FSK/PSK system is not always good enough when the nonuniformity in the signal constellation is introduced.

The capacity of Multi-pulse PPM (MPPM) and performance of Reed-Solomon coded MPPM in optical photon communications are evaluated. Transmission rate, energy efficiency and error probability of MPPM are presented for noiseless channel. It is shown that MPPM yields higher limits of energy efficiencies as well as transmission rate than PPM in band limited channel. Moreover, it is shown that MPPM combined with Reed-Solomon (RS) codes achieves higher energy efficiency of more than twice as that of RS coded PPM, which McEliece studied, in practical range of error probability.

This paper proposes a hierarchical MS synchronization network in which the slaves increased averaging numbers of phase errors along the hierarchy in order to improve the network characteristics in both jitter suppression and phase tracking. The properties of the proposed network are investigated and compared with the conventional one which uses an identical averaging number in all hierarchical slaves. The results show the proposed network has an advantage over the conventional one. With the same tracking property, the jitter accumulation in the network proposed with 9 hierarchies is suppressed about 0.8-2 dB more than that in the conventional identical one, and much higher improvements are guaranteed in a larger hierarchical MS network. The idea of using increased averaging numbers along the hierarchy can be applied to the general MS synchronization network which consists of a chain of PLLs, for instance, one can design the transfer function of the PLLs with the reduced bandwidth along the chain, to obtain a better performance in the network entirety than the conventional identical one.

An Interlace Coding System (ICS) involving data compression code, data encryption code and error correcting code is proposed and its error performance on additive white Gaussian noise (AWGN) channel with quadrature phase shift keying (QPSK) is analyzed. The proposed system handles data compression, data encryption and error correcting processes together, i.e. adds error correcting redundancy to the block lists of the dictionary in which compression system constructs to reduce source redundancy. Each block list is encoded by Ziv-Lempel code and Data Encryption Standard (DES). As the catastrophic condition determined by the data compression procedure is not negligible, error correcting redundancy should be added so as to avoid catastrophic condition. We found that the catastrophic condition depends only on the size of the dictionary for our proposed system. Thus, by employing a large dictionary, good error performance can be applied by the proposed system and the catastrophic condition can be avoided.

In this paper, restricted overflow strategy is proposed as a novel channel access strategy for the queueable hierarchical channel structure, which has been proposed as one of "Wideband-ISDN" channel structures. In this policy, overflow from higher bit rate channels to lower bit rate channels is partly restricted by the number of waiting customers in the higher channel's buffer. Therefore, thresholds, which restrict overflow, are considered on the buffer. First, we present the system model with two types of services and restricted overflow strategy. Next, we provide a queueing analysis of this strategy. After that, some numerical results of both conventional overflow strategy and restricted overflow strategy are presented, and we compare the average holding times under these strategies. Finally, we show that, if we choose appropriate thresholds, the average holding time of higher level traffic is improved.

A class E low dv/dt PWM synchronous rectifier regulating the output voltage at a fixed frequency is presented, analyzed and verified experimentally. This rectifier is derived from the class E low dv/dt rectifier by replacing the controlled switch (MOSFET with its anti-parallel diode) with the rectifier diode in class E low dv/dt rectifier, and by using the synchronized PWM signal to control the output voltage at desired value. The ZVS condition of the controlled switch can be maintained from full-loaded to open-loaded. The experimental results measured at switching frequency 1 MHz are in good agreement with the theoretical prediction.

In this paper we present a new analytical method, in evaluation of the upper bound to the symbol error probability performance of coded M-PSK signals, subject to the filtering effect, in addition to white gaussian noise. The effects of transmission filter on performance of 4-state code of coded 16-PSK signal, detected with coherent demodulator coupled with maximum likelihood sequence decoder (Viterbi algorithm) are demonstrated with numerical results. The filtering degradation of the coded system is then compared to its counterpart uncoded system. We found that the coding gain slightly increase as filtering bandwidth decreases (increasing coding gain by more than 1 dB at BT2) and generally, the Full roll off channel filtering shows better performance relative to the Butterworth or Chebyshev filtering.

In this paper, we propose two parallel M/M/1 queueing systems with dynamic routing under a threshold-type scheduling. Arriving customer is sent to the buffer of the faster server as far as the difference of two queues does not exceed a threshold value, but it should be sent to the buffer of the slower server if and only if the difference of two queues exceeds a threshold value. It is shown that as the difference of the two service rates becomes large, the two parallel M/M/1 queueing systems with dynamic routing under the threshold-type scheduling can reduce the mean queueing time of costomers in the system compared to the conventional nonthreshold-type one. It is also found that as the asymmetry in the two service rates increases, the optimum threshold value which minimizes the mean queueing time should be large to reduce the number of queueing customer in the buffer of the slower server. On the other hand, as the traffic intensity becomes large, the optimum threshold value tends to be small in order to increase the total service rate.

The queueing system with multiple servers of possibly different rates under a threshold-type scheduling is analyzed. We first derive the general expressions for state probabilities and the average queueing delay in which the conventional M/M/n queueing system is also included as the special case of zero-threshold policy. Next, the numerical calculation is carried out for the queueing system with 3 servers under a threshold-type scheduling to consider the impact of the multiple thresholds on the average queueing delay of the system. It is found that the average queueing delay of the queueing system with multiple servers of different rates can be reduced under a threshold-type scheduling by selecting the threshold values appropriately. The threshold-type scheduling is more effective as the difference of the service rates becomes larger.

Frequency synthesizers are widely used in the radio communication systems and as the signal generators. Usually, the frequency synthesizers are built as a PLL, and the requirements for both switching speed and frequency step size are in conflict. In this paper, a new digital frequency synthesizer using a phase accumulator is proposed, and a new phase frequency detector is described. The frequency of the phase accumulator is used as a reference generator and its frequency can be changed with a fine resolution at a high frequency, which offers a rapid frequency switching. Since the phase accumulator generates binary data, a new phase estimation technique is used and is extended to have an ability to detect the frequency error. Due to a high reference frequency which offers a high loop gain and the better characteristics of the phase-frequency detector, the speed of the frequency switching is improved. The properties of the proposed frequency synthesizer is investigated by experiments and theoretical analysis and is compared with the conventional PLL frequency synthesizer, resulting in that the proposed system has faster frequency switching speed and better signal purity than those of the conventional PLL frequency synthesizer.

In this study, we investigate two oscillators which have the same natural frequency, mutually coupled by N-type piecewise-linear negative resistor. In this system, according to the negative range of the coupling negative resistor, the various inter-esting synchronization phenomena which are in-phase, opposite phase and doublemode-like oscillations are observed. Especially, we show doublemode-like oscillations that are not observed until now in mutually coupled van der Pol oscillators with the smooth cubic characteristics, although the ones with same natural frequencies are coupled. And we show the differences of the phenomena between two oscillators coupled by the smooth cubic negative resistor and the ones coupled by the piecewise-linear negative resistor.

We propose parallel rate-variable punctured convolutional coded PPM in photon communication to achieve high energy information efficiency Ie for desired bit error rate (BER) and transmission bandwidth. We theoretically show the BER performance, bandwidth expansion factor β and necessary Ie to achieve BER10-6 of the proposed systems for some combinations of code rates. It is found that the proposed system can achieve high Ie for desired BER and β by selecting a suitable combination of code rates depending on the channel conditions. Moreover, it is showm that the proposed system has better BER performance than RS-coded PPM in the range of small β.

We propose Polarization-Shift-Keying (POLSK) homodyne system using phase-diversity receivers and theoretically analyze its bit-error-rate (BER) performance. Since the proposed system uses polarization modulation and homodyne detection, it can cancel the phase noise and is attractive at a high bit-rate transmission. It is found that the receiver sensitivity of the proposed POLSK homodyne system is the same as that of POLSK heterodyne system and is much better than that of DPSK phase-diversity homodyne systems at high signal-to-noise ratio (SNR). We also cosider theoreically the effect of the fluctuation of state of polarization (SOP) on the BER performance of POLSK homodyne system.

The effect of an optical hard-limiter on the performance of direct-detection optical synchronous code-division multiple-access (CDMA) systems with M-ary pulse position modulation (PPM) signaling is analyzed. Moreover, the effect of the error correction coding on the performance of direct-detection optical synchronous CDMA systems with PPM signaling is analyzed: Reed-Solomon (RS) codes and convolutional codes (CC's) with soft-decision Viterbi decoding are employed. We analyze the performance under the assumption of Poisson shot noise model for the receiver photodetector and the noise due to the detector dark currents is considered. We analyze the performance under average power and bit rate constraints. Our results show that the optical hard-limiter is not effective for improving the performance of the optical CDMA systems with PPM signaling. Moreover, RS codes are shown to be more effective than CC's with soft-decision Viterbi decoding to reduce an asymptotic floor to the error probability of the system with large M, while CC's with soft-decision Viterbi decoding is more effective than RS codes for the system with small M. Furthermore, we show that as the code rate of the error correction code increases, the required average energy to achieve the bit error probability Pb105 for the RS coded PPM/CDMA system appreciably increases compared with that for the convolutional coded PPM/CDMA system when M16.

In this paper the normalized lease mean square (NLMS) algorithm based on clipping input samples with an arbitrary threshold level is studied. The convergence characteristics of these clipping algorithms with correlated data are presented. In the clipping algorithm, the input samples are clipped only when the input samples are greater than or equal to the threshold level and otherwise the input samples are set to zero. The results of the analysis yield that the gain constant to ensure convergence, the speed of the convergence, and the misadjustment are functions of the threshold level. Furthermore an optimum threshold level is derived in terms of the convergence speed under the condition of the constant misadjustment.

When N oscillators are coupled by one resistor, we can see N-phase oscillation, because the system tends to minimize the current through the coupling resistor. Moreover, when the hard oscillators are coupled, we can see N, N - 1, , 3, 2-phase oscillation and get much more phase states. In this study, the two types of coupled oscillators networks with third and fifth-power nonlinear characteristics are proposed. One network has two-dimensional hexagonal structure and the other has two-dimensional lattice structure. In the hexagonal circuit, adjacent three oscillators are coupled by one coupling resistor. On the other hand, in the lattice circuit, four oscillators are coupled by one coupling resistor. In this paper we confirm the phenomena seen in the proposed networks by circuit experiments and numerical calculations. In the system with third-power nonlinear characteristics, we can see the phase patterns based on 3-phase oscillation in the hexagonal circuit, and based on anti-phase oscillation in lattice circuit. In the system with fifth-power nonlinear characteristics, we can see the phase patterns based on 3-phase and anti-phase oscillation in both hexagonal and lattice circuits. In particular, in these networks, we can see not only the synchronization based on 3-phase and anti-phase oscillation but the synchronization which is not based on 3-phase and anti-phase oscillation.

This peper proposes a simplified model of the well-known two-neuron neural oscillator. By eliminating one of the two positive feedback synapses in the neural oscillator, learning for the in-phase control of the oscillator is shown to be achievable via a very simple learning rule. The learning rule is devised in such a way that only the plasticity of two synaptic weights are required. We demonstrate some examples of the synchronization learning to validate the efficiency of the learning rule, and finally by illustrating the dynamics of the synchronization learning and by using computer simulation, we show the convergence behavior and the stability of the learning rule for the two-neuron simple neural oscillator.

A fast Viterbi decoding technique with path reduction in optical channels is presented. This decoding exploits the asymmetric characteristic of optical channels. In the decoding trellis, the branches with low or no possibility being correct path are eliminated based on the detected signal level. The number of Add-Compare-Select (ACS) operations which occupy the dominant part of Viterbi decoding is considerably reduced due to branch eliminations, and fast decoding is realized by decoding asynchronously to received sequence. The reduction of the number of ACS operations is derived for the codes with rate 1/2. It is shown that the number of ACS operations is considerably reduced compared with the conventional Viterbi decoding. The bit error probability of the proposed decoding is derived for noiseless photon counting channel. It is also shown that the decoding technique can be applied to the cases using avalanche photo diode (APD) based receiver with dark current noise at a cost of negligible degradation on the bit error probability.

In this paper, we develop a unified synthesizing approach for the cloning templates of Cellular Neural Networks (CNNs). In particular, we shall consider the case when the signal processing problem is complex, and a multilayered CNN with time-variant templates is necessary. The method originates from the existence of correspondence between the cloning templates of Cellular Neural Network and its discrete counterpart, Discrete-Time Cellular Neural Network (DTCNN), in solving a prescribed image processing problem when time-variant templates are involved. Thus, one can start with calculating the cloning templates from DTCNN, and then translating the cloning templates to those for CNN operations. As a result, the mathematical tools being used in the synthesis of Discrete-time Cellular Neural Network can also be applied to the analog type Cellular Neural Network. This inevitably helps to simplify the design problem of CNN for signal processing. Examples akin to contour drawing and parallel thinning are shown to illustrate the merits of our proposed method.