• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1922-1931
• /
• 1999

A multicast traffic’s feature is the function of providing a point to multipoints cell transmission, which is emerging from the main function of ATM switch. However, when a conventional point-to-point switch executes a multicast function, the excess load is occurred because unicast cell as well as multicast cell passed the copy network. Additionally, due to the excess load, multicast cells collide with other cells in a switch. Thus a deadlock that losses cells raises, extremely diminishes the performance of switch. An input queued switch also has a defect of the HOL (Head of Line) blocking that less lessens the performance of the switch. In the proposed multicast switch, we use shared memory switch to reduce HOL blocking and deadlock. In order to decrease switch’s complexity and cell's processing time, to improve a throughput, we utilize the method that routes a cell on a separated paths by traffic pattern and the scheduling algorithm that processes a maximum 2N cell at once in the control part. Besides, when cells is congested at an output port, a cell loss probability increases. Thus we use the Output Memory (OM) to reduce the cell loss probability. And we make use of the method that stores the assigned memory (UM, MM) with a cell by a traffic pattern and clears the cell of the Output memory after a fixed saving time to improve the memory utilization rate. The performance of the proposed switch is executed and compared with the conventional policy under the burst traffic condition through both the analysis based on Markov chain and simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.751-764
• /
• 2013

In cognitive radio ad-hoc networks, common control channel overload and packet collisions are occured due to indiscriminate broadcasting of control packets. So that the path reliability is reduced and control channel is easily saturated. In this paper, we propose a new routing algorithm considering the probability of appearance of primary user and channel status of neighbor nodes. When the source node needs to transmit a data packet to the destination, it performs route discovery process by exchanging control messages using a control channel in ADOV CR Ad-hoc networks. If any intermediate node doesn't have common data channel with previous node to transmit data, it doesn't rebroadcast control packet. And if it has common data channels with previous node, each node determines channel contribution factor with the number of common channels. Based on the channel contribution factor, each node performs different back-off broadcasting. In addition, each node controls control packet flooding by applying to proposed advanced mode using such as number of available channels and channel stability. With the proposed method, the number of control packets to find the data transmission path and the probability of collision among control packets can be decreased. While the path reliability can be increased. Through simulation, we show that our proposed algorithm reduces packet collisions in comparison with the traditional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.994-1004
• /
• 2000

In this paper, bitstreams are composed of using H.263 for a moving picture coding in the band-limited and error-prone environment such as wireless environment. EREC sub-frames are implemented by applying the proposed EREC algorithm in order to be UEP for the real data parts of implemented bitstreams. Because those are able to do resynchronization with a block unit, propagation of the error can be minimized, and the position of the important bits such as INTRADC and MVD can be known. Class is separated using the position of these important bits, and variable puncturing tables are designed by the class informations and the code rates of turbo codes are differently designed in according to the class. Channel coding used the turbo codes, and an interleaver to be designed in the turbo codes does not eliminate redundancy bits of the important bits in applying variable code rates of EREC sub-frames unit and is always the same at the transmitter and the receiver although being variable frame size. As a result of simulation, UEP with the code rate similar to EEP is obtained a improved result in the side of bit error probability. And the result of applying it to image knows that the subjective and objective quality have been improved by the protection of important bits.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.931-936
• /
• 2016

The PS algorithm divides the number of tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. It limits the number of responding tags by grouping the tags within the identification range of the reader, and thus can reduce the probability of tag collision. Also, in the PS algorithm, the reader takes advantages of the difference of identification ranges. This algorithm uses the fixed frame size at every scan. Therefore, it has problems that the performance can be shown variously according to the number of tags and frame size. In this paper, we propose an EPS algorithm that allocates the optimal frame size by estimating the number of tags at each scan, and apply it into the STAC protocol. The simulation results showed that STAC/EPS algorithm can improve the identification delay about 45% compared with STAC protocol. Also, it provides a stable identification delay regardless of power level increase.

• Archives of design research
• /
• v.18 no.1 s.59
• /
• pp.49-58
• /
• 2005

Focusing on the information sender, message, channel, and receiver, the existing information theory deals with the noise, information contents, and probability of choice, which involve in the process of information transmission. In the current digital environment, besides simply conveying information itself through media, the important issue is how to efficiently convey information. Therefore, we need to analyze the theory in different perspective, and to research the Information redundancy for the methodology of information design. The redundancy causes the receiver to have attraction to the information and to reduce its contents due to its supplement and repetition. So it can play a role of efficient communication method. The concept of redundancy is applied to the communication of art such as literature, architecture, painting, and design to accomplish efficient communication. In order to get persuasive information design for the receiver's perspective we need to make use of this concept. The redundancy can be applied with the technical aspect of multimedia and Interaction, which add supplemental expression, or sort of event for the receiver's experience and memory. In the process of constructing information it can be applied with the structure of gaming redundancy, entropy, the accumulating communication code using entertaining feature, and storytelling methodology. The noise and entropy could be used for the means of making redundancy, not the obstacle to information. The redundancy gives the receiver attraction on the information and makes them have strong will of interpreting it so that the purpose of conveying information will be accomplished efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10A
• /
• pp.962-968
• /
• 2002

