Relevant bibliographies by topics / Constant Modulus Algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Constant Modulus Algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Constant Modulus Algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Constant Modulus Algorithm"

1

van der Veen, A. J., and A. Paulraj. "An analytical constant modulus algorithm." IEEE Transactions on Signal Processing 44, no. 5 (1996): 1136–55. http://dx.doi.org/10.1109/78.502327.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Benesty, J., and P. Duhamel. "Fast constant modulus adaptive algorithm." IEE Proceedings F Radar and Signal Processing 138, no. 4 (1991): 379. http://dx.doi.org/10.1049/ip-f-2.1991.0049.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zarzoso, V., and P. Comon. "Optimal Step-Size Constant Modulus Algorithm." IEEE Transactions on Communications 56, no. 1 (2008): 10–13. http://dx.doi.org/10.1109/tcomm.2008.050484.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xu, C., and J. Li. "A Batch Processing Constant Modulus Algorithm." IEEE Communications Letters 8, no. 9 (2004): 582–84. http://dx.doi.org/10.1109/lcomm.2004.835330.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ahmad, Zeeshan, Zain ul Abidin Jaffri, Najam ul Hassan, and Meng Chen. "Robust adaptive beamforming using modified constant modulus algorithms." Journal of Electrical Engineering 73, no. 4 (2022): 248–57. http://dx.doi.org/10.2478/jee-2022-0033.

Full text
Abstract:
Abstract This paper addresses the self-nulling phenomenon also known as the self-cancellation in adaptive beamformers. Optimum beamforming requires knowledge of the desired signal characteristics, either its statistics, its direction-of-arrival, or its response vector. Inaccuracies in the required information lead the beamformer to attenuate the desired signal as if it were interference. Self-nulling is caused by the desired signal having large power (high SNR) relative to the interference signal in case of the minimum variance distortion less response beamformer, and low power desired signal
APA, Harvard, Vancouver, ISO, and other styles
6

Manioudakis, Stylianos. "Linearly precoded analytical constant modulus algorithm for non-constant modulus space-time codes." AEU - International Journal of Electronics and Communications 60, no. 9 (2006): 659–62. http://dx.doi.org/10.1016/j.aeue.2005.12.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yang, Heng, Jing Wang, Jing Guan, and Wei Lu. "Momentum Factor Constant Modulus Algorithm and Theory." Applied Mechanics and Materials 263-266 (December 2012): 1058–61. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.1058.

Full text
Abstract:
The traditional constant modulus algorithm (CMA) has the disadvantage of slow convergence in blind equalization algorithm. This paper studied one improved algorithm based on momentum factor constant modulus algorithm(MCMA) to solve this problem, momentum factor was added to the weight vector iteration formula of CMA to improve the convergence speed. theoretical analysis and simulation showed that: in the case of the same equalization effect, the MCMA converges faster than the traditional constant modulus algorithm, and also different momentum factors have different convergence effects. The lar
APA, Harvard, Vancouver, ISO, and other styles
8

Dabeer, O., and E. Masry. "Convergence analysis of the constant modulus algorithm." IEEE Transactions on Information Theory 49, no. 6 (2003): 1447–64. http://dx.doi.org/10.1109/tit.2003.811903.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Daumont, Steredenn, and Daniel Le Guennec. "An Analytical Multimodulus Algorithm for Blind Demodulation in a Time-Varying MIMO Channel Context." International Journal of Digital Multimedia Broadcasting 2010 (2010): 1–11. http://dx.doi.org/10.1155/2010/307927.

Full text
Abstract:
This paper addresses the issue of blind multiple-input multiple-output (MIMO) demodulation of communication signals, with time-varying channels and in an interception context. A new adaptive-blind source separation algorithm, which is based on the implementation of the Multimodulus cost function by analytical methods, is proposed. First a batch processing analysis is performed; then an adaptive implementation of the (Analytical Multi-Modulus Algorithm) AMMA and its simplified version named (Analytical Simplified Constant Modulus Algorithm) ASCMA is detailed. These algorithms, named adaptive-AM
APA, Harvard, Vancouver, ISO, and other styles
10

Guo, Ye Cai, and Kang Fan. "Blind Equalization Algorithm Based on Adaptive Genetic Algorithm and Wavelet Transform." Applied Mechanics and Materials 44-47 (December 2010): 3215–19. http://dx.doi.org/10.4028/www.scientific.net/amm.44-47.3215.

