Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Jun Won Choi is active.

Publication


Featured researches published by Jun Won Choi.


IEEE Transactions on Communications | 2010

Improved linear soft-input soft-output detection via soft feedback successive interference cancellation

Jun Won Choi; Andrew C. Singer; Jungwoo Lee; Nam Ik Cho

We propose an improved minimum mean square error (MMSE) vertical Bell Labs layered space-time (V-BLAST) detection technique, called a soft input, soft output, and soft feedback (SIOF) V-BLAST detector, for turbo multi-input multioutput (turbo-MIMO) systems. We derive a symbol estimator by minimizing the power of the interference plus noise, given a priori probabilities of undetected layer symbols and a posteriori probabilities for past detected layer symbols. For a low-complexity implementation, an approximate SIOF algorithm is presented, which allows for a time-invariant realization of the symbol ordering and an MMSE filtering process. Another implementation, referred to as the iterative SIOF algorithm is introduced, which decides on symbol detection order based on a posteriori symbol probabilities to improve the detection performance. Simulations performed on a space-time bit-interleaved coded modulation (STBICM) architecture over quasi-static MIMO fading channels demonstrate that the SIOF V-BLAST detector provides performance gains over previous turbo-BLAST detectors, most notably when more transmit antennas are used.


IEEE Journal of Oceanic Engineering | 2011

Adaptive Linear Turbo Equalization Over Doubly Selective Channels

Jun Won Choi; Thomas J. Riedl; Kyeongyeon Kim; Andrew C. Singer; James C. Preisig

Over the last decade, tremendous gains, leading to near-capacity achieving performance, have been shown for a variety of communication systems through the application of the turbo principle, i.e., the exchange of extrinsic information between constituent algorithms for tasks such as channel decoding, equalization, and multiple-input-multiple-output (MIMO) detection. In this paper, we study the practical application of such an iterative detection and decoding (IDD) framework to underwater acoustic communications. We explore complexity and performance tradeoffs of a variety of turbo equalization (TEQ)-based receiver architectures. First, we elaborate on two popular but suboptimal turbo equalization techniques: a channel-estimate-based minimum mean-square error TEQ (CE-based MMSE-TEQ) and a direct-adaptive TEQ (DA-TEQ). We study the behavior of both TEQ approaches in the presence of channel estimation errors and adaptive filter adjustment errors. We confirm that after a sufficient number of iterations, the performance gap between these two TEQ algorithms becomes small. Next, we demonstrate that an underwater receiver architecture built upon the least mean squares (LMS) DA-TEQ technique can leverage and dramatically improve the performance of the conventional implementation based on the decision-feedback equalizer at a feasible complexity. To maintain performance gains over time-varying channels, the slow convergence speed of the LMS algorithm has been improved via two methods: 1) repeating the weight update for the same set of data with decreasing step size and 2) reducing the dimensionality of the equalizer by capturing sparse channel structure. This receiver architecture was used to process collected data from the SPACE 08 experiment (Marthas Vineyard, MA). Receiver performance for different modulation orders, channel codes, and hydrophone configurations is examined at a variety of distance, up to 1 km from the transmitters. Experimental results show great promise for this approach, as data rates in excess of 15 kb/s could readily be achieved without error.


IEEE Transactions on Signal Processing | 2010

Low-Complexity Decoding via Reduced Dimension Maximum-Likelihood Search

Jun Won Choi; Byonghyo Shim; Andrew C. Singer; Nam Ik Cho

In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which approximates the maximum-likelihood (ML) estimate of symbols by searching a partitioned symbol vector space rather than that spanned by the whole symbol vector. The inevitable performance loss due to a reduction in the search space is compensated by 1) the use of a list tree search, which is an extension of a single best searching algorithm called sphere decoding, and 2) the recomputation of a set of weak symbols, i.e., those ignored in the reduced dimension search, for each strong symbol candidate found during the list tree search. Through simulations on M-quadrature amplitude modulation (QAM) transmission in frequency nonselective multi-input-multioutput (MIMO) channels, we demonstrate that the RD-MLS algorithm shows near constant complexity over a wide range of bit error rate (BER) (10-1 ~ 10-4), while limiting performance loss to within 1 dB from ML detection.


