Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931436
Khadidja Gouizi, F. B. Reguig, C. Maaoui
The emotion recognition is one of the great challenges in human-human and human-computer interaction. In this paper, an approach for the emotions recognition based on physiological signals is proposed. Six basic emotions: joy, sadness, fear, disgust, neutrality and amusement are analysed using physiological signals. These emotions are induced through the presentation of IAPS pictures (International Affecting Picture System) to the subjects. Also, the physiological signals of interest in this analysis are: electromyogram signal (EMG), respiratory volume (RV), skin temperature (SKT), skin conductance (SKC), blood volume pulse (BVP) and heart rate (HR). These are selected to extract some characteristic parameters, which will be used for classifying the emotions. The SVM (support vector machines) technique is used for classifying these parameters. The experimental results show that the proposed methodology provides a recognition rate of 85% for different emotional states.
{"title":"Analysis physiological signals for emotion recognition","authors":"Khadidja Gouizi, F. B. Reguig, C. Maaoui","doi":"10.1109/WOSSPA.2011.5931436","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931436","url":null,"abstract":"The emotion recognition is one of the great challenges in human-human and human-computer interaction. In this paper, an approach for the emotions recognition based on physiological signals is proposed. Six basic emotions: joy, sadness, fear, disgust, neutrality and amusement are analysed using physiological signals. These emotions are induced through the presentation of IAPS pictures (International Affecting Picture System) to the subjects. Also, the physiological signals of interest in this analysis are: electromyogram signal (EMG), respiratory volume (RV), skin temperature (SKT), skin conductance (SKC), blood volume pulse (BVP) and heart rate (HR). These are selected to extract some characteristic parameters, which will be used for classifying the emotions. The SVM (support vector machines) technique is used for classifying these parameters. The experimental results show that the proposed methodology provides a recognition rate of 85% for different emotional states.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131629108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/wosspa.2011.5931505
A. Silva, S. Jesus
Maximum Ratio Combiner (MRC) is a diversity combining technique applicable to underwater communications when the data transmitted by a single projector is received by more than one antenna/node. Post Detection MRC (PD-MRC) performs a weighted-sum over initial detected outputs of multiple nodes. PD-MRC can be applied to noise-only or ISI-only channels with the weights computed from the signal to noise ratio or from the channel impulse response of each node, respectively. In this paper it is shown that in the presence of noisy-ISI channels the weighs can be computed from the detector output constellation of each node. A performance of the PD-MRC is evaluated using real data collected during RADAR'07 experiment. Results show that a gain is always attained using two nodes in the PD-MRC as compared to the node having the best MSE. Moreover, the PD-MRC gain is higher when both nodes present a similar MSE.
MRC (Maximum Ratio Combiner)是一种适用于水下通信的分集组合技术，当单个投影仪传输的数据被多个天线/节点接收时。检测后MRC (PD-MRC)对多个节点的初始检测输出执行加权求和。PD-MRC可以应用于纯噪声或纯isi信道，分别根据信噪比或每个节点的信道脉冲响应计算权重。本文证明了在存在噪声isi信道的情况下，权重可以由每个节点的检测器输出星座来计算。利用RADAR'07实验中收集的真实数据对PD-MRC的性能进行了评估。结果表明，与具有最佳MSE的节点相比，PD-MRC中使用两个节点总是获得增益。此外，当两个节点呈现相似的MSE时，PD-MRC增益更高。
{"title":"A post-detection Maximum Ratio Combiner: Experimental assessment on high diversity underwater channels","authors":"A. Silva, S. Jesus","doi":"10.1109/wosspa.2011.5931505","DOIUrl":"https://doi.org/10.1109/wosspa.2011.5931505","url":null,"abstract":"Maximum Ratio Combiner (MRC) is a diversity combining technique applicable to underwater communications when the data transmitted by a single projector is received by more than one antenna/node. Post Detection MRC (PD-MRC) performs a weighted-sum over initial detected outputs of multiple nodes. PD-MRC can be applied to noise-only or ISI-only channels with the weights computed from the signal to noise ratio or from the channel impulse response of each node, respectively. In this paper it is shown that in the presence of noisy-ISI channels the weighs can be computed from the detector output constellation of each node. A performance of the PD-MRC is evaluated using real data collected during RADAR'07 experiment. Results show that a gain is always attained using two nodes in the PD-MRC as compared to the node having the best MSE. Moreover, the PD-MRC gain is higher when both nodes present a similar MSE.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"230 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130295339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931514
F. Mourad, H. Chehade, H. Snoussi, F. Yalaoui, L. Amodeo, C. Richard
This paper deals with the problem of single target tracking in controlled mobility sensor networks. It thus proposes an original strategy to manage the mobility of sensor nodes, in order to improve the estimation of the positions of the target. The proposed method consists of estimating the actual position of the target, then it uses position estimates to predict a region where the target is assumed to fall in the next time-step. A structure of triangle is then defined, aiming at covering at best the predicted area. Each mobile sensor is then assigned a position at the vertices of the structure, in the way to minimize the total traveled distance by the nodes. One constraint for this technique is to maintain the total coverage of the network. For this reason, we propose to use a hybrid network, including static nodes, as well, to insure continuously the coverage of the network. Simulation results corroborate the efficiency of the proposed method compared to the target tracking methods considered for networks with static nodes.
{"title":"A single-target tracking algorithm in controlled mobility sensor networks","authors":"F. Mourad, H. Chehade, H. Snoussi, F. Yalaoui, L. Amodeo, C. Richard","doi":"10.1109/WOSSPA.2011.5931514","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931514","url":null,"abstract":"This paper deals with the problem of single target tracking in controlled mobility sensor networks. It thus proposes an original strategy to manage the mobility of sensor nodes, in order to improve the estimation of the positions of the target. The proposed method consists of estimating the actual position of the target, then it uses position estimates to predict a region where the target is assumed to fall in the next time-step. A structure of triangle is then defined, aiming at covering at best the predicted area. Each mobile sensor is then assigned a position at the vertices of the structure, in the way to minimize the total traveled distance by the nodes. One constraint for this technique is to maintain the total coverage of the network. For this reason, we propose to use a hybrid network, including static nodes, as well, to insure continuously the coverage of the network. Simulation results corroborate the efficiency of the proposed method compared to the target tracking methods considered for networks with static nodes.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124043779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931502
C. Delpha, S. Braci, R. Boyer, I. Mostefa, M. Khamadja
In applications to secured diffusion of digital images, several watermarking solutions have been studied in the field of Data Hiding. For this aim, the main idea consists in embedding an information in the digital media with good properties in terms of robustness, capacity and invisibility (perceptual transparency and statistical undetectability). Recent studies has highlighted the importance of statistical undetectability which is unfortunately not often evaluated. We propose in this work to study a watermarking scheme with side-information at the encoder and based on Treillis Coded Quantization (TCQ). The main particularity of our approach is that we propose to apply the embedding process in an independent domain (by the way of Independent Component Analysis: ICA). We then show the improvement of the robustness and statistical undetectability properties with our proposal. The comparison with well known watermarking approaches, of the performances obtained, is done. This highlight the wide improvement of the obtained performances: high robustness without reducing the capacity, good security level or very low distorsions on the watermarked signals probability density functions.
{"title":"Trellis Coded Quantization based watermarking scheme performances in an independent domain","authors":"C. Delpha, S. Braci, R. Boyer, I. Mostefa, M. Khamadja","doi":"10.1109/WOSSPA.2011.5931502","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931502","url":null,"abstract":"In applications to secured diffusion of digital images, several watermarking solutions have been studied in the field of Data Hiding. For this aim, the main idea consists in embedding an information in the digital media with good properties in terms of robustness, capacity and invisibility (perceptual transparency and statistical undetectability). Recent studies has highlighted the importance of statistical undetectability which is unfortunately not often evaluated. We propose in this work to study a watermarking scheme with side-information at the encoder and based on Treillis Coded Quantization (TCQ). The main particularity of our approach is that we propose to apply the embedding process in an independent domain (by the way of Independent Component Analysis: ICA). We then show the improvement of the robustness and statistical undetectability properties with our proposal. The comparison with well known watermarking approaches, of the performances obtained, is done. This highlight the wide improvement of the obtained performances: high robustness without reducing the capacity, good security level or very low distorsions on the watermarked signals probability density functions.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124558393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931467
N. Dahnoun, J. Brand
The digital world is undoubtedly upon us. With so many ground breaking digital technologies in the consumer space, from iPads to 3-D TV's, it is clear that innovation is the key to success in today's market. Some might say, more important than innovation is the ability to take an idea from concept to prototype and from prototype to production in a timely manner, ideally less than two years. As Moore's Law continues to hold true, the window of opportunity to get a product to market is shrinking and engineers need to be smarter about their processor selection. Cost is not always the key to success. Software portability is increasingly important, coupled with familiarity of tools and development environment. With these thoughts in mind, the following paper addresses the engineering need to rapidly prototype key algorithms across a selection of processor architectures (ARM, DSP, System-on-Chip (SoC)), using standard benchmarking techniques in a familiar IDE.
{"title":"Defining a process for rapid processor selection and algorithm development","authors":"N. Dahnoun, J. Brand","doi":"10.1109/WOSSPA.2011.5931467","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931467","url":null,"abstract":"The digital world is undoubtedly upon us. With so many ground breaking digital technologies in the consumer space, from iPads to 3-D TV's, it is clear that innovation is the key to success in today's market. Some might say, more important than innovation is the ability to take an idea from concept to prototype and from prototype to production in a timely manner, ideally less than two years. As Moore's Law continues to hold true, the window of opportunity to get a product to market is shrinking and engineers need to be smarter about their processor selection. Cost is not always the key to success. Software portability is increasingly important, coupled with familiarity of tools and development environment. With these thoughts in mind, the following paper addresses the engineering need to rapidly prototype key algorithms across a selection of processor architectures (ARM, DSP, System-on-Chip (SoC)), using standard benchmarking techniques in a familiar IDE.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117109028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931501
R. Ganji, M. Belhaj, M. Mitrea, F. Prêteux
The present paper deals with robust and transparent video watermarking in the MPEG-4 AVC domain. It reconsiders and extends an insertion technique previously presented by the authors in order to increase its overall performances (transparency and robustness against re-encoding attacks). In this respect, an objective study on the practical impact of the errors induced by the MPEG-4 AVC (iterative) decoding/re-encoding is carried out. The experiments are performed on the MEDIEVALS corpus (more than 1h of video). The results show an increase of the PSNR of about 1.3dB and a decrease of the BER by about 10%.
{"title":"MPEG-4 AVC re-encoding for watermarking purposes","authors":"R. Ganji, M. Belhaj, M. Mitrea, F. Prêteux","doi":"10.1109/WOSSPA.2011.5931501","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931501","url":null,"abstract":"The present paper deals with robust and transparent video watermarking in the MPEG-4 AVC domain. It reconsiders and extends an insertion technique previously presented by the authors in order to increase its overall performances (transparency and robustness against re-encoding attacks). In this respect, an objective study on the practical impact of the errors induced by the MPEG-4 AVC (iterative) decoding/re-encoding is carried out. The experiments are performed on the MEDIEVALS corpus (more than 1h of video). The results show an increase of the PSNR of about 1.3dB and a decrease of the BER by about 10%.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"867 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114150138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931416
S. Bouaziz, A. Elouardi, B. Larnaudie, M. A. Khettat
Encryption algorithms need high performance computations based on large data width operators. Traditional improvements of the carry propagation delay have often implied increasing the silicon surface. This paper presents a formalized approach for arithmetic operators using large data width. We will focus on the arithmetic adder. Our approach uses a statistical evaluation of the carry propagation delay which is considered better than the critical path delay. The designed operator will be used to implement Modular Multiplication intended for RSA cryptography applications.
{"title":"Long word addition: A statistical approach for high speed arithmetic applications","authors":"S. Bouaziz, A. Elouardi, B. Larnaudie, M. A. Khettat","doi":"10.1109/WOSSPA.2011.5931416","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931416","url":null,"abstract":"Encryption algorithms need high performance computations based on large data width operators. Traditional improvements of the carry propagation delay have often implied increasing the silicon surface. This paper presents a formalized approach for arithmetic operators using large data width. We will focus on the arithmetic adder. Our approach uses a statistical evaluation of the carry propagation delay which is considered better than the critical path delay. The designed operator will be used to implement Modular Multiplication intended for RSA cryptography applications.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125369427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931411
K. Messaoudi, E. Bourennane, S. Toumi, Gilberto Ochoa
The deblocking filter is more complex than other modules in the H.264 because it is highly adaptive, applied to each boundary of all 4×4 blocks and updated three pixels in each direction. After careful study and analysis of this filter, we have concluded that its complexity lies in the data dependency and in the control module of elementary filters that compose it, but not in the type of these filters. In this paper, we propose two hardware implementations for the deblocking filter using the same strategy for memory management. The implementations differ on the utilized data width. The first one utilizes 32-bit while the second one utilizes 128-bit. The use of 128-bit data width is in order to ensure a high degree of parallelism and to avoid the use of transpose circuits and the intermediate buffers between the elementary modules in the filter. Simulation and synthesis results are then compared. The number of consumed LUTs remains almost the same compared with previous implementations and the number of clock cycles required to process a macroblock is reduced about 40% less than the best of the competing proposals.
{"title":"Performance comparison of two hardware implementations of the deblocking filter used in H.264 by changing the utilized data width","authors":"K. Messaoudi, E. Bourennane, S. Toumi, Gilberto Ochoa","doi":"10.1109/WOSSPA.2011.5931411","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931411","url":null,"abstract":"The deblocking filter is more complex than other modules in the H.264 because it is highly adaptive, applied to each boundary of all 4×4 blocks and updated three pixels in each direction. After careful study and analysis of this filter, we have concluded that its complexity lies in the data dependency and in the control module of elementary filters that compose it, but not in the type of these filters. In this paper, we propose two hardware implementations for the deblocking filter using the same strategy for memory management. The implementations differ on the utilized data width. The first one utilizes 32-bit while the second one utilizes 128-bit. The use of 128-bit data width is in order to ensure a high degree of parallelism and to avoid the use of transpose circuits and the intermediate buffers between the elementary modules in the filter. Simulation and synthesis results are then compared. The number of consumed LUTs remains almost the same compared with previous implementations and the number of clock cycles required to process a macroblock is reduced about 40% less than the best of the competing proposals.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123683107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931421
Z. Abo-Hammour, O. Alsmadi, A. Al-Smadi
A frequency-based model order reduction (MOR) via genetic algorithm (GA) approach is presented in this paper. An exogenous autoregressive model with a smaller dimensionality, which can mimic the full order model, maybe obtained using the GA MOR approach. For a general MOR, the GA predicts the elements of the system state matrix [A] defined in a state space representation along with the elements of the [B] and [C] matrices of the reduced order model. As a frequency-based MOR technique, the GA predicts only the elements of the [B] and [C] matrices of the reduced order model while [A] is set in the modal form. The proposed GA model order reduction approach is compared to recently published work for method evaluation.
{"title":"Frequency-based model order reduction via genetic algorithm approach","authors":"Z. Abo-Hammour, O. Alsmadi, A. Al-Smadi","doi":"10.1109/WOSSPA.2011.5931421","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931421","url":null,"abstract":"A frequency-based model order reduction (MOR) via genetic algorithm (GA) approach is presented in this paper. An exogenous autoregressive model with a smaller dimensionality, which can mimic the full order model, maybe obtained using the GA MOR approach. For a general MOR, the GA predicts the elements of the system state matrix [A] defined in a state space representation along with the elements of the [B] and [C] matrices of the reduced order model. As a frequency-based MOR technique, the GA predicts only the elements of the [B] and [C] matrices of the reduced order model while [A] is set in the modal form. The proposed GA model order reduction approach is compared to recently published work for method evaluation.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122459217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931500
Badoud Abd Essalam, Khemliche Mabrouk
The objective of this work is to have the results concerning the electric characterization and modeling by Bond Graph of the photovoltaic system coupled to a permanent magnet synchronous motor. The modeling of the global system components is developed with the integration of inverter with filter. The model of the solar generating subsystem is particularly developed. It is shown that this model is interesting for analyzing the dynamic behavior of the system and for designing the control strategy. The operating point of a photovoltaic generator that is connected to a permanent magnet synchronous motor is determined by the intersection point of its characteristic curves. In general, this point is not the same as the generator's maximum power point. This difference means losses in the system performance. Other point developed in this paper is presents an improved maximum power point tracking (MPPT) algorithm of a PV system under real climatic conditions. The proposed MPPT is based on the perturbation and observation (P&O) strategy and the variable step method that control the load voltage to ensure optimal operating points of a PV system.
{"title":"Grid-connected modeling, control and simulation of single-phase two-level photovoltaic power generation system coupled to a permanent magnet synchronous motor","authors":"Badoud Abd Essalam, Khemliche Mabrouk","doi":"10.1109/WOSSPA.2011.5931500","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931500","url":null,"abstract":"The objective of this work is to have the results concerning the electric characterization and modeling by Bond Graph of the photovoltaic system coupled to a permanent magnet synchronous motor. The modeling of the global system components is developed with the integration of inverter with filter. The model of the solar generating subsystem is particularly developed. It is shown that this model is interesting for analyzing the dynamic behavior of the system and for designing the control strategy. The operating point of a photovoltaic generator that is connected to a permanent magnet synchronous motor is determined by the intersection point of its characteristic curves. In general, this point is not the same as the generator's maximum power point. This difference means losses in the system performance. Other point developed in this paper is presents an improved maximum power point tracking (MPPT) algorithm of a PV system under real climatic conditions. The proposed MPPT is based on the perturbation and observation (P&O) strategy and the variable step method that control the load voltage to ensure optimal operating points of a PV system.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130451119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：