Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The Journal of Korean Institute of Communications and Information Sciences
Journal Basic Information
Journal DOI :
The Korean Institute of Communications and Information Sciences
Editor in Chief :
Kyung-Hi Chang / Song Chong / Jong-Taek Oh / Jae-Jin Lee / Myung-Sik Yoo
Volume & Issues
Volume 24, Issue 12B - Dec 1999
Volume 24, Issue 12A - Dec 1999
Volume 24, Issue 11A - Nov 1999
Volume 24, Issue 10B - Oct 1999
Volume 24, Issue 10A - Oct 1999
Volume 24, Issue 9B - Sep 1999
Volume 24, Issue 9A - Sep 1999
Volume 24, Issue 8B - Aug 1999
Volume 24, Issue 8A - Aug 1999
Volume 24, Issue 7B - Jul 1999
Volume 24, Issue 7A - Jul 1999
Volume 24, Issue 6B - Jun 1999
Volume 24, Issue 6A - Jun 1999
Volume 24, Issue 5B - 00 1999
Volume 24, Issue 5A - 00 1999
Volume 24, Issue 4B - 00 1999
Volume 24, Issue 4A - 00 1999
Volume 24, Issue 3B - 00 1999
Volume 24, Issue 3A - 00 1999
Volume 24, Issue 2B - 00 1999
Volume 24, Issue 2A - 00 1999
Volume 24, Issue 1B - 00 1999
Volume 24, Issue 1A - 00 1999
Volume 24, Issue 12 - 00 1999
Volume 24, Issue 11B - 00 1999
Selecting the target year
Blind Multi-user Estimation for Asynchronous DS-CDMA Systems
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 939~946
A new blind multi-user channel estimation algorithm for the mobile communication systems is proposed. The proposed algorithm exploits the second-order statistics of a received signal and the subspace concept, and requires much less computational complexity than the existing algorithms. The algorithm can reduce the comptational load by estimating the physical channels excluding the spreading codes. We formulate the algorithm using the multi-channel model for asynchronous DS-CDMA systems and perform numerical experiments to evaluate the performance of the proposed algorithm.
The Design of New Phase Noise Dielectric Resonator Parallel Feedback Oscillator
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 947~954
A new low phase noise Dielectric Resonator Parallel Feedback Oscillator(DRPFO) that is proposed in this paper has a simple structure so that it can be fabricated in low cost and with high performance. The proposed DRPFO is in a feedback loop oscillator configuration, which is composed of a low noise amplifier, a power amplifier, a power attenuator, a power divider and a parallel resonator feedback element that consists of a dielectric resonator coupled with two microstrip lines. The measured phase noise of DRPFO was less than -81 dBc/Hz at offset frequency 1 kHz of 10.75 GHz carrier frequency, and the frequency stability of DRPFO was less than
200 kHz over the temperature range of -40
C to +60
Performance Analysis of Key Distribution Protocol in Satellite Network
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 955~963
In this paper, in other to analyze the performance of efficient key distribution protocol, we evaluate the key distribution processing method of push model like the Kerberos and pull model such as X.9.17 used in wired network. Also, we evaluate the procedure of key distribution protocol in satellite network. Besides, we analyze the performance of key distribution protocol procedure in view of delay and throughput in the case that key distribution protocol is processed based on Inband/Outband channel.
Performance Analysis of Layered Cell Protocol for the Integrated Traffic of Packetized Voice and Low Bit-rate Data
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 964~972
In this paper, we proposed a simulation model to which apply the AAL 2 (AAL type 2) between BSC and MSC in the cellular mobile communication systems. We suggested the frame structure of processing the packets of short length and the scheme which multiplex to one or more ATM cell. Also, we analyzed the performance of the APR, transmission delay, and channel transmission efficiency used in the packetized voice traffic and the low bit-rate data traffic such as fax. From the simulation results, the maximum number of users are 47 users without using AAL 2 multiplexing, but the maximum number of users are 70 (Non-Overlapping scheme) users, 110 (Overlapping scheme) users, respectively. Thus, we knew that the Overlapping scheme is more efficient than the Non-Overlapping scheme. Finally, we showed that the optimum transmission buffer size is 4 ATM cells in the cellular communication systems with the bandwidth of 2 Mbps.
Performance Analysis of MAC Protocol for Packet Data Service in CDMA Based Mobile Communication Systems
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 973~986
In this paper, we propose MAC protocol that consists of channel access mechanism and transmission mechanism to support effective wireless packet data service. In channel access mechanism, broadcast channel announces status information of random access channel, and mobile station tries random access based on status information. Also, mobile station has access probability to prevent collision increase due to transmission of short message. For effective transmission, mobile station changes transmission rate based on transmission queue status to adapt burst traffic characteristics. In restricted environments of transmission code and bandwidth, proposed protocol shows better performance than cdma2000 system.
Call Connection Control in CDMA-Based Mobile Network
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 987~995
The handoff is a distinctive characteristic of the mobile networks. In the CDMA systems, if base stations support multiple Frequency Assignment (FA), they provide both soft handoff and hard handoff. Under the CDMA environments, the soft handoff guarantees the favorable service quality and the continuity of call connection without interruption, and increases the service capacity of the base stations. This paper proposes call connection control schemes with handoff queue for supporting efficient handoff processing. The proposed schemes are divided into two categories: single handoff queue scheme and multiple handoff queue scheme. We analyze the performance of the proposed call connection control schemes using numerical analysis. From the analysis results, we can say that it is more desirable to avoid hard handoff as long as handoff queues are used. When a single handoff queue used, adaptive scheme that properly mixes avoidable and avoidable hard handoff method under the given traffic condition is more desirable. In case that multiple handoff queues are used, the suitable trade-off needs to be developed between handoff blocking probability and hard handoff probability to guarantee a given blocking probability threshold.
The Study on Performance of Reverse Link Synchronous DS-CDMA System for IMT-2000
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 996~1004
In this paper, we evaluate the performance of reverse link synchronous CDMA with orthogonal spreading and Rake combining, and compare this to that of an asynchronous transmission under Rayleigh multipath fading environments. The link performance is evaluated in terms of average bit error rate (BER) and capacity, assuming ideal BPSK data modulation. The focus of this paper is on the impact that the multipath intensity profile (MIP) shape and number of taps in Rake receiver have on the performance of synchronous transmission. The results show the reverse link synchronous transmission can always achieve smaller BER than the asynchronous transmission even if inter-path interference exists.
An Improvement on FFT-Based Digital Implementation Algorithm for MC-CDMA Systems
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1005~1015
This paper is concerned with an improvement on IFFT (inverse fast Fourier transform) and FFT based baseband digital implementation algorithm for BPSK (binary phase shift keying)-modulated MC-CDMA (multicarrier-code division multiple access) systems, that is functionally equivalent to the conventional implementation algorithm, while reducing computational complexity and bandwidth requirement. We also derive an equalizer structure for the proposed implementation algorithm. The proposed algorithm is based on a variant of FFT algorithm that utilizes a N/2-point FFT/IFFT for simultaneous transformation and reconstruction of two N/2-point real signals. The computer simulations under additive white Gaussian noise channels and frequency selective fading channels using equal gain combiner and maximal ratio combiner diversities, demonstrate the performance of the proposed algorithm.
Improved Linearizer for use in Real Zero SSB Receiver
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1016~1021
In order to obtain a demodulated signal from RZ-SSB signal, it is important to design a linearizer which cancels the high-order distortions after FM demodulation. Since the NTT's linearizer must include a Hilbert transform, the characteristics of the linearizer are determined by the characteristics of Hilbert transform and it is very complicated to design and realize especially in the low frequency range. In the case of the proposed linearizer, the high-order distortion can be reduced without using any Hilbert transform. Furthemore, unlike the conventional RZ-SSB Demodulator, the proposed linearizer can be realized easily.
Effect of mobile terminal searcher on TDOA position location technique
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1022~1027
This paper proposes method that uses Time-Difference-of-Arrival(TDOA) of Forward Pilot signals from base stations(BS) arriving at a mobile station(MS) as a position location method of CDMA MS. MS searcher does acquisition of BS Pilot signals and measurement of TDOAs. In order to do it, its processing gain is very important. Proportional relationship of the gain to the signal coherent integration interval is theoretically derived and analyzed and field test is performed to show acquisition of weak Pilot signals and stable measurements of TDOA values by increasing the gain. Also, signal strength decrease exponentially by the distance it travels. Therefore, improvement of the searcher gain makes possible to acquire Pilot signals at a location far away from BS. Variation of possible position estimation area relative to the signal strength within a cell is simulated with computer. Neglecting shadow effect it indicated necessity of detecting signals below -35dB in order to cover over 90% of cell area. Thus, efforts to maximize searcher coherent integration interval in order to acquire weak Pilot signals are required for expansion of position estimation area and measurement of stable TDOA values.
A New Decision-Directed Carrier Recovery Algorithm
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1028~1035
To increase the throughput of data transmission in burst-mode TDMA communication systems and also to get a good BER performance at the same time, it is essential to rapidly acquire the carrier while keeping the desirable tracking performance. To achieve this goal, in this paper, a new decision-directed carrier recovery algorithm is presented. The proposed scheme does not incorporate the PLL and suppress the Gaussian random process of input noise by the pre-stage low pass filter so as to get both the fast acquisition and a good performance. Through computer simulations, the performance of the scheme is analyzed with respect to the acquisition time and bit error rate. The cycle slip in the proposed scheme is seldom observed at very low SNR environment in contrast to the previous proposed one. Because of this merit, it is not required to do the differential encoding and decoding in the proposed scheme.
An Efficient Causal Ordering Algorithm in Overlapping Groups
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1036~1045
In this paper, we proposed a causal ordering algorithms which is efficiently applicable to overlapped process group environments where one process may belong to several process groups. The ones is proposed to choose with topology of the network. We proposed receiver select algorithm in broadcast network, sender select algorithm in point-to-point network. Each algorithms removes unnecessary vector timestampes to reduce the message overhead required for the causual ordering. And, compressed vector timestamps using the locally maintained vector timestamp information of other processes and other groups to minimize the message overhead. Also, we logically proved the proposed causal ordering method, and compared the performance of the proposed algorithm with ones of other existing algorithms by computer simulation.
Performance analysis on the complexity of turbo code with short frame sizes
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1046~1051
It is well known that Parallel Concatenated Convolutional Codes(turbo codes) has a good performance for long block sizes. This thesis has analyzed the performance of turbo code which is based on voice or control frames with short frame sizes in the future mobile communication system. Also, at the similar decoding complexity, the performance of turbo code and convolutional codes in the speech/control frames, and the applicability of this system are considered. As a result, turbo code in short frame sizes present the performance of a BER of
or more over 3 iterations in the future mobile communication system. However, at a BER of
, if the same complexity is considered, the performance of rate 1/2 turbo code with K = 5 is better than that of convolutional code with K = 9 at low
, and the performance of turbo code with K = 3 is superior to that of convolutional code with K = 7. Rate 1/3 turbo code with K = 3 and 5 have similar to performance of rate 1/2 turbo code.
A New Compensated Criterion in Testing Trained Codebooks
Kim, Dong-Sik ;
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1052~1063
In designing the quantizer of a coding scheme using a training sequence (TS), the training algorithm tries to find a quantizer that minimizes the distortion measured in the TS. In order to evaluate the trained quantizer or compare the coding scheme, we can observe the minimized distortion. However, the minimized distortion is a biased estimate of the minimal distortion for the input distribution. Hence, we could often overestimate a quantizer or make a wrong comparison even if we use a validating sequence. In this paper, by compensating the minimized distortion for the TS, a new estimate is proposed. Compensating term is a function of the training ratio, the TS size to the codebook size. Several numerical results are also introduced for the proposed estimate.
A Study on Performance Evaluation of SCP and HLR Integration supporting IN Services
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1064~1073
In the integrated systems of wired and wireless networks, it is not fit to separate cellular networks to intelligent networks so IMT-2000 is basically developed including the intelligent networks. But it is not yet determined how functional entities of IMT-2000 map the corresponding physical entities. In this paper, we propose the integrated model by mapping various functional entities of IMT-2000 into the corresponding physical entities. Also, we proposs the call model for the mobile call setup and IN service call. Based on the proposed model, we evaluate the performance and compare with IMT-2000 in terms of the mean service delay and processing delay at each physical entities.
Performance Comparison of Turbo Codes at Various Puncturing Rates
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1074~1079
In this paper, the concept of puncturing is introduced to turbo code in order to implement various code as code rate varies.rates. First, several different puncturing matrices are applied into rate 1/3 encoder in order to produce various rate 1/2 turbo codes. By analyzing and comparing these results, we can show which puncturing pattern should be selected in order to maintain good performance. Second, we select some appropriate puncturing patterns which provide the best performance of turbo codes of various rates from 1/3 to 2/3 among all the possible candidates. Finally, we provide the change of required Eb/No at
as code rate varies.
An Algorithm for Computing the Weight Enumerating Function of Concatenated Convolutional Codes
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1080~1089
The union upper bounds to the bit error probability of maximum likelihood(ML) soft-decoding of parallel concatenated convolutional codes(PCCC) and serially concatenated convolutional codes(SCCC) can be evaluated through the weight enumerating function(WEF). This union upper bounds become the lower bounds of the BER achievable when iterative decoding is used. In this paper, to compute the WEF, an efficient error event search algorithm which is a combination of stack algorithm and bidirectional search algorithm is proposed. By computor simulation, it is shown that the union boounds obtained by using the proposed algorithm become the lower bounds to BER of concatenated convolutional codes with iterative decoding.
VLSI Design of EPR-4 Viterbi Decoder for Magnetic Disk Read Channel
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7A, 1999, Pages 1090~1098
In this paper ERP-4 viterbi decoder for magnetic disk read channel is designed. The viterbi decoder consists of ACS circuit, path memory circuit, minimum detection circuit, and output selection circuit. In the viterbi decoder the number of state is reduced from 8 to 6 using (1,7) RLL codes and modulo comparison based on 2's complement arithmetic is applied to handle overflow problem of ACS module. Also to determine the correct symbol values in nonconvergent condition of path memory, pipelined minimum detector which determines path with minimum state metric is used. The EPR-4 viterbi decoder is designed using 0.35
CMOS technology and consists of about 15,300 transistors and has 250 Mbps data rates under 3.3 volts.