• Title/Summary/Keyword: Sphere decoding

Search Result 48, Processing Time 0.024 seconds

Soft-Decision Algorithm with Low Complexity for MIMO Systems Using High-Order Modulations (고차 변조 방식을 사용하는 MIMO 시스템을 위한 낮은 복잡도를 갖는 연판정 알고리즘)

  • Lee, Jaeyoon;Kim, Kyoungtaek
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.6
    • /
    • pp.981-989
    • /
    • 2015
  • In a log likelihood ratio(LLR) calculation of the detected symbol, multiple-input multiple-output(MIMO) system applying an optimal or suboptimal algorithm such as a maximum likelihood(ML) detection, sphere decoding(SD), and QR decomposition with M-algorithm Maximum Likelihood Detection(QRM-MLD) suffers from exponential complexity growth with number of spatial streams and modulation order. In this paper, we propose a LLR calculation method with very low complexity in the QRM-MLD based symbol detector for a high order modulation based $N_T{\times}N_R$ MIMO system. It is able to approach bit error rate(BER) performance of full maximum likelihood detector to within 1 dB. We also analyze the BER performance through computer simulation to verify the validity of the proposed method.

An Adaptive Decoding Algorithm Using the Differences Between Level Radii for MIMO Systems (다중 송수신 안테나 시스템에서 단계별 반경의 차이를 이용한 적응 복호화 알고리즘)

  • Kim, Sang-Hyun;Park, So-Ryoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7C
    • /
    • pp.618-627
    • /
    • 2010
  • In this paper, we propose an adaptive K-best algorithm in which the number K of candidates is changed according to the differences of level radii. We also compare the bit error performance and complexity of the proposed algorithm with those of several conventional K-best algorithms, where the complexity is defined as the total number of candidates of which partial Euclidean distances have to be calculated. The proposed algorithm adaptively decides K at each level by eliminating the symbols, whose differences of radii are larger than a threshold, from the set of candidates, and the maximum or average value of differences can be adopted as the threshold. The proposed decoding algorithm shows the better bit error performance and the lower complexity than a conventional K-best decoding algorithm with a constant K, and also has a similar bit error performance and the lower complexity than other adaptive K-best algorithms.

Low-Complexity Maximum-Likelihood Decoder for V-BLAST Architecture

  • Le, Minh-Tuan;Pham, Van-Su;Mai, Linh;Yoon, Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.126-130
    • /
    • 2005
  • In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providingthe V-BLAST schemes with ML performance at low detection complexity.

  • PDF

The Improved Success Rate of Integer Ambiguity Resolution by Using Many Visible GPS/GNSS Satellites

  • Kondo, Kentaro
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.2
    • /
    • pp.243-246
    • /
    • 2006
  • This study investigates the improvement in the theoretical success rate of the integer ambiguity resolution in GPS/GNSS carrier-phase positioning by using many visible satellites. It estimates the dependence of the rate on the baseline length in relative positioning under the condition of the use of double/triple-frequency navigation signals. The calculation results show that the use of 14 navigation satellites (i.e., seven GPS and seven Galileo ones) remarkably improves the success rate under the condition of very short baseline length, compared with the use of seven GPS ones. The numerical reliability of the calculated success rates is strictly tested by examining the tightness of the union and minimum-distance bounds to the rate. These bounds are also shown to be effective to investigate the realization of the high success rates.

  • PDF

Simplified Maximum-Likelihood Decoder for V-BLAST Architecture

  • Le Minh-Tuan;Pham Van-Su;Mai Linh;Yoon Giwan
    • Journal of information and communication convergence engineering
    • /
    • v.3 no.2
    • /
    • pp.76-79
    • /
    • 2005
  • In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providing the V­BLAST schemes with ML performance at low detection complexity

On the Hardware Complexity of Tree Expansion in MIMO Detection

  • Kong, Byeong Yong;Lee, Youngjoo;Yoo, Hoyoung
    • Journal of Semiconductor Engineering
    • /
    • v.2 no.3
    • /
    • pp.136-141
    • /
    • 2021
  • This paper analyzes the tree expansion for multiple-input multiple-output (MIMO) detection in the viewpoint of hardware implementation. The tree expansion is to calculate path metrics of child nodes performed in every visit to a node while traversing the detection tree. Accordingly, the tree-expansion unit (TEU), which is responsible for such a task, has been an essential component in a MIMO detector. Despite the paramount importance, the analyses on the TEUs in the literature are not thorough enough. Accordingly, we further investigate the hardware complexity of the TEUs to suggest a guideline for selection. In this paper, we focus on a pair of major ways to implement the TEU: 1) a full parallel realization; 2) a transformation of the formulae followed by common subexpression elimination (CSE). For a logical comparison, the numbers of multipliers and adders are first enumerated. To evaluate them in a more practical manner, the TEUs are implemented in a 65-nm CMOS process, and their propagation delays, gate counts, and power consumptions were measured explicitly. Considering the target specification of a MIMO system and the implementation results comprehensively, one can choose which architecture to adopt in realizing a detector.

360-degree Video Streaming System for Large-scale Immersive Displays (대형 가상현실 공연장을 위한 360도 비디오 스트리밍 시스템)

  • Yeongil, Ryu;Kon Hyong, Kim;Andres, Cabrera;JoAnn, Kuchera-Morin;Sehun, Jeong;Eun-Seok, Ryu
    • Journal of Broadcast Engineering
    • /
    • v.27 no.6
    • /
    • pp.848-859
    • /
    • 2022
  • This paper presents a novel 360-degree video streaming system for large-scale immersive displays and its ongoing implementation. Recent VR systems aim to provide a service for a single viewer on HMD. However, the proposed 360-degree video streaming system enables multiple viewers to explore immersive contents on a large-scale immersive display. The proposed 360-degree video streaming system is being developed in 3 research phases, with the final goal of providing 6DoF. Currently, the phase 1: implementation of the 3DoF 360-degree video streaming system prototype is finished. The implemented prototype employs subpicture-based viewport-dependent streaming technique, and it achieved bit-rate saving of about 80% and decoding speed up of 543% compared to the conventional viewport-independent streaming technique. Additionally, this paper demonstrated the implemented prototype on UCSB AlloSphere, the large-scale instrument for immersive media art exhibition.

Performance analysis of maximum likelihood detection for the spatial multiplexing system with multiple antennas (다중 안테나를 갖는 공간 다중화 시스템을 위한 maximum likelihood 검출기의 성능 분석)

  • Shin Myeongcheol;Song Young Seog;Kwon Dong-Seung;Seo Jeongtae;Lee Chungyong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.103-110
    • /
    • 2005
  • The performance of maximum likelihood(ML) detection for the given channel is analyzed in spatially multiplexed MIMO system. In order to obtain the vector symbol error rate, we define error vectors which represent the geometrical relation between lattice points. The properties of error vectors are analyzed to show that all lattice points in infinite lattice almost surely have four nearest neighbors after random channel transformation. Using this information and minimum distance obtained by the modified sphere decoding algorithm, we formulate the analytical performance of vector symbol error over the given channel. To verify the result, we simulate ML performance over various random channel which are classified into three categories: unitary channel, dense channel, and sparse channel. From the simulation results, it is verified that the derived analytical result gives a good approximation about the performance of ML detector over the all random MIMO channels.