Relevant bibliographies by topics / Constant Modulus Algorithm

Academic literature on the topic 'Constant Modulus Algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 January 2023

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

Select a source type:

Contents

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 (May 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 (January 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 (September 2004): 582–84. http://dx.doi.org/10.1109/lcomm.2004.835330.

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

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 (October 2006): 659–62. http://dx.doi.org/10.1016/j.aeue.2005.12.002.

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

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 (August 1, 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 in the case of the constant modulus algorithm (CMA) beamformer, which leads the beamformer to suppress the desired signal and lock onto the interference signal. The least-square constant modulus algorithm is a prominent blind adaptive beamforming algorithm. We propose two CMA-based algorithms which exploit the constant modularity as well as power or DOA of the desired signal to avoid self-nulling in beamforming. Simulations results verify the effectiveness of the proposed algorithms.
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 larger the momentum factor , the better convergence effect in the defined domain of the momentum factor.
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 (June 2003): 1447–64. http://dx.doi.org/10.1109/tit.2003.811903.

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

Ram Babu., T., and Dr P. Rajesh Kumar. "Blind Equalization using Constant Modulus Algorithm and Multi-Modulus Algorithm in Wireless Communication Systems." International Journal of Computer Applications 1, no. 3 (February 25, 2010): 50–55. http://dx.doi.org/10.5120/86-184.

Full text
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 also avoid stagnancy during the evolution process. So it is propitious to search the whole optimum solution in overall range. The performance of the proposed algorithm was verified by computer simulation with underwater acoustic channels.
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 using the iNET packet structure with SOQPSK modulation. In this case, the CMA equalizer is first initialized using MMSE and the equalizer coefficients are then updated once, using each entire block (iNET packet). In the second experiment, we apply the FFT-based block processing equalizer to received data blocks of QPSK signals, which have been randomly generated and transmitted over an aeronautical channel. A modified constant modulus algorithm and alphabet matched algorithm (CMA + AMA) equalizer is used to recover these data blocks. For this case of QPSK signals, the equalizer performance is evaluated over 500 Monte Carlo runs, using the average symbol error rate (SER).
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 filter, canceling the interference by exploiting its cyclostationarity. It learns the cyclostationary characteristics of the interferer blindly, through a property restoration algorithm which aims to drive the spectrum to white noise. The property restoration algorithm, inspired by the constant modulus algorithm (CMA), is applied to each frequency bin to determine the optimal coefficients for the proposed CMA FRESH whitening filter (CFW). The performance of the CFW in interference rejection is compared to a time-invariant version, and proposed use cases are analyzed. The use cases consist of the rejection of a high powered, wider bandwidth interferer which is masking the signal-of-interest (SOI). The interferer is rejected blindly, with no knowledge of its characteristics. We analyzed signal detection performance in the case that the SOI is another user with much lower power, for multiple types of SOIs ranging from BPSK to OFDM. We also deal with the case that the SOI is to be received and demodulated; we recover it and compare resulting bit error rates to state of the art FRESH filters. The results show significantly better signal detection and recovery.
Master of Science
Wireless communication is complicated by the fact that multiple radios may be attempting to transmit at the same frequency, time and location concurrently. This scenario may be a due to malicious intent by certain radios (jamming), or mere confusion due to a lack of knowledge that another radio is transmitting in the same channel. The latter scenario is more common due to congested wireless spectrum, as the number of devices increases exponentially. In either case, interference results. We present a novel interference rejection method in this work, one that is blind to the properties of the interferer and adapts to cancel it. It follows the philosophy of property restoration as extolled by the constant modulus algorithm (CMA) and is a frequency shift (FRESH) filter, hence the name. The process of restoring the wireless spectrum to white noise is what makes it a whitening filter, and is also how it adapts to cancel interference. Such a filter has myriad possible uses, and we examine the use case of rejecting interference to detect or recover the signal-of-interest (SOI) that we are attempting to receive. We present performance results in both cases and compare with conventional time-invariant filters and state of the art FRESH filters.
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 favoráveis para a equalização, os vetores de coeficientes dos algoritmos propostos e a correspondente solução de Wiener são colineares. Além disso, usando a informação da estimativa do símbolo transmitido e de seus símbolos vizinhos, esquemas de baixo custo computacional são propostos para aumentar a velocidade de convergência dos algoritmos. No caso do algoritmo baseado no critério do módulo constante, evita-se sua divergência através de um mecanismo que descarta estimativas inconsistentes dos símbolos transmitidos. Adicionalmente, apresenta-se uma análise de rastreio (tracking), que permite obter expressões analíticas para o erro quadrático médio em excesso dos algoritmos propostos em ambientes estacionários e não-estacionários. Através dessas expressões, verifica-se que com sobreamostragem, ausência de ruído e ambiente estacionário, os algoritmos propostos podem alcançar a equalização perfeita, independentemente da ordem da constelação QAM. Os algoritmos são estendidos para a adaptação conjunta dos filtros direto e de realimentação do equalizador de decisão realimentada, levando-se em conta um mecanismo que evita soluções degeneradas. Resultados de simulação sugerem que a utilização dos esquemas aqui propostos pode ser vantajosa na recuperação de sinais QAM, fazendo com que seja desnecessário o chaveamento para o algoritmo de decisão direta.
In this work, we propose efficient blind algorithms for equalization of communication channels, considering the transmission of QAM (quadrature amplitude modulation) signals. Their error functions are constructed in order to make the estimation error equal to zero at the coordinates of the constellation symbols. This characteristic enables the proposed algorithms to have a similar performance to that of a supervised equalization algorithm as the NLMS (normalized least mean-square), independently of the QAM order. Under some favorable conditions, we verify analytically that the coefficient vector of the proposed algorithms are collinear with the Wiener solution. Furthermore, using the information of the symbol estimate in conjunction with its neighborhood, we propose schemes of low computational cost in order to improve their convergence rate. The divergence of the constant-modulus based algorithm is avoided by using a mechanism, which disregards nonconsistent estimates of the transmitted symbols. Additionally, we present a tracking analysis in which we obtain analytical expressions for the excess mean-square error in stationary and nonstationary environments. From these expressions, we verify that using a fractionally-spaced equalizer in a noiseless stationary environment, the proposed algorithms can achieve perfect equalization, independently of the QAM order. The algorithms are extended to jointly adapt the feedforward and feedback filters of the decision feedback equalizer, taking into account a mechanism to avoid degenerative solutions. Simulation results suggest that the proposed schemes may be advantageously used to recover QAM signals and make the switching to the decision direct mode unnecessary.
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
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 forma satisfatÃria. Desta forma, as tÃcnicas aqui propostas sÃo projetadas para melhorar a performance do CMA em termos de velocidade de convergÃncia e precisÃo, quando operando em sinais transmitidos com diversos mÃdulos, em particular para a modulaÃÃo QAM. Assim como o CMA, para possuir um bom apelo prÃtico, essas tÃcnicas devem apresentar bom compromisso entre complexidade, robustez e desempenho. Para tanto, as tÃcnicas propostas utilizam o Ãltimo sÃmbolo decidido para definir uma estimaÃÃo de raio de referÃncia para a saÃda do equalizador. De fato, esses algoritmos podem ser vistos como generalizaÃÃes do CMA e de alguns derivados do CMA para constelaÃÃes com mÃltiplos raios. A proposiÃÃo de algoritmos do tipo gradiente estocÃstico à concluÃda com o desenvolvimento de tÃcnicas originais, baseadas no CMA, para equalizaÃÃo de canais do tipo Wiener, que consiste em um filtro linear com memÃria, seguido por um filtro nÃo-linear sem memÃria. As expressÃes para a adaptaÃÃo do equalizador sÃo encontradas com o auxÃlio de uma notaÃÃo unificada para trÃs diferentes estruturas: i) um filtro de Hammerstein; ii) um filtro de Volterra diagonal; e iii) um filtro de Volterra completo. Um estudo teÃrico acerca do comportamento do principal algoritmo proposto, o Decision Directed Modulus Algorithm (DDMA) à realizado. SÃo analisadas a convergÃncia e a estabilidade do algoritmo atravÃs de uma anÃlise dos pontos de mÃnimo de sua funÃÃo custo. Outro objetivo à encontrar o valor teÃrico do Erro MÃdio QuadrÃtico MÃdio em Excesso - Excess Mean Square Error (EMSE) fornecido pelo DDMA considerando-se o caso sem ruÃdo. Ao final, à feito um estudo em que se constata que o algoritmo DDMA possui fortes ligaÃÃes com a soluÃÃo de Wiener e com o CMA. VersÃes normalizadas, bem como versÃes do tipo Recursive Least Squares (RLS), dos algoritmos do tipo gradiente estocÃstico estudados sÃo tambÃm desenvolvidas. Cada famÃlia de algoritmos estudada fie composta por quatro algoritmos com algumas propriedades interessantes e vantagens sobre as tÃcnicas clÃssicas, especialmente quando operando em sinais QAM de ordem elevada. TambÃm sÃo desenvolvidas versÃes normalizadas e do tipo RLS dos algoritmos do tipo CMA estudados para equalizaÃÃo de canais nÃo-lineares. O comportamento de todas as famÃlias de algoritmos desenvolvidos à testado atravÃs de simulaÃÃes computacionais, em que à verificado que as tÃcnicas propostas fornecem ganhos significativos em desempenho, em termos de velocidade de convergÃncia e erro residual, em relaÃÃo Ãs tÃcnicas clÃssicas.
This work studies and proposes algorithms to perform blind equalization of linear and nonlinear channels inspired on the Constant Modulus Algorithm (CMA). The CMA works very well for modulations in which all points of the signal constellation have the same radius, like in Phase Shift Keying (PSK) modulations. However, when the constellation points are characterized by multiple radii, like in Quadrature Amplitude Modulation (QAM) signals, the CMA does not work properly in many situations. Thus, the techniques proposed here are designed to improve the performance of the CMA, in terms of speed of convergence and residual error, when working with signals transmitted with multiple magnitude, in particular with QAM signals. As well as for the CMA, these techniques should have a good compromise among performance, complexity and robustness. To do so, the techniques use the last decided symbol to estimate reference radius to the output of the equalizer. In fact, they can be seen as modifications of the CMA and of some of its derivatives for constellations with multiple radii. The proposition of stochastic gradient algorithms is concluded with the development of new adaptive blind techniques to equalize channels with a Wiener structure. A Wiener filter consists of a linear block with memory followed by a memoryless nonlinearity, by using the CMA. We develop expressions for the adaptation of the equalizer using a unified notation for three different equalizer filter structures: i) a Hammerstein filter, ii) a diagonal Volterra filter and iii) a Volterra filter. A theoretical analysis of the main proposed technique, the Decision Directed Modulus Algorithm (DDMA), is also done. We study the convergence and the stability of the DDMA by means of an analysis of the minima of the DDM cost function. We also develop an analytic expression for the Excess Mean Square Error (EMSE) provided by the DDMA in the noiseless case. Then, we nd some interesting relationships among the DDM, the CM and the Wiener cost functions. We also develop a class of normalized algorithms and a class of Recursive Least Squares (RLS)-type algorithms for blind equalization inspired on the CMA-based techniques studied. Each family is composed of four algorithms with desirable properties and advantages over the original CM algorithms, specially when working with high-level QAM signals. Normalized and RLS techniques for equalization of Wiener channels are also developed. The behavior of the proposed classes of algorithms discussed is tested by computational simulations. We verify that the proposed techniques provide significative gains in performance, in terms of speed of convergence and residual error, when compared to the classical algorithms.
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
Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Engenharia da Informação, 2014.
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 processamento dos dados medidos. Estes algoritmos podem ser supervisionados ou não supervisionados. Buscando estimar parâmetros comuns através de um processamento distribuído, a topologia da rede passa a ser uma característica importante e precisa ser levada em conta nos algoritmos utilizados. Tais algoritmos operam em modo de difusão, considerando a troca de informações entre sensores vizinhos na atualização dos coecientes dos ltros adaptativos de cada sensor. O mapeamento da topologia da rede é feito de forma matricial através das chamadas matrizes de combinação. Neste trabalho, estudamos o impacto da escolha da matriz de combinação no desempenho dos algoritmos supervisionados. No caso de algoritmos não supervisionados, como a única proposta encontrada na literatura considerava um caso bastante restrito em que o algoritmo só poderia ser aplicado a uma rede com topologia em anel e comunicação unidirecional entre os nós, propomos um novo algoritmo capaz de operar em modo de difusão em qualquer topologia, baseado no clássico critério do módulo constante. O algoritmo proposto é simulado em diversas situações, sempre apresentando vantagens em relação a uma rede sem cooperação entre os nós.
Wireless sensor networks (WSN) have been used in the observation of several phenomena, system identication, channel equalization, and others. Considering the case of homogeneous networks with point to point protocol, in which the sensors are able to process their information and communicate with neighbors, various adaptive algorithms have been applied in the processing of measured data. These algorithms can be supervised or unsupervised. Seeking to estimate common parameters across a distributed processing, network topology becomes an important feature and must be taken into account in the algorithms used. Such algorithms operate in diusion mode, that is, considering the exchange of information between sensors to update the coecients of the adaptive lters. Thenetwork topology is mapped through the use of a matrix, denoted combination matrix. In this work, we study the impact of the choice of the combination matrix on the performance of supervised algorithms. In the case of blind methods, the only technique found in the literature was applied to the specic case of a network with ring topology and unidirectional communication between nodes. Thus, we propose a new algorithm capable of operating in diusion mode on any topology, based on the classical constant modulus criterion. The proposed algorithm is simulated in several scenarios, always presenting advantages over a network without cooperation between nodes.
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 componentes. Dessa forma, o esquema proposto é capaz de atingir o desempenho de um algoritmo de filtragem adaptativa supervisionada sem o conhecimento prévio da imagem original. O desempenho da combinação é ilustrado por meio de simulações, que comprovam a eficiência desse esquema quando comparado a outras soluções da literatura.
The goal of blind image deconvolution is to restore a degraded image without using information from the actual image or from the point spread function. The mapping of the gray levels of an image into a communication signal enables the use of blind equalization techniques for image restoration. In this work, we use a blind image deconvolution scheme based on the convex combination of a blind equalizer with an equalizer in the decision-directed mode. The combination is also blindly adapted, which enables automatic switching between the component filters. Thus, the proposed scheme is able to achieve the performance of a supervised adaptive filtering algorithm without prior knowledge of the original image. The performance of the combination is illustrated by simulations, which show the efficiency of this scheme when compared to other solutions in the literature.
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 this field. This text describes the music constraint systems PMC, Score-PMC, PWMC (and its successor Cluster Engine), Strasheela, and Orchidée—most are libraries of the composition systems PWGL or OpenMusic. These systems are shown in action by discussions of the composition processes of specific works by Jacopo Baboni Schilingi, Magnus Lindberg, Örjan Sandred, Torsten Anders, Johannes Kretz, and Jonathan Harvey.
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, 386–95. Berlin, Heidelberg: 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, 436–42. Berlin, Heidelberg: 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, 205–12. London: 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, 39–49. Cham: 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

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, 694–700. Berlin, Heidelberg: 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
6

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, 498–503. Berlin, Heidelberg: 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
7

