Searcharxiv⌕ Search

arXiv subjects

Jong-Seon No

Publications and source records attributed to Jong-Seon No.

42 records · Page 3Linked to original sources

On the Cross-Correlation of a $p$-ary m-Sequence and its Decimated Sequences by $d=\frac{p^n+1}{p^k+1}+\frac{p^n-1}{2}$

In this paper, for an odd prime $p$ such that $p\equiv 3\bmod 4$, odd $n$, and $d=(p^n+1)/(p^k+1)+(p^n-1)/2$ with $k|n$, the value distribution of the exponential sum $S(a,b)$ is calculated as $a$ and $b$ run through $\mathbb{F}_{p^n}$. The sequence family $\mathcal{G}$ in which each sequence has the period of $N=p^n-1$ is also constructed. The family size of $\mathcal{G}$ is $p^n$ and the correlation magnitude is roughly upper bounded by $(p^k+1)\sqrt{N}/2$. The weight distribution of the relevant cyclic code $\mathcal{C}$ over $\mathbb{F}_p$ with the length $N$ and the dimension ${\rm dim}_{\mathbb{F}_p}\mathcal{C}=2n$ is also derived. Our result includes the case in \cite{Xia} as a special case.

cs.IT↗

Fast Correlation Computation Method for Matching Pursuit Algorithms in Compressed Sensing

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.

cs.IT↗

A New Low-Complexity Selected Mapping Scheme Using Cyclic Shifted IFFT for PAPR Reduction in OFDM Systems

In this paper, a new peak-to-average power ratio (PAPR) reduction scheme for orthogonal frequency division multiplexing (OFDM) is proposed based on the selected mapping (SLM) scheme. The proposed SLM scheme generates alternative OFDM signal sequences by cyclically shifting the connections in each subblock at an intermediate stage of inverse fast Fourier transform (IFFT). Compared with the conventional SLM scheme, the proposed SLM scheme achieves similar PAPR reduction performance with much lower computational complexity and no bit error rate (BER) degradation. The performance of the proposed SLM scheme is verified through numerical analysis. Also, it is shown that the proposed SLM scheme has the lowest computational complexity among the existing low-complexity SLM schemes exploiting the signals at an intermediate stage of IFFT.

cs.IT↗

New decoding scheme for LDPC codes based on simple product code structure

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.

cs.IT↗

Clipping Noise Cancellation for OFDM and OFDMA Systems Using Compressed Sensing

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.

cs.IT↗

Dynamic MDS Matrices for Substantial Cryptographic Strength

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.

cs.CR↗