http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
An efficient algorithm for the reconstruction of punctured convolutional codes
Chung, Habong,Jang, Hwanseok,Seong, Jinwoo SpringerOpen 2017 Eurasip Journal on Wireless Communications and Net Vol.2017 No.-
<P>Puncturing is one of the methods of increasing the code rate, and the original code before puncturing is called the mother code. Any (N,K) convolutional code is obtainable by puncturing some (n,1) mother codes. The objective of a blind recognition of a channel code is to obtain its generator from the intercepted noisy bit stream. The process of the blind recognition of punctured convolutional codes consists of two parts: the reconstruction of the PGM of the (N,K) punctured convolutional code and the searching process of the mother code and its puncturing pattern. The process of finding the mother code is important for designing the optimum channel decoder. In this paper, a new searching algorithm with the computational complexity of O(K-4) polynomial operations is proposed, compared to the existing searching algorithm by M. Cluzeau which requires O(K-6) polynomial operations.</P>
Cyclotomic Numbers in the Finite Field GF(p²ⁿ)
Chung, Habong 弘益大學校 科學技術硏究所 2007 科學技術硏究論文集 Vol.18 No.-
For a prime p and a positive integer M which divides p - 1, the cyclotomic number (i,j)M of order M is defined as the number of ordered pairs (s,t) such that ◁수식 삽입▷(원문을 참조하세요), where g is a primitive element of the prime field GF(p). Let p be a prime and q = p^(n), Let M be an integer such that ◁수식 삽입▷(원문을 참조하세요). In this paper, cyclotomic numbers ◁수식 삽입▷(원문을 참조하세요), of order M in the extension field GF(qc²) are derived using Stickelberger's theorem.
On Some Properties of <i>M</i>-Ary Sidel'nikov Sequences
CHUNG, Jung-Soo,KIM, Young-Sik,LIM, Tae-Hyung,NO, Jong-Seon,CHUNG, Habong The Institute of Electronics, Information and Comm 2009 IEICE transactions on fundamentals of electronics, Vol.92 No.1
<P>In this letter, we enumerate the number of cyclically inequivalent <I>M</I>-ary Sidel'nikov sequences of given length as well as the number of distinct autocorrelation distributions that they can have, while we change the primitive element for generating the sequence.</P>
Jung-Soo Chung,Jong-Seon No,Habong Chung IEEE 2011 IEEE transactions on information theory Vol.57 No.4
<P>In this paper, a new family of <I>M</I> -ary sequences of period <I>p</I><SUP>n</SUP> -1 is proposed. The proposed family is constructed by the addition of cyclic shifts of an <I>M</I> -ary Sidel'nikov sequence and its reverse sequence. The number of sequences contained in this family is about (<I>M</I>-1)<SUP>2</SUP> times of their period and the maximum magnitude of their correlation values is upper bounded by 4 √(<I>p</I><SUP>n</SUP><I>)</I> +5.</P>
鄭夏奉 弘益大學校 科學技術硏究所 2004 科學技術硏究論文集 Vol.15 No.-
In this paper, we address the question of the existence of real orthogonal-design-based space-time (ODST) codes when the symbol alphabet is restricted to be a proper subset of real numbers. We refer to these as restricted-alphabet ODST (RA-ODST) codes. We show that real RA-ODST codes of size greater than 8 that also guarantee maximum diversity advantage do not exist. Without the diversity requirement, RA-ODST codes exist only when the symbol alphabet is of size 2.