sensor array and multichannel signal processing workshop | 2008

Iterative multi-channel equalization and decoding for high frequency underwater acoustic communications

Jun Won Choi; Robert J. Drost; Andrew C. Singer; James C. Preisig

In this paper, an iterative multi-channel equalization and decoding technique is introduced to improve system performance in underwater acoustic communications. The turbo principle is applied to the existing canonical receiver structure including fractionally spaced decision feedback equalization with phase synchronization. The performance of multi-channel equalization and adaptive weight update algorithms are aided by soft information delivered from the channel decoder. The complexity of the proposed scheme is shown to be reasonable for highly reverberant underwater channels since it has linear complexity by the use of the least mean square (LMS) algorithm. Experimental results for data transmission at 41.67 k symbol/s with a carrier frequency of 100 kHz demonstrate the feasibility of the proposed algorithm.


IEEE Transactions on Signal Processing | 2007

Low-Power Filtering Via Minimum Power Soft Error Cancellation

Jun Won Choi; Byonghyo Shim; Andrew C. Singer; Nam Ik Cho

In this paper, an energy-efficient estimation and detection problem is formulated for low-power digital filtering. Building on the soft digital signal processing technique proposed by Hegde and Shanbhag, which combines algorithmic noise tolerance and voltage scaling to reduce power, the proposed minimum power soft error cancellation (MP-SEC) technique detects, estimates, and corrects transient errors that arise from voltage overscaling. These timing violation-induced errors, called soft errors, can be detected and corrected by exploiting the correlation structure induced by the filtering operation being protected, together with a reduced-precision replica of the protected operation. By exploiting a spacing property of soft errors in certain architectures, MP-SEC can achieve up to 30% power savings with no signal-to-noise ratio (SNR) loss and up to 55% power savings with less than 1-dB SNR loss, according to the logic-level simulations performed for an example 25-tap frequency-selective filter.


IEEE Communications Surveys and Tutorials | 2017

Compressed Sensing for Wireless Communications: Useful Tips and Tricks

Jun Won Choi; Byonghyo Shim; Yacong Ding; Bhaskar D. Rao; Dong In Kim

As a paradigm to recover the sparse signal from a small set of linear measurements, compressed sensing (CS) has stimulated a great deal of interest in recent years. In order to apply the CS techniques to wireless communication systems, there are a number of things to know and also several issues to be considered. However, it is not easy to grasp simple and easy answers to the issues raised while carrying out research on CS. The main purpose of this paper is to provide essential knowledge and useful tips and tricks that wireless communication researchers need to know when designing CS-based wireless systems. First, we present an overview of the CS technique, including basic setup, sparse recovery algorithm, and performance guarantee. Then, we describe three distinct subproblems of CS, viz., sparse estimation, support identification, and sparse detection, with various wireless communication applications. We also address main issues encountered in the design of CS-based wireless communication systems. These include potentials and limitations of CS techniques, useful tips that one should be aware of, subtle points that one should pay attention to, and some prior knowledge to achieve better performance. Our hope is that this paper will be a useful guide for wireless communication researchers and even non-experts to get the gist of CS techniques.


IEEE Transactions on Signal Processing | 2015

Iterative Channel Estimation Using Virtual Pilot Signals for MIMO-OFDM Systems

Sunho Park; Byonghyo Shim; Jun Won Choi

The number of transmit and receive antennas in multi-input multi-output (MIMO) systems is increasing rapidly to enhance the throughput and reliability of next-generation wireless systems. Benefits of large size MIMO systems, however, can be realized only when the quality of estimated channels is ensured at the transmitter and receiver side alike. In this paper, we introduce a new decision-directed channel estimation technique dealing with pilot shortage in the MIMO-OFDM systems. The proposed channel estimator uses soft symbol decisions obtained by iterative detection and decoding (IDD) scheme to enhance the quality of channel estimate. Using the soft information from the decoders, the proposed channel estimator selects reliable data tones, subtracts interstream interferences, and performs re-estimation of the channels. We analyze the optimal data tone selection criterion, which accounts for the reliability of symbol decisions and correlation of channels between the data tones and pilot tones. From numerical simulations, we show that the proposed channel estimator achieves considerable improvement in system performance over the conventional channel estimators in realistic MIMO-OFDM scenarios.


