Scattering characteristics of a stratified chiral slab, which is composed of dielectric chiral layers of different material properties and thicknesses, are extensively explored. Design considerations for optical filters are also presented for both the cases of normal and oblique incidence. In the analysis, the incident field is assumed to be a plane monochromatic wave of any arbitrary polarization. The transmitted and reflected electric fields are obtained by noting the fact that the electric field inside a chiral medium is expressed as a sum of the left- and right-circularly polarized plane waves of different phase velocities. Then one can describe the power densities and the Stokes parameters of the transmitted and reflected waves in terms of their field components. As is well known,the Stokes parameters characterize every possible state of polarization of a plane wave. Numerical examples are presented to show the effects of chirality on polarization conversion properties of the stratified chiral slab. The cross- and co-polarized powers and the Stokes parameters of the transmitted and reflected waves are computed for the incident wave of perpendicular polarization. The numerical results demonstrate novel depolarization properties of the slab with application to the design of efficient filters active at the optical region. It is seen from the results that the stratified chiral slab acts as a polarization-conversion transmission filter that passes only a cross-polarized component of the transmitted wave at some frequency band. Furthermore, the slab may be utilized as an antireflection filter for both the cross- and co-po1arized components of the reflected wave at the band region.

A linear block code has a finite-length trellis diagram which terminates at the length of the code. Such a trellis diagram is expressed and constructed in terms of sections. The complexity of an L-section trellis diagram for a linear block code is measured by the state and branch complexities, the state connectivity, and the parallel structure. The state complexity is defined as the number of states at the end of each section of the L-section trellis diagram, the branch complexity is defined as the number of parallel branches between two adjacent states, the state connectivity is defined in terms of the number of states which are adjacent to and from a given state and the connections between disjoint subsets of states, and the parallel structure is expressed in terms of the number of parallel sub-trellis diagrams without cross connections between them. This paper investigates the branch complexity, the state connectivity, and the parallel structure of an L-section minimal trellis diagram for a binary linear block code. First these complexities and structure are expressed in terms of the dimensions of specific subcodes of the given code. Then, the complexities of 2i-section minimal trellis diagrams for Reed-Muller codes are given.

This paper presents a potential FM double modulation technique for subcarrier optical transmission in order to improve the input dynamic range. The proposed theory of FM double modulation is presented. The BER performance and input dynamic range are shown theoretically and experimentally compared with conventional direct intensity modulation. It was found that the dynamic range could be experimentally improved by 20dB compared with the conventional method by using FM double modulation. The proposed technique achieved an input dynamic range of 60 dB even when using a commercial Fabri-Perot LD.

Redundancy is introduced by sampling a bandlimited signal at a higher rate than the Nyquist rate. In the cases of erasures due to fading or jamming, the samples are discarded. Therefore, what we get at the output of the receiver is a set if nonuniform samples obtained from a uniform sampling process with missing samples. As long as the rate of nonuniform samples is higher than the Nyquist rate, the original signal can be recovered with no errors. The sampling theorem can be shown to be equivalent to the fundamental theorem of information theory. This oversampling technique is also equivalent to a convolutional code of infinite constraint length is the Field of real numbers. A DSP implementation of this technique is through the use of a Discrete Fourier Transform (DFT), which happens to be equivalent to block codes in the field of real numbers. An iterative decoder has been proposed for erasure and impulsive noise, which also works with moderate amount of additive random noise. The iterative method is very simple and efficient consisting of modules of Fast Fourier Transforms (FFT) and Inverse FFT's. We also suggest a non-linear iterative method which converges faster than the successive approximation. This iterative decoder can be implemented in a feedback configuration. Besides FFT, other discrete transforms such as Discrete Cosine Transform, Discrete Sine Transform, Discrete Hartley Transform, and Discrete Wavelet Transform are used. The results are comparable to FFT with the advantage of working in the field of real numbers.

A quantum interconnection scheme by controlling the Coulomb interaction between ballistic electrons is proposed in which 2DEG (2 dimensional electron gas) plays the role of an interconnection medium. This concept brings up new possibilities for the interconnection approach in various fields such as parallel processing, telecommunications switching, and quantum functional devices. Cross-over interconnection, address collision, and address selection in a quantum information network system were analyzed as the first step. The obtained results have shown that the interconnection probability can be controlled by the velocity and timing of the ballistic electron emission from the emitter electrode. The proposed interconnection scheme is expected to open up a new field of quantum effect integrated circuits in the 21st century.

