In this paper, the bit error rate (BER) performance of the Spread Spectrum communication with Constrained Spreading Code system is studied under the synchronous CDMA system. Particularly, BER considering the tracking error is derived by theoretical analysis. The synchronizing spreading sequence is employed to track the signals in the receiver. As the result, the BER performance is degraded by increasing the number of users. However, the BER performance can be improved by canceling the co-channel interference and by suppressing the cross-correlation value between the information spreading sequence and the synchronizing spreading sequence.

In this paper, a new overload control strategy is proposed for a call control processor (CCP) in the base station controller (BSC) and processor utilization is measured. The proposed overload control strategy can regulate the call attempts by adopting measured processor utilization. A function, specifically a linear interpolation function based on Inverse Transform theory is used to convert controlled predictive average load rate in a call rejection rate. Then a call admission rate is obtained from the call rejection rate. Simulation shows that the proposed algorithm yields better performance than the conventional algorithm does under the heavy transient overload status in terms of call admission rate.

M-ary/SS systems are compared with DS/SS systems applied the multicarrier systems and the RAKE receiver in the presence of AWGN, frequency selective Rayleigh fading and partial-band interference. In particular, the BER performance and SSMA capability are evaluated. Consequently, the M-ary/SSMA system using the multicarrier techniques is subject to the M-ary/SSMA system with the RAKE receiver in the presence of partial-band interference. The BER performance of the M-ary/SSMA system is better than that of the DS/SSMA system when the number of users is smaller than 20. And the spectral efficiency of the multicarrier M-ary/SSMA system is best in the four systems when JSR=20 [dB] and BER=10-3.

Differences in the behavior of dispenser cathodes and oxide cathodes in laminar-flow type and crossover type electron guns were investigated by experiments and simulations under high-current-density conditions. When an oxide cathode is operated under such conditions, the heating effect due to Joule heat in the oxide layer exceeds the cooling effect, depending on the product of the work function and the cathode current, resulting in a rise in the cathode temperature. This rise in cathode temperature aggravates deterioration of emission characteristics during the life of an oxide cathode. In the case of the dispenser cathode, however, the cathode temperature decreases under high-current-density conditions. When an oxide cathode in a crossover type electron gun is operated, equipotential surfaces are formed in the curved surface in the oxide layer. The formation of an equipotential surface leads to relaxation of the loading. It is considered that this is the reason for the longer life of an oxide cathode in a crossover type electron gun than that of an oxide cathode in a laminar-flow type electron gun.

We discuss optimal rotation estimation from two sets of 3-D points in the presence of anisotropic and inhomogeneous noise. We first present a theoretical accuracy bound and then give a method that attains that bound, which can be viewed as describing the reliability of the solution. We also show that an efficient computational scheme can be obtained by using quaternions and applying renormalization. Using real stereo images for 3-D reconstruction, we demonstrate that our method is superior to the least-squares method and confirm the theoretical predictions of our theory by applying bootstrap procedure.

In this paper, Orthogonal Multicode OFDM-DS/CDMA system using Partial Bandwidth Transmission is proposed. By using the flexible carrier allocation of OFDM, Partial Bandwidth Transmission is considered for high quality communication. Furthermore, multicode packet data transmission is presented. Multicode packet data transmission is very effective to handle variable data. Since the proposed system can detect the header information without complex control, it is also suitable for packet data transmission. The computer simulation results show that the BER performance of the proposed system with the ideal channel estimation is improved compared with the case of the conventional Orthogonal Multicode DS/CDMA system with ideal RAKE receivers. Moreover the proposed system with the channel estimation by MLS algorithm also shows the good BER performance. In packet data transmission, the delay and throughput performances are also improved in the proposed system.

This paper proposes local lightwave networks with grouping property which are based on a wavelength division multiplexing (WDM). The proposed network is partitioned into several groups according to traffic volume between stations so that traffic is more likely to be within groups. The stations within a group are connected to a broadcast-and-select WDM network with star topology. For inter-group communication, a WDM network of each group is connected to another star-topology WDM network through a special station called a router. In the proposed network, intra-group communication is achieved by one hop and inter-group communication goes through multiple hops. We analyze the average hop number, the maximum throughput, and the mean packet delay of the proposed network and investigate its performance characteristics. Since the proposed network has the better performance as its grouping property strengthens, it is fit for local lightwave networks with the locality of traffic.

