• ETRI Journal
• /
• 제36권4호
• /
• pp.564-571
• /
• 2014

Sphere decoding (SD) for multiple-input and multiple-output systems is a well-recognized approach for achieving near-maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM-MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal-to-noise ratio regime. To demonstrate the potential of our method, we compare the results with another well-known method - namely, probabilistic tree pruning SD.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1998년도 제13차 학술회의논문집
• /
• pp.201-204
• /
• 1998

This paper presents a new construction method of candidate controllers using Multi-modal Neural Network(MNN). To improve a control performance of multiple controller, we construct, candidate controllers which consist of MNN. MNN can learn more complicated function than multilayer neural network. MNN consists of preprocessing module and neural network module. The preprocessing module transforms input signals into spectra which are used as input of the following neural network module. We apply the proposed method to multiple control system which controls the cart-pole balancing system and show the effectiveness of the proposed method.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.320-326
• /
• 2016

In existing literature on multiple-input multiple-output (MIMO) relaying communication systems, antenna selection is often implemented by maximizing the channel capacity or the output single-to-noise ratio (SNR). In this paper, we propose an energy-efficient low-complexity antenna selection scheme for MIMO relaying communication systems. The proposed algorithm is based on beamforming and maximizing the Frobenius norm to jointly optimize the transmit power, number of active antennas, and antenna subsets at the source, relaying and destination. We maximize the energy efficiency between the link of source to relay and the link of relay to destination to obtain the maximum energy efficiency of the system, subject to the SNR constraint. Compared to existing antenna selection methods forMIMO relaying communication systems, simulation results demonstrate that the proposed method can save more power in term of energy efficiency, while having lower computational complexity.

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.141-149
• /
• 2007

Multiple-input multiple-output (MIMO) transmit pre-coding/beamforming can significantly improve system spectral efficiency. However, several obstacles prevent precoding from wide deployment in early wireless networks: The significant feedback overhead, performance degradation due to feedback delay, and the large storage requirement at the mobile devices. In this paper, we propose a precoding method that addresses these issues. In this approach, only 3 or 6 bits feedback is needed to select a precoding matrix from a codebook. There are fifteen codebooks, each corresponding to a unique combination of antenna configuration (up to 4 antennas) and codebook size. Small codebooks are prestored and large codebooks are efficiently computed from the prestored codebook, modified Hochwald method and Householder reflection. Finally, the feedback delay is compensated by channel prediction. The scheme is validated by simulations and we have observed significant gains comparing to space-time coding and antenna selection. This solution was adopted as a part of the IEEE 802.16e specification in 2005.

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.136-140
• /
• 2007

In this paper, an adaptive minimum transmit power modulation scheme under constant data rate and fixed bit error rate (BER) for the multiple-input multiple-output (MIMO) system is proposed. It adjusts the modulation order and allocates the transmit power to each spatial sub-channel when meeting the user's requirements at the cost of minimum transmission power. Compared to the other algorithm, it can obtain good performance with lower computational complexity and can be applied to the wireless communication system. Computer simulation results present the efficiency of the proposed scheme. And its performance under different channel condition has been compared with the other algorithm.

• Journal of Communications and Networks
• /
• 제18권4호
• /
• pp.649-657
• /
• 2016

In this paper, we investigate energy efficiency (EE) of the traditional co-located and the distributed massive multiple-input multiple-output (MIMO) systems. First, we derive an approximate EE expression for both the idealistic and the realistic power consumption models. Then an optimal energy-efficient remote access unit (RAU) selection algorithm based on the distance between the mobile stations (MSs) and the RAUs are developed to maximize the EE for the downlink distributed massive MIMO systems under the realistic power consumption model. Numerical results show that the EE of the distributed massive MIMO systems is larger than the co-located massive MIMO systems under both the idealistic and realistic power consumption models, and the optimal EE can be obtained by the developed energy-efficient RAU selection algorithm.

• 한국통신학회논문지
• /
• 제33권4C호
• /
• pp.330-335
• /
• 2008

본 논문은 IEEE802.11n 시스템의 패킷 검출에 필요한 알고리즘을 제안한다. IEEE802.11n 시스템은 다중 송수신 안테나 시스템으로서 IEEE802.11a 시스템에서 적용되는 알고리즘과 달리 다중 수신부에서 적용 가능한 결합 기법을 고려하여 적용하여야 한다. 따라서 본 논문에서는 단일 송수신 안테나 시스템에서 사용하는 이중 슬라이딩 윈도우 알고리즘과 지연 후 상관 알고리즘을 다중 수신 안테나 결합 알고리즘과 하이브리드하게 결합하여 패킷 검출부 알고리즘을 제시하고, 각각의 성능을 11n 환경에서 모의 실험하고 그 결과를 제시하였다.

• Journal of information and communication convergence engineering
• /
• 제9권4호
• /
• pp.385-390
• /
• 2011

In this paper, various ultra-wideband (UWB) spatial multiplxing (SM) multiple input multiple output (MIMO) receivers based on a prerake diversity combining scheme are discussed and their performance is analyzed. Several UWB MIMO detection approaches such as zero forcing (ZF), minimum mean square error (MMSE), ordered successive interference cancellation (OSIC), sorted QR decomposition (SQRD), and maximum likelihood (ML) are considered in order to cope with inter-channel interference. The UWB SM systems based on transmitter-side multipath preprocessing and receiver-side MIMO detection can either boost the transmission data rate or offer significant diversity gain and improved BER performance. The error performance and complexity of linear and nonlinear detection algorithms are comparatively studied on a lognormal multipath fading channel.

• Journal of Information Processing Systems
• /
• 제13권4호
• /
• pp.1029-1042
• /
• 2017

A joint channel estimation and data detection technique for a multiple input multiple output (MIMO) wireless communication system is proposed. It combines the least square (LS) training based channel estimation (TBCE) scheme with sphere decoding. In this new approach, channel estimation is enhanced with the help of blind symbols, which are selected based on their correctness. The correctness is determined via sphere decoding. The performance of the new scheme is studied through simulation in terms of the bit error rate (BER). The results show that the proposed channel estimation has comparable performance and better computational complexity over the existing semi-blind channel estimation (SBCE) method.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 춘계학술대회
• /
• pp.143-146
• /
• 2009

In this paper, we investigated the list sphere decoders (LSD) for multiple-input multiple-output (MIMO) systems. We showed that the ordering procedures play an important role in LSD in order to achieve the low complexity without degrading the bit-error-rate (BER) performance. Then, we proposed a novel ordering algorithm for the LSD which uses a look-up table and simply comparative operations. Comparative results in terms of BER performance and computational complexity are provided through computer simulations.