Corresponding to the development of B-ISDN, integrated services for data, voice, etc. are imperatively required for the so called third generation wireless communication networks. In this paper, I-ISMA (Idle Signal Multiple Access for Integrated services) is proposed to transmit integrated voice and data traffic from dispersed terminals to a base station. In the system, data packets and the first packets of talkspurts of conversational speeches are transmitted using ISMA protocol over a shared channel while subsequent packets of talkspurts are sent with time reservation technique. The channel capacity of I-ISMA is evaluated and compared with that of PRMA. The region in which I-ISMA has larger capacity than PRMA is figured out. Generally speaking, I-ISMA has larger capacity than PRMA when the duration for transmitting and detecting an idle signal is not too long and the channel is not too congested by the reserved voice transmissions. When we concern real time voice transmission, delay is one of the most important performance measures. Only is a qualitative discussion on delay performance given here. The quantitative evaluation is obtained by the dynamic analysis in our succeeding paper.

Markov chain models are used to derive the average stationary throughput and delay performance of Idle-Signal Casting Multiple Access (ICMA), with and without Failure Detection (/FD), protocols which are suitable for use in mobile packet radio local area networks, where propagation impairments are prevalent. The models consider the effects of pure Rayleigh fading on channel access and packet transmission. Numerical results, validated by computer simulations, are obtained that enable a quantitative study of the performance of the protocols. It is found that the performance of the ICMA/FD protocol is affected more significantly by fading on the base-to-mobile channel than is the performance of the ICMA protocol. In addition, performance improves with larger packet sizes eventhough such packets are more vulnerable to failure due to fading.

This letter discusses a behavior of solitons in a Josephson junction transmission line which is described by a perturbed sine-Gordon equation. It is shown that a soliton wave leads a quasi-periodic break down route to chaos in a Josephson transmission line. This route show phase locking, quasi-periodic state, chaos and hyper chaos, and these phenomena are examined by using Poincar sections, circle map, rotation number, and so on.

Logic synthesizers usually have good area minimization capabilities, producing circuits of minimal area. But good delay minimization techniques are still missing in current logic synthesis technology. In [7], the RENO algorithm (which stands for REsynthesis for Network Optimization) was proposed for minimizing the area of multi-level combinational networks, and its effectiveness in designing minimal-area networks has been demonstrated. In this paper, we present improvements and extensions of the RENO algorithm for network delay minimization by using Boolean resynthesis techniques. We will discuss new algorithms for gate resynthesis which have not only reduced the processing time significantly, but also have improved the quality of minimization. Due to the generality of the gate resynthesis algorithms, we can minimize both delay and area of a network concurrently in a unified way, and network delay is reduced significantly with no or very small area penalty. Extensive experimental results and comparison with the speed_up algorithm in SIS-1.0 are presented.

This paper reviews fiber optic link techniques from the microwave and millimeter-wave transmission point of view. Several architectures of fiber optic links are reviewed. The application of MMIC technologies to the optical receivers are discussed and 26-GHz subcarrier transmission experimental works are described. Novel fiber optic links which utilize both optical device nonlinearities and microwave functional circuits are also reviewed. A system concept of millimeter-wave cellular radio using fiber optic links is finally discussed.

We have developed a new HIGFET structure achieving an extremely high K-value of 13.3 S/Vcm with a gate length of 0.15 µm. Self-aligned ion implantation is excluded to suppress a short-channel effect. An i-GaAs cap layer and an n+-GaAs contact layer are employed to reduce source resistance. The threshold voltage shift is as small as 50 mV when the gate length is reduced from 1.5 µm to 0.15 µm. Source resistance is estimated to be 53 mΩcm. We have also developed a new fabrication process that can achieve a shorter gate length than the minimum size of lithography. This process utilizes an SiO2 sidewall formed on the n+-GaAs contact layer to reduce the gate length. A gate length of 0.15 µm can be achieved using 0.35 µm lithography.

In this paper, a definitce relation between the TSP's optimal solution and the attracting region in the parameters space of TSP's energy function is discovered. An many attracting region relating to the global optimal solution for TSP is founded. Then a neural network algorithm with the optimized parameters by using Orthogonal Array Table Method is proposed and used to solve the Travelling Salesman Problem (TSP) for 30, 31 and 300 cities and Map-coloring Problem (MCP). These results are very satisfactory.

