• 제목/요약/키워드: space-time block code

검색결과 146건 처리시간 0.021초

Joint Processing of Zero-Forcing Detection and MAP Decoding for a MIMO-OFDM System

  • Sohn, In-Soo;Ahn, Jae-Young
    • ETRI Journal
    • /
    • 제26권5호
    • /
    • pp.384-390
    • /
    • 2004
  • We propose a new bandwidth-efficient technique that achieves high data rates over a wideband wireless channel. This new scheme is targeted for a multiple-input multiple- output orthogonal frequency-division multiplexing (MIMO-OFDM) system that achieves transmit diversity through a space frequency block code and capacity enhancement through the iterative joint processing of zero-forcing detection and maximum a posteriori (MAP) decoding. Furthermore, the proposed scheme is compared to the coded Bell Labs Layered Space-Time OFDM (BLAST-OFDM) scheme.

  • PDF

Improved Design Criterion for Space-Frequency Trellis Codes over MIMO-OFDM Systems

  • Liu, Shou-Yin;Chong, Jong-Wha
    • ETRI Journal
    • /
    • 제26권6호
    • /
    • pp.622-634
    • /
    • 2004
  • In this paper, we discuss the design problem and the robustness of space-frequency trellis codes (SFTCs) for multiple input multiple output, orthogonal frequency division multiplexing (MIMO-OFDM) systems. We find that the channel constructed by the consecutive subcarriers of an OFDM block is a correlated fading channel with the regular correlation function of the number and time delay of the multipaths. By introducing the first-order auto-regressive model, we decompose the correlated fading channel into two independent components: a slow fading channel and a fast fading channel. Therefore, the design problem of SFTCs is converted into the joint design in both slow fading and fast fading channels. We present an improved design criterion for SFTCs. We also show that the SFTCs designed according to our criterion are robust against the multipath time delays. Simulation results are provided to confirm our theoretic analysis.

  • PDF

Novel Approach for Eliminating BER Irreducible Floor in the Enhanced Blind Cyclic Detection for Space-Time Coding

  • Pham, Van-Su;Le, Minh-Tuan;Mai, Linh;Kabir, S.M.Humayun;Yoon, Gi-Wan
    • Journal of information and communication convergence engineering
    • /
    • 제6권2호
    • /
    • pp.150-153
    • /
    • 2008
  • In the blind Maximum-likelihood (ML) detection for Orthogonal Space-Time Block Codes (OSTBC), the problem of ambiguity in determining the symbols has been a great concern. A possible solution to this problem is to apply semi-blind ML detection, i.e. the blind ML decoding with pilot symbols or training sequence. In order to increase the performance, the number of pilot symbols or length of training sequence should be increased. Unfortunately, this leads to a significantly decrease in system spectral efficiency. This work presents an approach to resolve the aforementioned issue by introducing a new method for constructing transmitted information symbols, in which transmitting information symbols drawn form different modulation constellations. Therefore, the ambiguity can be easily eliminated. In addition, computer simulation is implemented to verify the performance of the proposed approach.

Fast Binary Block Inverse Jacket Transform

  • Lee Moon-Ho;Zhang Xiao-Dong;Pokhrel Subash Shree;Choe Chang-Hui;Hwang Gi-Yean
    • Journal of electromagnetic engineering and science
    • /
    • 제6권4호
    • /
    • pp.244-252
    • /
    • 2006
  • A block Jacket transform and. its block inverse Jacket transformn have recently been reported in the paper 'Fast block inverse Jacket transform'. But the multiplication of the block Jacket transform and the corresponding block inverse Jacket transform is not equal to the identity transform, which does not conform to the mathematical rule. In this paper, new binary block Jacket transforms and the corresponding binary block inverse Jacket transforms of orders $N=2^k,\;3^k\;and\;5^k$ for integer values k are proposed and the mathematical proofs are also presented. With the aid of the Kronecker product of the lower order Jacket matrix and the identity matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse, fast algorithm and prime based $P^k$ order of proposed binary block inverse Jacket transform, it can be applied in communications such as space time block code design, signal processing, LDPC coding and information theory. Application of circular permutation matrix(CPM) binary low density quasi block Jacket matrix is also introduced in this paper which is useful in coding theory.

