• Title/Summary/Keyword: 비트에러율

Search Result 215, Processing Time 0.03 seconds

Dynamic Rate Adaptation of Centralized AP for WLAN Performance Enhancement (무선랜 성능향상을 위한 AP의 동적 전송속도 할당 기법)

  • Park, Byoung-Chang;Woo, Hee-Kyoung;Kim, Chong-Kwon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.391-393
    • /
    • 2005
  • 최근 유비쿼터스 네트워크 환경을 구축하기 위해 많은 무선 통신 기술들이 등장하였다. 그 중 무선랜 기술은 쉬운 설치와 저렴한 비용 덕에 폭발적인 보급이 이루어 겼다. IEEE 802.11 표준을 기반으로 만들어진 무선랜은 여러 개의 전송속도를 지원한다. 대표적으로 802.11b는 1, 2, 5.5, 11MbPs의 4가지 전송속도를 지원한다. 낮은 전송속도로 전송을 하면 패킷 전송시간은 증가하지만 비트 에러율은 감소된다. 각각의 전송속도에 따라 다른 패킷 전송 성공률을 갖게 된다. 한 무선랜 AP에 연결된 노드들은 각자 자신의 처리율을 최대화할 수 있는 전송속도를 결정하여 사용하게 된다. 이러한 상황은 전체 시스템 성능에는 문제를 발생시킬 수 있다. 본 논문에서는 각자의 전송속도를 각자가 결정하는 것이 전체 시스템 성능에 문제를 발생시키는 경우를 보이고, 그것을 해결하기 위해 AP가 각 노드의 전송속도를 결정하는 기법을 제안한다. 나아가 무선랜에서의 문제점인 Performance Anomaly 현상을 해결하고, [3]에서 언급된 Inefficient Equilibria 현상도 막아본다.

  • PDF

A New Parity Preserving Run-length Limited Code for Optical Recording System (광 기록 저장 장치를 위한 새로운 패리티 보존형 런-길이 제한 코드)

  • Hong, Hyun-Sun;Lee, Jae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1C
    • /
    • pp.59-64
    • /
    • 2004
  • We propose a new RLL(run length limited) (2,7) PP(parity preserving) code with 4 RMTR(repeated minimum transition run) for optical recording. The proposed code has better characteristics in terms of density ratio, RMTR, DC(direct current) component suppression, BER(bit error rate) and system complexity than (2,1O) code that currently applied in storage systems and (1,7) PP code that highly recommended as the next generation optical recording system. Some characteristics of the code are described with several simulations. And the proposed code's superiorites in performance is illustrated as compared with the other codes.

Dynamic Rate & TXOP Adaptation of Centralized AP for WLAN Performance Enhancement (무선랜 성능향상을 위한 AP 의 전송속도 및 전송시간 동적 할당 기법)

  • Park, Byoung-Chang;Woo, Hee-Kyoung;Kim, Chong-Kwon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.11a
    • /
    • pp.1125-1128
    • /
    • 2005
  • 최근 유비쿼터스 네트워크 환경을 구축하기 위해 많은 무선 통신 기술들이 등장하였다. 그 중 무선랜 기술은 쉬운 설치와 저렴한 비용 덕에 폭발적인 보급이 이루어 졌다. IEEE 802.11 표준을 기반으로 만들어진 무선랜은 여러 개의 전송속도를 지원한다. 대표적으로 802.11b 는 1, 2, 5.5, 11Mbps 의 4 가지 전송속도를 지원한다. 낮은 전송속도로 전송을 하면 패킷 전송시간은 증가하지만 비트 에러율은 감소된다. 각각의 전송속도에 따라 다른 패킷 전송 성공률을 갖게 된다. 한 무선랜 AP 에 연결된 노드들은 각자 자신의 처리율을 최대화할 수 있는 전송속도를 결정하여 사용하게 된다. 이러한 상황은 전체 시스템 성능에는 문제를 발생시킬 수 있다. 본 논문에서는 각자의 전송속도를 각자가 결정하는 것이 전체 시스템 성능에 문제를 발생시키는 경우를 보이고, 그것을 해결하기 위해 AP 가 각 노드의 전송속도 및 전송시간을 결정하는 기법을 제안한다. 나아가 무선랜에서의 문제점인 Performance Anomaly 현상을 해결하고, [3]에서 언급된 Inefficient Equilibria 현상도 막아본다.

  • PDF

