• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.354-363
• /
• 1994

This paper describes the method that voice traffic is served efficiently in BISDN. Voice is divided into talkspurt and silent period, and it is possible to transmit olny talksurt by the speech activity detection. This paper described the voice traffic control algorithm in the ATM network where cell discarding method is applied to the embedded ADPCM voice data. For traffic control, the cell discarding was used over low priority cells when it overflows the queue threshold. To estimate the efficiency of traffic control algorithm, the computer simuation was performed with cell loss probability, queue length and mean delay as performance parameters. The embedded ADPCM voice coding and cell disscarding resulted in improving the voice cell traffic efficiency and the dynamic control over network congestion.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.243-248
• /
• 2012

In this paper we simulate the capacity of VOIP calls through WiFi network by computer simulations using OPNET modeler. The results show that sudden quality degradations occur on all VoIP calls when the number of call of an AP(Access Point) increases beyond a specific value. The reason of the quality degradation was turned out to be the queueing delay at the down link of AP. Under the IEEE 802.11b environments, the maximum number of VoIP calls of an AP maintaining the required voice quality (MOS > 2.5), was evaluated as 5, 12, and 27 when we use G.711, G.729a, and G.729a VAD codec, respectively.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1216-1226
• /
• 2005

In this paper, a preventive transmission rate decision algorithm, called PTRD, is proposed for the transmission of live video over networks with dynamic bandwidth allocation capability. Frame analyzer predicts the bit-rates of future frames before encoding by analyzing the source information such as spatial variances and the degree of scene changes. By using the predicted bit-rates, transmission rate bounds are derived from the constraints of encoder and decoder buffers. To resolve the problem of renegotiation cost increment due to frequent renegotiations, the PTRD algorithm is presented to decide transmission rates considering the elapsed time after the recent renegotiation and the perceived video quality. From the simulation results, compared to the normalized LMS based method, PTRD is shown to achieve high channel utilization with low renegotiation cost and no delay violation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8A
• /
• pp.689-697
• /
• 2012

In this paper, we propose base layer repetition and HARQ schemes for improving the reliability and the performances of H.264 SVC video transmission in a wireless channel, and investigate its performances. The proposed method may solve the problems of transmission delay as well as the scarcity of wireless resources, since the proposed scheme was applied for only base layer, not for enhancement layer. The numerical results show that the proposed scheme can enhance the BER performance of $1.5{\times}10^{-5}$ and the FER of $1.2{\times}10^{-3}$, when SNR=3.4dB. Also, it was confirmed through the resultant images that the proposed method can improve the SVC performance in the wireless link.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3B
• /
• pp.196-201
• /
• 2002

OFDM(orthogonal Frequency Division Multiplex) modulates transmitting data with many carriers in parallel. As a result, high-speed data transmission is carried out and high spectral efficiency is provided by overlapping orthogonal frequencies. Therefore, OFDM is applied to many communication systems. In this paper, according to modulation methods(M-PSK and M-QAM), coded-OFDM wireless communication is simulated. Turbo code is used and two channels(virtual and real channel) are used. both channels have multipath delay spread, Gaussian noise, and peak power clipping. As a result of the simulation, coding gain is about 3dB and it is proved that M-QAM modulation is better than M-PSK. Start after striking space key 2 times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.659-667
• /
• 2002

In this dissertation, in the Turbo Code used for error correction coding of the recent digital communication systems, we propose a new S-R interleaver that has the better performance than the existing block interleaver, and the Turbo Decoder that has the parallel concatenated New structure using the MAP algorithm. For real-time voice and video services over the third generation mobile communications, the performance of two proposed methods is analyzed by the reduced decoding delay using the variable decoding method by computer simulation over multipath channels of DS-CDMA system. Also, a Modified NCMA based on conventional NCMA is proposed to improve the channel efficiency in the mobile communication system, and is investigated over the multi-user environment of DS-CDMA system through computer simulation.

• Journal of Digital Contents Society
• /
• v.5 no.1
• /
• pp.28-34
• /
• 2004

In this paper, we have analyzed the block error probability of orthogonal multicarrier 16 QAM signal in a frequency selective Rician fading environment. The block error probability is evaluated with several parameters such as normalized propagation delay $(\gamma/T_S),$, bit energy to noise power ratio $(E_b/N_0),$ and desired signal to undesired signal power ratio (DUR) in fast fading and slow fading channels. In the fast fading channel, The result shows that the block error probability rather in the fast fading channel achieves better performance than in the slow fading channel, when the error correction capability is one or two.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.6 no.1
• /
• pp.66-76
• /
• 1995

In this paper, the error rate performance of DS/SSMA system in multipath fading channel is calculated by computer simulation. At first, the multipath fading channel is modeled with TDL(Tap Delay Line) model. The characteristics of channels, including multipath fading effects and error pattern, are examined by doppler frequency and signal bandwidth, and time spread variation. Using the multipath fading channel model, the error rateperformance of block code and convolutional code is compared, thus the coding sys- tem is applied to the DS / SSMA system. The BER results of DS / SSMA system show that the proposed receiver gives about 2~3[dB] improve- ment compared with the conventional receiver.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.4
• /
• pp.97-102
• /
• 2007

In this paper, a new architecture for fast-serial $GF(2^m)$ multiplier with low hardware complexity is proposed. The fast-serial multiplier operates standard basis of $GF(2^m)$ and is faster than bit serial ones but with lower area complexity than bit parallel ones. The most significant feature of the fast-serial architecture is that a trade-off between hardware complexity and delay time can be achieved. But The traditional fast-serial architecture needs extra (t-1)m registers for achieving the t times speed. In this paper a new fast-serial multiplier without increasing the number of registers is presented.