Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 16 )

2018 ( 24 )

2017 ( 33 )

2016 ( 45 )

Custom range...

Search Results: 1 - 10 of 10388 matches for " Jong-Seon Park "
All listed articles are free for downloading (OA Articles)
Page 1 /10388
Display every page Item
Clipping Noise Cancellation for OFDM and OFDMA Systems Using Compressed Sensing
Kee-Hoon Kim,Hosung Park,Jong-Seon No,Habong Chung
Mathematics , 2011,
Abstract: In this paper, we propose clipping noise cancellation scheme using compressed sensing (CS) for orthogonal frequency division multiplexing (OFDM) systems. In the proposed scheme, only the data tones with high reliability are exploited in reconstructing the clipping noise instead of the whole data tones. For reconstructing the clipping noise using a fraction of the data tones at the receiver, the CS technique is applied. The proposed scheme is also applicable to interleaved orthogonal frequency division multiple access (OFDMA) systems due to the decomposition of fast Fourier transform (FFT) structure. Numerical analysis shows that the proposed scheme performs well for clipping noise cancellation of both OFDM and OFDMA systems.
Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families
Hosung Park,Seokbeom Hong,Jong-Seon No,Dong-Joon Shin
Mathematics , 2012,
Abstract: For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to making short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, a new construction method of high-rate regular QC LDPC codes with parity-check matrices consisting of a single row of circulants with the column-weight 3 or 4 is proposed based on special classes of cyclic difference families. The proposed QC LDPC codes can be constructed for various code rates and lengths including the minimum achievable length for a given design rate, which cannot be achieved by the existing high-rate QC LDPC codes. It is observed that the parity-check matrices of the proposed QC LDPC codes have full rank. It is shown that the error correcting performance of the proposed QC LDPC codes of short and moderate lengths is almost the same as that of the existing ones through numerical analysis.
Design of Multiple-Edge Protographs for QC LDPC Codes Avoiding Short Inevitable Cycles
Hosung Park,Seokbeom Hong,Jong-Seon No,Dong-Joon Shin
Mathematics , 2012,
Abstract: There have been lots of efforts on the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes with large girth. However, most of them are focused on protographs with single edges and little research has been done for the construction of QC LDPC codes lifted from protographs with multiple edges. Compared to single-edge protographs, multiple-edge protographs have benefits such that QC LDPC codes lifted from them can potentially have larger minimum Hamming distance. In this paper, all subgraph patterns of multiple-edge protographs, which prevent QC LDPC codes from having large girth by inducing inevitable cycles, are fully investigated based on graph-theoretic approach. By using combinatorial designs, a systematic construction method of multiple-edge protographs is proposed for regular QC LDPC codes with girth at least 12 and also other method is proposed for regular QC LDPC codes with girth at least 14. A construction algorithm of QC LDPC codes by lifting multiple-edge protographs is proposed and it is shown that the resulting QC LDPC codes have larger upper bounds on the minimum Hamming distance than those lifted from single-edge protographs. Simulation results are provided to compare the performance of the proposed QC LDPC codes, the progressive edge-growth (PEG) LDPC codes, and the PEG QC LDPC codes.
Fast Correlation Computation Method for Matching Pursuit Algorithms in Compressed Sensing
Kee-Hoon Kim,Hosung Park,Seokbeom Hong,Jong-Seon No,Habong Chung
Mathematics , 2012,
Abstract: There have been many matching pursuit algorithms (MPAs) which handle the sparse signal recovery problem a.k.a. compressed sensing (CS). In the MPAs, the correlation computation step has a dominant computational complexity. In this letter, we propose a new fast correlation computation method when we use some classes of partial unitary matrices as the sensing matrix. Those partial unitary matrices include partial Fourier matrices and partial Hadamard matrices which are popular sensing matrices. The proposed correlation computation method can be applied to almost all MPAs without causing any degradation of their recovery performance. And, for most practical parameters, the proposed method can reduce the computational complexity of the MPAs substantially.
New decoding scheme for LDPC codes based on simple product code structure
Beomkyu Shin,Seokbeom Hong,Hosung Park,Jong-Seon No,Dong-Joon Shin
Mathematics , 2012,
Abstract: In this paper, a new decoding scheme for low-density parity-check (LDPC) codes using the concept of simple product code structure is proposed based on combining two independently received soft-decision data for the same codeword. LDPC codes act as horizontal codes of the product codes and simple algebraic codes are used as vertical codes to help decoding of the LDPC codes. The decoding capability of the proposed decoding scheme is defined and analyzed using the paritycheck matrices of vertical codes and especially the combined-decodability is derived for the case of single parity-check (SPC) and Hamming codes being used as vertical codes. It is also shown that the proposed decoding scheme achieves much better error-correcting capability in high signal to noise ratio (SNR) region with low additional decoding complexity, compared with a conventional decoding scheme.
Dynamic MDS Matrices for Substantial Cryptographic Strength
Muhammad Yasir Malik,Jong-Seon No
Computer Science , 2011,
Abstract: Ciphers get their strength from the mathematical functions of confusion and diffusion, also known as substitution and permutation. These were the basics of classical cryptography and they are still the basic part of modern ciphers. In block ciphers diffusion is achieved by the use of Maximum Distance Separable (MDS) matrices. In this paper we present some methods for constructing dynamic (and random) MDS matrices.
New Families of $p$-ary Sequences of Period $\frac{p^n-1}{2}$ With Low Maximum Correlation Magnitude
Wijik Lee,Ji-Youp Kim,Jong-Seon No
Computer Science , 2013,
Abstract: Let $p$ be an odd prime such that $p \equiv 3\;{\rm mod}\;4$ and $n$ be an odd integer. In this paper, two new families of $p$-ary sequences of period $N = \frac{p^n-1}{2}$ are constructed by two decimated $p$-ary m-sequences $m(2t)$ and $m(dt)$, where $d = 4$ and $d = (p^n + 1)/2=N+1$. The upper bound on the magnitude of correlation values of two sequences in the family is derived using Weil bound. Their upper bound is derived as $\frac{3}{\sqrt{2}} \sqrt{N+\frac{1}{2}}+\frac{1}{2}$ and the family size is 4N, which is four times the period of the sequence.
The impact of dose of the angiotensin-receptor blocker valsartan on the post-myocardial infarction ventricular remodeling: study protocol for a randomized controlled trial
Young-Rak Cho, Young-Dae Kim, Tae-Ho Park, Kyungil Park, Jong-Sung Park, Heekyung Baek, Sun-Young Choi, Kee-Sik Kim, Taek-Jong Hong, Tae-Hyun Yang, Jin-Yong Hwang, Jong-Seon Park, Seung-Ho Hur, Sang-Gon Lee
Trials , 2011, DOI: 10.1186/1745-6215-12-247
Abstract: Valsartan in post-MI remodeling (VALID) is a randomized, open-label, single-blinded multicenter study designed to compare the efficacy of different clinical dose of valsartan on the post-MI ventricular remodeling. This study also aims to assess neurohormone change and clinical parameters of patients during the post-infarct period. A total of 1116 patients with left ventricular dysfunction following the first episode of acute ST-elevation MI are to be enrolled and randomized to a maximal tolerable dose (up to 320 mg/day) or usual dose (80 mg/day) of valsartan for 12 months in 2:1 ratio. Echocardiographic analysis for quantifying post-MI ventricular remodeling is to be conducted in central core laboratory. Clinical assessment and laboratory test are performed at fixed times.VALID is a multicenter collaborative study to evaluate the impact of dose of valsartan on the post-MI ventricular remodeling. The results of the study provide information about optimal dosing of the drug in the management of patients after MI. The results will be available by 2012.NCT01340326Progressive enlargement of the heart chamber and deterioration of contractile function after myocardial infarction (MI), termed post-MI ventricular remodeling, is associated with development of heart failure and poor prognosis [1-3]. The magnitude of post-MI remodeling is influenced by several determinants, most notably infarct size [4], but also by ventricular wall stress [5], patency of infarct-related artery [6], and a number of neurohormonal factors [7]. Thus, the consequence of post-MI remodeling varies among patients with acute MI even in the era of reperfusion therapy [8]. Modification of neurohormonal acitivities, particularly the rennin-angiotensin-aldosterone system (RAAS), can significantly influence the process of ventricular remodeling after acute MI. Suppression of angiotensin activity either by inhibition of angiotensin-converting enzyme (ACE) [9-11] or by blockade of angiotensin II receptor [12]
Adaptive Generation Method of OFDM Signals in SLM Schemes for Low-complexity
Kee-Hoon Kim,Hyun-Seung Joo,Jong-Seon No,Dong-Joon Shin
Mathematics , 2012,
Abstract: There are many selected mapping (SLM) schemes to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. Beginning with the conventional SLM scheme, there have been proposed many low-complexity SLM schemes including Lim's, Wang's, and Baxely's SLM schemes typically. In this paper, we propose an adaptive generation (AG) method of OFDM signals in SLM schemes. By generating the alternative OFDM signals adaptively, unnecessary computational complexity of SLM schemes can be removed without any degradation of their PAPR reduction performance. In this paper, we apply the AG method to various SLM schemes which are the conventional SLM scheme and its low-complexity versions such as Lim's, Wang's, and Baxely's SLM schemes. Of course, the AG method can be applied to most of existing SLM schemes easily. The numerical results show that the AG method can reduce their computational complexity substantially.
The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem
Gerhard Wunder,Robert F. H. Fischer,Holger Boche,Simon Litsyn,Jong-Seon No
Mathematics , 2012,
Abstract: Peak power control for multicarrier communications has been a long-lasting problem in signal processing and communications. However, industry and academia are confronted with new challenges regarding energy efficient system design. Particularly, the envisioned boost in network energy efficiency (e.g. at least by a factor of 1000 in the Green Touch consortium) will tighten the requirements on component level so that the efficiency gap with respect to single-carrier transmission must considerably diminish. This paper reflects these challenges together with a unified framework and new directions in this field. The combination of large deviation theory, de-randomization and selected elements of Banach space geometry will offer a novel approach and will provide ideas and concepts for researchers with a background in industry as well as those from academia.
Page 1 /10388
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.