Performance Analysis of Interworking Protocol for Efficient Mobile Data Service (효율적인 이동 데이타 서비스를 위한 연동 프로토콜의 성능 분석)

  • 박성수;송영재;조동호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.7
    • /
    • pp.1744-1754
    • /
    • 1998
  • In this paper, the data service protocol which could support data service more efficiently between mobile host and fixed host in wire network is investigated. Wireless link has high bit error rate compared with wire link. Therefore, TCP performance for the data service is degraded in wire and wireless interworking environment. Thus, to reduce performance degradation. Interworking module withsimple protocol processing function is proposed. This, interworking module analyzes the hearder information of TCP fram. If received TCP freame is a duplicated frame, TCP frame is discared. Also, if interworking moudule receives retransmission request frame is a duplicated frame, TCP freme is discarded. Also, if interworking module receives retansmission request frame, interworking module performs retransmission procedure. According to simulation results, the proposed IWF shows better performance than traditional IWF in view of delay and throughput in the wire and wireless interworking environments.

  • PDF

Interference Alignment in 2-user X Channel System with Orthogonal and quasi-orthogonal Space-time Block Codes (직교 및 준직교 시공간 블록 부호를 통한 2-사용자 X 채널에서의 간섭정렬)

  • Mohaisen, Islam;Lee, Saet-byeol;Mohaisen, Manar;Elaydi, Hatem
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.8
    • /
    • pp.1785-1796
    • /
    • 2015
  • In this paper, we investigate achieving the full diversity order and power gains in case of using OSTBCs and quasi-OSBCs in the x channel system with interference alignment with more than 2 antennas at each terminal. A slight degradation is remarked in the case of quasi-OSTBCs. In terms of receiver structure, we show that due to the favorable structure of the channel matrices, the simple zero-forcing receiver achieves the full diversity order, while the interference cancellation receiver leads to degradations in performance. As compared to the conventional scheme, simulation results demonstrate that our proposed schemes achieve 14dB and 16.5dB of gain at a target bit error rate (BER) of 10-4 in the case of OSTBCs with 3 and 4 antennas at each terminal, respectively, while achieving the same spectral efficiency. Also, a gain of 10dB is achieved at the same target BER in the case of quasi-OSTBC with 4 antennas at each terminal.

Throughput Analysis of an ARQ Scheme with Noisy Feedback Channel over Nakagami Fading Channel (나카가미 페이딩 채널에서 궤환채널의 잡음을 고려한 ARQ 기법의 정보전송율 분석)

  • 황재문;박진수
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.8
    • /
    • pp.1161-1168
    • /
    • 2002
  • In this paper, the throughput performance of an ARQ scheme is analyzed with noisy feedback channel, in order to exactly analysis for performance of an ARQ scheme. An ARQ mechanism is presented by state diagram, and the throughput of an ARQ scheme is mathematically derived using generation function for a signal flow graph. The channel is modeled by the Nakagami-m fading channel which is distributed over far and wide, and the throughput performance of an ARQ scheme, which is applied in BPSK and BFSK systems, according to feedback gain and fading index m is analyzed through computer simulation. In the results, It is shown conformed that the throughput of an ARQ scheme decreased according to the increase of the noise for feedback channel, but it increased according to the increase of the feedback gain and fading index m. Also, it is shown that the throughput of an ARQ scheme using BPSK system is superior to BFSK system because of the difference of bit error probability between BPSK and BFSK systems.