Bromberger, Martin, Irina Dragoste, Rasha Faqeh, Christof Fetzer, Larry González, Markus Krötzsch, Maximilian Marx, Harish K. Murali, and Christoph Weidenbach. "A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic." In Tools and Algorithms for the Construction and Analysis of Systems, 480–501. Cham: 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 deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine.In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.
APA, Harvard, Vancouver, ISO, and other styles
8

Zhou, Jun, Lihe Tang, Songyuhao Shi, Wei Li, Pan Hu, and Feng Wang. "Research on Visualization of Power Grid Big Data." In Proceeding of 2021 International Conference on Wireless Communications, Networking and Applications, 511–17. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2456-9_52.

Full text
Abstract:
AbstractWith the constant improvement of power grid planning and management requirements and the gradual advancement of the urbanization process, the problems that need to be taken into account in the planning process are increasing, especially the demand for big data visualization of the power grid has increased sharply. About 80% of the information that humans obtain from the external environment comes from the visual system. A picture is worth a thousand words. A good visualization platform can monitor the overall operation of the power grid, which is convenient for analyzing and monitoring the operation of power supply companies to provide customers with high-quality services. The platform can complete the interactive simulation of different services, and can display the monitoring and analysis of the power grid through a rich visual interface, which is convenient for people to understand the real-time status of the power grid. This paper uses various advanced visualization technologies and data module algorithms at home and abroad to cooperate with the monitoring network to realize the visualization platform of power grid big data, promote the further development of power grid big data applications, and form a big data standard system for power big data technology research, product research and development, and pilot construction.
APA, Harvard, Vancouver, ISO, and other styles
9