A novel cell-level FEC (forward error correction) scheme at SSCS of AAL type 5 for error-free data transmission services in ATM networks is proposed and evaluated. In the proposed cell-level FEC scheme, both the length of user data (e. g. , IP packet) and attached redundant data can be modified based on sender's local decision without any end-to-end parameter re-negotiation procedure. The writing and reading order regarding an interleave matrix for cell-level FEC algorithm are the same, in order to perform pipelining data transmission. The prototype implementation with software processing achieves few Mbps end-to-end throughput. The end-to-end data transmission latency and the amount of retransmission packets due to packet error at the receiver entity are evaluated by computer simulation with correlated cell dropping process. Simulation results show that the benefits of cell-level FEC scheme for the error-free data transmission services, i. e. , by use of cell-level FEC scheme, the amount of retransmitted packets can be reduced, even if the average latency for end-to-end data transmission increases slightly.

In this paper, a virtual-short circuit which consists of only two MOS transistors operated in the weak-inversion region is proposed. It has the advantages of almost zero power consumption, low voltage operation, small chip area, and no needlessness of bias voltages or currents. The second order effects, such as the device mismatch, the Early effect, and the temperature dependency of the circuit are analyzed in detail. Next, current-controlled and voltage-controlled current sources using the proposed virtual-short circuit are presented as applications. The performance of the proposed circuits is estimated using SPICE simulation with MOSIS 1. 2 µm CMOS device parameters. The results are reported on this paper.

We propose a novel soft-decision decoding algorithm for cyclic codes based on energy minimization principle. The well-known soft-decision decoding algorithms for block codes perform algebraic (hard-decision) decoding several times in order to generate candidate codewords using the reliability of received symbols. In contrast, the proposed method defines energy as the Euclidean distance between the received signal and a codeword and alters the values of information symbols so as to decrease the energy in order to seek the codeword of minimum energy, which is the most likely codeword. We let initial positions be the information parts of signals obtained by cyclically shifting a received signal and look for the point, which represents a codeword, of minimum energy by moving each point from several initial positions. This paper presents and investigates reducing complexity of the soft-decision decoding algorithm. We rank initial positions in order of reliability and reduce the number of initial positions in decoding. Computer simulation results show that this method reduces decoding complexity.

This paper presents the performance of FH/MFSK systems, which exploit silent gaps in speech to accommodate more users, over Rayleigh fading channels. Two kinds of receivers are considered: one uses a threshold on the received signal strength to declare whether the signals were present or not, and the other is assumed to have perfect transmitter-state information obtained from using additional bandwidth. Results show that, if the codeword dropping and codeword error are assumed to be equally costly, the former can achieve slightly better performance than the latter in the decoding error probability. This finding suggests that, for the system to exploit silent gaps in speech, it is advantageous for the receiver to use a threshold to declare whether signals were present or not instead of relying on the transmitter-state information.

The DC component suppressing method, called Guided Scrambling (GS), has been proposed, where a source bit stream within a data block is subjected to several kinds of scrambling and a RLL (Run Length Limited) coding to make the selection set of channel bit streams, then the one having the least DC component is selected. Typically, this technique uses a convolutional operation or GF (Galois field) conversion. A review of their respective symbol error properties has revealed important findings. In the former case, the RS (Reed-Solomon) decoding capability is reduced because error propagation occurs in descrambling. In the latter case, error propagation of a data block length occurs when erroneous conversion data occurs after RS decoding. This paper introduces expressions for determining the decoded symbol error probabilities of the two schemes based on these properties. The paper also discusses the difference in code rates between the two schemes on the basis of the result of calculation using such expressions.

Reentrant delay line memories using narrow YBa2Cu3O7-δ (YBCO) coplanar transmission lines are proposed. The proposed memory is composed of a looped YBCO coplanar delay line and a 22 semiconductor crossbar switch. This type of memory is superior to semiconductor memories in operating speed, the number of logic gates, power dissipation, and so on. We have also developed narrow and low-loss YBCO coplanar transmission lines for use in these reentrant delay line memories. Etch-back planarization and a patterning process combining Ar-ion milling and wet-etching enabled us to fabricate 18-cm-long YBCO coplanar transmission lines as narrow as 5 µm, and these lines did not suffer from electrical shorts even when the spacing was only 2. 5 µm. The surface resistances calculated from the attenuation constants of 5-, 10-, and 25-µm-wide lines provide similar low values of 0. 18-0. 26 mΩ at 10 GHz and 55 K. This indicates that the process damage was sufficiently suppressed despite the narrow line widths. The 5-µm-wide line attained a low attenuation constant of 2. 7 dB/m, which is similar to that in Cu coaxial cables. Even in the 5-µm-wide line, no significant increase in transmission loss was observed up to an input power level of 16 mW at 10 GHz and 55 K. This input power is comparable to that required to propagate digital signals from semiconductor circuits. Therefore high-speed digital signals can propagate through these narrow YBCO coplanar lines without significant attenuation of the signal pulses. Thus, these narrow YBCO coplanar lines can be used in the reentrant delay line memories.