자동 코드생성을 이용한 무인기용 OFP의 검증에 관한 연구 (A Study on Validation of OFP for UAV using Auto Code Generation)

  • 조상욱;최기영
    • 한국항공우주학회지
    • /
    • 제37권4호
    • /
    • pp.359-366
    • /
    • 2009
  • 자동 코드생성이란 MATLAB의 Simulink 환경에서 설계한 블록 다이어그램을 c 코드로 변환시켜 주는 기능으로 MATLAB과의 연동을 통해 소프트웨어 설계부터 검증까지의 통합된 개발환경을 제공함으로서 개발 시간을 크게 줄일 수 있다. 하지만 생성된 c 프로그램을 무인기에 탑재하기 위해서는 소프트웨어의 신뢰성 확보가 필요하며 특히 원본이 되는 Simulink 블록의 검증이 중요하다. 본 연구에서는 자동 코드생성 기능을 고려하여 Simulink 환경에서 구성한 무인기용 자동비행 프로그램을 DO-178B에 명시된 소프트웨어 시험 과정에 따라 검증하였다. 이 과정을 통해 최종 프로그램은 기능 요구사항에 대한 만족함을 확인했을 뿐 아니라 Decision Coverage 93%, Condition Coverage 95% 그리고 MC/DC 90%로 구조적 측면에서 검증을 수행했다.

Code Combining Cooperative Diversity in Long-haul Transmission of Cluster based Wireless Sensor Networks

  • Asaduzzaman, Asaduzzaman;Kong, Hyung-Yun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권7호
    • /
    • pp.1293-1310
    • /
    • 2011
  • A simple modification of well known Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is proposed to exploit cooperative diversity. Instead of selecting a single cluster-head, we propose M cluster-heads in each cluster to obtain a diversity of order M. The cluster-heads gather data from all the sensor nodes within the cluster using same technique as LEACH. Cluster-heads transmit gathered data cooperatively towards the destination or higher order cluster-head. We propose a code combining based cooperative diversity protocol which is similar to coded cooperation that maximizes the performance of the proposed cooperative LEACH protocol. The implementation of the proposed cooperative strategy is analyzed. We develop the upper bounds on bit error rate (BER) and frame error rate (FER) for our proposal. Space time block codes (STBC) are also a suitable candidate for our proposal. In this paper, we argue that the STBC performs worse than the code combining cooperation.

이동통신 환경에서 개선된 송신 다이버시티를 이용하는 STBC-OFDM 시스템의 성능 개선 (Performance Improvement of STBC-OFDM System with Advanced Transmit Diversity in Mobile Communications Environment)

  • 김장욱;양희진;오창헌;조성준
    • 한국전자파학회논문지
    • /
    • 제15권5호
    • /
    • pp.444-450
    • /
    • 2004
  • 이동통신 환경에서 송신 다이버시티를 이용하는 STBC-OFDW(Space Time Block Code-Orthogonal Frequency Division Multiplexing) 시스템의 성능은 두 심볼을 전송하는 시간 동안 채널 특성이 변하지 않을 경우, MRRC (Maximal Ratio Receiver Combining)의 다이버시티 이득을 얻는다. 그러나 채널 특성이 변하게 되면 수신단에서 수신 심볼간에 서로 간섭영향을 주기 때문에 MRRC의 다이버시티 이득이 발생하지 않는다. 따라서 이동통신환경에서 송신 다이버시티를 적용한 이동체가 고속으로 이동할 경우 이러한 간섭영향에 의한 성능 감소의 영향을 줄일 수 있는 방안이 필요하다. 본 논문에서는 이동통신 환경에서 개선된 송신 다이버시티를 이용하여 STBC-OFDM 시스템의 성능을 개선시킬 수 있는 수신기 구조를 제안하였다. 제안하는 구조는 수신단에 ZF(Zero Forcing) 알고리즘을 이용한 간섭제거기를 사용하여 전송대역폭의 변화 없이 다이버시티 이득을 얻을 수 있다. 시뮬레이션 결과 도플러 주파수가 클수록 성능 개선 정도가 커지는 특징을 갖는다.

