The search functionality is under construction.

Author Search Result

[Author] Jae-Hyun RO(3hit)

1-3hit
  • A Simplified QRD-M Algorithm in MIMO-OFDM Systems

    Jong-Kwang KIM  Jae-Hyun RO  Hyoung-Kyu SONG  

     
    LETTER-Communication Theory and Signals

      Vol:
    E100-A No:10
      Page(s):
    2195-2199

    The Long Term Evolution (LTE) of mobile communication standard was designed by the 3rd generation partnership project (3GPP) to serve the requirements. Nowadays, the combining of the orthogonal frequency division multiplexing (OFDM) and the multiple input multiple output (MIMO) is supported in LTE system. The MIMO-OFDM is considered to improve data rate and channel capacity without additional bandwidth. Because the receivers get all transmission signals from all transmitters at the same time, many detection schemes have been developed for accurate estimation and low complexity. Among the detection schemes, the QR decomposition with M algorithm (QRD-M) achieves optimal error performance with low complexity. Nevertheless, the conventional QRD-M has high complexity for implementation. To overcome the problem, this letter proposes the low complexity QRD-M detection scheme in MIMO-OFDM systems. The proposed scheme has two elements which decide layer value and the limited candidates. The two elements are defined by the number of transmit antennas and the cardinality of modulation set respectively. From simulation results, the proposed scheme has the same error performance with the conventional QRD-M and very lower complexity than the conventional QRD-M.

  • Adaptive K-Best BFTS Signal Detection Algorithm Based on the Channel Condition for MIMO-OFDM Signal Detector

    Jong-Kwang KIM  Seung-Jin CHOI  Jae-Hyun RO  Hyoung-Kyu SONG  

     
    LETTER-Communication Theory and Signals

      Vol:
    E100-A No:10
      Page(s):
    2207-2211

    The breadth-first tree searching (BFTS) detection algorithm such as the QR decomposition with M algorithm (QRD-M) which is the generally K-best detection algorithm is suboptimal, but has high complexity. In this letter, the K-best BFTS detection algorithm having reduced complexity is proposed. The proposed detection algorithm calculates the channel condition to decide the thresholds for regulating complexity and performance and from the simulation results, it has good error performance with very low complexity.

  • The Cooperative Recovery Scheme Using Adjacent Base Stations in the Wireless Communication System

    Young-Min KO  Jae-Hyun RO  Hyoung-Kyu SONG  

     
    LETTER-Digital Signal Processing

      Vol:
    E99-A No:10
      Page(s):
    1871-1875

    In a wireless communication system, the base station failure can result in a communication disruption in the cell. This letter aims to propose an alternative way to cope with the base station failure in a wireless communication system, based on MIMO-OFDM. Cooperative communication can be a solution to the problem. Unlike general cooperative communication, this letter attempts to cover cooperation among adjacent base stations. This letter proposes a specific configuration of transmission signals which is applied to the CDD scheme. The proposed cooperative system can obtain multiplexing gain and diversity gain at the same time. A more reliable performance can be obtained by the proposed cooperative system which uses cooperation of adjacent base stations.