• Title/Summary/Keyword: Transmitted Error

Search Result 500, Processing Time 0.026 seconds

Geometrical Uniformity For Space-Time Codes (시공간 부호의 기하학적 균일성)

  • 정영석;이재홍
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.89-92
    • /
    • 2003
  • A geometrically uniform code in AWGN channel has strong symmetry properties such as a) the distance profiles form codewords On C to all other codewords are all the same, and b) all Voronoi regions of codewords in C have the same shape. Such properties make the word error probability of geometrically uniform codes be transparent to the transmitted codeword. In this paper, we extend the geometrically uniform codes in AWGN channel to the geometrical uniform codes in fading channel with multiple transmit antennas.

  • PDF

Remote Mobile robot control system using multimedia data (멀티미디어 기반의 원격 이동 로봇 제어 시스템)

  • 변재영;문호석;정재한;고성제
    • Proceedings of the IEEK Conference
    • /
    • 2002.06c
    • /
    • pp.235-238
    • /
    • 2002
  • This paper presents a remote mobile robot system that transmits streaming video and audio over the lossy packet networks such as (Wireless) LAN. The error resilient video and audio packets are transmitted on the RTP/UDPfP Protocol stack. The mobile robot can be accessed by a certified user from the remoted area. Thus, the movement of mobile robot can be controlled by the operator observing the working surroundings.

  • PDF

A fast watermark embedding method for MPEG-2 bit stream (MPEG-2 비트 스트림에 대한 고속 워터마크 삽입방법)

  • 김성일;서정일;김구영;원치선
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1997.11a
    • /
    • pp.151-154
    • /
    • 1997
  • In this paper, we propose a new watermarking algorithm for copyright protection of video data. The proposed algorithm inserts a watermark directly on the MPEG-2 bitstream. Since more and more video data are stored and transmitted in a compressed form, it is desirable to insert a watermark on the compressed bit stream to avoid the expensive full-decoding and re-encoding process. Embedding a watermark in the compressed domain, we can also avoid the effect of the compression error which may erase the watermark.

  • PDF

A Study on Multi-Carrier CDMA in Rayleigh Fading Channel (레일레이 폐이딩환경에서의 다중반송파 CDMA방식에 관한 연구)

  • 홍우상;한영열
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 1997.11a
    • /
    • pp.127-135
    • /
    • 1997
  • In this paper, we apply a digital modulation scheme called Multi-Carrier Code Division Multiple Access (MC-CDMA) in which data symbols are transmitted at multiple subcarriers. Each subcarrier is encoded with a phase offset of -π or π based on a pseudo-random noise(PN) sequence. MC-CDMA scheme is introduced to combat against the multipath fading. We annalize above system and derive the average probability of error in AWGN and Rayleigh fading environment.

  • PDF

A Study on the Performance of the Noncoherent FFH-SSMA Communication Systems over Fading Channels (페이딩 채널상의 비동기 FFH-SSMA 통신시스템 성능에 관한 연구)

  • 방사현;김원후
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1983.10a
    • /
    • pp.88-92
    • /
    • 1983
  • The performance of noncoherent fast frequency-hopped spread spectrum multiple access communication systems with square-law combining over fading channel is presented. The expression for the probalility of error as a performance measure is derived by means of momenting function of the dedecision variables, and the cross-covariance of the fading process the ambiguty function of the transmitted signals.

  • PDF

Encoding and Decoding using Cyclic Product Code (순환곱셈코드를 이용한 인코딩 및 디코딩)

  • 김신령;강창언
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1984.10a
    • /
    • pp.11-14
    • /
    • 1984
  • When the received sequence is not identical to the transmitted code word due to the channel nose effect, it is necessary to detect and correct errors. In this paper, it is shown how to construct the encoder and the decoder using cyclic product codes. this system combines random and burst error correction and is easily decodable. Performance has been obtained as expected.

  • PDF

MSE of Dual-k Convolutional Codes for an AWGN Channel with Rayleigh Fading (Rayleigh Fading AWGN채널에 대한 Dual-K길쌈부호의 평균자승오차)

  • 문상재
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1986.04a
    • /
    • pp.1-3
    • /
    • 1986
  • We are concerned with transmitting numerical source data of {0, 1, 2, ..., 2k-1} through a channel coding system. The rate 1/v dual-k convolutional code with the orthogonal MFSK modulation and the Viterbl decoding is employed for the implementation of the channel coding system. The mean square error of the dual-k convolutional code is evaluated for the numerical source transmitted over an additive white Gaussian noise channel with Rayleigh fading.

  • PDF

A New Constant Modulus Algorithm based on Maximum Probability Criterion

  • Kim, Nam-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.2A
    • /
    • pp.85-90
    • /
    • 2009
  • In this paper, as an alternative to constant modulus algorithm based on MSE, maximization of the probability that equalizer output power is equal to the constant modulus of the transmitted symbols is introduced. The proposed algorithm using the gradient ascent method to the maximum probability criterion has superior convergence and steady-state MSE performance, and the error samples of the proposed algorithm exhibit more concentrated density functions in blind equalization environments. Simulation results indicate that the proposed training has a potential advantage versus MSE training for the constant modulus approach to blind equalization.

Discovered Pilot Designs in MIMO OFDM System with optimization algorithms

  • JunYoung Son
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.44-50
    • /
    • 2023
  • For Wi-Fi and IoT wireless systems, high-capacity wireless communication technology is being applied using MIMO OFDM. Because of virtu0al subcarriers in the practical MIMO OFDM system, the pilot subcarriers cannot be spaced equally. Thus, it is difficult to obtain a good mean square error (MSE) performance of the channel estimate. This paper proposes applicable methods and the newly discovered locations of pilot subcarriers in four transmitted antennas resulting in a good MSE performance with proposed optimization algorithms.

A Study on the Efficient Interference Cancellation for Multi-hop Relay Systems (다중 홉 중계 시스템에서 효과적인 간섭 제거에 관한 연구)

  • Kim, Eun-Cheol;Cha, Jae-Sang;Kim, Seong-Kweon;Lee, Jong-Joo;Kim, Jin-Young;Kang, Jeong-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.47-52
    • /
    • 2009
  • The transmitted signal from a source is transmitted to a destination through wireless channels. But if the mobile destination is out of the coverage of the source or exists in the shady side of the coverage, the destination can not receiver the signal from the source and they can not maintain communication. In order to overcome these problems, we adopt relays. A system employing relays is a multi-hop relay system. In the multi-hop relay system, coverages of each relay that is used for different systems can overlap each other in some place. When there is a destination in this place, interference occurs at the destination. In this paper, we study on the efficient co-channel interference (CCI) cancellation algorithm. In the proposed strategy, CCI is mitigated by zero forcing (ZF) or minimum mean square error (MMSE) receivers. Moreover, successive interference cancellation (SIC) with optimal ordering algorithm is applied for rejecting CCI efficiently. And we analyzed and simulated the proposed system performance in Rayleigh fading channel. In order to justify the benefit of the proposed strategy, the overall system performance is illustrated in terms of bit error probability.

  • PDF