Leeson, Mark S., and Eugene Iwu. "Blind Equalization for Broadband Access using the Constant Modulus Algorithm." In Applied Signal and Image Processing, 76–101. IGI Global, 2011. http://dx.doi.org/10.4018/978-1-60960-477-6.ch005.

Full text
Abstract:
The cost of laying optical fiber to the home means that digital transmission using copper twisted pairs is still widely used to provide broadband Internet access via Digital Subscriber Line (DSL) techniques. However, copper transmission systems were optimally designed for voice transmission and cause distortion of high bandwidth digital information signals. Thus equalization is needed to ameliorate the effects of the distortion. To avoid wasting precious bandwidth, it is desirable that the equalization is blind, operating without training sequences. This chapter concerns the use of a popular blind adaptive equalization algorithm, namely the Constant Modulus Algorithm (CMA) that penalizes deviations from a fixed value in the modulus of the equalizer output signal. The CMA is set in the context of blind equalization, with particular focus on systems that sample at fractions of the symbol time. Illustrative examples show the performance of the CMA on an ideal noiseless channel and in the presence of Gaussian noise. Realistic data simulations for microwave and DSL channels confirm that the CMA is capable of dealing with the non-ideal circumstances that will be encountered in practical transmission scenarios.
APA, Harvard, Vancouver, ISO, and other styles
10

