• Title/Summary/Keyword: Shannon limit

Search Result 43, Processing Time 0.02 seconds

A Meeting of Euler and Shannon (오일러(Euler)와 샤논(Shannon)의 만남)

  • Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.59-68
    • /
    • 2017
  • The flower and woman are beautiful but Euler's theorem and the symmetry are the best. Shannon applied his theorem to information and communication based on Euler's theorem. His theorem is the root of wireless communication and information theory and the principle of today smart phone. Their meeting point is $e^{-SNR}$ of MIMO(multiple input and multiple output) multiple antenna diversity. In this paper, Euler, who discovered the most beautiful formula($e^{{\pi}i}+1=0$) in the world, briefly guided Shannon's formula ($C=Blog_2(1+{\frac{S}{N}})$) to discover the origin of wireless communication and information communication, and these two masters prove a meeting at the Shannon limit, It reveals something what this secret. And we find that it is symmetry and element-wise inverse are the hidden secret in algebraic coding theory and triangular function.

A Note on Central Limit Theorem for Deconvolution Wavelet Density Estimators

  • Lee, Sungho
    • Communications for Statistical Applications and Methods
    • /
    • v.9 no.1
    • /
    • pp.241-248
    • /
    • 2002
  • The problem of wavelet density estimation based on Shannon's wavelets is studied when the sample observations are contaminated with random noise. In this paper we will discuss the asymptotic normality for deconvolving wavelet density estimator of the unknown density f(x) when courier transform of random noise has polynomial descent.

A CPLD Implementation of Turbo Decoder (Turbo 복호기 CPLD 구현)

  • 김상훈;김상명;황원철;정지원
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.438-441
    • /
    • 2000
  • In this paper, Turbo rode is describing a performance near the Shannon's channel capacity limit. So, basic theory of turbo code and MAP,Log-MAP decoding algorithm was arranged. The foundation of this using VHDL, Log-MAP turbodecoder was implemented by Altera´s FLEX10K CPLD.

  • PDF

Encounter of Lattice-type coding with Wiener's MMSE and Shannon's Information-Theoretic Capacity Limits in Quantity and Quality of Signal Transmission (신호 전송의 양과 질에서 위너의 MMSE와 샤논의 정보 이론적 정보량 극한 과 격자 코드 와의 만남)

  • Park, Daechul;Lee, Moon Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.8
    • /
    • pp.83-93
    • /
    • 2013
  • By comparing Wiener's MMSE on stochastic signal transmission with Shannon's mutual information first proved by C.E. Shannon in terms of information theory, connections between two approaches were investigated. What Wiener wanted to see in signal transmission in noisy channel is to try to capture fundamental limits for signal quality in signal estimation. On the other hands, Shannon was interested in finding fundamental limits of signal quantity that maximize the uncertainty in mutual information using the entropy concept in noisy channel. First concern of this paper is to show that in deriving limits of Shannon's point to point fundamental channel capacity, Shannon's mutual information obtained by exploiting MMSE combiner and Wiener filter's MMSE are interelated by integro-differential equantion. Then, At the meeting point of Wiener's MMSE and Shannon's mutual information the upper bound of spectral efficiency and the lower bound of energy efficiency were computed. Choosing a proper lattice-type code of a mod-${\Lambda}$AWGN channel model and MMSE estimation of ${\alpha}$ confirmed to lead to the fundamental Shannon capacity limits.

Turbo Coded MIMO System with Adaptive Turbo Space- Time Processing for High-Speed Wireless Communications (고속 무선 통신을 위한 적응형 터보 시공간 처리를 갖는 터보 부호화된 다중 입출력 시스템)

  • 조동균;김상준;박주남;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9C
    • /
    • pp.843-850
    • /
    • 2003
  • Turbo coding and turbo processing have been known as methods close to Shannon limit in the aspect of wireless MIMO communications similarly to wireless single antenna communication. The iterative processing can maximize the mutual effect of coding and interference cancellation, but turbo coding has not been used for turbo processing because of the inherent decoding process delay. This paper proposes a turbo coded MIMO system with adaptive turbo parallel space-time (Turbo-PAST) processing for high-speed wireless communications and a enhanced cyclic redundancy check (E-CRC) scheme as an efficient and simple priori stopping criterion. Simulation results show that the Turbo-PAST outperforms conventional system with 1.3dB and the proposed E-CRC scheme effectively reduces the amount of turbo processing iterations from the point of average number of iterations.

