• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.115-116
• /
• 2008

본 논문에서는 다중입력 다중출력(Multiple Input Multiple Output: MIMO) 시스템에서 Maximum Likelihood (ML) 수신기와 같은 성능을 가지지만 복잡도가 낮은 Sphere Decoding (SD) 알고리즘에 대해 분석하고, 그 성능을 평가한다. 각각의 송신 안테나에서 채널로 전송되는 독립적인 신호는 QPSK 방식을 사용하여 변조되며, 채널은 산란이 활발하게 일어나는 레일리(Rayleigh) 평탄 페이딩 채널로 가정한다. 수신기에서 수신된 신호는 Fincke & Pohst SD 알고리즘에 의해 간 송신 안테나로부터의 독립적인 신호로 검파되며 그 성능이 ML수신기의 성능과 비교되었다. 추가적으로 복잡도를 줄이기 위해 개선된 형태인 Viterbo & Boutros SD 알고리즘을 이용하여 검파된 신호의 BER 성능과 부동 소수점 연산량 (Floating Point Operations: FLOPS)이 각각 비교 분석되었다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.1-3
• /
• 2010

스피어 복호 알고리즘 (sphere decoding algorithm)은 다중 입출력 (MIMO) 통신 시스템에서 사용되는 복호기중 최대 우도 복호기 (Maximum Likelihood Detector)와 비슷한 BER(bit error rate)성능을 가지고 복잡도를 줄일수 있어서 최근 많이 연구되어 왔다. 이때 공간 다중화와 채널 부호의 연접시스템에서 연판정 정보(Soft output information) 를 스피어 복호 알고리즘을 통해 생성하기 위한 방법으로 리스트 스피어 복호 알고리즘 (List Sphere Decoding)이 알려져있다. 기존 리스트 스피어 디코딩 알고리즘은 리스트를 반지름을 업데이트 하지 않으므로 탐색시 복잡도가 매우 높다는것이 문제가 되므로, 차원별로 최적해의 가능성이 높은 격자 주변으로 검색을 제한하여 복잡도를 줄이는 알고리즘을 제안하고 성능과 복잡도를 실험한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.231-237
• /
• 2010

Multi-input multi-output (MIMO) systems are used to improve the transmission rate in proportion to the number of antennas. However, their computational complexity is very high for the detection in the receiver. The sphere decoding (SD) is a detection algorithm with reduced complexity. In this paper, an improved Schnorr-Euchner SD (SE SD) is proposed based on the minimum mean square error (MMSE) and the Euclidean distance criteria without additional complexity.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• 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 알고리즘의 복잡도를 기존 알고리즘에 비해 크게 낮추면서도 비트 오율 성능 열화가 적은 알고리즘을 제안하고 전산 실험을 통해 이를 검증한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• 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.

• Journal of information and communication convergence engineering
• /
• v.3 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.34-42
• /
• 2007

The sphere decoder (SD) has recently been proposed to perform maximum likelihood (ML) decoding for multi-input multi-output systems. Employing a 'breadth-first' searching algorithm for closet points in a lattice, we propose a novel ML decoding scheme for multi-input multi-output systems. Simulation results show that the proposed scheme has the same bit error rate performance as the conventional ML decoders while allowing significantly lower computational burden than the SD.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.523-529
• /
• 2017

In this paper, we propose an efficient sphere decoding scheme that reduces computational complexity by combining receive and transmit ordering techniques in generalized spatial modulation systems, where the indexes of activated transmit antennas as well as the transmit symbols are exploited to transfer information to the receiver. In this scheme, the receive signals are optimally ordered so that the calculation for a candidate solution outside the sphere is terminated early to lower the computational complexity. In addition, the transmit ordering technique is applied to first search for candidate symbols and activated antennas having higher probabilities to further reduce the computational complexity. Simulation results show that the proposed doubly ordered sphere decoding scheme provides the same bit error rate performance with the conventional sphere decoding method and the sphere decoder employing only the receive ordering technique while it requires lower computational complexity.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.3
• /
• pp.13-18
• /
• 2011

Sphere Decoding (SD) is a decoding technique able to achieve the Maximum Likelihood (ML) performance in fading environments; nevertheless, the main disadvantage of this technique is its high complexity, especially in poor channel conditions. In this paper, we present an adaptive hybrid algorithm which reduces the conventional Sphere Decoder's complexity and keeps the ML performance. The system called Adaptive OSIC-SD modifies its operation based on Signal to Noise Ratio (SNR) information and achieves an optimal performance in terms of Bit Error Rate (BER) and complexity. Through simulations, we probe that the proposed system maintains almost the same bit error rate performance of the conventional SD, and exhibits a lower, quasi-constant complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8C
• /
• pp.522-528
• /
• 2011

The iterative detection and decoding (IDD) has been shown to dramatically improve the bit error rate (BER) performance of the multiple-input multiple-output (MIMO) communication systems. However, these techniques require a high computational complexity since it is required to compute the soft decisions for each bit. In this paper, we show IDD comprised of sphere decoder with low-density parity check (LDPC) codes and present the tree search strategy, called a layer symbol search (LSS), to obtain soft decisions with a low computational complexity. In addition, an adaptive early termination is proposed to reduce the computational complexity during an iteration between an inner sphere decoder and an outer LDPC decoder. It is shown that the proposed approach can achieve the performance similar to an existing algorithm with 70% lower computational complexity compared to the conventional algorithms.