Tadmor, Sagi, Sapir Carmi, and Monika Pinchas. "A Novel Dual Mode Decision Directed Multimodulus Algorithm (DM-DD-MMA) for Blind Adaptive Equalization." In Proceedings of CECNet 2021. IOS Press, 2021. http://dx.doi.org/10.3233/faia210430.

Full text
Abstract:
In this paper, we propose for the 16 quadrature amplitude modulation (QAM) input case, a dual-mode (DM), decision directed (DD) multimodulus algorithm (MMA) algorithm for blind adaptive equalization which we name as DM-DD-MMA. In this new proposed algorithm, the MMA method is switched to the DD algorithm, based on a previously obtained expression for the step-size parameter valid at the convergence state of the blind adaptive equalizer, that depends on the channel power, input signal statistics and on the properties of the chosen algorithm. Simulation results show that improved equalization performance is obtained for the 16 QAM input case compared with the DM-CMA (where CMA is the constant modulus algorithm), DM-MCMA (where MCMA is the modified CMA) and MCMA-MDDMA (where MDDMA is the modified decision directed modulus algorithm).
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Constant Modulus Algorithm"

1

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
2

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
3

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
4

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
5

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
6

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
7

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
8

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
9

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
10

Haun, M. A., and D. L. Jones. "The fractionally spaced vector constant modulus algorithm." In 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258). IEEE, 1999. http://dx.doi.org/10.1109/icassp.1999.761241.

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 is a unifier in the sense that the terms obtained by its application, namely b + a and a + b, are equal modulo commutativity of '+'. More generally, equational unification is concerned with the problem of how to make terms equal modulo a given equational theory, which specifies semantic properties of the function symbols that occur in the terms to be unified.
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