Author Search Result

[Author] Jongsub CHA(6hit)

1-6hit
  • A Computationally Efficient Fano-Based Sequential Detection Algorithm for V-BLAST Systems

    Jongsub CHA  Joonhyuk KANG  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E90-B No:6
      Page(s):
    1528-1531

    We present a computationally efficient sequential detection scheme using a modified Fano algorithm (MFA) for V-BLAST systems. The proposed algorithm consists of the following three steps: initialization, tree searching, and optimal selection. In the first step, the proposed detection scheme chooses several candidate symbols at the tree level of one. Based on these symbols, the MFA then finds the remaining transmitted symbols from the second tree level in the original tree structure. Finally, an optimal symbol sequence is decided among the most likely candidate sequences searched in the previous step. Computer simulation shows that the proposed scheme yields significant saving in complexity with very small performance degradation compared with that of sphere detection (SD).

  • Low Complexity Tree Searching-Based Iterative Precoding Techniques for Multiuser MIMO Broadcast Channel

    Jongsub CHA  Kyungho PARK  Joonhyuk KANG  Hyuncheol PARK  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E91-B No:6
      Page(s):
    2045-2048

    In this letter, we propose two computationally efficient precoding algorithms that achieve near-ML performance for multiuser MIMO downlink. The proposed algorithms perform tree expansion after lattice reduction. The first full expansion is tried by selecting the first level node with a minimum metric, constituting a reference metric. To find an optimal sequence, they iteratively visit each node and terminate the expansion by comparing node metrics with the calculated reference metric. By doing this, they significantly reduce the number of undesirable node visit. Monte-Carlo simulations show that both proposed algorithms yield near-ML performance with considerable reduction in complexity compared with that of the conventional schemes such as sphere encoding.

  • Reduced-Complexity Stack-Based Iterative Detection for V-BLAST Systems

    Jongsub CHA  Keonkook LEE  Joonhyuk KANG  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E90-B No:10
      Page(s):
    2897-2902

    In this paper, a computationally efficient stack-based iterative detection algorithm is proposed for V-BLAST systems. To minimize the receiver's efforts as much as possible, the proposed scheme employs iterative tree search for complexity reduction and storage saving. After an M-ary tree structure by QR decomposition of channel matrix is constructed, the full tree depth is divided into the first depth and the remaining ones. At tree depth of one, the proposed algorithm finds M candidate symbols. Based on these symbols, it iteratively searches the remaining symbols at second-to-last depth, until finding an optimal symbol sequence. Simulation results demonstrate that the proposed algorithm yields the performance close to that of sphere detection (SD) with significant saving in complexity and storage.

  • Efficient V-BLAST Detection Using Modified Fano Algorithm

    Jongsub CHA  Joonhyuk KANG  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E89-B No:6
      Page(s):
    1955-1959

    We propose a sub-optimal but computationally efficient Modified Fano Detection algorithm (MFD) for V-BLAST systems. This algorithm utilizes the QR decomposition of the channel matrix and the sequential detection scheme based on tree searching to find the optimal symbol sequence. For more reliable signal detection, the decoder is designed to move backward for the specified value at the end of the tree. This results in significant reduction of the complexity while the performance of MFD is comparable to that of ML detector.

  • Low Complexity Fano-Based Detection Algorithm with Iterative Structure for V-BLAST Systems

    Jongsub CHA  Hyoungsuk JEON  Hyuckjae LEE  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E91-B No:1
      Page(s):
    347-350

    We present a computationally efficient Fano detection algorithm with an iterative structure for V-BLAST systems. As our previous work, we introduced a Fano-based sequential detection scheme with three interrelated steps whose computational loads are excessive. To deal with the computational inefficiency, the proposed algorithm is redesigned by the addition of two steps: preparation and iterative tree searching. In particular, it employs an early stop technique to avoid the unnecessary iteration or to stop the needless searching process of the algorithm. Computer simulation shows that the proposed scheme yields significant saving in complexity with very small performance degradation, compared with sphere detection (SD).

  • Efficient Transmit Power Allocation with Partial Feedback for Closed-Loop SQRD Based V-BLAST Systems

    Hoiyoon JUNG  Jongsub CHA  Hyuckjae LEE  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E91-B No:4
      Page(s):
    1219-1222

    This letter proposes an efficient transmit power allocation using partial channel information feedback for the closed-loop sorted QR decomposition (SQRD) based V-BLAST systems. For the feedback information, the positive real-valued diagonal elements of R are forwarded to the transmitter. With the proposed transmit power allocation that is numerically derived by the Lagrange optimization method, the bit error rate performance of the system can be remarkably improved compare to the conventional open-loop SQRD based V-BLAST systems without increasing the receiver complexity.

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.