This paper describes voice communication connection controls in digital public land mobile networks (D-PLMNs). Voice communications in the D-PLMNs are carried at about 10 kbit/s over narrow-band TDMA channels with highly efficient cellular voice encoding schemes. Extensive research is being carried on half-rate voice encoding schemes that will effectively double radio resources. We first outline the configuration of voice communication connection between a cellular phone in the D-PLMN and a telephone in a fixed network, and we describe the optimum position for the CODECs that transform cellular voice codes to the conventional voice codes used in the fixed network, and vice versa. Then we propose a CODEC-bypassed communication control scheme that improves the quality of voice communication between cellular phones. And we propose a cellular voice code negotiation scheme in the D-PLMN which supports different cellular voice encoding schemes. We also propose an efficient channel reassignment scheme for effectively assigning TDMA channels to voice calls with two different bitrates (full-rate and half-rate), and we analyze this scheme's traffic capability. Finally, we describe a dual-tone multiple-frequency (DTMF) signal transmission scheme and estimate the number of DTMF signal senders required in the D-PLMN.

Two types of multicast error control protocols based on a product code structure with or without interleaving are considered. The performances of these protocols are analyzed on burst error channels modeled by Gilbert's two-state Markov chain. The numerical results reveal that the interleaving does not always succeed in improving the performance of the protocol proposed in Part .

MISRs are widely used as signature circuits for VLSI built-in self tests. To improve the aliasing probability of MISRs, multiple MISRs and M-stage MISRs with m inputs are available, where M is grater than m. The aliasing probability as a function of the test length is analyzed for the compaction circuits for a binary symmetric channel. It is observed that the peak aliasing probability of the double MISRs is less than that of M-stage MISRs with m inputs. It is also shown that the final aliasing probability for a multiple MISR with d MISRs is 2dm and that for an M-stage MISR with m imputs is 2M if it is characterized by a primitive polynomial.

A new design method is proposed for realizing a hypercube network (HC) structured multicomputer system on a wafer using wafer-scale integration (WSI). The probability that an HC can be constructed on a wafer is higher in this method than in the conventional method; this probavility is called a construction probability. We adopt the FUSS method for the processor (PE) address allocation in our desing because it has a high success probability in the allocation. Even if the design renders the address allocation success probalility hegher, it is of no use if it makes either the maximum wiring length between PEs or the array size (wiring area) larger. A new wiring channel structure capable of connecting PEs on a wafer is proposed in this paper, where a channel, called a basic channel, is used. A one-dimensional-array sub-HC row network (RN) or column networks (CN) can be constructed using the basic channel. The sub-HC construction method, which embeds wirings into the basic channel, is also proposed. It requires almost the same wiring width as conventional method. However, it has an advantage in that maximum wiring length between PEs can be about half that of the conventional method. If PEs must be shifted in the case of PE defects, they can be shifted and connected to the basic channel using other PE shifting channels, and an RN or CN can be constructed. The maximum wiring length between PEs, array size, and construction probability will also be derived, and it will be shown that the proposed design is superior to the conventional one.

This paper presents an efficient algorithm for computing the capacity of discrete memoryless channels. The algorithm uses Newton's method which is known to be quadratically convergent. First, a system of nonlinear equations termed Kuhn-Tucker equations is formulated, which has the capacity as a solution. Then Newton's method is applied to the Kuhn-Tucker equations. Since Newton's method does not guarantee global convergence, a continuation method is also introduced. It is shown that the continuation method works well and the convergence of the Newton algorithm is guaranteed. By numerical examples, effectiveness of the algorithm is verified. Since the proposed algorithm has local quadratic convergence, it is advantageous when we want to obtain a numerical solution with high accuracy.

A new channel stop design for submicton local oxidation of silicon (LOCOS) isolation was presented. The n-channel stop was designed with boron implanation after forming LOCOS, while the p-channel stop was constructed with high energy phosphorus or arsenic implantation before or after forming LOCOS. These optimized channel stop designs can extend an isolation spacing to the submicron region without a decrease in junction breakdown voltage and an increase in junction leakage current. Narrow channel effects were found to be effectively suppressed by optimum channel stop design issues.