전자상거래를 위한 128비트 블록 암호 알고리즘의 구현 (An Implementation of 128bit Block Cipher Algorithm for Electronic Commerce)

  • 서장원;전문석
    • 한국전자거래학회지
    • /
    • 제5권1호
    • /
    • pp.55-73
    • /
    • 2000
  • Recently; EC(Electronic Commerce) is increasing with high speed based on the expansion of Internet. EC which is done on the cyber space through Internet has strong point like independence from time and space. On the contrary, it also has weak point like security problem because anybody can access easily to the system due to open network attribute of Internet. Therefore, we need the solutions that protect the security problem for safe and useful EC activity. One of these solutions is the implementation of strong cipher algorithm. NC(Nonpolynomial Complete) cipher algorithm proposed in this paper is good for the security and it overcome the limit of current 64bits cipher algorithm using 128bits key length for input, output and encryption key, Moreover, it is designed for the increase of calculation complexity and probability calculation by adapting more complex design for subkey generation regarded as one of important element effected to encryption. The result of simulation by the comparison with other cipher algorithm for capacity evaluation of proposed NC cipher algorithm is that the speed of encryption and decryption is 7.63 Mbps per block and the speed of subkey generation is 2,42 μ sec per block. So, prosed NC cipher algorithm is regarded as proper level for encryption. Furthermore, speed of subkey generation shows that NC cipher algorithm has the probability used to MAC(Message Authentication Code) and block implementation of Hash function.

  • PDF

비장착 엔진/나셀 형상에 대한 3차원 Euler 유동 해석 (Calculations of 3D Euler Flows around an Isolated Engine/Nacelle)

  • 김수미;양수석;이대성
    • 한국전산유체공학회지
    • /
    • 제2권2호
    • /
    • pp.51-58
    • /
    • 1997
  • A reliable computational solver has been developed for the analysis of three-dimensional inviscid compressible flows around a nacelle of a high bypass ratio turbofan engine, The numerical algorithm is based on the modified Godunov scheme to allow the second order accuracy for space variables, while keeping the monotone features. Two step time integration is used not only to remove time step limitation but also to provide the second order accuracy in a time variable. The multi-block approach is employed to calculate the complex flow field, using an algebraic, conformal, and elliptic method. The exact solution of Riemann problem is used to define boundary conditions. The accuracy of the developed solver is validated by comparing its results around the isolated nacelle in the cruise flight regime with the solution obtained using a commercial code "RAMPANT. "

  • PDF

전송신뢰성의 향상을 위해 STBC에 컨볼루션 코드를 연계한 시스템의 성능분석 (Performance Analysis of STBC System Combined with Convolution Code fot Improvement of Transmission Reliability)

  • 신현준;강철규;오창헌
    • 한국항행학회논문지
    • /
    • 제15권6호
    • /
    • pp.1068-1074
    • /
    • 2011
  • 본 논문에서는 고속 무선 데이터 전송에서 높은 데이터 전송의 신뢰성을 얻기 위해 MIMO(multi-input multi-output) 기술 중 하나인 시공간 블록 코드(STBC: space-time block codes)와 채널코딩 중 하나인 컨볼루션 코드(convolution code)를 연계한 시스템을 제안한다. 또한 이 시스템은 전송한 데이터를 복원하며 높은 시스템 이득을 가지기 위해 수정된 비터비 알고리즘을 사용한다. 제안한 시스템은 시공간 블록 코드와 컨볼루션 코드를 연계하였기 때문에 시스템의 복잡도는 다소 높지만 STBC의 최대 다이버시티 이득과 컨볼루션 코드의 높은 부호화 이득을 동시에 얻을 수 있는 큰 장점이 있다. 수정된 비터비 알고리즘은 기존의 비터비 알고리즘과 달리 브랜치 매트릭스를 구하기 위해 해밍 거리를 사용하지 않고 수신 심볼과 레퍼런스 심볼 사이의 유클리디안 거리를 사용한다. 제안한 시스템을 시뮬레이션 한 결과 기존의 시스템보다 7.5 dB(STBC 2Tx-2Rx $BER=10^{-3}$ )의 성능이 향상됨을 확인 할 수 있었다. 이 결과를 통해 STBC와 컨볼루션 코드를 연계할 때 본 논문에서 제안한 알고리즘을 사용하면 향상된 전송 신뢰성과 전송 효율로 데이터를 전송 할 수 있다.