• Title/Summary/Keyword: M-algorithm

Search Result 3,922, Processing Time 0.025 seconds

Bitwise Decomposition Algorithm for Gray Coded M-PSK Signals (Gray 부호화된 M-PSK 신호의 비트 정보 분할 알고리듬)

  • Kim Ki-Seol;Hyun Kwang-Min;Park Sang-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8A
    • /
    • pp.784-789
    • /
    • 2006
  • In this paper, we propose a bitwise information decomposition algorithm for an M-PSK signal based on the Max-Log-MAP algorithm. In order to obtain the algorithm, we use a coordinate transformation from M-PSK to M-PAM signal space. Using the proposed algorithm, we analyze the performance of a Turbo iterative decoding method. The proposed algorithm can be applicable not only for a communication with PSK and iterative decoding method but for adaptive modulation and coding system.

An Algorithm for S-to-M Mapping in CMAC (CMAC의 S-to-M 변환을 위한 알고리즘)

  • Gwon, Seong-Gyu
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.10
    • /
    • pp.3135-3141
    • /
    • 1996
  • In order to develop an efficient algorithm for S-to-M mapping in CMCA, characteristics of CMCA mappings is studied and conceptual mapping procedure is physically described. Then, careful observations on the mapping procedure and experience reveal a simple algorithm of the S-to-M mapping. The algorithm is described and compared with other procedures for S-to-M mapping. It is found very efficient in terms of computational operations and processing time.

A fast M-band discrete wavelet transform algorithm using factorization of lossless matrix when the length of bases equals to 2M (기저의 길이 L=2M인 경우 무손실 행렬의 분해를 이용한 고속 M-대역 이산 웨이브렛 변환 알고리즘)

  • 권상근;이동식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2706-2713
    • /
    • 1997
  • The fast implementation algorithm of M-band discrete wavelet transform is propsed using the factorization of lossless matrix when the length of discrete orthogonal wavelet bases equals to 2M. In computational complexity when direct filtering method is employed, the number of multiplicationand addition is (2M$^{2}$) and (2M$^{2}$ -M), respectively. But by proposed algorithm, it can be reduced to (M$^{2}$+M) and (M$^{2}$+2M-1), respectively. and it is possible to reduce the compuatational complexity further when unitary matrix employed to design the discrete or thogonal wavelet basis has the fast algorithm.

  • PDF

A Performance Comparison of mSE-MMA and mDSE-MMA Adaptive Equalization Algorithm in 16-QAM Signal Transmission (16-QAM 신호 전송에서 mSE-MMA와 mDSE-MMA 적응 등화 알고리즘의 성능 비교)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.2
    • /
    • pp.61-66
    • /
    • 2021
  • This paper related with the performance comparison of mSE-MMA and mDSE-MMA adaptive equalization algorithm which is possible to reduce the intersymbol interference that occurs in the nonlinear communication channel transmitting 16-QAM signal. This two algorithm is possible to reduce the computational load compared to the current MMA algorithm, it has the degraded equalization performance due to simplified arithmetic in order to applying the mobile communication terminal. In order to improve the performance degradation, they controls the step size according to the existence of arbitrary radius circle of equalizer output compared to transmitted symbol point. The variation of step size according to this principle is applied to the SE-MMA and DSE-MMA, namely mSE-MMA and mDSE-MMA algorithm, the algorithm's performance were compared in the same channel and noise environment by computer simulation. As a result of simulation, the mSE-MMA has more superior to the mDSE-MMA in residual value of every performance index and SER performance, and the vice versa result in convergence speed.

Complexity of the Symmerge Algorithm (Symmerge 알고리즘의 복잡도 )

  • Kim, Pok-Son
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.2
    • /
    • pp.272-277
    • /
    • 2008
  • Symmerge is a stable minimum storage merging algorithm that needs $O(m{\log}{\frac{n}{m}})$ element comparisons, where in and n are the sizes of the input sequences with $m{\leq}n$. Hence, according to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The Symmerge algorithm is based on the standard recursive technique of "divide and conquer". The objective of this paper is to consider the relationship between m and n for the degenerated case where the recursion depth reaches m-1.

Machine learning-based design automation of CMOS analog circuits using SCA-mGWO algorithm

  • Vijaya Babu, E;Syamala, Y
    • ETRI Journal
    • /
    • v.44 no.5
    • /
    • pp.837-848
    • /
    • 2022
  • Analog circuit design is comparatively more complex than its digital counterpart due to its nonlinearity and low level of abstraction. This study proposes a novel low-level hybrid of the sine-cosine algorithm (SCA) and modified grey-wolf optimization (mGWO) algorithm for machine learning-based design automation of CMOS analog circuits using an all-CMOS voltage reference circuit in 40-nm standard process. The optimization algorithm's efficiency is further tested using classical functions, showing that it outperforms other competing algorithms. The objective of the optimization is to minimize the variation and power usage, while satisfying all the design limitations. Through the interchange of scripts for information exchange between two environments, the SCA-mGWO algorithm is implemented and simultaneously simulated. The results show the robustness of analog circuit design generated using the SCA-mGWO algorithm, over various corners, resulting in a percentage variation of 0.85%. Monte Carlo analysis is also performed on the presented analog circuit for output voltage and percentage variation resulting in significantly low mean and standard deviation.

