• 제목/요약/키워드: MIMO(Multiple-Input-Multiple-Output)

검색결과 668건 처리시간 0.025초

Error-detection-coding-aided iterative hard decision interference cancellation for MIMO systems with HARQ

  • Park, Sangjoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권3호
    • /
    • pp.1016-1030
    • /
    • 2018
  • In this paper, an error-detection-coding-aided iterative hard decision interference cancellation (EDC-IHIC) scheme for multiple-input multiple-output systems employing hybrid automatic repeat request (HARQ) for multi-packet transmission is developed and investigated. In the EDC-IHIC scheme, only packets identified as error-free by the EDC are submitted to the interference cancellation (IC) stage for cancellation from the received signals. Therefore, the possibility of error propagation, including inter-transmission error propagation, can be eliminated using EDC-IHIC. Because EDC must be implemented in systems that employ HARQ to determine packet retransmission, error propagation can be prevented without the need for additional redundancy. The results of simulations conducted herein verify that the EDC-IHIC scheme outperforms conventional hard decision IC schemes in terms of the packet error rate in various environments.

선형 감소 K-Best LSD 알고리즘 (Linearly Decreasing K-Best List Sphere Decoding Algorithm)

  • 홍석철;이정우
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2012년도 하계학술대회
    • /
    • pp.373-376
    • /
    • 2012
  • Multiple-Input Multiple-Output (MIMO) 시스템의 복잡도를 감소시키는 방식은 실생활에서 MIMO 시스템을 활용하는 데에 있어 중요한 부분이다. 널리 사용되는 Maximum Likelihood (ML) 복호기의 경우 낮은 에러오율 (BER) 을 보여주지만 복잡도가 높다. 실생활에 활용하기 위하여 ML 복호기의 복잡도를 감소시킬 필요가 있고 이에 Sphere Decoding Algorithm (SDA) 이 제안되었다. 이를 발전시킨 List Sphere Decoding(LSD) 은 여러 종류가 있다. 그 중에 넓이 우선 탐색 방식인 K-Best LSD 알고리즘은 각 레이어에서 리스트의 크기가 복잡도와 밀접한 연관이 있다. 본 논문에서는 기존의 K-Best LSD 알고리즘에 기반하여 초기 반지름 설정 및 선형적으로 리스트 크기를 감소시키는 방식으로 K-Best LSD 알고리즘의 복잡도를 기존 알고리즘에 비해 크게 낮추면서도 비트 오율 성능 열화가 적은 알고리즘을 제안하고 전산 실험을 통해 이를 검증한다.

  • PDF

Throughput-Reliability Tradeoff in Decode-and-Forward Cooperative Relay Channels: A Network Information Theory Approach

  • Li, Jun;Chen, Wen
    • Journal of Communications and Networks
    • /
    • 제11권5호
    • /
    • pp.445-454
    • /
    • 2009
  • Cooperative transmission protocols are always designed to achieve the largest diversity gain and the network capacity simultaneously. The concept of diversity-multiplexing tradeoff (DMT) in multiple input multiple output (MIMO) systems has been extended to this field. However, DMT constrains a better understanding of the asymptotic interplay between transmission rate, outage probability (OP) and signal-to-noise ratio. Another formulation called the throughput-reliability tradeoff (TRT) was then proposed to avoid such a limitation. By this new rule, Azarian and Gamal well elucidated the asymptotic trends exhibited by the OP curves in block-fading MIMO channels. Meanwhile they doubted whether the new rule can be used in more general channels and protocols. In this paper, we will prove that it does hold true in decode-and-forward cooperative protocols. We deduce the theoretic OP curves predicted by TRT and demonstrate by simulations that the OP curves will asymptotically overlap with the theoretic curves predicted by TRT.

A New Approach to Get the Optimum Channel Capacity in MIMO Systems

  • Su, Pham-Van;Tuan, Le-Minh;Giwan Yoon
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2002년도 추계종합학술대회
    • /
    • pp.317-319
    • /
    • 2002
  • In this paper, a new method to get the optimum channel capacity of a Multiple-Input Multiple-Output (MIMO) system is presented. The proposed method exploits the diagonal structure o f channel matrix in order to maximize the channel capacity. The diagonal format of the channel matrix is formed by multiplying the transmitted signal with the precompensated channel (PCC) matrix. Numerical simulations show that the proposed method exploiting the diagonal structure of channel matrix could significantly increase the system capacity compared with the system without applying the diagonal structure of channel matrix.

  • PDF

