• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.7 no.1
• /
• pp.61-70
• /
• 1996

M-ary differential phase shift keying(DPSK)is a bandwidth efficient digital modulation technique and recently has attracted increased attention in mobile satellite communication application where the available radio bandwidth is limited. Coherent detection offers good BER performance in AWGN channel. However, it requires long acquisition times in fading environment. In this paper, we analyze the BER performance of M-ary DPSK signal using the Multiple Differ- ential Feedback Detection(MDFD) technique in Rician fading and shadowed Rician fading channel. MDFD is an efficient scheme to decrease the performance gap between differential and coherent reception by increasing the complexity of the conventional differential receiver to some extent. Compared to the multiple symbol maximum likelihood detection technique, the multiple differential feedback detection technique has a much simpler structure for hardware implementation. Espe- cially, this technique has application to land mobile satellite channel which can vary in time and space between AWGN and rapidly fading channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.299-306
• /
• 2017

The real number M-ary QAM system can reduce PAPR and effectively improve the transmission efficiency as it increases gradually the value of M according to the state of channel. However, only approximate performance analysis was performed due to the complexity of the analysis. In this paper, we introduce an exact performance analysis considering the change of a boundary line due to the difference in frequency of use of the signal points. Also, we propose a new constellation of 2 time dimension ($3{\times}2^m$)-ary QAM with odd m which has better performance in PAPR. In the performance analysis, we obtain the signal point error rate and the bit error rate of real number M-ary QAM for the various values of m and compare performance between the proposed QAM and the conventional $2^k-ary$ QAM with integer k.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1857-1868
• /
• 2016

We consider a natural generalization of $h_2(n)$, denoted $h_m(n)$, which is the number of partitions of n into parts which are power of $m{\geq}2$ wherein each power of m is allowed to be used as a part at most m times. In this note, we approach in three different ways using the recurrences, the matrix and the tree to calculate the value of $h_m(n)$.

• Journal of Communications and Networks
• /
• v.1 no.2
• /
• pp.111-117
• /
• 1999

Using a method recently reported in the literature for analyzing the bit error probability (BEP) performance of noncoherent Mary orthogonal signals with square-law combining in the presence of independent and identically distributed Nakagami-m faded paths, we are able to reformulate this method so as to apply to a generalized fading channel in which the fading in each path need not be identically distributed nor even distributed ac-cording to the same family of distribution. The method leads to exact expressions for the BEP in the form of a finite-range integral whose integrand involves the moment generating function of the combined signal-to-noise ratio and which can therefore be readily evaluated numerically. The mathematical formalism is illustrated by applying the method to some selected numerical examples of interest showing the impact of the multipath intensity profile (MIP) as well as the fading correlation profile (FCP) on the BEP performance of M-ary orthogonal signal over Nakagami-m fading channels. Thses numerical results show that both MIP and FCP induce a non-negligible degradition in the BEP and have therefore to be taken into account for the accurate prediction of the performance of such systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8B
• /
• pp.1453-1459
• /
• 2000

In this paper, the method which compensates the problem occurred in case M-ary QAM is applied to system is proposed. The conventional CMA has two problems, First, when M is larger than 4, it has a poor performance of equalizer due to a degradation of convergence property. Second, the phase of conventional CMA is distorted after convergence. To compensate these problems, we set the proper interval according to modulated signal when the signal using 16-QAM modulation method is equalized and use a different equalizing method for each interval. Using this method, the ISI is reduced and the performance of equalizing is improved. Also, the computer simulation using residual ISI shows an improved performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.9
• /
• pp.6269-6273
• /
• 2015

Performance of the Alamouti algorithm based M-ary $2{\times}N$ OSTBC(Orthogonal Space Time Block Coded) MIMO(Multi Input Multi Output) system has been simulated varying two main parameters - the number of constellation(M), and the number of receiving antennas(N). Computer simulation has also been carried out using Matlab software for performance comparison between $2{\times}N$ MIMO and MRC(Maximal Ratio Combining) diversity antenna system to evaluate the degree of enhancement achieved through the use of Alamouti $2{\times}N$ MIMO. Under 10 dB EbNo QPSK scenario, $2{\times}1$ MIMO brought 4.2 dB BER improvement over single antenna system and $2{\times}2$ MIMO resulted in 7.4 dB BER improvement over $1{\times}2$ MRC.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.41-47
• /
• 2016

The times of multiplication for encryption and decryption of cryptosystem is primarily determined by implementation efficiency of the modular exponentiation of $a^b$(mod m). The most frequently used among standard modular exponentiation methods is a standard binary method, of which n-ary($2{\leq}n{\leq}6$) is most popular. The n-ary($1{\leq}n{\leq}6$) is a square-and-multiply method which partitions $b=b_kb_{k-1}{\cdots}b_1b_{0(2)}$ into n fixed bits from right to left and squares n times and multiplies bit values. This paper proposes a variable-length partition algorithm that partitions $b_{k-1}{\cdots}b_1b_{0(2)}$ from left to right. The proposed algorithm has proved to reduce the multiplication frequency of the fixed-length partition n-ary method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.874-879
• /
• 2008

In this paper, a new extending method of q-ary low correlation zone(LCZ) sequence sets is proposed, which is a generalization of binary LCZ sequence set by Kim, Jang, No, and Chung. Using this method, q-ary LCZ sequence set with parameters (N,M,L,${\epsilon}$) is extended as a q-ary LCZ sequence set with parameters (pN,pM,p[(L+1)/p]-1,p${\epsilon}$), where p is prime and p|q.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.763-769
• /
• 2004

It is known that a bent function corresponds to a perfect nonlinear function, which makes it difficult to do the differential cryptanalysis in DES and in many other block ciphers. In this paper, for an odd prime p, quadratic p-ary bent functions defined on finite fields are given from the families of p-ary sequences with optimal correlation properly. And quadratic p-ary bent functions, that is, perfect nonlinear functions from the finite field F $_{p^{m}}$ to its prime field $F_{p}$ are constructed by using the trace functions. trace functions.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.821-826
• /
• 2012

p-ary sequences of period $N=2^k-1$ are widely used in many areas of engineering and sciences. Some well-known applications include coding theory, code-division multiple-access (CDMA) communications, and stream cipher systems. The analysis of cross-correlations of these sequences is a very important problem in p-ary sequences research. In this paper, we analyze cross-correlations of p-ary sequences which is associated with the equation $(x+1)^d=x^d+1$ over finite fields.