Design of High Rate Turbo Code for PR4 Channel (PR4 channel에서의 High Rate Turbo Code의 설계)

  • 변남균;김종태
    • Proceedings of the IEEK Conference
    • /
    • 2001.06b
    • /
    • pp.297-300
    • /
    • 2001
  • Turbo code shows the great performance near Shannon limit on AWGN channel. Mainly, turbo code has been studied and designed for wireless digital communications. There are recent studies that applies turbo decoder on magnetic recording. Because of the limited capacity of magnetic storages, high rate turbo code is used for magnetic storages. This paper presents some issues on implementing high rate turbo code and structures for designing turbo decoder

  • PDF

Design Turbo code with MAP decoder (MAP복호기를 이용한 Turbo code 설계)

  • 박태운;조원경
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.425-428
    • /
    • 1999
  • Turbo decoder were shown to achieve performance within 0.7㏈ of the Shannon capacity limit. This constituted a significant gain in power efficiency over other coding techniques known at the time. In this paper, Turbo code with constraint length K=4, code rate 1/3, frame size 196bits(6 tail bits), 20㎳ frame and 6bit MAP decoder is implemented using VHDL. The designed Turbo code is used for voice service. Interactions of the system are used to attain large performance improvements.

  • PDF

Turbo Perallel Space-Time Processing System with LDPC Code in MIMO Channel for High-Speed Wireless Communications (MIMO 채널에서 고속 무선 통신을 위한 LDPC 부호를 갖는 터보 병렬 시공간 처리 시스템)

  • 조동균;박주남;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10C
    • /
    • pp.923-929
    • /
    • 2003
  • Turbo processing have been known as methods close to Shannon limit in the aspect of wireless multi-input multi-output (MIMO) communications similarly to wireless single antenna communication. The iterative processing can maximize the mutual effect of coding and interference cancellation, but LDPC coding has not been used for turbo processing because of the inherent decoding process delay. This paper suggests a LDPC coded MIMO system with turbo parallel space-time (Turbo-PAST) processing for high-speed wireless communications and proposes a average soft-output syndrome (ASS) check scheme at low signal to noise ratio (SNR) for the Turbo-PAST system to decide the reliability of decoded frame. Simulation results show that the suggested system outperforms conventional system and the proposed ASS scheme effectively reduces the amount of turbo processing iterations without performance degradation from the point of average number of iterations.

LDPC Coding for image data and FPGA Implementation of LDPC Decoder (영상 정보의 LDPC 부호화 및 복호기의 FPGA구현)

  • Jang, Eun-Young
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.12 no.4
    • /
    • pp.569-574
    • /
    • 2017
  • In order to transmit information in a channel environment in which noise exists, a coding technique of information is required. One of the coding techniques used for error detection and correction close to the Shannon limit is Low Density Parity Code(LDPC). LDPC and decoding characteristic features by Sum-product algorithm are matched for the performance to Turbo Code, RA(Repeat Accumulate) code, in case of very long code length of LDPC surpass their performance. This paper explains LDPC coding scheme of image data and decoding scheme, implements LDPC decoder in FPGA.

Jeju Jong Nang Channel Code I (제주 정낭 채널 Code I)

  • Lee, Moon Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.27-35
    • /
    • 2012
  • In this paper, we look into a Jong Nang Channel which is the origin of digital communications and has been used in Jeju Island since AD 1234. It is one kind of communication ways which informs people of whether a house owner is in one's house or not using its own protocol. It is comprised of three timber and two stone pillars whose one side has three holes respectively. In this paper, we analyze the Jong-Nang Channel both in the light of logic and bit error probability. In addition, we compare it with a conventional binary erasure channel when some errors occur over them respectively. We also show that a capacity of NOR channel approaches Shannon limit.