• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6C
• /
• pp.582-588
• /
• 2006

In this paper, the relationship among M-ary Sidel'nikov sequences generated by different primitive elements and decimation are studied. Their autocorrelation function and autocorrelation distribution are derived. It is proved that Sidel'nikov sequences for a given period are equivalent under the decimation, cyclic shift, and scalar multiplication of the sequence.

• Journal of electromagnetic engineering and science
• /
• v.7 no.2
• /
• pp.74-82
• /
• 2007

The performances of M-ary DPSK(MDPSK) for diversity reception theoretically are derived, using an L-branch selection combining(SC) in frequency-nonselective slow Nakagami fading channels. For integer values of the Nakagami fading parameter m, An exact closed-form symbol error rate(SER) multichannel performance that can be easily evaluated via numerical integration is presented. Finally, we compare these analyses with numerical analyses with integral-form expressions for the performance of MDPSK signals under the effect of two-branch SC diversity over slow and nonselective Rician fading channels with additive white Gaussian noise(AWGN).

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.3
• /
• pp.417-424
• /
• 2001

This paper proposes new symbol mapping method that can enhance the performance of trellis coded M-ary PSK compared with conventional symbol mapping methods in AWGN environment. Since the basic criteria of TCM design is Maximum Euclidean distance in AWGN, conventional symbol mapping method keep this basic criteria. In this paper, proposed new symbol mapping method uses both Euclidean distance and Hamming distance to design, while conventional methods make use of only optimal Euclidean distance. New symbol mapping method show the better BER performance than the other through computer simulation and error equations.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.16 no.5
• /
• pp.12-17
• /
• 1979

This paper presents the investigation of the theoretical symbol error performances of an M-ary differential phase-shift-keyed(DPSK) system in an interference environment. A simple method is transmitted over a nondistroting channel, but additively corrupted by Gaussian noise and cochannel interference. Computed DPSK symbol error performance results for M=2, 4, and 8 are compared with the corresponding curves for coherent phase-shift-Keyed(CPSK) system as a function of carrier-to-noise power ratio(CNR) with carrier-to-interferer power ratio(CIR) as a parameter. Comparisons between DPSK systems reveal, as we might expect, that DPSK system suffers more degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.51-56
• /
• 2007

Unitary matrix modulation (UMM) is investigated in multiple antennas system that is called unitary space-time modulation (USTM). When we consider only diagonal components of UMM with splitting over the coherence bandwidth, the system can obtain frequency diversity in a single antenna system. In Rayleigh fading channel, we compared USTM/OFDM with 2Tx-antenna with UMM-S/OFDM with 1Tx-antenna, conventional multi-level OFDM and UMM-S/OFDM with changing bit rate per Hz. Also, we analyzed SNR for between multi-level modulation STBC/OFDM and multi-level modulation UMM-S/OFDM with changing transmission rate. When it was adaptive multi-level modulation to improve SNR, we did the UMM-S/OFDM system performance analysis of N-ary PSK and M-ary QAM.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.25-31
• /
• 2014

When the public key e and the composite number n=pq are disclosed but not the private key d in an asymmetric-key RSA, message decryption is carried out by obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and subsequently computing $d=e^{-1}(mod{\phi}(n))$. The most commonly used decryption algorithm is integer factorization of n/p=q or $a^2{\equiv}b^2$(mod n), a=(p+q)/2, b=(q-p)/2. But many of the RSA numbers remain unfactorable. This paper therefore applies baby-step giant-step discrete logarithm and $2^k$-ary modular exponentiation to directly obtain ${\phi}(n)$. The proposed algorithm performs a reverse baby-step and $2^k$-ary adult-step. As a results, it reduces the execution time of basic adult-step to $1/2^k$ times and the memory $m={\lceil}\sqrt{n}{\rceil}$ to l, $a^l$ > n, hence obtaining ${\phi}(n)$ by executing within l times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2173-2183
• /
• 1998

We consider a frequency-hopped multiple-access communication system that employs reed-solomon code over GF(Q) and M-ary FSK signaling ($M{\leq}Q$) in rayleigh fading channel. We investigate the tradeoff among the modulation symbol size (M), the number of frequency slots, and the code rate in maximizing the average number of successfully transmitted information bits per unit time and unit bandwidth (called normalized throughput). We find that it is desirabel to use a large M in noise-limited environment. In interference-limited environment, it is more improtant to prevent errors (hits) by increasing the number of frequency slots than to correct them with formward error correction techniques or to reduce the error rate by increasing M.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1656-1662
• /
• 2005

This paper introduces M-PPAM(M-ary Pulse Position and Amplitude Modulation) architecture, combined PPM(Pulse Position Modulation) with PAM(Pulse Amplitude Modulation). Since M-PPAM can transmit several bits using one pulse, it is mon effective than PPM or PAM. Also, to obtain the same data transmission rate with PPM or PAM, M-PPAM can use a long pulse repetition period. This method will be able to use in the multi-path fading environment such as indoor condition. To accomodate multiple users, direct sequence technique is used. This paper has provided the modeling method of the M-PPAM DS-UWB receiver covering multi-user interference(MUI) with the Standard Gaussian Approximation under Gaussian channel. The performance of the receiver is simulated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.304-310
• /
• 2009

This paper proposes a successive MAP (maximum a posteriori probability) detection scheme with SoIC(soft interference cancellation) to reduce the receiver complexity of hierarchical M-ary QAM system. For the successive MAP detection, modulation symbols generated from the other data streams are treated as Gaussian noise or eliminated as the soft interference according to their priorities. The log-likelihood ratio of the a posteriori probability (LAPRP) of each bit is calculated by the MAP detector with an adjusted noise variance in order to take the elimination and Gaussian assumption effect into account. By separating the detection process into the successive steps, the detection complexity is reduced to increase linearly with the number of bits per hierarchical M-ary QAM symbol. Simulation results show that the proposed detection provides a small performance degradation as compared to the optimal MAP detection.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.1-6
• /
• 2011

The performance and practicality of cryptosystem for encryption, decryption, and primality test is primarily determined by the implementation efficiency of the modular exponentiation of $a^b$(mod n). To compute $a^b$(mod n), the standard binary squaring still seems to be the best choice. But, the d-ary, (d=2,3,4,5,6) method is more efficient in large b bits. This paper suggests m-numeral system modular exponentiation. This method can be apply to$b{\equiv}0$(mod m), $2{\leq}m{\leq}16$. And, also suggests the another method that is exit the algorithm in the case of the result is 1 or a.