Full text
Abstract:
Constant Modulus Algorithm(CMA) has slow convergence speed and easily immerges in local minimum owing to lack of initialization theory. Aiming at these disadvantages, adaptive genetic parameters are introduced into constant modulus blind equalization algorithm based on Genetic Algorithm and Wavelet Transform(GAWT-CMA), and Constant Modulus blind equali- zation Algorithm based on Adaptive Genetic Algorithm and Wavelet Transform(AGAWT-CMA) was proposed. The proposed algorithm processes genetic parameters adaptively, which can not only save the excellence individual with large probability but als
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Constant Modulus Algorithm"

1

Schumacher, Robert G. Jr. "An Efficient FPGA Implementation of a Constant Modulus Algorithm Equalizer for Wireless Telemetry." University of Dayton / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1417738709.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Batra, Anuj. "Extensions of the constant modulus algorithm and the phase-locked loop for blind multiuser detection." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/15360.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Luo, Yuhui. "A mixed cross-correlation and constant modulus adaptive algorithm for joint blind equalisation and source separation." Thesis, Imperial College London, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270380.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Taiwo, Peter, and Itie Serge Kone Dossongui. "Towards Real-Time CMA Equalization by using FFT for Signal Blocks transmitted over an Aeronautical channel." International Foundation for Telemetering, 2016. http://hdl.handle.net/10150/624260.

Full text
Abstract:
We consider the problem of equalizing data blocks of signals, which have been transmitted over an aeronautical channel using two different modulation schemes. The equalization is performed using the block-processing constant modulus algorithm (CMA), and in order to achieve real-time processing a Fast Fourier Transform (FFT) is used to compute the gradient of this cost function during equalization. The equalizer length is chosen to be five times of the channel length. For the first experiment, we present the result of equalizing a set of measured data, which was modulated and transmitted u
APA, Harvard, Vancouver, ISO, and other styles
5

Jauhar, Ahmad Shujauddin. "A CMA-FRESH Whitening Filter for Blind Interference Rejection." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/85389.

Full text
Abstract:
The advent of spectrum sharing has increased the need for robust interference rejection methods. The Citizens Broadband Radio Service (CBRS) band is soon to be occupied by LTE waveforms and License Assisted Access (LAA) will have LTE signals coexisting with other signals in the 5 GHz band. In anticipation of this need, we present a method for interference rejection of cyclostationary signals, which can also help avoid interference through better detection of low power co-channel signals. The method proposed in this thesis consists of a frequency-shift (FRESH) filter which acts as a whitening
APA, Harvard, Vancouver, ISO, and other styles
6

Xingwen, Ding, Zhai Wantao, Chang Hongyu, and Chen Ming. "CMA BLIND EQUALIZER FOR AERONAUTICAL TELEMETRY." International Foundation for Telemetering, 2016. http://hdl.handle.net/10150/624262.

Full text
Abstract:
In aeronautical telemetry, the multipath interference usually causes significant performance degradation. As the bit rate of telemetry systems increases, the impairments of multipath interference are more serious. The constant modulus algorithm (CMA) blind equalizer is effective to mitigate the impairments of multipath interference. The CMA adapts the equalizer coefficients to minimize the deviation of the signal envelope from a constant level. This paper presents the performances of the CMA blind equalizer applied for PCM-FM, PCM-BPSK, SOQPSK-TG and ARTM CPM in aeronautical telemetry.
APA, Harvard, Vancouver, ISO, and other styles
7

Filho, João Mendes. "Algoritmos eficientes para equalização autodidata de sinais QAM." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/3/3142/tde-15032012-122010/.

Full text
Abstract:
Neste trabalho, são propostos e analisados algoritmos autodidatas eficientes para a equalização de canais de comunicação, considerando a transmissão de sinais QAM (quadrature amplitude modulation). Suas funções de erro são construídas de forma a fazer com que o erro de estimação seja igual a zero nas coordenadas dos símbolos da constelação. Essa característica os possibilita ter um desempenho similar ao de um algoritmo de equalização supervisionada como o NLMS (normalized least mean-square), independentemente da ordem da constelação QAM. Verifica-se analiticamente que, sob certas condições fav
APA, Harvard, Vancouver, ISO, and other styles
8

Fernandes, Carlos Alexandre Rolim. "EqualizaÃÃo adaptativa e autodidata de canais lineares e nÃo-lineares utilizando o algoritmo do mÃdulo constante." Universidade Federal do CearÃ, 2005. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=2041.

Full text
Abstract:
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico<br>Este trabalho trata da proposiÃÃo de algoritmos para equalizaÃÃo cega de canais lineares e nÃao-lineares inspirados no Algoritmo do MÃdulo Constante (CMA). O CMA funciona de maneira bastante eficiente com constelaÃÃes nas quais todos os pontos possuem a mesma amplitude, como em modulaÃÃes do tipo Phase Shift Keying (PSK). Entretanto, quando os pontos da constelaÃÃo podem assumir diferentes valores de amplitudes, como em modulaÃÃes do tipo Quadrature Amplitude Modulation (QAM), o CMA e seus derivados muitas vezes nÃo funcionam de
APA, Harvard, Vancouver, ISO, and other styles
9