Throughput Performance of Hybrid ARQ Ultra-Wideband Communication System for Wireless Packet Transmission (무선 패킷 전송을 위한 Hybrid ARQ 광대역 통신시스템의 처리율 성능)

  • Roh, Jae-Sung
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.3
    • /
    • pp.274-280
    • /
    • 2007
  • An ultra-wideband signal is characterized by a radiated spectrum with wide bandwidth around a relatively low center frequency. In this paper, the bit error rate (BER), packet error rate (PER), and data throughput performance for an ultra-wideband system with M-ary correlation receiver are analyze in additive white Gaussian noise (AWGN) and co-channel interference channel. To evaluate the performance of UWB system, a set of UWB communication waveform as pulse position modulated (PPM) signals consisting of more than one UWB pulse is used. The M-ary PPM signals are defined to be equally correlated in order to simplify the system performance analysis. The analysis for system performance shows that the wireless channel error significantly degrades throughput performance and can be effectively increased by hybrid ARQ scheme. Also, an attempt for comparing the data throughput of ultra-wideband system on different performance improvement schemes and parameters has been made. From the performance evaluation process, it is shown that the effects of wireless channel and hybrid ARQ scheme for ultra wideband M-ary PPM system can be evaluated by means of a suitable combination of the PER, throughput vs. signal-to-noise power ratio per bit.

  • PDF

Design of ${\gamma}$=1/3, K=9 Convolutional Codec Using Viterbi Algorithm (비터비 알고리즘을 이용한 r=1/3, K=9 콘벌루션 복부호기의 설계)

  • 송문규;원희선;박주연
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1393-1399
    • /
    • 1999
  • In this paper, a VLSI design of the convolutional codec chip of code rate r=l/3, and constraint length K=9 is presented, which is able to correct errors of the received data when transmitted data is corrupted in channels. The circuit design mainly aimed for simple implementation. In the decoder, Viterbi algorithm with 3-bit soft-decision is employed. For information sequence updating and storage, the register exchange method is employed, where the register length is 5$\times$K(45 stages). The codec chip is designed using VHDL language and Design Analyzer and VHDL Simulator of Synopsys are used for simulation and synthesis. The chip is composed of ENCODER block, ALIGN block, BMC block, ACS block, SEL_MIN block and REG_EXCH block. The operation of the codec chip is verified though the logic simulations, where several error conditions are assumed. As a result of the timing simulation after synthesis, the decoding speed of 325.5Kbps is achieved, and 6,894 gates is used.

  • PDF

An Effective Solution to Overcome the Restriction of SACK Blocks' Number in TCP SACK (오프셋을 활용한 효율적인 TCP SACK 메커니즘)

  • Lin, Cui;Hong, Choong-Seon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.7 s.103
    • /
    • pp.1039-1046
    • /
    • 2005
  • TCP SACK is the unique mechanism to reflect the situation of sink's sequence space, some TCP variants and proposals can perform in conjunction with SACK mechanism for achieving optimal performance. By definition of RFC 2018, however, each contiguous block of data queued at the data receiver is defined in the SACK option by two 32-bit unsigned integers in network byte order. Since TCP Options field has a 40-byte maximum length, when error bursts now, we note that the available option space may not be sufficient to report all blocks present in the receiver's queue and lead to unnecessarily force the TCP sender to retransmit Packets that have actually been received by TCP sink. For overcoming this restriction, in this thesis, a new solution named 'one-byte offset based SACK mechanism' is designed to further improve the performance or TCP SACK and prevent those unwanted retransmissions. The results or both theory analysis and simulation also show that his proposed scheme operates simply and more effectively than the other existing schemes by means of the least bytes and most robust mechanism to the high packet error rates often seen in networks environment.

An Adaptive FEC Algorithm for Mobile Wireless Networks (이동 무선 네트워크의 전송 성능 향상을 위한 적응적 FEC 알고리즘)

  • Ahn, Jong-Suk;John Heidmann
    • The KIPS Transactions:PartC
    • /
    • v.9C no.4
    • /
    • pp.563-572
    • /
    • 2002
  • Wireless mobile networks tend to drop a large portion of packets due to propagation errors rather than congestion. To Improve reliability over noisy wireless channels, wireless networks can employ forward error correction (FEC) techniques. Static FEC algorithms, however, can degrade the performance by poorly matching their overhead to the degree of the underlying channel error, especially when the channel path loss rate fluctuates widely. This paper investigates the benefits of an adaptable FEC mechanism for wireless networks with severe packet loss by analytical analysis or measurements over a real wireless network called sensor network. We show that our adaptive FEC named FECA (FEC-level Adaptation) technique improves the performance by dynamically tuning FEC strength to the current amount of wireless channel loss. We quantify these benefits through a hybrid simulation integrating packet-level simulation with bit-level details and validate that FECA keeps selecting the appropriate FEC-level for a constantly changing wireless channel.