This paper presents two new maximum likelihood decoding (MLD) algorithms for linear codes over Z-channel, which are much more efficient than conventional exhaustive algorithms for high rate codes. In the proposed algorithms, their complexities are reduced by employing the projecting set Cs of the code, which is determined by the "projecting" structure of the code. Space and computational complexities of algorithms mainly depend upon the size of Cs which is usually several times smaller than the total number of codewords. It is shown that the upper bounds on computational complexities of decoding algorithms are in proportion to the number of parity bits and the distance between an initial estimate of the codeword and the received word, respectively, while space complexities of them are equal to the size of Cs. Lastly, numerical examples clarify the average computational complexities of the proposed algorithms, and the efficiency of these algorithms for high rate codes is confirmed.

A technique for reducing fiber four-wave mixing (FWM) in multichannel transmissions is proposed. Birefringent elements are inserted on the way of transmission lines. Due to the effect of birefringent elements on the polarization states, the effective crosstalk due to FWM is expected to be 3/16 of that in the worst case in conventional systems.

Recently, the small set of nonbinary Kasami sequences was presented and their correlation properties were clarified by Liu and Komo. The family of nonbinary Kasami sequences has the same periodic maximum nontrivial correlation as the family of Kumar-Moreno sequences, but smaller family size. In this paper, first it is shown that each of the nonbinary Kasami sequences is unbalanced. Secondly, a new family of nonbinary sequences obtained from modified Kasami sequences is proposed, and it is shown that the new family has the same maximum nontrivial correlation as the family of nonbinary Kasami sequences and consists of the balanced nonbinary sequences.

A model for a large network with an unidirectional linear respone (ULR) is proposed in this letter. This deterministic system has powerful computing properties in very close correspondence with earlier stochastic model based on McCulloch-Pitts neurons and graded neuron model based on sigmoid input-output relation. The exclusive OR problems and other digital computation properties of the earlier models also are present in the ULR model. Furthermore, many analog and continuous signal processing can also be performed using the simple ULR neural network. Several examples of the ULR neural networks for analog and continuous signal processing are presented and show extemely promising results in terms of performance, density and potential for analog and continuous signal processing. An algorithm for the ULR neural network is also developed and used to train the ULR network for many digital and analog as well as continuous problems successfully.

A new method of multipath diversity combination is proposed for Direct Sequence Spread Spectrum (DS-SS) mobile communications. In this method, the transmitted signal from the base staion is the sum of a number of the same spread signal, each one delayed and scaled according to the delay and the strength of the multipaths of the transmission channel. As a result the received signal at the mobile unit will already be a Rake combination of the multipath signals. This new method is called Pre-Rake diversity combination because the Rake diversity combination process is performed before transmission By this method the size and complexity of the mobile unit can be minimized, and the unit is made as simple as a non-combining single path receiver. A theoretical examination of the Signal to Noise Ratio (SNR) and the Bit Error Rate (BER) results for the traditional Rake and the Pre-Rake combiners as well as computer simulations show that the performance of the Pre-Rake combiner is equivalent to that of the Rake combiner.

An adaptive signal processing using Acoustic Charge Transport device, which has great potential for processing very wide band signals in real time, is investigated. It shows that adaptive system for signals of bandwidth from dc up to 500 MHz can be implemented in real time.

In this paper, we propose an adaptive RAKE receiver, which does not need to send the sounding signals and can track the fluctuations caused by fading. The channel estimation can be done by using a least squares method of the first and second equations suppressing additive noise and tracking the channel fluctuations. It is confirmed by computer simulations that the result has good agreement with theory and the performance is almost same as that of the conventional RAKE with the sounding signals.

Indoor radio communications is an important component of the emerging personal communication systems service. It is also the basis for wireless local area networks. The indoor radio channel is characterized by fading multipaths as well as noise. Direct sequence spread spectrum (DSSS), with its inherent resistance to multipath interference is an attractive technique for this environment. To allow multiple users within the limited bandwidths available, code division multiple access is needed. This paper analyzes the performance of a DSSS scheme employing random orthogonal codes over fading multipath indoor radio channels using actual channel measurements from five different locations. A RAKE receiver is used to study the effects of power control, code length and receiver structure. The average probability of error as a function of signal-to-noise ratio or as a function of the number of simultaneous transmitters is used as the performance criteria.