Reliable high-speed data communications over insufficient channel bandwidth is one of the major challenges of harsh wireless environments that push the achievable spectral efficiency far below its theoretical limits. A Quadrature amplitude modulation (QAM) scheme is a userful modulation technique for achieving high data rate transmission without increasing the bandwidth of wireless communication systems. The exact general bit error rate (BER) expression of arbitrary rectangular quadrature amplitude modulation has not yet been derived. In this paper, a generalized closed-form expression for the BER performance of rectangular QAM with Gray code bit mapping is derived and analyzed in the presence of additive white Gaussian noise (AWGN) channel. First we analyze the BER performance of an I-ary PAM scheme. Regular patterns in the k-th bit error probability are observed while developing the EBR expression. From these patterns we provide the exact and general closed-from EBR expression of an I-ary PAM. Then we present a general closed-from expression for BER of an arbitrary IXJ rectangular QAM by considering that this signaling format consists of two PAM scheme, i.e., I-ary and J-ary PAM. A simple approximate BER expression for rectangular QAM is given as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.955-962
• /
• 2008

Multicast Strategy is one of the cost-saving methods in the large scale VOD environment. However, it does involve complicated problems to implement VCR-like interactions for user's convenience in the multicast streaming system under considering the limited-server and the network's bandwidth in the multicast-transmission system. Therefore, the proper solution of settling such a problem is necessary. Thus, this paper which revised P2Patching[l] proposes LGST(Level Group Streaming Technique) which supports the VCR's function through cooperation among peers with heterogeneous bandwidth under the environment of P2P. This strategy can reduce latency by improving the acceptance of server and using the bandwidth of network efficiently. And for evaluate the proposed scheme's performance, I simulated the performance of streaming delivery topology and streaming quality in comparison with P2Patching. In evaluation to service request refusal ratio and service quality according to bandwidth decrement, the result of simulation shows that proposed LGST improves about $11{\sim}18%$ of performance than P2Patching. In the test of latency recovery according to fault probability and influence of VCR function operation duration, it shows similar performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.5
• /
• pp.425-432
• /
• 2014

The Enhanced Distributed Channel Access (EDCA) function of IEEE 802.11e standard defines contention window (CW) for different Access Category (AC) limits to support Quality-of-Service (QoS). However, it have been remained the problem that the collision probability of transmission is increasing in congested network. Several different solutions have been proposed but the collision occurs among same priority queue within the same station to compete the channel access. This paper presents an APCA (Advanced Priority Collision Avoidance) algorithm for EDCA that increases the throughput in saturated situation. The proposed algorithm use reserved field's bits of FC(Frame Control) using IEEE 802.11e standard's RTS/CTS (Request to Send / Clear to Send) mechanism to avoid data collision. The simulation results show that the proposed algorithm improves the performance of EDCA in packet loss. Using Jain's fairness index formula, we also prove that the proposed APCA algorithm achieves the better fairness than EDCA method under network congested condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.598-606
• /
• 2003

In this paper, we analyze the performance of the PCM cell search algorithm proposed for fast cell search of WCDMA systems. In order to improve both performance and complexity of the cell search algorithm standardized for WCDMA systems the PCM scheme uses a group of the polarization codes produced by a Gold code generator. The PCM scheme only uses one synchronization channel since the polarization codes modulated on P-SCH can replace the RS codes of S-SCH. Thus, the PCM reduces the BS's transmission power since only one synchronization channel can be used, and it can also reduce the complexity of receiver as compared with the conventional one. In this paper, by defining a numerical model, we analyze the performance of the PCM cell search algorithm in terms of detection probability and mean acquisition time. Consequently, we could demonstrate that the PCM cell search algorithm is superior to the standard WCDMA cell search algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.6
• /
• pp.1-8
• /
• 1999

Multi-carrier CDMA is a transmission scheme where data symbols are spread in the frequency domain with a spread code then transmitted using multiple carriers. It is robust against narrowband interference because of its long symbol duration. However, due to large sidebands of the rectangular window frequency response, subchannels spectrally overlap with neighboring subchannels, which leads to substantial intercarrier interference in a dispersive channel. In this paper, we consider a mult-carrier CDMA system where subchannel spectral containment is achiveved by M-band cosine modulated filter bank (CMFB). In CMFB based MC-CDMA, subchannel spectral containment is achieved using the filter bank of longer impulse response than that of conventional discrete Fourier transform (DFT) filter bank. We show that spectral containment feature of the CMFB based fading channel is analyzed using computer simulations.