• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.60-68
• /
• 2019

In this paper, we propose the adaptive beamforming algorithm for the MIMO (Multi-Input Multi-Out)-OFDMA(Orthogonal Frequency Division Multiplexing Access)system to improve the performance. The performance of MIMO-OFDMA systems is greatly decreased in the wireless channel environment with multiusers, because the received signals are much distorted by a cochannel interference (CCI) during the space-time decoding. The proposed approach can track the DOA of each signal from the multiple antennas of the desired user without being greatly dependent on the impinging angle. And beams are directed toward the multiple transmitters of the desired user while null beams are directed toward interference directions. Therefore, we can can effectively cancel CCI and mitigate the impairment of delay spread while preserving the STC(space time code) diversity. BER performance improvement is investigated through computer simulation by applying the proposed approach to MIMO-OFDMA system in a multipath fading channel with CCI.

• Journal of information and communication convergence engineering
• /
• v.4 no.4
• /
• pp.151-154
• /
• 2006

In this work, a novel optimal multiuser detection (MUD) approach, which not only achieves the optimal maximum-likelihood (ML)-like performance but also has reasonably low computational complexity, for Space-time coded OFDM (ST-OFDM) systems is presented. In the proposed detection scheme, the signal model is firstly re-expressed into linearly equivalent one. Then, with the linearly equivalent signal model, a new jointly MUD algorithm is proposed to detect signals. The ML-like bit-error-rate (BER) performance and reasonably low complexity of the proposed detection are verified by computer simulations.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.112-117
• /
• 2007

In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

• Journal of electromagnetic engineering and science
• /
• v.6 no.4
• /
• pp.203-208
• /
• 2006

Channel estimation and data detection for OFDM systems over time- and frequency-selective channels are investigated. Relying on the complex exponential basis expansion channel model, a pilot-embedded channel estimation scheme with low computational complexity and spectral efficiency is proposed. A periodic pilot sequence is superimposed at a low power on information bearing sequence at the transmitter before modulation and transmission. The channel state information(CSI) can be estimated using the first-order statistics of the received data. In order to enhance the performance of channel estimation, we recover the transmitted data which can be exploited to estimate CSI iteratively. Simulation results show that the proposed method is suitable for doubly-selective channel estimation for the OFDM systems and the performance of the proposed method can be better than that of the Wiener filter method under some conditions. Through simulations, we also analyze the factors which can affect the system performances.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.745-747
• /
• 2014

본 논문에서는 OFDM 기반 무선 백홀 시스템에 적용 할 수 있는 채널 추정 및 $2{\times}2$ MIMO 알고리즘을 VHDL로 구현하여, 무선 백홀 시스템용으로 제작한 보드의 FPGA에서 신호 검출 성능을 검증한다. 이를 위해, 먼저 매틀랩(Matlab) simulink를 이용하여 채널 추정 및 $2{\times}2$ MIMO 알고리즘을 floating-point와 fixed-point 모델로 설계하여 성능을 검증하고, 그 다음 Modelsim을 이용하여 VHDL로 구현한다. 구현된 알고리즘의 성능 검증을 위해 설계한 simulink 모델, Modelsim 시뮬레이션, ISE Chipscope, 그리고 오실로스코프로 측정한 결과들을 비교한다. 비교결과, Modelsim 시뮬레이션, ISE Chipscope, 그리고 오실로스코프로 측정한 결과들이 서로 동일함을 확인하였으며, simulink 모델의 결과와는 약간의 오차를 보임을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1124-1131
• /
• 2008

In this paper, we propose a timing synchronization scheme and its hardware architecture of the next generation IEEE 802.11n wireless LAN standard which is based on MIMO-OFDM technique. Proposed timing synchronization method takes two steps which consist of two modified auto-correlators. For coarse timing synchronization, a sliding window differentiator is used after a conventional auto-correlation in order to avoid plateau problem. The conjugate symmetry property of L-LTS is utilized for the simplification of fine timing synchronization. Since cross-correlation based methods are not required, the computational complexity and the number of multipliers can be reduced. In order to reduce the hardware complexity, we have used sign multipliers. Based on simulation results, the proposed method outperforms a conventional method. The proposed scheme can be applied to IEEE 802.11n systems and can easily be expanded to frequency synchronization scheme.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.165-168
• /
• 2015

In this paper, we analyze a SFBC-OFDM(Space Frequency Block Code-Orthogonal Frequency Division Multiplexing) system with antenna selection method using pilot symbols. An antenna selection criterion is based on channel coefficients estimated from pilot symbols. At each frequency, the channel coefficients is arranged and the best is selected, and then data is sent to those antenna with the best coefficients. Also, The coding and diversity gain of the proposed system are analyzed.

• ETRI Journal
• /
• v.28 no.5
• /
• pp.688-691
• /
• 2006

This letter addresses the superimposed pilot aided multiuser channel estimation for the uplinks of multi-input multi-output orthogonal frequency-division multiplexing systems. To mitigate the embedded-data effects on the performance of channel estimation, a novel combining algorithm is proposed. Optimal pilot symbols are developed with respect to the least square channel estimate's mean square error. The averaged sum-capacity lower bound is derived and simulated. Simulation results show that on a low signal-to-noise ratio regime, our proposed scheme achieves better performance and higher capacity than the conventional pilot aided approach.

• 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.