Santos, Samuel Batista dos. "Estudo de algoritmos adaptativos aplicados a redes de sensores sem fio : caso supervisionado e não supervisionado." reponame:Repositório Institucional da UFABC, 2014.

Find full text
Abstract:
Orientadora: Profa. Dra. Aline de Oliveira Neves Panazio<br>Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Engenharia da Informação, 2014.<br>Redes de sensores sem o (WSN - Wireless Sensor Networks) têm sido usadas na observação de fenômenos, identicação de sistemas, equalização de canais, além de aplicações nas mais diversas áreas. Considerando o caso de redes homogêneas com protocolo ponto a ponto, nas quais os sensores são capazes de processar suas informações e se comunicar com sensores vizinhos, diversos algoritmos adaptativos vêm sendo aplicados no pro
APA, Harvard, Vancouver, ISO, and other styles
10

Silva, Daniela Brasil. "Restauração cega de imagens: soluções baseadas em algoritmos adaptativos." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/3/3142/tde-27082018-143938/.

Full text
Abstract:
O objetivo da desconvolução cega de imagens é restaurar uma imagem degradada sem usar informação da imagem real ou da função de degradação. O mapeamento dos níveis de cinza de uma imagem em um sinal de comunicação possibilita o uso de técnicas de equalização cega de canais para a restauração de imagens. Neste trabalho, propõe-se o uso de um esquema para desconvolução cega de imagens baseado na combinação convexa de um equalizador cego com um equalizador no modo de decisão direta. A combinação também é adaptada de forma cega, o que possibilita o chaveamento automático entre os filtros component
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Constant Modulus Algorithm"

1

Anders, Torsten. Compositions Created with Constraint Programming. Edited by Roger T. Dean and Alex McLean. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780190226992.013.5.

Full text
Abstract:
This chapter surveys music constraint programming systems, and how composers have used them. The chapter motivates why and explains how users of such systems describe intended musical results with constraints. This approach to algorithmic composition is similar to the way declarative and modular compositional rules have successfully been used in music theory for centuries as a device to describe composition techniques. This systematic overview highlights the respective strengths of different approaches and systems from a composer’s point of view, complementing other more technical surveys of t
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Constant Modulus Algorithm"

1

Song, Xin, Jinkuan Wang, Qiuming Li, and Han Wang. "Robust Constrained Constant Modulus Algorithm." In Advances in Neural Networks – ISNN 2012. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31362-2_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jun, Sun Li, Zhang Shou-Yong, and Dai Bin. "A New Variable Step-Size Constant Modulus Blind Equalization Algorithm." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23998-4_60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Guo, Ye-cai, Qu Chen, and Jun Guo. "Constant Modulus Blind Equalization Algorithm for Multi-Carrier Combining of Digital Phase-Locked Loop and Pilot Sequence." In Lecture Notes in Electrical Engineering. Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4793-0_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Heitzinger, Clemens. "Variables, Constants, Scopes, and Modules." In Algorithms with JULIA. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-16560-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ayala-Rincón, Mauricio, David M. Cerna, Andrés Felipe González Barragán, and Temur Kutsia. "Equational Anti-unification over Absorption Theories." In Automated Reasoning. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63501-4_17.

Full text
Abstract:
AbstractInterest in anti-unification, the dual problem of unification, is rising due to various new applications. For example, anti-unification-based techniques have been used recently in software analysis and related areas such as clone detection and automatic program repair. While syntactic forms of anti-unification have found many interesting uses, some aspects of modern applications are more appropriately modeled by reasoning modulo an equational theory. Thus, extending existing anti-unification methods to deal with important equational theories is the natural step forward. This paper cons
APA, Harvard, Vancouver, ISO, and other styles
6

Ning, Xiaoling, Zhong Liu, and Yasong Luo. "An Improved Combination of Constant Modulus Algorithms Used in Underwater Acoustic Channels." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13498-2_91.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fernandes, C. A. R., and J. C. M. Mota. "New Blind Algorithms Based on Modified “Constant Modulus” Criteria for QAM Constellations." In Telecommunications and Networking - ICT 2004. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27824-5_67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Loose, Nils, Felix Mächtle, Florian Sieck, and Thomas Eisenbarth. "SWAT: Modular Dynamic Symbolic Execution for Java Applications using Dynamic Instrumentation (Competition Contribution)." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57256-2_28.