채널 추정 에러와 동적 파워 할당 기술이 적용된 MIMO 시스템 (Quasi-Orthogonal STBC based on Partial Feedback with Adaptive Power Allocation under Imperfect Channel Estimation)

  • 허창열;이동훈;김기선
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2007년도 하계종합학술대회 논문집
    • /
    • pp.83-84
    • /
    • 2007
  • Multiple-input multiple-output (MIMO) systems can achieve the increasing of performances by using an adaptive power allocation. The related previous work limited the transmit antenna number because orthogonal space-time block codes (OSTBCs) yield full transmit rate only for two transmit antennas. We extend a robust system under imperfect channel estimation for four transmission antennas with maintaining a full transmission rate.

  • PDF

Approximate ML Detection with the Best Channel Matrix Selection for MIMO Systems

  • Jin, Ji-Yu;Kim, Seong-Cheol;Park, Yong-Wan
    • Journal of Electrical Engineering and Technology
    • /
    • 제3권2호
    • /
    • pp.280-284
    • /
    • 2008
  • In this paper, a best channel matrix selection scheme(BCMS) is proposed to approximate maximum likelihood(ML) detection for a multiple-input multiple-output system. For a one stage BCMS scheme, one of the transmitted symbols is selected to perform ML detection and the other symbols are detected by zero forcing(ZF). To increase the diversity of the symbols that are detected by ZF, multi-stage BCMS detection scheme is used to further improve the system performance. Simulation results show that the performance of the proposed BCMS scheme can approach that of ML detection with a significant reduction in complexity.

A Study on Complexity Reduction for Space-Time Block Codes Decoder in MIMO OFDM systems

  • Pham, Van-Su;Le, Minh-Tuan;Mai, Linh;Yoon, Gi-Wan
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2005년도 춘계종합학술대회
    • /
    • pp.117-121
    • /
    • 2005
  • In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is defined by the intersection of an approximate polygon of searching circle and disk of lattice constellation. Therefore, the proposed scheme can reduce the searching boundary and it can avoid missing searching points as well. The performance of the proposed scheme, which is verified by computer simulations, consolidates our scheme.

  • PDF

WiBro Wave2 Cell Plan Tool 구현 (Implementation of WiBro Wave2 Cell Plan Tool)

  • 전현철
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 한국정보통신설비학회 2008년도 정보통신설비 학술대회
    • /
    • pp.233-236
    • /
    • 2008
  • There are several kinds of service standards for 3G($3^{rd}$-Generation) wireless communication as WCDMA, CDMA2000 and WiBro(Wireless Broadband Internet). Especially WiBro Wave2 system is a marked currnt issue. In this paper, we describe on the cell plan tool to desgin WiBro Wave2 network. For this, we treat from basic theory to practical substance to produce new(or modified) path loss prediction model for 2.3GHz. And we explain the method how to implement new technology MIMO(Multiple Input Multiple Output) deployed in Wave2 system. Also we emphasize on the importance of LOS(Line Of Sight) analysis in WiBro network design.

  • PDF

Complexity Reduction for Space-Time Block Codes Decoder in MIMO OFDM Systems

  • Pham Van-Su;Le Minh-Tuan;Mai Linh;Yoon Giwan
    • Journal of information and communication convergence engineering
    • /
    • 제3권2호
    • /
    • pp.72-75
    • /
    • 2005
  • In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.

Novel High-Rate High-Performance Space-Time Codes

  • Le, Minh-Tuan;Mai Linh;Pham, Van-Su;Giwan Yoon
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2004년도 SMICS 2004 International Symposium on Maritime and Communication Sciences
    • /
    • pp.32-35
    • /
    • 2004
  • In this paper, we propose two novel high-rate high-performance space-time codes for multiple-input multiple-output (MIMO) systems. When $n_{T}$ transmit antennas and $n_{R}$ = $n_{T}$ receive antennas are deployed, the two proposed codes respectively offer transmission rates of ( $n_{T}$ -I) and ( $n_{T}$ - 2) symbols per channel use and diversity orders of 3 and 5. As a consequence, our proposed codes allow the MIMO systems to employ a simple detection technique based on QR decomposition. Moreover, for equal or even higher spectral efficiencies, our proposed codes always provide much better bit error rate (BER) performances than V-BLAST architecture does when $n_{R}$ = $n_{T}$. Computer simulation is given to verify performances of our proposed codes.sed codes.des.

  • PDF