In this paper, a type hybrid ARQ scheme with Adaptive Forward Error Correction (ARQ/AFEC) using BCH codes is proposed and analyzed. The basic idea in the proposed type hybrid ARQ/AFEC scheme is to increase the error-correcting capability of BCH code according to channel state using incremental redundancy. The incremental redundancy is the remainder ai(x) of an information frame f(x) of length n divided by a minimum polynomial mi(x) of α2i-1, where α is a primitive element of finite field GF(2l). Let gi(x) be the product of mj(x) (j=1, 2, , i) and let ci(x) be the remainder of f(x) divided by gi(x). The polynomial ci(x) is obtained from the remainders ai(x) and ci-1(x) since mi(x)and gi-1 (x) are relatively prime. Since f(x) + ci(x) is divided by gi(x), f(x) + ci(x) is the codeword of an i-error-correcting BCH code when n2l-1. So, the errors less than or equal to i bits in f(x) can be corrected if ci(x) has no error.

Thin Si films grown on anodized porous silicon have been characterized using a high-energy ion scattering technique with related simulations of MeV ions in solids. It turned out that the simulations are necessary and very usuful for quantitative and nondestractive analysis of thin films with thicknesses less than 100 nm. In the case of the epitaxial Si films examined, it is often insufficient for the characterization of crystalline quality to measure only the channeling minimum yield, and therefore, it is emphasized that angular scans over the critical angle in the vicinity of a channeling direction must be performed for the analysis of possible imperfections in thin films. The possible imperfections observed in the epitaxial specimen are treated quantitatively.

It is difficult for a receiver in Asynchronous SSMA systems to eliminate co-channel interference, when the receiver doesn't know the sequence of the co-channel interference. In this paper, a filter for eliminating co-channel interference without using the knowledge of the sequence of co-channel interference in an asynchronous SSMA system, in which each transmitter/receiver is assigned an infinite number of sequences and select a sequence secretly for information security. The filter gathers the co-channel interference energy into some puleses and scatters the signal energy widely. The receiver can clip the co-channel interference energy by losing small amount of signal energy. This is a new solution for the near-far problem in an asynchronous SSMA system using secret sequences.

Quadrature Amplitude Modulation (QAM) schemes are attractive in terms of bandwidth efficiency and offer a number of subchannels with different integrities via both Gaussian and Rayleigh-fading channels. Specifically, the 16-QAM phasor constellation has two, while the 64-QAM possesses three such subchannels, which become dramatically different via Rayleigh-fading channels. The analytically derived bit error rate (BER) formulae yield virtually identical curves with simulation results, exhibiting adequate BERs for the highest integrity subchannels of both 16-QAM and 64-QAM to be further reduced by forward error correction coding (FEC). However, the BERs of the lower integrity subchannels require fading compensation to reduce their values for FEC techniques to become effective. This property creates ground for a variety of carefully matched, embedded mobile transmission schemes of different complexities. The practical implementation of such an embedded scheme is demonstrated by a low-cost, low-complexity and low-consumption 50KBd mobile video telephone scheme offering adequate speech and image quality for channel SNRs in excess of about 20dB via Rayleigh-fading channels.

This paper analyzes the performance of the capacity controlled digital radio system, which controls the number of modulation levels according to the amount of traffic. These analyses are performed under thermal noise and co-channel interference. As a result, the throughput improvement is approximately 16 times comparing with the fixed capacity system which has the designed outage probability of 0.1%. Theoretical results are applied to the future mobile communication system which utilizes TDMA access method or burst co-dec, and it is found that the reuse distance can be improved to 1/5 times when the designed outage probability is 0.1%.