This paper proposes a high-speed connection admission control scheme, named PERB CAC (CAC based on Prior Estimation for Residual Bandwidth). This scheme estimates the residual bandwidth in advance by generating a series of virtual requests for connection. When an actual connection request occurs, PERB CAC can instantaneously judge if the required bandwidth is larger than the estimated residual bandwidth, so the connection set-up time can be greatly reduced. Therefore, PERB CAC can realize high-speed connection set-up.

In this paper the performance of the Block Sorting algorithm proposed by Burrows and Wheeler is evaluated theoretically. It is proved that the Block Sorting algorithm is asymptotically optimal for stationary ergodic finite order Markov sources. Our proof is based on the facts that symbols with the same Markov state (or context) in an original data sequence are grouped together in the output sequence obtained by Burrows-Wheeler transform, and the codeword length of each group can be bounded by a function described with the frequencies of symbols included in the group.

Recently, Garcia and Stichtenoth proposed sequences of algebraic function fields with finite constant fields such that their sequences attain the Drinfeld-Vl bound. In the sequences, the third algebraic function fields are Artin-Schreier extensions of Hermitian function fields. On the other hand, Miura presented powerful tools to construct one-point algebraic geometric (AG) codes from algebraic function fields. In this paper, we clarify rational functions of the third algebraic function fields which correspond to generators of semigroup of nongaps at a specific place of degree one. Consequently, we show generator matrices of the one-point AG codes with respect to the third algebraic function fields for any dimension by using rational functions of monomial type and rational points.

We propose a method of reducing laser-clipping-induced distortion in a subcarrier multiplexed (SCM) optical-cable TV system. This scheme reduces amplitude peaks of the SCM signal by controlling the phases of video carriers to prevent the clipping which occurs when these peaks fall below the threshold of a laser-diode. It is experimentally shown that using this method reduces the bit error rate in an AM-VSB / QAM hybrid optical-transmission system.

For the realization of the very high-speed data transmission over wide area network, the HIPPI-ATM conversion for connecting two remote HIPPI end systems is specified by ANSI. Since the credit scheme is adopted for the flow control on the ATM part in the specification, the propagation delay influences the remarkable transfer throughput degradation with the longer distance between end systems. In this paper, two priority types of HIPPI bursts are proposed, which include the flag indicating the priority, high priority or low priority. We propose the hybrid scheme that the credit scheme is adopted only for sending the high priority HIPPI bursts and the source can send low priority HIPPI bursts without reserving buffers in the receiver. In order to confirm the effectiveness of the proposed scheme, we show the characteristics of transfer performance and low priority bursts loss ratio v. s. transmission distance by simulation. Furthermore, we introduce the implemental example of the proposed scheme in the MPEG video transmission application, and show it's good performance.

A new broadband buffer circuit technique and its analytical design method are proposed for a high-speed decision circuit featuring both a higher input sensitivity and a larger phase margin. The buffer circuit characteristics are significantly improved by employing a series peaking source follower (SPSF), where a peaking inductor is inserted between the first and second source follower stages. Optimization of the peaking inductance successfully enhances the 3-dB bandwidth of the data-input buffer and the clock buffer by 7 GHz for both, over conventional double-stage source follower SCFL buffers. The proposed circuit technique and design method are applied to a 10-Gbit/s decision circuit by the use of production-level 0. 5 µm GaAs MESFETs. The fabricated decision circuit achieves a data input sensitivity of 43 mVp-p and a phase margin of 240 both at 10-Gbit/s: a 230 mVp-p smaller input sensitivity and a 35 larger phase margin than those of conventional non-peaking inductor types.

This paper addresses the problem of determining the 3-D pose of a curved rigid object from a single 2-D image. The surface of the object are assumed to be modeled with several patches, each of which be expressed by an implicit polynomial. Moreover, the sensed data are assumed to be the coordinates of those points that are on the image contours. Based on the idea of contour matching, the algorithm proposed computes the parameters defining the pose of the object, and achieves the segmentation of the sensed data and the recognition of the object.