The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Algoritma Modulus Malar (CMA) ialah kaedah yang telah dikenali secara meluas sebagai pembentukan rasuk penyesuaian buta kerana ia tidak memerlukan pengetahuan tentang isyarat kecuali bahawa bentuk gelombang isyarat yang dihantar mempunyai sampul yang tetap. Walaupun CMA mempunyai merit operasi buta ini, ia mempunyai masalah dalam sifat penumpuannya. Dalam makalah ini, masalah yang wujud dalam algoritma ini diselesaikan menggunakan gabungan CMA dan satu lagi algoritma penyesuaian utama SMI (Sample Matrix Inversion). Ideanya ialah menggunakan SMI untuk menentukan pemberat awal untuk operasi CMA. Walaupun manfaat CMA sebagai algoritma buta tidak dimanfaatkan sepenuhnya, aspek baik kedua-dua SMI dan CMA boleh diperkenalkan. Dengan menggunakan pendekatan ini, dua masalah utama dalam sifat penumpuan CMA boleh diselesaikan. Salah satu masalah ini ialah kebolehpercayaan dan ini berkaitan dengan prestasi penumpuan dalam kes tertentu. Apabila isyarat gangguan lebih kuat daripada isyarat yang dikehendaki, algoritma cenderung untuk menghasilkan penyelesaian yang salah dengan menangkap isyarat gangguan yang mempunyai kuasa lebih kuat. Selain itu, masa penumpuan algoritma ini adalah perlahan, mengehadkan penggunaannya dalam persekitaran dinamik, walaupun masa penumpuan perlahan CMA telah dikaji sebelum ini dan beberapa kaedah telah dicadangkan untuk mengatasi kecacatan ini. Dengan menggunakan kaedah yang dicadangkan, kemerosotan akibat kedua-dua masalah ini boleh dikurangkan. Keputusan simulasi ditunjukkan untuk mengesahkan teori. Tambahan pula, penilaian dilakukan mengenai ciri-ciri pudar. Ia juga disahkan daripada simulasi bahawa prestasi pengesanan kaedah ini boleh dianggap sebagai mencukupi dalam komunikasi mudah alih peribadi.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Rumiko YONEZAWA, Isamu CHIBA, "A Combination of Two Adaptive Algorithms SMI and CMA" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 7, pp. 1768-1773, July 2001, doi: .
Abstract: Constant Modulus Algorithm (CMA) is a method that has been widely known as blind adaptive beamforming because it requires no knowledge about the signal except that the transmitted signal waveform has a constant envelope. Although CMA has the merit of this blind operation, it possesses problems in its convergence property. In this paper, problems that are inherent to this algorithm is resolved using a combination of CMA and another major adaptive algorithm SMI (Sample Matrix Inversion). The idea is to use SMI to determine the initial weights for CMA operation. Although the benefit of CMA being a blind algorithm is not fully taken advantage of, good aspects of both SMI and CMA can be introduced. By using this approach, two major problems in convergence properties of CMA can be solved. One of these problems is the reliability and this relates to the convergence performance in certain cases. When the interfering signal is stronger than the desired signal, the algorithm tends to come up with the wrong solution by capturing the interfering signal which has the stronger power. Also, the convergence time of this algorithm is slow, limiting its application in dynamic environment, although the slow convergence time of CMA has been studied previously and several methods have been proposed to overcome this defect. Using the proposed method, the deterioration due to both of these problems can be mitigated. Simulation results are shown to confirm the theory. Furthermore, evaluations are done concerning the fading characteristics. It is also confirmed from the simulation that the tracking performance of this method can be regarded as sufficient in personal mobile communication.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_7_1768/_p
Salinan
@ARTICLE{e84-b_7_1768,
author={Rumiko YONEZAWA, Isamu CHIBA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Combination of Two Adaptive Algorithms SMI and CMA},
year={2001},
volume={E84-B},
number={7},
pages={1768-1773},
abstract={Constant Modulus Algorithm (CMA) is a method that has been widely known as blind adaptive beamforming because it requires no knowledge about the signal except that the transmitted signal waveform has a constant envelope. Although CMA has the merit of this blind operation, it possesses problems in its convergence property. In this paper, problems that are inherent to this algorithm is resolved using a combination of CMA and another major adaptive algorithm SMI (Sample Matrix Inversion). The idea is to use SMI to determine the initial weights for CMA operation. Although the benefit of CMA being a blind algorithm is not fully taken advantage of, good aspects of both SMI and CMA can be introduced. By using this approach, two major problems in convergence properties of CMA can be solved. One of these problems is the reliability and this relates to the convergence performance in certain cases. When the interfering signal is stronger than the desired signal, the algorithm tends to come up with the wrong solution by capturing the interfering signal which has the stronger power. Also, the convergence time of this algorithm is slow, limiting its application in dynamic environment, although the slow convergence time of CMA has been studied previously and several methods have been proposed to overcome this defect. Using the proposed method, the deterioration due to both of these problems can be mitigated. Simulation results are shown to confirm the theory. Furthermore, evaluations are done concerning the fading characteristics. It is also confirmed from the simulation that the tracking performance of this method can be regarded as sufficient in personal mobile communication.},
keywords={},
doi={},
ISSN={},
month={July},}
Salinan
TY - JOUR
TI - A Combination of Two Adaptive Algorithms SMI and CMA
T2 - IEICE TRANSACTIONS on Communications
SP - 1768
EP - 1773
AU - Rumiko YONEZAWA
AU - Isamu CHIBA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2001
AB - Constant Modulus Algorithm (CMA) is a method that has been widely known as blind adaptive beamforming because it requires no knowledge about the signal except that the transmitted signal waveform has a constant envelope. Although CMA has the merit of this blind operation, it possesses problems in its convergence property. In this paper, problems that are inherent to this algorithm is resolved using a combination of CMA and another major adaptive algorithm SMI (Sample Matrix Inversion). The idea is to use SMI to determine the initial weights for CMA operation. Although the benefit of CMA being a blind algorithm is not fully taken advantage of, good aspects of both SMI and CMA can be introduced. By using this approach, two major problems in convergence properties of CMA can be solved. One of these problems is the reliability and this relates to the convergence performance in certain cases. When the interfering signal is stronger than the desired signal, the algorithm tends to come up with the wrong solution by capturing the interfering signal which has the stronger power. Also, the convergence time of this algorithm is slow, limiting its application in dynamic environment, although the slow convergence time of CMA has been studied previously and several methods have been proposed to overcome this defect. Using the proposed method, the deterioration due to both of these problems can be mitigated. Simulation results are shown to confirm the theory. Furthermore, evaluations are done concerning the fading characteristics. It is also confirmed from the simulation that the tracking performance of this method can be regarded as sufficient in personal mobile communication.
ER -