Pub Date : 2017-07-13DOI: 10.1109/ISSCS.2017.8034875
L. Scripcariu, P. Matasaru, F. Diaconu
Data Encryption Standard (DES) was initially considered a strong symmetric encryption algorithm, resistant to all known cryptographic attacks at that time [1]. But the short key used to encrypt data is a weakness of the algorithm. Increasing the data structure size and the key length are two recommended measures that ensure the strength of the encryption algorithm. The running-time is a constraint imposed to the design of the algorithm that restricts its applicability at a moment. Triple-DES (TDES) with 128-bit key will be considered as a candidate to Advanced Encryption Standard (AES) after 2020 when the technology is estimated to be sufficiently developed to run fast enough TDES [2]. Regarding the time, DES can be a good candidate to AES if it is applied on multi-bit symbols instead of bits. We propose an extension of DES algorithm to Galois Fields (GF), with an encryption key of at least 256-bit long. The substitution boxes (S-boxes) are the non-linear component of the algorithm that is decisive for its robustness. The design of multi-bit S-boxes is done using bijective polynomials defined on Galois Fields. DES-256 running on GF (16), with 4-bit symbols, is proposed and presented with all the details.
{"title":"Extended DES algorithm to Galois Fields","authors":"L. Scripcariu, P. Matasaru, F. Diaconu","doi":"10.1109/ISSCS.2017.8034875","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034875","url":null,"abstract":"Data Encryption Standard (DES) was initially considered a strong symmetric encryption algorithm, resistant to all known cryptographic attacks at that time [1]. But the short key used to encrypt data is a weakness of the algorithm. Increasing the data structure size and the key length are two recommended measures that ensure the strength of the encryption algorithm. The running-time is a constraint imposed to the design of the algorithm that restricts its applicability at a moment. Triple-DES (TDES) with 128-bit key will be considered as a candidate to Advanced Encryption Standard (AES) after 2020 when the technology is estimated to be sufficiently developed to run fast enough TDES [2]. Regarding the time, DES can be a good candidate to AES if it is applied on multi-bit symbols instead of bits. We propose an extension of DES algorithm to Galois Fields (GF), with an encryption key of at least 256-bit long. The substitution boxes (S-boxes) are the non-linear component of the algorithm that is decisive for its robustness. The design of multi-bit S-boxes is done using bijective polynomials defined on Galois Fields. DES-256 running on GF (16), with 4-bit symbols, is proposed and presented with all the details.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115532216","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 : 2017-07-13DOI: 10.1109/ISSCS.2017.8034874
Emad Alnawafa, I. Marghescu
Many protocols have been emerged for facing the problem of energy consumption in the wireless sensor network (WSN). Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is one of these protocols, which achieved a lot of spreading. In this paper, a dynamic multi-hop technique (DMHT-LEACH) protocol is proposed based on the LEACH protocol. The DMHT-LEACH protocol suggests a dynamic technique for routing the data of cluster head (CH) through other CHs to the Base Station (BS). The simulation results show that the DMHT-LEACH improves the lifetime and throughput of the sensor network comparing with the IMHT-LEACH and the conventional LEACH protocols.
{"title":"DMHT-LEACH: Dynamic multi-hop technique for wireless sensor networks","authors":"Emad Alnawafa, I. Marghescu","doi":"10.1109/ISSCS.2017.8034874","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034874","url":null,"abstract":"Many protocols have been emerged for facing the problem of energy consumption in the wireless sensor network (WSN). Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is one of these protocols, which achieved a lot of spreading. In this paper, a dynamic multi-hop technique (DMHT-LEACH) protocol is proposed based on the LEACH protocol. The DMHT-LEACH protocol suggests a dynamic technique for routing the data of cluster head (CH) through other CHs to the Base Station (BS). The simulation results show that the DMHT-LEACH improves the lifetime and throughput of the sensor network comparing with the IMHT-LEACH and the conventional LEACH protocols.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127424107","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 : 2017-07-13DOI: 10.1109/ISSCS.2017.8034915
A. Lavric, V. Popa
Nowadays there is a lot of effort on the study, analysis and finding of new solutions related to high density sensor networks used as part of the IoT (Internet of Things) concept. LoRa (Long Range) is a modulation technique that enables the long-range transfer of information with a low transfer rate. This paper presents a review of the challenges and the obstacles of IoT concept with emphasis on the LoRa technology. A LoRaWAN network (Long Range Network Protocol) is of the Low Power Wide Area Network (LPWAN) type and encompasses battery powered devices that ensure bidirectional communication. The main contribution of the paper is the evaluation of the LoRa technology considering the requirements of IoT. After introduction in Section II the main obstacles of IoT development are discussed, section III addresses the challenges and entails the need for solutions to different problems in WSN research. Section IV presents the LoRaWAN communication protocol architecture requirements while in Section V the LoRa modulation performance is evaluated and discussed. In conclusion LoRa can be considered a good candidate in addressing the IoT challenges.
{"title":"Internet of Things and LoRa™ Low-Power Wide-Area Networks: A survey","authors":"A. Lavric, V. Popa","doi":"10.1109/ISSCS.2017.8034915","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034915","url":null,"abstract":"Nowadays there is a lot of effort on the study, analysis and finding of new solutions related to high density sensor networks used as part of the IoT (Internet of Things) concept. LoRa (Long Range) is a modulation technique that enables the long-range transfer of information with a low transfer rate. This paper presents a review of the challenges and the obstacles of IoT concept with emphasis on the LoRa technology. A LoRaWAN network (Long Range Network Protocol) is of the Low Power Wide Area Network (LPWAN) type and encompasses battery powered devices that ensure bidirectional communication. The main contribution of the paper is the evaluation of the LoRa technology considering the requirements of IoT. After introduction in Section II the main obstacles of IoT development are discussed, section III addresses the challenges and entails the need for solutions to different problems in WSN research. Section IV presents the LoRaWAN communication protocol architecture requirements while in Section V the LoRa modulation performance is evaluated and discussed. In conclusion LoRa can be considered a good candidate in addressing the IoT challenges.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116144337","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 : 2017-07-13DOI: 10.1109/ISSCS.2017.8034918
Laura-Maria Dogariu, S. Ciochină, C. Paleologu, J. Benesty, P. Piantanida
This paper proposes a new and very simple method to perform identification of nonlinearities in systems that are supposed to be linear. The improvement with respect to the previous approaches lies in the low computational complexity of the solution and the convenient possibility of online evaluation. Simulation results show that the proposed method provides good performance in terms of coefficients identification, resulting in both low steady-state error and high convergence rate of the algorithm, which justifies its applicability in practice.
{"title":"An adaptive solution for nonlinear system identification","authors":"Laura-Maria Dogariu, S. Ciochină, C. Paleologu, J. Benesty, P. Piantanida","doi":"10.1109/ISSCS.2017.8034918","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034918","url":null,"abstract":"This paper proposes a new and very simple method to perform identification of nonlinearities in systems that are supposed to be linear. The improvement with respect to the previous approaches lies in the low computational complexity of the solution and the convenient possibility of online evaluation. Simulation results show that the proposed method provides good performance in terms of coefficients identification, resulting in both low steady-state error and high convergence rate of the algorithm, which justifies its applicability in practice.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"260 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116417043","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 : 2017-07-13DOI: 10.1109/ISSCS.2017.8034863
T. Barbu
A novel compound image inpainting approach is proposed in this paper. We consider a variational interpolation model based on nonlinear second-order and fourth-order diffusions. A well-posed nonlinear PDE-based model is then derived from the variational scheme. It is then discretized by using an iterative finite-difference based numerical approximation scheme. The proposed reconstruction technique works successfully in noisy conditions and also overcomes the unintended effects.
{"title":"Hybrid image interpolation technique based on nonlinear second and fourth-order diffusions","authors":"T. Barbu","doi":"10.1109/ISSCS.2017.8034863","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034863","url":null,"abstract":"A novel compound image inpainting approach is proposed in this paper. We consider a variational interpolation model based on nonlinear second-order and fourth-order diffusions. A well-posed nonlinear PDE-based model is then derived from the variational scheme. It is then discretized by using an iterative finite-difference based numerical approximation scheme. The proposed reconstruction technique works successfully in noisy conditions and also overcomes the unintended effects.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"2 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131942705","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 : 2017-07-13DOI: 10.1109/ISSCS.2017.8034864
C. Andriesei, Cristian Ţurcă
This article reconsiders the impedance matching problem for common source CMOS LNA (CS-LNA) and proposes several improved equivalent models that take into account both Cgd capacitance and the type of load, resistive or inductive, normally not considered by the classical approach. These newly developed models might offer valuable insights about the input impedance, amplifier stability and quality of impedance matching, all these being of great interest in LNA design. The simulation results show good agreement, in terms of frequency response, between the proposed models and transistor based CS-LNA. Hence, it would justify further consideration of Cgd when designing the matching network while taking into account the load, as well. The analysis covered the frequency range 0.1–7 GHz.
{"title":"Revisiting the impedance matching for CS-LNA","authors":"C. Andriesei, Cristian Ţurcă","doi":"10.1109/ISSCS.2017.8034864","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034864","url":null,"abstract":"This article reconsiders the impedance matching problem for common source CMOS LNA (CS-LNA) and proposes several improved equivalent models that take into account both Cgd capacitance and the type of load, resistive or inductive, normally not considered by the classical approach. These newly developed models might offer valuable insights about the input impedance, amplifier stability and quality of impedance matching, all these being of great interest in LNA design. The simulation results show good agreement, in terms of frequency response, between the proposed models and transistor based CS-LNA. Hence, it would justify further consideration of Cgd when designing the matching network while taking into account the load, as well. The analysis covered the frequency range 0.1–7 GHz.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134325830","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 : 2017-07-13DOI: 10.1109/ISSCS.2017.8034870
B. Yarman, Cem Ulger, A. Aslan
Need for end-to-end secure voice communication under the cyber security threats are increasing day by day. This paper describes a method of establishing secure VOIP system in which the voice encoded with the SYMPES [1] coding technique and encryption set with an open standard encryption algorithm. Voice can be transmitted from point to point within a secure IP network. A Graphic Processing Unit (GPU) based sub-structure will be placed to increase performance of the overall system under the heavy mathematical calculations of SYMPES algorithm.
{"title":"SYMPES technique encoded IP-based secure voice communication system","authors":"B. Yarman, Cem Ulger, A. Aslan","doi":"10.1109/ISSCS.2017.8034870","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034870","url":null,"abstract":"Need for end-to-end secure voice communication under the cyber security threats are increasing day by day. This paper describes a method of establishing secure VOIP system in which the voice encoded with the SYMPES [1] coding technique and encryption set with an open standard encryption algorithm. Voice can be transmitted from point to point within a secure IP network. A Graphic Processing Unit (GPU) based sub-structure will be placed to increase performance of the overall system under the heavy mathematical calculations of SYMPES algorithm.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133351764","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034872
J. H. Husøy, M. Abadi
In this paper we revisit the well known and popular Normalized Subband Adaptive Filter (NSAF). Based on an analysis of the algorithm in the mean and using an analysis strategy presented in [1], we find that the NSAF can be seen as a Richardson iteration applied to a preconditioned augmented Wiener-Hopf equation. This equation is formulated in such a way that its convergence speed can be predicted directly from a matrix QT R≂, where QT is a matrix formed as a weighted sum of Toeplitz matrices directly related to the filter banks used and R≂ is a tall, rectangular, autocorrelation matrix. Since the QT R≂ itself is symmetric and Toeplitz, we can make quantitative statements about its convergence speed in much the same way as we can for the least mean square (LMS) algorithm with the important difference that in the NSAF case we can directly use QT to control the convergence speed. Through some experiments we demonstrate the validity of our approach in the prediction of convergence speed. Also, and perhaps more important, we point out that our formalism holds the potential for providing an optimization problem such that the filter banks used in NSAF can be designed based on this rather than merely being selected/postulated as is done presently.
{"title":"On the convergence speed of the Normalized Subband Adaptive Filter: Some new insights and interpretations","authors":"J. H. Husøy, M. Abadi","doi":"10.1109/ISSCS.2017.8034872","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034872","url":null,"abstract":"In this paper we revisit the well known and popular Normalized Subband Adaptive Filter (NSAF). Based on an analysis of the algorithm in the mean and using an analysis strategy presented in [1], we find that the NSAF can be seen as a Richardson iteration applied to a preconditioned augmented Wiener-Hopf equation. This equation is formulated in such a way that its convergence speed can be predicted directly from a matrix QT R≂, where QT is a matrix formed as a weighted sum of Toeplitz matrices directly related to the filter banks used and R≂ is a tall, rectangular, autocorrelation matrix. Since the QT R≂ itself is symmetric and Toeplitz, we can make quantitative statements about its convergence speed in much the same way as we can for the least mean square (LMS) algorithm with the important difference that in the NSAF case we can directly use QT to control the convergence speed. Through some experiments we demonstrate the validity of our approach in the prediction of convergence speed. Also, and perhaps more important, we point out that our formalism holds the potential for providing an optimization problem such that the filter banks used in NSAF can be designed based on this rather than merely being selected/postulated as is done presently.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124909506","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034943
P. Ungureanu, E. David
We investigate the performances of fixed point implementation recursive approximations of Gabor filters in a texture classification framework based on a bag of words approach. The obtained results indicate that it is possible to obtain similar performances as in the case of using “premium” but very costly feature extractors.
{"title":"Texture classification performances of fixed point implementation of Gabor filters recursive approximations","authors":"P. Ungureanu, E. David","doi":"10.1109/ISSCS.2017.8034943","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034943","url":null,"abstract":"We investigate the performances of fixed point implementation recursive approximations of Gabor filters in a texture classification framework based on a bag of words approach. The obtained results indicate that it is possible to obtain similar performances as in the case of using “premium” but very costly feature extractors.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122572428","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034912
Adrian Done, A. Căilean, C. Lesanu, M. Dimian, A. Graur
As the number of satellites orbiting around the Earth is significantly increasing, it is important to extend the ground station network, in order to be able to receive as much of the satellite transmitted data. In this context, this paper addresses the aspects related to the implementation of a ground station for LEO satellites, located in Suceava city, focusing on the analysis of the reference antenna's parameters using probe signals from satellites that are not stabilized in attitude. The ground station currently uses a 145 and a 436 MHz omnidirectional antenna, with two more antennas and a remote control station under development.
{"title":"Considerations on ground station antennas used for communication with LEO satellites","authors":"Adrian Done, A. Căilean, C. Lesanu, M. Dimian, A. Graur","doi":"10.1109/ISSCS.2017.8034912","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034912","url":null,"abstract":"As the number of satellites orbiting around the Earth is significantly increasing, it is important to extend the ground station network, in order to be able to receive as much of the satellite transmitted data. In this context, this paper addresses the aspects related to the implementation of a ground station for LEO satellites, located in Suceava city, focusing on the analysis of the reference antenna's parameters using probe signals from satellites that are not stabilized in attitude. The ground station currently uses a 145 and a 436 MHz omnidirectional antenna, with two more antennas and a remote control station under development.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122912928","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
扫码关注我们
求助内容：
应助结果提醒方式：