In recent years, the digitalization of transmission links, such as optical fibre cables, satellite links, and terrestrial microwave links, has been progressed rapidly in many countries. In addition, many types of digital studio equipment have been developed and TV programs can be produced or edited without any picture quality degradation by using such equipment, for example, digital VTR. A high-efficiency bit-reduction coding system is the most promising and effective means for this situation in terms of reducing the cost of digital transmission of TV programs with high picture quality. Considering this background, a new digital coding system has been developed, which makes it possible to transmit up to 4 NTSC TV programs simultaneously over a single DS3 45Mbps link including two high quality sound channels and one 64kbps ancillary data channel for each TV program. The principal bit-reduction technique employed is 2 dimensional intraframe WHT (Walsh Hadamard Transform) coding, which gives higher coding performance for composite TV signals than DCT (Discrete Cosine Transform) coding. In order to attain high picture quality at around 8Mbps for 4 channel transmission, a 3 dimensional adaptive quantization cube which reflects human visual perception sufficiently is employed in the intraframe WHT coding scheme. The hardware has been made compact like a home use VTR. In this paper, first, the algorithm of the coding scheme developed for the coding system is presented, and then the system configuration and its basic coding performance are described.

It is known that the uniquely decodable code pairs (C1, C2) for the two-user binary adder channel relates to the maximum independent set of a graph associated with a binary code. This paper formulates the independence number of a class of graphs associated with binary linear codes, and presents an algorithm of the maximum independent set for those graphs. Uniquely decodable code pairs (C1, C2)'s are produced, where C1 is a linear code and C2 is a maximum independent set of the graph associated with C1. For the given C1, the transmission rate of C2 is higher than that by Khachatrian, which is known as the best result as so far. This is not rather surprising because the code C2 is a maximum independent set in this paper but not be Khachatrian's.

A layout system for mixed analog/digital standard cell LSI's is described. The system includes interactive floorplan and placement features and automatic global and channel router. In mixed analog/digital circuits, crosstalk noise causes chip performance degradation. Thus, the proposed global routing algorithm routes analog nets in areas that are free of digital nets as much as possible. The number of line crossovers, especially for analog nets, is minimized by both global and detailed routers, because these crossovers are the dominant factors in the crosstalk noise. Double width lines can be used to avoid unexpected voltage drops caused by parasitic resistances. A postprocess automatically puts up shield lines for very noise sensitive wirings to improve the S/N ratio. Experimental results show that the proposed algorithms are effective in reducing the number of crossovers and redundant vias.

In general, dynamic channel assignment has a better performance than fixed channel assignment in a cellular mobile communication system. However, it is complex to control the system and a lot of equipments are required in each cell when dynamic channel assignment is applied to a large service area. Therefore, it is effective to limit the size of the service area in order to correct the defects of dynamic channel assignment. So, we propose an application of dynamic channel assignment to a part of a service area when fixed channel assignment is applied to the remaining part of the area. In the system, the efficiency of channel usage in some cells sometimes becomes terribly low. The system has such a problem to be improved. We show that the rearrangement of the channel allocation is effective on the problem.

This work describes a new analytical MOSFET model for analog circuit simulation based on the charge-sheet model. The current equation consists of diffusion and drift components, therefore Ids is a smooth function of the applied voltages. Since the original charge-sheet model is valid only for long-channel transistors, it has been further developed to describe quarter-micron MOSFETs by introducing the lateral electric field Ey into the theory. The new model includes these field contributions self-consistently, and describes the drain current of MOSFETs from long to quarter-micron channel lengths with a single model parameter set without discontinuities in derivatives of the drain current Ids. The mobility reduction due to Ey is described by an empirical equation with physical parameter values taken from literature. Only two fitting parameters, the impurity scattering and the surface roughness scattering in the mobility equation, are added to the physical parameters. The subdiffusion lengths are also taken as fitting parameters. Though the new model reduces the number of fitting parameters totally to four, it reproduces measured Ids excellently for MOSFETs with all channel lengths. The model has been included in the parameter extraction program JANUS, which extracts model parameters automatically. The algorithm for parameter extraction is summarized.

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.