A Robustness Performance Improvement of MMA Adaptive Equalization Algorithm in QAM Signal Transmission (QAM 신호 전송에서 MMA 적응 등화 알고리즘의 Robustness 성능 개선)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.2
    • /
    • pp.85-90
    • /
    • 2019
  • This paper related with the M-CMA adaptive equalization algorithm which is possible to improve the residual isi and robustness performance compare to the current MMA algorithm that is reduce the intersymbol interference occurs in channel when transmitting the QAM signal. The current MMA algorithm depend on the cost function and error function using fixed signal dispersion constant, but the M-CMA algorithm depend on the new proposed cost function and error function using multiple dispersion constant. By this, it is possible to having robustness of the CMA and simultaneous compensation of amplitude and phase of MMA. The computer simulation was performed in the same channel and noise environment for compare the proposed M-CMA and current MMA algorithm. The equalizer output signal constellation, residual isi, MD, MSE learning courves and SER, represents the robustness were used for performance index. As a result of simulation, the M-CMA has more superior to the MMA in robustness and other performance index.

Modified Baby-Step Giant-Step Algorithm for Discrete Logarithm (최단 보폭-최장 보폭 이산대수 알고리즘의 변형)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.8
    • /
    • pp.87-93
    • /
    • 2013
  • A baby-step giant-step algorithm divides n by n blocks that possess $m={\lceil}\sqrt{n}{\rceil}$ elements, and subsequently computes and stores $a^x$ (mod n) for m elements in the 1st block. It then calculates mod n for m blocks and identifies each of them with those in the 1st block of an identical elemental value. This paper firstly proposes a modified baby-step giant-step algorithm that divides ${\lceil}m/2{\rceil}$ blocks with m elements applying $a^{{\phi}(n)/2}{\equiv}1(mod\;n)$ and $a^x(mod\;n){\equiv}a^{{\phi}(n)+x}$ (mod n) principles. This results in a 50% decrease in the process of the giant-step. It then suggests a reverse baby-step giant step algorithm that performs and saves ${\lceil}m/2{\rceil}$ blocks firstly and computes $a^x$ (mod n) for m elements. The proposed algorithm is found to successfully halve the memory and search time of the baby-step giant step algorithm.

Dynamic threshold location algorithm based on fingerprinting method

  • Ding, Xuxing;Wang, Bingbing;Wang, Zaijian
    • ETRI Journal
    • /
    • v.40 no.4
    • /
    • pp.531-536
    • /
    • 2018
  • The weighted K-nearest neighbor (WKNN) algorithm is used to reduce positioning accuracy, as it uses a fixed number of neighbors to estimate the position. In this paper, we propose a dynamic threshold location algorithm (DH-KNN) to improve positioning accuracy. The proposed algorithm is designed based on a dynamic threshold to determine the number of neighbors and filter out singular reference points (RPs). We compare its performance with the WKNN and Enhanced K-Nearest Neighbor (EKNN) algorithms in test spaces of networks with dimensions of $20m{\times}20m$, $30m{\times}30m$, $40m{\times}40m$ and $50m{\times}50m$. Simulation results show that the maximum position accuracy of DH-KNN improves by 31.1%, and its maximum position error decreases by 23.5%. The results demonstrate that our proposed method achieves better performance than other well-known algorithms.

On algorithm for finding primitive polynomials over GF(q) (GF(q)상의 원시다항식 생성에 관한 연구)

  • 최희봉;원동호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.1
    • /
    • pp.35-42
    • /
    • 2001
  • The primitive polynomial on GF(q) is used in the area of the scrambler, the error correcting code and decode, the random generator and the cipher, etc. The algorithm that generates efficiently the primitive polynomial on GF(q) was proposed by A.D. Porto. The algorithm is a method that generates the sequence of the primitive polynomial by repeating to find another primitive polynomial with a known primitive polynomial. In this paper, we propose the algorithm that is improved in the A.D. Porto algorithm. The running rime of the A.D. Porto a1gorithm is O($\textrm{km}^2$), the running time of the improved algorithm is 0(m(m+k)). Here, k is gcd(k, $q^m$-1). When we find the primitive polynomial with m odor, it is efficient that we use the improved algorithm in the condition k, m>>1.