Pub Date : 2016-06-01DOI: 10.1109/TSP.2016.7760945
J. Jerabek, R. Sotner, D. Kubánek, Jan Dvorak, L. Langhammer, N. Herencsar, K. Vrba
This paper presents possible solution of fractional-order low-pass filter (FLPF) with electronically adjustable order between 1 and 2 and with also electronically adjustable pole frequency. It is based on well-known follow-the-leader feedback (FLF) topology adjusted in our case for utilization with operational transconductance amplifiers (OTAs) and adjustable current amplifiers (ACAs). This 3rd-order topology is used in order to approximate FLPF response in particular frequency band of interest. Design is supported by Pspice simulations for three particular values of order of the filter (1.3, 1.5, 1.7) and for several values of pole frequency.
{"title":"Fractional-order low-pass filter with electronically adjustable parameters","authors":"J. Jerabek, R. Sotner, D. Kubánek, Jan Dvorak, L. Langhammer, N. Herencsar, K. Vrba","doi":"10.1109/TSP.2016.7760945","DOIUrl":"https://doi.org/10.1109/TSP.2016.7760945","url":null,"abstract":"This paper presents possible solution of fractional-order low-pass filter (FLPF) with electronically adjustable order between 1 and 2 and with also electronically adjustable pole frequency. It is based on well-known follow-the-leader feedback (FLF) topology adjusted in our case for utilization with operational transconductance amplifiers (OTAs) and adjustable current amplifiers (ACAs). This 3rd-order topology is used in order to approximate FLPF response in particular frequency band of interest. Design is supported by Pspice simulations for three particular values of order of the filter (1.3, 1.5, 1.7) and for several values of pole frequency.","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128355052","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 : 2016-06-01DOI: 10.1109/TSP.2016.7760842
P. Koleva, Plamen T. Semov, V. Poulkov, Oleg Asenov
In this paper a routing algorithm for MANETs is presented, based on the formation of servicing zones and determination of nodes in these zones as default gateways. The idea behind this approach is to gain power efficiency and sustainability of the network. The proposed approach reduces the overall number of broadcasts in the network and ensures a reliable and energy efficient connection, by balancing the load among the nodes. The algorithm could be considered as a hybrid type of routing mechanism, incorporating multipath hop-by-hop distributed routing. We apply a time slot based self-organizing and self-routing approach by the application of a network model with universal basic node properties. For each node we define two functional and one generic property. The algorithm has the logic of non-cooperative routing based on the evaluation of the defined basic properties of the nodes. The major advantages of the algorithm are related to the complexity and the reduced overall routing cost, especially in higher density networks.
{"title":"Layered routing algorithm for sustainable MANET operation","authors":"P. Koleva, Plamen T. Semov, V. Poulkov, Oleg Asenov","doi":"10.1109/TSP.2016.7760842","DOIUrl":"https://doi.org/10.1109/TSP.2016.7760842","url":null,"abstract":"In this paper a routing algorithm for MANETs is presented, based on the formation of servicing zones and determination of nodes in these zones as default gateways. The idea behind this approach is to gain power efficiency and sustainability of the network. The proposed approach reduces the overall number of broadcasts in the network and ensures a reliable and energy efficient connection, by balancing the load among the nodes. The algorithm could be considered as a hybrid type of routing mechanism, incorporating multipath hop-by-hop distributed routing. We apply a time slot based self-organizing and self-routing approach by the application of a network model with universal basic node properties. For each node we define two functional and one generic property. The algorithm has the logic of non-cooperative routing based on the evaluation of the defined basic properties of the nodes. The major advantages of the algorithm are related to the complexity and the reduced overall routing cost, especially in higher density networks.","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124694575","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 : 2016-06-01DOI: 10.1109/TSP.2016.7760912
Virgil E. Petcu, O. Boncalo, A. Amaricai, V. Savin
In this paper, we present an LDPC decoder design equipped with an adaptive throughput mechanism achievable using a multiple quantization scheme. Three representations are supported by the proposed architecture: 1-bit (hard decision), 2-bit, and 4-bit messages. A throughput increase by of factor of 4, 2 and 1 can be achieved with respect to the 4-bit message representation version, by simultaneously decoding 4, 2, or 1 codewords. This is done by employing a single instruction multiple data (SIMD) approach at processing unit level which is able to process 4, 2 and 1 operands corresponding to the distinct codewords. We provide implementation results for a partial parallel flooding architecture, with serial processing at processing node level. FPGA implementation results indicate that the proposed SIMD approach has an overhead of about 60% in logic with respect to the fixed 4-bit LDPC decoder, with no memory increase, while having a throughput increase of 4× when the hard-decision decoding is used.
{"title":"Variable throughput LDPC decoders using SIMD-based adaptive quantization","authors":"Virgil E. Petcu, O. Boncalo, A. Amaricai, V. Savin","doi":"10.1109/TSP.2016.7760912","DOIUrl":"https://doi.org/10.1109/TSP.2016.7760912","url":null,"abstract":"In this paper, we present an LDPC decoder design equipped with an adaptive throughput mechanism achievable using a multiple quantization scheme. Three representations are supported by the proposed architecture: 1-bit (hard decision), 2-bit, and 4-bit messages. A throughput increase by of factor of 4, 2 and 1 can be achieved with respect to the 4-bit message representation version, by simultaneously decoding 4, 2, or 1 codewords. This is done by employing a single instruction multiple data (SIMD) approach at processing unit level which is able to process 4, 2 and 1 operands corresponding to the distinct codewords. We provide implementation results for a partial parallel flooding architecture, with serial processing at processing node level. FPGA implementation results indicate that the proposed SIMD approach has an overhead of about 60% in logic with respect to the fixed 4-bit LDPC decoder, with no memory increase, while having a throughput increase of 4× when the hard-decision decoding is used.","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"32 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132644587","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 : 2016-06-01DOI: 10.1109/TSP.2016.7760865
Zdenek Martinasek, Petr Dzurenda, L. Malina
DPA (Differential Power Analysis) Contest is well-known international framework that allows researchers to compare their power analysis attacks under the same conditions. The latest version of DPA Contest V4.2 provides an improved software implementation of the Rotating Sbox Masking (RSM) scheme. The improved RSM combines low-entropy boolean masking with the shuffling technique to protect AES (Advanced Encryption Standard) implementation on a smart card. The improvements were designed based on the lacks that were analyzed during the previous DPA Contest V4.1. Therefore, this new implementation should resist most of the proposed attacks to the origin RSM implementation. In this article, we proposed and implemented profiling power analysis attack that aimed improved RSM implementation and is based on template attack and MLP attack (multy-layer perceptorn).
{"title":"Profiling power analysis attack based on MLP in DPA contest V4.2","authors":"Zdenek Martinasek, Petr Dzurenda, L. Malina","doi":"10.1109/TSP.2016.7760865","DOIUrl":"https://doi.org/10.1109/TSP.2016.7760865","url":null,"abstract":"DPA (Differential Power Analysis) Contest is well-known international framework that allows researchers to compare their power analysis attacks under the same conditions. The latest version of DPA Contest V4.2 provides an improved software implementation of the Rotating Sbox Masking (RSM) scheme. The improved RSM combines low-entropy boolean masking with the shuffling technique to protect AES (Advanced Encryption Standard) implementation on a smart card. The improvements were designed based on the lacks that were analyzed during the previous DPA Contest V4.1. Therefore, this new implementation should resist most of the proposed attacks to the origin RSM implementation. In this article, we proposed and implemented profiling power analysis attack that aimed improved RSM implementation and is based on template attack and MLP attack (multy-layer perceptorn).","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127385042","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 : 2016-06-01DOI: 10.1109/TSP.2016.7760921
Z. Sadreddini, Tugrul Çavdar, H. B. Jond
A distance measurement method for a single-camera condition is proposed. The aim is to implement a way to find the distance of an object in front of the imaging system in indoor environment. In this method, the first step is to extract the appropriate vertical floor line from the snapshots sequence. Moreover, the line passing through the base side of the object is found simultaneously with the floor line. Then, the part of the floor line starting from this point is measured in pixels, by taking the intersection point of these lines, and converted to distance between the camera and the object. The proposed method is applicable for flat indoor buildings with regular lines on the floor, while many buildings are in such a situation. Experimental results are carried out by using MATLAB to estimate the measured distance by the proposed method.
{"title":"A distance measurement method using single camera for indoor environments","authors":"Z. Sadreddini, Tugrul Çavdar, H. B. Jond","doi":"10.1109/TSP.2016.7760921","DOIUrl":"https://doi.org/10.1109/TSP.2016.7760921","url":null,"abstract":"A distance measurement method for a single-camera condition is proposed. The aim is to implement a way to find the distance of an object in front of the imaging system in indoor environment. In this method, the first step is to extract the appropriate vertical floor line from the snapshots sequence. Moreover, the line passing through the base side of the object is found simultaneously with the floor line. Then, the part of the floor line starting from this point is measured in pixels, by taking the intersection point of these lines, and converted to distance between the camera and the object. The proposed method is applicable for flat indoor buildings with regular lines on the floor, while many buildings are in such a situation. Experimental results are carried out by using MATLAB to estimate the measured distance by the proposed method.","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130424964","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 : 2016-06-01DOI: 10.1109/TSP.2016.7760957
J. Baranowski, P. Piątek, Kamelia Niemczyk
The problem of signal processing in EEG analysis is a current and interesting one. Appropriate choice of the filter is still a topic of ongoing discussion. In this paper we analyze application of non-integer band pass filters for this purpose. Non-integer filters are interesting because of their flexibility in the shaping of slopes in amplitude response. However, their direct digital implementation is not possible, as they require infinite memory because of lack of semigroup property. We show how to implement non-integer filters using Laguerre Impulse Response Approximation (LIRA) method. Also design of filter is discussed and illustrated with two examples of EEG signal processing.
{"title":"Design and implementation of non-integer band pass filters for EEG processing","authors":"J. Baranowski, P. Piątek, Kamelia Niemczyk","doi":"10.1109/TSP.2016.7760957","DOIUrl":"https://doi.org/10.1109/TSP.2016.7760957","url":null,"abstract":"The problem of signal processing in EEG analysis is a current and interesting one. Appropriate choice of the filter is still a topic of ongoing discussion. In this paper we analyze application of non-integer band pass filters for this purpose. Non-integer filters are interesting because of their flexibility in the shaping of slopes in amplitude response. However, their direct digital implementation is not possible, as they require infinite memory because of lack of semigroup property. We show how to implement non-integer filters using Laguerre Impulse Response Approximation (LIRA) method. Also design of filter is discussed and illustrated with two examples of EEG signal processing.","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131723545","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 : 2016-06-01DOI: 10.1109/TSP.2016.7760878
N. Herencsar, A. Lahiri, J. Koton, K. Vrba
This paper presents a new circuit realization capable of simultaneously realizing all three current-mode first-order filtering functions, namely the low-pass (LP), high-pass (HP), and all-pass (AP). The proposed circuit is created using three programmable current amplifiers (PCAs) and only two passive components, which includes one resistor and one capacitor. LP and HP filters have independently tuneable gain and pole frequency by means of “mu-factors”, while the AP filter has only tunable gains and the pole frequency is ideally controllable only by external passive components. The theoretical results are verified by SPICE simulations using transistor model process parameters NR100N (NPN) and PR100N (PNP) of bipolar arrays ALA400-CBIC-R from AT&T.
{"title":"First-order multifunction filter design using current amplifiers","authors":"N. Herencsar, A. Lahiri, J. Koton, K. Vrba","doi":"10.1109/TSP.2016.7760878","DOIUrl":"https://doi.org/10.1109/TSP.2016.7760878","url":null,"abstract":"This paper presents a new circuit realization capable of simultaneously realizing all three current-mode first-order filtering functions, namely the low-pass (LP), high-pass (HP), and all-pass (AP). The proposed circuit is created using three programmable current amplifiers (PCAs) and only two passive components, which includes one resistor and one capacitor. LP and HP filters have independently tuneable gain and pole frequency by means of “mu-factors”, while the AP filter has only tunable gains and the pole frequency is ideally controllable only by external passive components. The theoretical results are verified by SPICE simulations using transistor model process parameters NR100N (NPN) and PR100N (PNP) of bipolar arrays ALA400-CBIC-R from AT&T.","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793945","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 : 2016-06-01DOI: 10.1109/TSP.2016.7760924
Elif Baykal, B. Ustubioglu, G. Ulutaş
Copy move attack, a special type of image forgery, is performed by copying a part of the image and pasting anywhere else in the same image. Besides block-based methods, keypoint-based methods like Scale Invariant Feature Transform (SIFT) are improved for detection of copy move attacks. In this method, firstly image keypoints are extracted and a 128 dimensional feature vector named as SIFT descriptor is generated for each keypoint. Then, these keypoints are matched using Euclidean distance among their descriptors. Although this method is good at detection of copy move attacks, it has drawback. Computational complexity is huge and increases with the size of the image. To overcome this drawback, we propose to use k-means++ method for clustering the SIFT descriptors. Thus, each keypoint is matched with keypoints only in its cluster instead of all other keypoints. This proposed hybrid method allows us to decrease the time complexity of the SIFT method considerably.
{"title":"Image forgery detection based on SIFT and k-means++","authors":"Elif Baykal, B. Ustubioglu, G. Ulutaş","doi":"10.1109/TSP.2016.7760924","DOIUrl":"https://doi.org/10.1109/TSP.2016.7760924","url":null,"abstract":"Copy move attack, a special type of image forgery, is performed by copying a part of the image and pasting anywhere else in the same image. Besides block-based methods, keypoint-based methods like Scale Invariant Feature Transform (SIFT) are improved for detection of copy move attacks. In this method, firstly image keypoints are extracted and a 128 dimensional feature vector named as SIFT descriptor is generated for each keypoint. Then, these keypoints are matched using Euclidean distance among their descriptors. Although this method is good at detection of copy move attacks, it has drawback. Computational complexity is huge and increases with the size of the image. To overcome this drawback, we propose to use k-means++ method for clustering the SIFT descriptors. Thus, each keypoint is matched with keypoints only in its cluster instead of all other keypoints. This proposed hybrid method allows us to decrease the time complexity of the SIFT method considerably.","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126737063","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 : 2016-06-01DOI: 10.1109/TSP.2016.7760857
A. Melikhova, I. Tsikin
In this paper planar antenna arrays with a small number of elements are discussed as applied to angle-of-arrival (AOA) integrity monitoring method for global-navigation satellite systems (GNSS). In accordance with AOA method decision making procedure about integrity presence or absence is created on the base of information about navigation signal sources direction-finding (DF) parameters. The maximum likelihood decision making procedure was statistically simulated and the most important characteristics such as false alarm and missed detection probabilities were estimated for different antenna arrays. Results of simulations showed the algorithms efficiency areas for different structures of antenna arrays so that finally the relationship between the number of antenna elements and missed detection probability were achieved for different number of analyzing signals. On bases of these results the relationship between required number of analyzed signals and the number of antenna elements providing the required probability based characteristics for integrity monitoring method can be estimated.
{"title":"Antenna array with a small number of elements for angle-of-arriving GNSS integrity monitoring","authors":"A. Melikhova, I. Tsikin","doi":"10.1109/TSP.2016.7760857","DOIUrl":"https://doi.org/10.1109/TSP.2016.7760857","url":null,"abstract":"In this paper planar antenna arrays with a small number of elements are discussed as applied to angle-of-arrival (AOA) integrity monitoring method for global-navigation satellite systems (GNSS). In accordance with AOA method decision making procedure about integrity presence or absence is created on the base of information about navigation signal sources direction-finding (DF) parameters. The maximum likelihood decision making procedure was statistically simulated and the most important characteristics such as false alarm and missed detection probabilities were estimated for different antenna arrays. Results of simulations showed the algorithms efficiency areas for different structures of antenna arrays so that finally the relationship between the number of antenna elements and missed detection probability were achieved for different number of analyzing signals. On bases of these results the relationship between required number of analyzed signals and the number of antenna elements providing the required probability based characteristics for integrity monitoring method can be estimated.","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123389456","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 : 2016-06-01DOI: 10.1109/TSP.2016.7760941
P. Rajmic, Michaela Novosadová
We show that convex optimization methods have fundamental properties that complicate performing signal segmentation based on sparsity assumptions. We review the recently introduced overcomplete sparse segmentation model, we perform experiments revealing the limits, and we explain this behaviour. We also propose modifications and alternatives.
{"title":"On the limitation of convex optimization for sparse signal segmentation","authors":"P. Rajmic, Michaela Novosadová","doi":"10.1109/TSP.2016.7760941","DOIUrl":"https://doi.org/10.1109/TSP.2016.7760941","url":null,"abstract":"We show that convex optimization methods have fundamental properties that complicate performing signal segmentation based on sparsity assumptions. We review the recently introduced overcomplete sparse segmentation model, we perform experiments revealing the limits, and we explain this behaviour. We also propose modifications and alternatives.","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121561466","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
扫码关注我们
求助内容：
应助结果提醒方式：