IEEE Transactions on Information Theory | 2012

Efficient Soft-Input Soft-Output Tree Detection via an Improved Path Metric

Jun Won Choi; Byonghyo Shim; Andrew C. Singer

Tree detection techniques are often used to reduce the complexity of a posteriori probability (APP) detection in multiantenna wireless communication systems. In this paper, we introduce an efficient soft-input soft-output tree detection algorithm that employs a new type of look-ahead path metric in the process of branch pruning (or sorting). While conventional path metrics depend only on symbols on a visited path, the new path metric accounts for unvisited parts of the tree in advance through an unconstrained linear estimator and adds a bias term that reflects the contribution of as-yet undecided symbols. By applying the linear estimate-based look-ahead path metric to an -algorithm that selects the best paths for each level of the tree, we develop a new soft-input soft-output tree detector, called an improved soft-input soft-output -algorithm (ISS-MA). Based on an analysis of the probability of correct path loss, we show that the improved path metric offers substantial performance gain over the conventional path metric. We also demonstrate through simulations that the proposed ISS-MA can be a promising candidate for soft-input soft-output detection in high-dimensional systems.


IEEE Journal of Selected Topics in Signal Processing | 2011

Markov Chain Monte Carlo Detection for Frequency-Selective Channels Using List Channel Estimates

Hong Wan; Rong Rong Chen; Jun Won Choi; Andrew C. Singer; James C. Preisig; Behrouz Farhang-Boroujeny

In this paper, we develop a statistical approach based on Markov chain Monte Carlo (MCMC) techniques for joint data detection and channel estimation over time-varying frequency-selective channels. The proposed detector, that we call MCMC with list channel estimates (MCMC-LCE), adopts the Gibbs sampler to find a list of mostly likely transmitted sequences and matching channel estimates/impulse responses (CIR), to compute the log-likelihood ratio (LLR) of transmitted bits. The MCMC-LCE provides a low-complexity means to approximate the optimal maximum a posterior (MAP) detection in a statistical fashion and is applicable to channels with long memory. Promising behavior of the MCMC-LCE is presented using both synthetic channels and real data collected from underwater acoustic (UWA) channels whose large delay spread and time variation have been the main motivation for the developed system. We also adopt an adaptive variable step-size least mean-square (VSLMS) algorithm for channel tracking. We find that this choice, which does not require prior knowledge on the CIR statistics, is a good fit for UWA channels. Superior performance of the MCMC-LCE over turbo minimum mean-square-error (MMSE) equalizers is demonstrated for a variety of channels examined in this work.


information theory and applications | 2010

Markov Chain Monte Carlo detection for underwater acoustic channels

Hong Wan; Rong Rong Chen; Jun Won Choi; Andrew C. Singer; James C. Preisig; Behrouz Farhang-Boroujeny

In this work, we develop novel statistical detectors to combat intersymbol interference for frequency selective channels based on Markov Chain Monte Carlo (MCMC) techniques. While the optimal maximum a posteriori (MAP) detector has a complexity that grows exponentially with the constellation size and the memory of the channel, the MCMC detector can achieve near optimal performance with a complexity that grows linearly. This makes the MCMC detector particularly attractive for underwater acoustic channels with long delay spread. We examine the effectiveness of the MCMC detector using actual data collected from underwater experiments. When combined with adaptive least mean square (LMS) channel estimation, the MCMC detector achieves superior performance over the direct adaptation LMS turbo equalizers (LMS-TEQ) for a majority of data sets transmitted over distances from 60 meters to 1000 meters.

Collaboration


Dive into the Jun Won Choi's collaboration.

Top Co-Authors

Avatar

Byonghyo Shim

Seoul National University

View shared research outputs
Top Co-Authors

Avatar

James C. Preisig

Woods Hole Oceanographic Institution

View shared research outputs
Top Co-Authors

Avatar

Nam Ik Cho

Seoul National University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge