Gotowe bibliografie tematyczne / LMS ALGORITHMS

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Książki
Części książek
Streszczenia konferencji
Raporty organizacyjne

Gotowa bibliografia na temat „LMS ALGORITHMS”

Autor: Grafiati

Data publikacji: 11 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „LMS ALGORITHMS”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "LMS ALGORITHMS"

Liu, Ningning, Yuedong Sun, Yansong Wang, Hui Guo, Bin Gao, Tianpei Feng i Pei Sun. "Active control for vehicle interior noise using the improved iterative variable step-size and variable tap-length LMS algorithms". Noise Control Engineering Journal 67, nr 6 (1.11.2019): 405–14. http://dx.doi.org/10.3397/1/376737.

Pełny tekst źródła

Streszczenie:

Active noise control (ANC) is used to reduce undesirable noise, particularly at low frequencies. There are many algorithms based on the least mean square (LMS) algorithm, such as the filtered-x LMS (FxLMS) algorithm, which have been widely used for ANC systems. However, the LMS algorithm cannot balance convergence speed and steady-state error due to the fixed step size and tap length. Accordingly, in this article, two improved LMS algorithms, namely, the iterative variable step-size LMS (IVS-LMS) and the variable tap-length LMS (VT-LMS), are proposed for active vehicle interior noise control. The interior noises of a sample vehicle are measured and thereby their frequency characteristics. Results show that the sound energy of noise is concentrated within a low-frequency range below 1000 Hz. The classical LMS, IVS-LMS and VT-LMS algorithms are applied to the measured noise signals. Results further suggest that the IVS-LMS and VT-LMS algorithms can better improve algorithmic performance for convergence speed and steady-state error compared with the classical LMS. The proposed algorithms could potentially be incorporated into other LMS-based algorithms (like the FxLMS) used in ANC systems for improving the ride comfort of a vehicle.

Style APA, Harvard, Vancouver, ISO itp.

Ying-Chang Liang i F. P. S. Chin. "Coherent LMS algorithms". IEEE Communications Letters 4, nr 3 (marzec 2000): 92–94. http://dx.doi.org/10.1109/4234.831035.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Kostromitsky, S. M., I. N. Davydzenko i A. A. Dyatko. "Equivalent forms of writing of processing algorithms of adaptive antenna array". Proceedings of the National Academy of Sciences of Belarus, Physical-Technical Series 67, nr 2 (2.07.2022): 230–38. http://dx.doi.org/10.29235/1561-8358-2022-67-2-230-238.

Pełny tekst źródła

Streszczenie:

The article is devoted to obtaining equivalent forms of writing of processing algorithms for the operation of adaptive antenna arrays, considering algorithms as varieties of some generalized LMS algorithm. This will facilitate a comparative analysis of the algorithms’ characteristics. The following algorithms of operation are considered: LMS, NLMS, LMS-Newton, SMI, RLS. The article contains the initial operation algorithms of adaptive antenna arrays, conclusions of equivalent processing algorithms and an equivalent block diagram of the generalized LMS algorithm. Equivalent forms of writing the operation algorithms of adaptive antenna arrays and their parameters are also presented in tabular form. Of particular interest is the equivalent operation algorithm in the case of the SMI algorithm, which differs most from the LMS algorithm. Equivalent algorithms differ only by the scalar convergence coefficient and the matrix normalizing factor. For LMS-Newton, SMI, and RLS algorithms, the matrix normalizing factor is the same, it is determined by inverting the estimation of the correlation matrix of input signals and reduces the dependence of the characteristics of the algorithms on the parameters of the correlation matrix. The scalar convergence coefficient of equivalent algorithms in the case of SMI and RLS algorithms depends on the iteration number and tends to zero for the SMI algorithm and to some non-zero value for the RLS algorithm. The dependence of the convergence coefficient on the iteration number makes it possible to optimize the characteristics of the algorithms at the transition stage. The tendency of the convergence coefficient to zero in the case of the SMI algorithm makes it effective only for stationary input signals. The non-zero steady-state value of the convergence coefficient in the case of the RLS algorithm allows its effective use in a non-stationary environment.

Style APA, Harvard, Vancouver, ISO itp.

Godavarti, M., i A. O. Hero. "Partial update LMS algorithms". IEEE Transactions on Signal Processing 53, nr 7 (lipiec 2005): 2382–99. http://dx.doi.org/10.1109/tsp.2005.849167.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Rusu, Alexandru-George, Silviu Ciochina, Constantin Paleologu i Jacob Benesty. "An Optimized Differential Step-Size LMS Algorithm". Algorithms 12, nr 8 (24.07.2019): 147. http://dx.doi.org/10.3390/a12080147.

Pełny tekst źródła

Streszczenie:

Adaptive algorithms with differential step-sizes (related to the filter coefficients) are well known in the literature, most frequently as “proportionate” algorithms. Usually, they are derived on a heuristic basis. In this paper, we introduce an algorithm resulting from an optimization criterion. Thereby, we obtain a benchmark algorithm and also another version with lower computational complexity, which is rigorously valid for less correlated input signals. Simulation results confirm the theory and outline the performance of the algorithms. Unfortunately, the good performance is obtained by an important increase in computational complexity. Nevertheless, the proposed algorithms could represent useful benchmarks in the field.

Style APA, Harvard, Vancouver, ISO itp.

Zhao, Sihai, Jiangye Xu i Yuyan Zhang. "A Variable Step-Size Leaky LMS Algorithm". Wireless Communications and Mobile Computing 2021 (9.11.2021): 1–11. http://dx.doi.org/10.1155/2021/7951643.

Pełny tekst źródła

Streszczenie:

The leaky LMS algorithm has been extensively studied because of its control of parameter drift. This unexpected parameter drift is linked to the inadequacy of excitation in the input sequence. And generally leaky LMS algorithms use fixed step size to force the performance of compromise between the fast convergence rate and small steady-state misalignment. In this paper, variable step-size (VSS) leaky LMS algorithm is proposed. And the variable step-size method combines the time average estimation of the error and the time average estimation of the normalized quantity. Variable step-size method proposed incorporating with leaky LMS algorithm can effectively eliminate noise interference and make the early convergence, and final small misalignments are obtained together. Simulation results demonstrate that the proposed algorithm has better performance than the existing variable step-size algorithms in the unexcited environment. Furthermore, the proposed algorithm is comparable in performance to other variable step-size algorithms under the adequacy of excitation.

Style APA, Harvard, Vancouver, ISO itp.

Kalkar, Purvika, i John Sahaya Rani Alex. "FIELD PROGRAMMABLE GATE ARRAY IMPLEMENTATION OF A VARIABLE LEAKY LEAST MEAN SQUARE ADAPTIVE ALGORITHM". Asian Journal of Pharmaceutical and Clinical Research 10, nr 13 (1.04.2017): 69. http://dx.doi.org/10.22159/ajpcr.2017.v10s1.19566.

Pełny tekst źródła

Streszczenie:

Adaptive noise cancellation is an extensively researched area of signal processing. Many algorithms had been studied such as least mean square algorithm (LMS), recursive least square algorithm, and normalized LMS algorithm. The statistical characteristics of noise are fast in nature and the algorithms for noise cancellation should converge fast. Since LMS algorithm has slow convergence; in this paper, a variable leaky LMS (VLLMS) algorithm is explored. VLLMS is implemented using the concept of hardware-software cosimulation using Xilinx System Generator. The design is implemented on Virtex-6 ML605 field programmable gate array board. The implemented design is tested for sinusoidal signal added with an additivewhite Gaussian noise. The design summary and the utilization summary are presented.

Style APA, Harvard, Vancouver, ISO itp.

Chen, Yuan Yuan, Run Jie Liu, Jin Yuan Shen i Dan Dan He. "The Use of Adaptive Algorithms on Smart Antenna Device". Advanced Materials Research 548 (lipiec 2012): 730–34. http://dx.doi.org/10.4028/www.scientific.net/amr.548.730.

Pełny tekst źródła

Streszczenie:

Adaptive beamforming is one of the core technology of the smart antenna system. Two different adaptive algorithms which adopt the minimum mean square algorithm (LMS) and recursive least squares algorithm (RLS) are employed to realize the beamforming in smart antenna system. The smart antenna system based on LMS and RLS is simulated and realized by the MATLAB software in which a uniform linear adaptive antenna array is used. The results show that the smart antenna systems based on RLS and LMS algorithms can significantly reduce the bit error rate especially with the low SNR.

Style APA, Harvard, Vancouver, ISO itp.

Javed, Shazia, i Noor Atinah Ahmad. "Optimal preconditioned regularization of least mean squares algorithm for robust online learning1". Journal of Intelligent & Fuzzy Systems 39, nr 3 (7.10.2020): 3375–85. http://dx.doi.org/10.3233/jifs-191728.

Pełny tekst źródła

Streszczenie:

Despite its low computational cost, and steady state behavior, some well known drawbacks of the least means squares (LMS) algorithm are: slow rate of convergence and unstable behaviour for ill conditioned autocorrelation matrices of input signals. Several modified algorithms have been presented with better convergence speed, however most of these algorithms are expensive in terms of computational cost and time, and sometimes deviate from optimal Wiener solution that results in a biased solution of online estimation problem. In this paper, the inverse Cholesky factor of the input autocorrelation matrix is optimized to pre-whiten input signals and improve the robustness of the LMS algorithm. Furthermore, in order to have an unbiased solution, mean squares deviation (MSD) is minimized by improving convergence in misalignment. This is done by regularizing step-size adaptively in each iteration that helps in developing a highly efficient optimal preconditioned regularized LMS (OPRLMS) algorithm with adaptive step-size. Comparison of OPRLMS algorithm with other LMS based algorithms is given for unknown system identification and noise cancelation from ECG signal, that results in preference of the proposed algorithm over the other variants of LMS algorithm.

Style APA, Harvard, Vancouver, ISO itp.

Egiazarian, Karen, Pauli Kuosmanen i Ciprian Bilcu. "Variable step-size LMS adaptive filters for CDMA multiuser detection". Facta universitatis - series: Electronics and Energetics 17, nr 1 (2004): 21–32. http://dx.doi.org/10.2298/fuee0401021e.

Pełny tekst źródła

Streszczenie:

Due to its simplicity the adaptive Least Mean Square (LMS) algorithm is widely used in Code-Division Multiple access (CDMA) detectors. However its convergence speed is highly dependent on the eigen value spread of the input covariance matrix. For highly correlated inputs the LMS algorithm has a slow convergence which require long training sequences and therefore low transmission speeds. Another drawback of the LMS is the trade-off between convergence speed and steady-state error since both are controlled by the same parameter, the step-size. In order to eliminate these drawbacks, the class of Variable Step-Size LMS (VSSLMS) algorithms was introduced. In this paper, we study the behavior of some algorithms belonging to the class of VSSLMS for training based multiuser detection in a CDMA system. We show that the proposed Complementary Pair Variable Step-Size LMS algorithms highly increase the speed of convergence while reducing the trade-off between the convergence speed and the output error.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "LMS ALGORITHMS"

Johansson, Sven. "Active Control of Propeller-Induced Noise in Aircraft : Algorithms & Methods". Doctoral thesis, Karlskrona, Ronneby : Blekinge Institute of Technology, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00171.

Pełny tekst źródła

Streszczenie:

In the last decade acoustic noise has become more and more regarded as a problem. In cars, boats, trains and aircraft, low-frequency noise reduces comfort. Lightweight materials and more powerful engines are used in high-speed vehicles, resulting in a general increase in interior noise levels. Low-frequency noise is annoying and during periods of long exposure it causes fatigue and discomfort. The masking effect which low-frequency noise has on speech reduces speech intelligibility. Low-frequency noise is sought to be attenuated in a wide range of applications in order to improve comfort and speech intelligibility. The use of conventional passive methods to attenuate low-frequency noise is often impractical since considerable bulk and weight are required; in transportation large weight is associated with high fuel consumption. In order to overcome the problems of ineffective passive suppression of low-frequency noise, the technique of active noise control has become of considerable interest. The fundamental principle of active noise control is based on secondary sources producing ``anti-noise.'' Destructive interference between the generated and the primary sound fields results in noise attenuation. Active noise control systems significantly increase the capacity for attenuating low-frequency noise without major increase in volume and weight. This doctoral dissertation deals with the topic of active noise control within the passenger cabin in aircraft, and within headsets. The work focuses on methods, controller structures and adaptive algorithms for attenuating tonal low-frequency noise produced by synchronized or moderately synchronized propellers generating beating sound fields. The control algorithm is a central part of an active noise control system. A multiple-reference feedforward controller based on the novel actuator-individual normalized Filtered-X Least-Mean-Squares algorithm is introduced, yielding significant attenuation of such period noise. This algorithm is of the LMS-type, and owing to the novel normalization it can also be regarded as a Newton-type algorithm. The new algorithm combines low computational complexity with high performance. For that reason the algorithm is suitable for use in systems with a large number of control sources and control sensors in order to reduce the computional power required by the control system. The computational power of the DSP hardware is limited, and therefore algorithms with high computational complexity allow fewer control sources and sensors to be used, often with reduced noise attenuation as a result. In applications, such as controlling aircraft cabin noise, where a large multiple-channel system is needed to control the relative complex interior sound field, it is of great importance to keep down the computational complexity of the algorithm so that a large number of loudspeakers and microphones can be used. The dissertation presents theoretical work, off-line computer experiments and practical real-time experiments using the actuator-individual normalized algorithm. The computer experiments are principally based on real-life cabin noise data recorded during flight in a twin-engine propeller aircraft and in a helicopter. The practical experiments were carried out in a full-scale fuselage section from a propeller aircraft.
Buller i vår dagliga miljö kan ha en negativ inverkan på vår hälsa. I många sammanhang, i tex bilar, båtar och flygplan, förekommer lågfrekvent buller. Lågfrekvent buller är oftast inte skadligt för hörseln, men kan vara tröttande och försvåra konversationen mellan personer som vistas i en utsatt miljö. En dämpning av bullernivån medför en förbättrad taluppfattbarhet samt en komfortökning. Att dämpa lågfrekvent buller med traditionella passiva metoder, tex absorbenter och reflektorer, är oftast ineffektivt. Det krävs stora, skrymmande absorbenter för att dämpa denna typ av buller samt tunga skiljeväggar för att förhindra att bullret transmitteras vidare från ett utrymme till ett annat. Metoder som är mera lämpade vid dämpning av lågfrekvent buller är de aktiva. De aktiva metoderna baseras på att en vågrörelse som ligger i motfas med en annan överlagras och de släcker ut varandra. Bullerdämpningen erhålls genom att ett ljudfält genereras som är lika starkt som bullret men i motfas med detta. De aktiva bullerdämpningsmetoderna medför en effektiv dämpning av lågfrekvent buller samtidigt som volymen, tex hos bilkupen eller båt/flygplanskabinen ej påverkas nämnvärt. Dessutom kan fordonets/farkostens vikt reduceras vilket är tacksamt för bränsleförbrukningen. I de flesta tillämpningar varierar bullrets karaktär, dvs styrka och frekvensinnehåll. För att följa dessa variationer krävs ett adaptivt (självinställande) reglersystem som styr genereringen av motljudet. I propellerflygplan är de dominerande frekvenserna i kabinbullret relaterat till propellrarnas varvtal, man känner alltså till frekvenserna som skall dämpas. Man utnyttjar en varvtalssignal för att generera signaler, så kallade referenssignaler, med de frekvenser som skall dämpas. Dessa bearbetas av ett reglersystem som generar signaler till högtalarna som i sin tur generar motljudet. För att ställa in högtalarsignalerna så att en effektiv dämpning erhålls, används mikrofoner utplacerade i kabinen som mäter bullret. För att åstadkomma en effektiv bullerdämpning i ett rum, tex i en flygplanskabin, behövs flera högtalare och mikrofoner, vilket kräver ett avancerat reglersystem. I doktorsavhandlingen ''Active Control of Propeller-Induced Noise in Aircraft'' behandlas olika metoder för att reducera kabinbuller härrörande från propellrarna. Här presenteras olika strukturer på reglersystem samt beräkningsalgoritmer för att ställa in systemet. För stora system där många högtalare och mikrofoner används, samt flera frekvenser skall dämpas, är det viktigt att systemet inte behöver för stor beräkningskapacitet för att generera motljudet. Metoderna som behandlas ger en effektiv dämpning till låg beräkningskostnad. Delar av materialet som presenteras i avhandlingen har ingått i ett EU-projekt med inriktning mot bullerundertryckning i propellerflygplan. I projektet har flera europeiska flygplanstillverkare deltagit. Avhandlingen behandlar även aktiv bullerdämpning i headset, som används av helikopterpiloter. I denna tillämpning har aktiv bullerdämpning används för att öka taluppfattbarheten.

Style APA, Harvard, Vancouver, ISO itp.

Callahan, Michael J. "Estimating Channel Identification Quality in Passive Radar Using LMS Algorithms". Wright State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1503508289044109.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dabeer, Onkar. "Convergence analysis of the LMS and the constant modulus algorithms /". Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2002. http://wwwlib.umi.com/cr/ucsd/fullcit?p3055781.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Duan, Jie. "Active Control of Vehicle Powertrain Noise Applying Frequency Domain Filtered-x LMS Algorithm". University of Cincinnati / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1243614246.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sigrist, Zoé. "Contribution à l'identification de systèmes non-linéaires en milieu bruité pour la modélisation de structures mécaniques soumises à des excitations vibratoires". Thesis, Bordeaux 1, 2012. http://www.theses.fr/2012BOR14655/document.

Pełny tekst źródła

Streszczenie:

Cette thèse porte sur la caractérisation de structures mécaniques, au travers de leurs paramètres structuraux, à partir d'observations perturbées par des bruits de mesure, supposés additifs blancs gaussiens et centrés. Pour cela, nous proposons d'utiliser des modèles à temps discret à parties linéaire et non-linéaire séparables. La première permet de retrouver les paramètres recherchés tandis que la seconde renseigne sur la non-linéarité présente. Dans le cadre d'une modélisation non-récursive par des séries de Volterra, nous présentons une approche à erreurs-dans-les-variables lorsque les variances des bruits ne sont pas connues ainsi qu'un algorithme adaptatif du type LMS nécessitant la connaissance de la variance du bruit d'entrée. Dans le cadre d'une modélisation par un modèle récursif polynomial, nous proposons deux méthodes à partir d'algorithmes évolutionnaires. La première inclut un protocole d'arrêt tenant compte de la variance du bruit de sortie. Dans la seconde, les fonctions fitness sont fondées sur des fonctions de corrélation dans lesquelles l'influence du bruit est supprimée ou compensée
This PhD deals with the caracterisation of mechanical structures, by its structural parameters, when only noisy observations disturbed by additive measurement noises, assumed to be zero-mean white and Gaussian, are available. For this purpose, we suggest using discrete-time models with distinct linear and nonlinear parts. The first one allows the structural parameters to be retrieved whereas the second one gives information on the nonlinearity. When dealing with non-recursive Volterra series, we propose an errors-in-variables (EIV) method to jointly estimate the noise variances and the Volterra kernels. We also suggest a modified unbiased LMS algorithm to estimate the model parameters provided that the input-noise variance is known. When dealing with recursive polynomial model, we propose two methods using evolutionary algorithms. The first includes a stop protocol that takes into account the output-noise variance. In the second one, the fitness functions are based on correlation criteria in which the noise influence is removed or compensated

Style APA, Harvard, Vancouver, ISO itp.

Ting, L. K. "Algorithms and FPGA implementation of adaptive LMS-based predictors for radar pulse identification". Thesis, Queen's University Belfast, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.395207.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Nguyen, Ngoc Hung, Majid Dowlatnia i Azhar Sarfraz. "Implementation of the LMS and NLMS algorithms for Acoustic Echo Cancellationin teleconference systemusing MATLAB". Thesis, Växjö University, School of Mathematics and Systems Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-6368.

Pełny tekst źródła

Streszczenie:

In hands-free telephony and in teleconference systems, the main aim is to provide agood free voice quality when two or more people communicate from different places.The problem often arises during the conversation is the creation of acoustic echo. Thisproblem will cause the bad quality of voice signal and thus talkers could not hearclearly the content of the conversation, even thought lost the important information.This acoustic echo is actually the noise which is created by the reflection of soundwaves by the wall of the room and the other things exist in the room. The mainobjective for engineers is the cancellation of this acoustic echo and provides an echofree environment for speakers during conversation. For this purpose, scientists designdifferent adaptive filter algorithms. Our thesis is also to study and simulate theacoustics echo cancellation by using different adaptive algorithms.

Style APA, Harvard, Vancouver, ISO itp.

Lo, Ming Jengis. "Performance investigation of adaptive filter algorithms and their implementation for MIMO systems". Thesis, University of Canterbury. Electrical and Computer Engineering, 2005. http://hdl.handle.net/10092/1136.

Pełny tekst źródła

Streszczenie:

The Group Research department in Tait Electronics has a reconfigurable platform for MIMO research. In particular, the platform has an adaptive multivariate DFE with the LMS algorithm currently implemented. The LMS algorithm has been simulated and optimised for implementation on the FPGA. The main objective of the research is to investigate an alternative, the RLS algorithm by comparing its performance to the LMS algorithm. The RLS algorithm is known to be more complex than the LMS algorithm but offers the potential for improved performance due to its fast-converging nature. This thesis provides a performance investigation of these adaptive filter algorithms on the MIMO system for the purpose of real-time implementation on the Tait platform. In addition to performance investigation, stability analysis and a feasibility study is shown for the RLS algorithm on the FPGA. The research is industry based and is supported by FRST.

Style APA, Harvard, Vancouver, ISO itp.

Castelo, Branco César Augusto Santana. "Algoritmos adaptativos LMS normalizados proporcionais: proposta de novos algoritmos para identificação de plantas esparsas". Universidade Federal do Maranhão, 2016. http://tedebc.ufma.br:8080/jspui/handle/tede/1688.

Pełny tekst źródła

Streszczenie:

Submitted by Rosivalda Pereira (mrs.pereira@ufma.br) on 2017-06-23T20:42:44Z No. of bitstreams: 1 CesarCasteloBranco.pdf: 11257769 bytes, checksum: 911c33f2f0ba5c1c0948888e713724f6 (MD5)
Made available in DSpace on 2017-06-23T20:42:44Z (GMT). No. of bitstreams: 1 CesarCasteloBranco.pdf: 11257769 bytes, checksum: 911c33f2f0ba5c1c0948888e713724f6 (MD5) Previous issue date: 2016-12-12
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPQ)
This work proposes new methodologies to optimize the choice of the parameters of the proportionate normalized least-mean-square (PNLMS) adaptive algorithms. The proposed approaches use procedures based on two optimization methods, namely, the golden section and tabu search methods. Such procedures are applied to determine the optimal parameters in each iteration of the adaptation process of the PNLMS and improved PNLMS (IPNLMS) algorithms. The objective function for the proposed procedures is based on the a posteriori estimation error. Performance studies carried out to evaluate the impact of the PNLMS and IPNLMS parameters in the behavior of these algorithms shows that, with the aid of optimization techniques to choose properly such parameters, the performance of these algorithms may be improved in terms of convergence speed for the identification of plants with high sparseness degree. The main goal of the proposed methodologies is to improve the distribution of the adaptation energy between the coefficients of the PNLMS and IPNLMS algorithms, using parameter values that lead to the minimal estimation error of each iteration of the adaptation process. Numerical tests performed (considering various scenarios in which the plant impulse response is sparse) show that the proposed methodologies achieve convergence speeds faster than the PNLMS and IPNLMS algorithms, and other algorithms of the PNLMS class, such as the sparseness controlled IPNLMS (SC-IPNLMS) algorithm.
Neste trabalho, novas metodologias para otimizar a escolha dos parâmetros dos algoritmos adaptativos LMS normalizados proporcionais (PNLMS) são propostas. As abordagens propostas usam procedimentos baseados em dois métodos de otimização, a saber, os métodos da razão áurea e da busca tabu. Tais procedimentos são empregados para determinar os parâmetros ótimos em cada iteração do processo de adaptação dos algoritmos PNLMS e PNLMS melhorado (IPNLMS). A função objetivo adotada pelos procedimentos propostos é baseada no erro de estimação a posteriori. O estudo de desempenho realizado para avaliar o impacto dos parâmetros dos algoritmos PNLMS e IPNLMS no comportamento dos mesmos mostram que, com o auxílio de técnicas de otimização para escolher adequadamente tais parâmetros, o desempenho destes algoritmos pode ser melhorado, em termos de velocidade de convergência, para a identificação de plantas com elevado grau de esparsidade. O principal objetivo das metodologias propostas é melhorar a distribuição da energia de ativação entre os coeficientes dos algoritmos PNLMS e IPNLMS, usando valores de parâmetros que levam ao erro de estimação mínimo em cada iteração do processo de adaptação. Testes numéricos realizados (considerando diversos cenários nos quais a resposta impulsiva da planta é esparsa) mostram que as metodologias propostas alcançam velocidades de convergência superiores às dos algoritmos PNLMS e IPNLMS, além de outros algoritmos da classe PNLMS, tais como o algoritmo IPNLMS com controle de esparsidade (SCIPNLMS).

Style APA, Harvard, Vancouver, ISO itp.

Hua, Fei. "Adaptation et apprentissage sur des réseaux et des graphiques multitâches". Thesis, Université Côte d'Azur, 2020. http://www.theses.fr/2020COAZ4037.

Pełny tekst źródła

Streszczenie:

L'apprentissage multitâche a reçu une attention considérable dans les communautés de traitement du signal et d'apprentissage automatique. Au contraire du traitement traditionnel des problèmes à tâche unique, il vise à apprendre d’une façon simultanée plusieurs tâches connexes. Il y a également eu un large éventail de problèmes de traitement de données qui sont structurés en réseau ou en graphiques et qui nécessitent une capacité d'adaptation à la transmission de données en continu et à des dynamiques variant dans le temps. Les stratégies d'apprentissage adaptatif réparties sur les réseaux permettent à une collection d'agents interconnectés d'accomplir une certaine tâche, telle que l'estimation des paramètres, en collaboration grâce au calcul local et à la coopération entre les agents voisins. De plus, ils confèrent aux agents une capacité d'adaptation et d'apprentissage continue pour suivre les dérives possibles dans le modèle sous-jacent. Malgré la nature hétérogène et le fait que chaque agent peut résoudre une tâche différente dans un réseau multitâche, il pourrait encore bénéficier d'une collaboration entre les agents pour améliorer la précision de l'estimation en tirant parti des relations et en capitalisant sur le transfert inductif entre eux. L'objectif de cette thèse est de concevoir et d'analyser des stratégies d'apprentissage adaptatif multitâche sur des réseaux et des graphiques. Premièrement, nous abordons les problèmes d'estimation multitâche où chaque agent est intéressé à estimer son propre vecteur de paramètres et où les vecteurs de paramètres aux agents voisins sont liés linéairement selon un ensemble de contraintes. Sur la base de la méthode des pénalités, un problème d'optimisation non contraint est reformulé et un algorithme distribué est dérivé. Le comportement de l'algorithme dans la moyenne et dans le sens de l'erreur quadratique moyenne est analysé. Ensuite, nous assouplissons l'hypothèse des contraintes locales et travaillons sur le problème multitâche avec des contraintes non locales. Nous concevons l'algorithme distribué en utilisant un protocole de relais à sauts multiples entre les agents. Nous prouvons que l'algorithme continuera de converger et fournira une analyse théorique des performances. Dans la troisième partie, nous étendons les stratégies d'apprentissage distribué aux applications émergentes de traitement du signal graphique où le signal lui-même est structuré en réseau. Plusieurs stratégies LMS de diffusion de graphe sont proposées pour faire face aux signaux de graphe en streaming. Nous étendons également le modèle multitâche aux filtres graphiques et proposons un mécanisme de clustering en ligne. Enfin, nous nous penchons sur le problème de la modélisation des signaux graphiques en utilisant une combinaison de plusieurs filtres graphiques. Un algorithme efficace est proposé pour apprendre simultanément les coefficients de plusieurs filtres graphiques et effectuer la sélection du modèle. Des résultats de simulation et numériques sont fournis pour illustrer l'efficacité de tous les algorithmes proposés et valider les analyses théoriques
Multitask learning has received considerable attention in signal processing and machine learning communities. It aims at simultaneously learning several related tasks other than the traditional single-task problems. There also have witnessed a wide spectrum of data processing problems that are network- or graph-structured and require adaptation ability to streaming data and time-varying dynamics. Distributed adaptive learning strategies over networks enable a collection of interconnected agents to accomplish a certain task, such as parameter estimation, collaboratively through local computation and cooperation among neighboring agents. Further, they endow the agents with continuous adaptation and learning ability to track possible drifts in the underlying model. Despite the heterogeneous nature and the fact that each agent may solve a different task in multitask network, it could still benefit from a collaboration between agents to improve the estimation accuracy by leveraging the relations and capitalizing on inductive transfer between them. The objective of this thesis is to devise and analyze multitask adaptive learning strategies over networks and graphs. First, we consider multitask estimation problems where each agent is interested in estimating its own parameter vector and where the parameter vectors at neighboring agents are related linearly according to a set of constraints. Based on the penalty method, an unconstrained optimization problem is reformulated and a distributed algorithm is derived. The behavior of the algorithm in the mean and in the mean-square-error sense is analyzed. Next, we relax the local constraints assumption and consider the multitask problem with non-local constraints. We devise the distributed algorithm by employing a multi-hop relay protocol across the agents. We prove that the algorithm will continue to converge and provide theoretical performance analysis. In the third part, we extend the distributed learning strategies to the emerging graph signal processing applications where the signal itself is network-structured. Several graph diffusion LMS strategies are proposed to cope with streaming graph signals. We also extend the multitask model to graph filters and propose an on-line clustering mechanism. Last, we consider the problem of modeling graph signals by using a combination of multiple graph filters. An efficient algorithm is proposed to simultaneously learn coefficients of multiple graph filters and perform model selection. Simulation and numerical results are provided to illustrate the effectiveness of all proposed algorithms and validate the theoretical analyses

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Książki na temat "LMS ALGORITHMS"

Gavin, Joseph Mark. Parametric modelling of narrowband signals using LMS and MSANF algorithms. [s.l: The Author], 1994.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Hernert, Patrice. Les algorithmes. Paris: Presses universitaires de France, 1995.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Pair, C. Construire les algorithmes: Les améliorer, les connaître, les évaluer. [Paris]: Dunod, 1988.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

K, Kokula Krishna Hari, red. Cancellation of Power Line Interference in ECG using Adaptive LMS Algorithm: ICIEMS 2014. India: Association of Scientists, Developers and Faculties, 2014.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Salomon, C. Los algoritmos del tecnoecistencialismo: Las esquematizaciones autoanulatorias del pensamiento de las masas. Argentina: Ediciones Suarez, 2007.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Salomon, C. Los algoritmos del tecnoecistencialismo: Las esquematizaciones autoanulatorias del pensamiento de las masas. Argentina: Ediciones Suarez, 2007.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Torres Ortega, Jesús Alfonso. Introducción a los métodos numéricos. Bogotá. Colombia: Universidad de La Salle. Ediciones Unisalle, 2012. http://dx.doi.org/10.19052/9789585148314.

Pełny tekst źródła

Streszczenie:

Los métodos numéricos son un medio para fortificar la comprensión de las matemáticas, ya que su propósito principal es reducir las matemáticas superiores a operaciones aritméticas básicas, y poseen la facultad de manejar sistemas de ecuaciones considerables que son frecuentes en la práctica de la ingeniería, por lo cual, constituyen el tipo de cálculo que con mayor periodicidad efectúan los ingenieros. Anteriormente a la creación del computador, se gastaba más en la técnica misma de solución de los problemas, en vez de aplicar mayor esfuerzo sobre la definición del problema y su interpretación. Actualmente, los algoritmos y los métodos numéricos suministran una opción para muchos cálculos complejos. Es probable que durante sus estudios la oportunidad de valerse de un software disponible comercialmente que contenga tenga métodos numéricos, el uso racional de estos programas está sujeto al discernimiento de la teoría básica en la que se fundamentan los cálculos numéricos.

Style APA, Harvard, Vancouver, ISO itp.

ACM Symposium on Parallelism in Algorithms and Architectures (17th 2005 Las Vegas, Nev.). SPAA 2005: Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA. New York, NY: Association for Computing Machinery, 2005.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Nelson, P. A. MINT, the multiple error LMS algorithm, and the design of inverse filters for multi-channel sound reproduction systems. Southampton, England: University of Southampton, 1992.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

La programmation linéaire dans les modèles de production. Paris: Masson, 1988.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Części książek na temat "LMS ALGORITHMS"

Ramirez, Paulo Sergio. "LMS-Based Algorithms". W The Kluwer International Series in Engineering and Computer Science, 139–93. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-3637-3_4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Diniz, Paulo Sergio Ramirez. "LMS-Based Algorithms". W Adaptive Filtering, 133–81. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4419-8660-3_4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Diniz, Paulo S. R. "LMS-Based Algorithms". W Adaptive Filtering, 103–55. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-29057-3_4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Diniz, Paulo S. R. "LMS-Based Algorithms". W Adaptive Filtering, 137–207. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4614-4106-9_4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Diniz, Paulo S. R. "Lms-Based Algorithms". W Adaptive Filtering, 1–63. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-68606-6_4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Wagner, Kevin, i Miloš Doroslovački. "LMS Analysis Techniques". W Proportionate-Type Normalized Least Mean Square Algorithms, 13–27. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118579558.ch2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sridhar, Bharath, I. Akram Sheriff, K. A. Narayanan Kutty i S. Sathish Kumar. "Comparison of Cascaded LMS-RLS, LMS and RLS Adaptive Filters in Non-Stationary Environments". W Novel Algorithms and Techniques in Telecommunications and Networking, 495–99. Dordrecht: Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-90-481-3662-9_85.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sridevi, K., i A. Jhansi Rani. "Performance Analysis of LMS and Fractional LMS Algorithms for Smart Antenna System". W Lecture Notes in Electrical Engineering, 181–87. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1906-8_20.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Ramirez, Paulo Sergio. "Quantization Effects in the LMS and RLS Algorithms". W The Kluwer International Series in Engineering and Computer Science, 527–58. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-3637-3_12.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sharma, Ritika, Anupama Senapati i Jibendu Sekhar Roy. "Design of Smart Antenna Using Normalized Leaky LMS and Sign Leaky LMS Algorithms—A Comparative Study". W Advances in Computer, Communication and Control, 143–53. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-3122-0_15.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "LMS ALGORITHMS"

Diniz, Paulo S. R., Hamed Yazdanpanah i Markus V. S. Lima. "Feature LMS Algorithms". W ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8461674.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Hosseini, Kianoush, Aman Montazeri, Hooman Alikhanian i Mohammad H. Kahaei. "New Classes of LMS and LMF Adaptive Algorithms". W Communication Technologies: from Theory to Applications (ICTTA). IEEE, 2008. http://dx.doi.org/10.1109/ictta.2008.4530045.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Yazdanpanah, Hamed, i Jose A. Apolinario. "Feature Normalized Lms Algorithms". W 2019 53rd Asilomar Conference on Signals, Systems, and Computers. IEEE, 2019. http://dx.doi.org/10.1109/ieeeconf44664.2019.9048952.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Tsinos, Christos G., i Paulo S. R. Diniz. "Data-selective LMS-Newton and LMS-Quasi-Newton Algorithms". W ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2019. http://dx.doi.org/10.1109/icassp.2019.8683076.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Yazdanpanah, Hamed, Jose A. Apolinario, Paulo S. R. Diniz i Markus V. S. Lima. "l0-NORM FEATURE LMS ALGORITHMS". W 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2018. http://dx.doi.org/10.1109/globalsip.2018.8646465.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dogariu, Laura-Maria, Constantin Paleologu, Jacob Benesty, Cristina Oprea i Silviu Ciochina. "LMS Algorithms for Multilinear Forms". W 2020 International Symposium on Electronics and Telecommunications (ISETC). IEEE, 2020. http://dx.doi.org/10.1109/isetc50328.2020.9301133.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Cheong Took, Clive, Danilo Mandic i Jacob Benesty. "Study of the quaternion LMS and four-channel LMS algorithms". W ICASSP 2009 - 2009 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2009. http://dx.doi.org/10.1109/icassp.2009.4960282.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Gogineni, Vinay Chakravarthi, Subrahmanyam Mula, Rajib Lochan Das i Mrityunjoy Chakraborty. "Performance analysis of proportionate-type LMS algorithms". W 2016 Signal Processing: Algorithms, Architectures, Arrangements and Applications (SPA). IEEE, 2016. http://dx.doi.org/10.1109/spa.2016.7763608.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Cattivelli, Federico S., i Ali H. Sayed. "Diffusion LMS algorithms with information exchange". W 2008 42nd Asilomar Conference on Signals, Systems and Computers. IEEE, 2008. http://dx.doi.org/10.1109/acssc.2008.5074402.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Douglas, Scott C., i Danilo P. Mandic. "Performance analysis of the conventional complex LMS and augmented complex LMS algorithms". W 2010 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2010. http://dx.doi.org/10.1109/icassp.2010.5495851.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "LMS ALGORITHMS"

Pirohov, Vladyslav M., Anna M. Horlo i Iryna S. Mintii. Software development of the algorithm of adaptating of the website design for people with color-blindness. [б. в.], grudzień 2018. http://dx.doi.org/10.31812/123456789/2888.

Pełny tekst źródła

Streszczenie:

The purpose of the study is the program implementation of the basic algorithms of the website design adaptation for people with color perception. This article examines the implementation of the following algorithms: the conversion algorithm from the rgb color model to the lms model (there is a special algorithm precisely in the color model lms for modeling various types of color perception violations), simulation of different color blindness types in the lms-model (this is the transformation of normal values in the color model lms to values with different types of color perception violations), convert data from lms color model to rgb model, conversion from color rgb to hsl model, color filtering in hsl-model and conversion from hsl model to rgb color model.

Style APA, Harvard, Vancouver, ISO itp.

Mintii, Iryna S., Svitlana V. Shokaliuk, Tetiana A. Vakaliuk, Mykhailo M. Mintii i Vladimir N. Soloviev. Import test questions into Moodle LMS. [б. в.], wrzesień 2019. http://dx.doi.org/10.31812/123456789/3271.

Pełny tekst źródła

Streszczenie:

The purpose of the study is to highlight the theoretical and methodological aspects of preparing the test questions of the most common types in the form of text files for further import into learning management system (LMS) Moodle. The subject of the research is the automated filling of the Moodle LMS test database. The objectives of the study: to analyze the import files of test questions, their advantages and disadvantages; to develop guidelines for the preparation of test questions of common types in the form of text files for further import into Moodle LMS. The action algorithms for importing questions and instructions for submitting question files in such formats as Aiken, GIFT, Moodle XML, “True/False” questions, “Multiple Choice” (one of many and many of many), “Matching”, with an open answer – “Numerical” or “Short answer” and “Essay” are offered in this article. The formats for submitting questions, examples of its designing and developed questions were demonstrated in view mode in Moodle LMS.

Style APA, Harvard, Vancouver, ISO itp.

Cooper, David A., Daniel C. Apon, Quynh H. Dang, Michael S. Davidson, Morris J. Dworkin i Carl A. Miller. Recommendation for Stateful Hash-Based Signature Schemes. National Institute of Standards and Technology, październik 2020. http://dx.doi.org/10.6028/nist.sp.800-208.

Pełny tekst źródła

Streszczenie:

This recommendation specifies two algorithms that can be used to generate a digital signature, both of which are stateful hash-based signature schemes: the Leighton-Micali Signature (LMS) system and the eXtended Merkle Signature Scheme (XMSS), along with their multi-tree variants, the Hierarchical Signature System (HSS) and multi-tree XMSS (XMSSMT).

Style APA, Harvard, Vancouver, ISO itp.

Hatke, Gary F., i Stuart C. Schwartz. A Robust Adaptive Array Structure Using the Soft Constrained LMS algorithm. Fort Belvoir, VA: Defense Technical Information Center, lipiec 1988. http://dx.doi.org/10.21236/ada203959.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Ortega-Castro, Fabio, Freddy Cepeda-López i Constanza Martínez-Ventura. Heterogeneidad en el uso de las fuentes de liquidez intradía en el sistema de pagos de alto valor. Banco de la República, sierpień 2021. http://dx.doi.org/10.32468/be.1166.

Pełny tekst źródła

Streszczenie:

En este documento se estudian las fuentes de liquidez que usan las entidades financieras que participan en el sistema de pagos de alto valor para cumplir con sus obligaciones diarias. Para este propósito, diseñamos e implementamos un algoritmo que descompone la unidad de caja de estas entidades en diferentes conceptos de fuente de liquidez, mediante reglas asociadas a los conceptos de pagos recibidos (fuentes) y enviados (usos). Los valores asignados por el algoritmo evidencian que a nivel agregado las fuentes preferidas son el ahorro de liquidez, la dinámica y los saldos overnight. A nivel de entidad, se observan diferencias en las preferencias que se pueden atribuir al tipo de negocio que realizan, a la disponibilidad (regulación y condiciones macroeconómicas) y a los costos de las fuentes.

Style APA, Harvard, Vancouver, ISO itp.

Housley, R. Use of the HSS/LMS Hash-Based Signature Algorithm in the Cryptographic Message Syntax (CMS). RFC Editor, luty 2020. http://dx.doi.org/10.17487/rfc8708.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Peñaloza, Rafael, i Anni-Yasmin Turhan. Completion-based computation of least common subsumers with limited role-depth for EL and Prob-EL⁰¹. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.175.

Pełny tekst źródła

Streszczenie:

The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this report we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL⁰¹.

Style APA, Harvard, Vancouver, ISO itp.

Housley, R. Use of the HSS/LMS Hash-Based Signature Algorithm with CBOR Object Signing and Encryption (COSE). RFC Editor, kwiecień 2020. http://dx.doi.org/10.17487/rfc8778.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Patterson, J. M. Dose algorithm determination for the Los Alamos National Laboratory personnel dosimetry system. Office of Scientific and Technical Information (OSTI), grudzień 1995. http://dx.doi.org/10.2172/672131.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Psenak, P., S. Zandi i G. Dawra. Border Gateway Protocol - Link State (BGP-LS) Extensions for Flexible Algorithm Advertisement. Redaktor K. Talaulikar. RFC Editor, luty 2023. http://dx.doi.org/10.17487/rfc9351.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!