Full text
Abstract:
AbstractSWAT is a novel dynamic symbolic execution engine for Java applications utilizing dynamic instrumentation. SWAT’s unique modular design facilitates flexible communication between its symbolic explorer and executor using HTTP endpoints, thus enhancing adaptability to diverse application scenarios. The symbolic executor’s ability to attach to Java applications enables efficient constraint generation and path exploration. SWAT employs JavaSMT for constraint generation and ASM for bytecode instrumentation, ensuring robust performance. SWAT’s efficacy is evaluated in the Java Track of SV-CO
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Haokun, Bican Xia, and Tianqi Zhao. "Local Search for Solving Satisfiability of Polynomial Formulas." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37703-7_5.

Full text
Abstract:
AbstractSatisfiability Modulo the Theory of Nonlinear Real Arithmetic, SMT(NRA) for short, concerns the satisfiability of polynomial formulas, which are quantifier-free Boolean combinations of polynomial equations and inequalities with integer coefficients and real variables. In this paper, we propose a local search algorithm for a special subclass of SMT(NRA), where all constraints are strict inequalities. An important fact is that, given a polynomial formula with n variables, the zero level set of the polynomials in the formula decomposes the n-dimensional real space into finitely many compo
APA, Harvard, Vancouver, ISO, and other styles
10

Bromberger, Martin, Irina Dragoste, Rasha Faqeh, et al. "A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_27.

Full text
Abstract:
AbstractIn a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of decidi
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Constant Modulus Algorithm"

1

Bi, Mengjun. "Logarithmic Type Constant Modulus Blind Equalization Algorithm Based on Maximum Correlation Entropy Criterion." In 2024 9th International Symposium on Computer and Information Processing Technology (ISCIPT). IEEE, 2024. http://dx.doi.org/10.1109/iscipt61983.2024.10673372.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Silva, Magno T. M. da, Max Gerken, and Maria D. Miranda. "An Accelerated Constant Modulus Algorithm." In 2002 International Telecommunications Symposium. Sociedade Brasileira de Telecomunicações, 2002. http://dx.doi.org/10.14209/its.2002.405.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yu Liu, Bingkun Gao, Yan Wang, Running Gao, and Liang Wang. "Constant Modulus Algorithm in intelligent antenna." In 2012 International Conference on Measurement, Information and Control (MIC). IEEE, 2012. http://dx.doi.org/10.1109/mic.2012.6273394.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Regalia. "A finite-interval constant modulus algorithm." In IEEE International Conference on Acoustics Speech and Signal Processing ICASSP-02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.1005139.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Regalia, Phillip A. "A finite-interval constant modulus algorithm." In Proceedings of ICASSP '02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.5745101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Song, Xin, Jinkuan Wang, and Bin Wang. "Robust Constrained Least Square Constant Modulus Algorithm." In 2009 Third International Symposium on Intelligent Information Technology Application. IEEE, 2009. http://dx.doi.org/10.1109/iita.2009.368.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Silva, Magno T. M., and Vitor H. Nascimento. "Tracking analysis of the constant modulus algorithm." In ICASSP 2008 - 2008 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2008. http://dx.doi.org/10.1109/icassp.2008.4518421.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Miranda, Maria D., Magno T. M. Silva, and Vitor H. Nascimento. "Avoiding divergence in the constant modulus algorithm." In ICASSP 2008 - 2008 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2008. http://dx.doi.org/10.1109/icassp.2008.4518422.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fan Xiaoxing, Feng Guangzeng, and Pan Ziyu. "A new batch processing constant modulus algorithm." In IET Conference on Wireless, Mobile and Sensor Networks 2007 (CCWMSN07). IEE, 2007. http://dx.doi.org/10.1049/cp:20070197.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Eksim, Ali, and Serhat Gul. "Buffered multi-layered modified constant modulus algorithm." In 2014 9th International Symposium on Communication Systems, Networks & Digital Signal Processing (CSNDSP). IEEE, 2014. http://dx.doi.org/10.1109/csndsp.2014.6923907.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Constant Modulus Algorithm"

1

Baader, Franz, and Klaus U. Schulz. Unification Theory - An Introduction. Aachen University of Technology, 1997. http://dx.doi.org/10.25368/2022.135.

Full text
Abstract:
Equational unification is a generalization of syntactic unification in which semantic properties of function symbols are taken into account. For example, assume that the function symbol '+' is known to be commutative. Given the unication problem x + y ≐ a + b (where x and y are variables, and a and b are constants), an algorithm for syntactic unification would return the substitution {x ↦ a; y ↦ b} as the only (and most general) unifier: to make x + y and a + b syntactically equal, one must replace the variable x by a and y by b. However, commutativity of '+' implies that {x ↦ b; y ↦ b} also i
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Constant Modulus Algorithm' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography