{"title":"Chaotic Admittance with Analog Multipliers","authors":"J. Petrzela, R. Sotner","doi":"10.1109/TSP.2018.8441438","DOIUrl":"https://doi.org/10.1109/TSP.2018.8441438","url":null,"abstract":"This brief paper focuses a design problem towards two-terminal device with unique property: chaotic or non-chaotic input current flows through this device depending on amplitude and frequency of the input harmonic driving voltage. Existence of chaos is proved numerically by means of two-dimensional colored plot of the largest Lyapunov exponent as a function of shape of input voltage signal. Gallery of the oscilloscope screenshots shows good agreement between numerical integration process and real experimental measurement. Some further ideas and few practical applications of proposed two-terminal element are also given.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"596 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116071347","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}
{"title":"Compressive Sensing for No-Contact 3D Ground Penetrating Radar","authors":"L. Miccinesi, N. Rojhani, M. Pieraccini","doi":"10.1109/TSP.2018.8441448","DOIUrl":"https://doi.org/10.1109/TSP.2018.8441448","url":null,"abstract":"No-contact Ground Penetrating Radars (GPRs) are popular microwave sensors for investigating soils or masonry/stone walls. In this paper the authors evaluated the compressive sensing (CS) as possible technique for speeding up the acquisition time of this kind of application. In effect the CS approach could reduce the number of acquisition points, and then the measurement time by using only a random pattern of the antennas positions. The authors found that the data reconstruction loses quality even with a reduction of 25 % of the number of acquisitions, but the features of the targets still visible. With a reduction of 50 % the SNR decrease sensibly and most of the targets are not detectable. Such a time reduction results rather marginal in most practical cases.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122525636","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}
{"title":"Signal Reconstruction in Multicarrier Comunications by Means of the Discrete Cosine Transform Type-III Even","authors":"M. Jiménez, G. Vidal, D. Luengo","doi":"10.1109/TSP.2018.8441489","DOIUrl":"https://doi.org/10.1109/TSP.2018.8441489","url":null,"abstract":"In this work, we address the problem of signal recovery in Multicarrier Modulation (MCM) with the Discrete Cosine Transform Type-III even (DCT3e). By appending one zero to the transmitted symbol, our technique provides a perfect reconstruction of the original signal at the receiver (in the absence of noise), after a simple procedure by using exclusively the DCT3e. We propose a matrix formulation which allows the diagonalization of the channel via the DCT3e; moreover, the one-tap per subcarrier coefficients for the reconstruction are also obtained by means of the DCT3e. We provide theoretical results and present simulations, using ITU-T's pedestrian channel B, which show the good behaviour of the proposed reconstruction algorithm.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122773811","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}
{"title":"Query-by-Example Retrieval in Satellite Image Time Series","authors":"A. Radoi, C. Burileanu","doi":"10.1109/TSP.2018.8441223","DOIUrl":"https://doi.org/10.1109/TSP.2018.8441223","url":null,"abstract":"The technological evolution of remote sensing sensors led to the acquisition of huge archives of data that are difficult to interpret by human experts. In order to process this huge amount of data and the large number of potential temporal evolutions, multitemporal analysis techniques need to be developed. In this paper, we propose a simple, unsupervised, yet effective technique towards the retrieval of spatio-temporal patterns from satellite image time series (SITS). Following a query-by-example procedure, the proposed method is able to extract patterns that are similar to a given query under two use case scenarios, i.e., short and long SITS, respectively. The experiments prove the successful application of the proposed method in both cases.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131438188","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}
{"title":"NF Analysis of LNA with Lossy Passive Network at the Input","authors":"Amirhossein Rasekh, R. Rabbani, M. S. Bakhtiar","doi":"10.1109/TSP.2018.8441357","DOIUrl":"https://doi.org/10.1109/TSP.2018.8441357","url":null,"abstract":"It is widely accepted that the presence of a lossy network, such as a SAW filter or balun, at the input of LNA increases NF of the overall circuit by an amount equal to the insertion loss of the lossy network. In this work it is shown that this idea is not exactly true and it considerably underestimates the overall NF. To verify this claim, Z-model of the lossy network is added before the LNA and the overall noise figure is recalculated for some commonly used LNA topologies. It is shown that in common gate LNA and common source LNA with resistive feedback the accepted equation underestimates the overall NF by 1.3 dB for an insertion loss of 2 dB. In common source with resistive matching and in common source with inductive degeneration the exact value of NF is almost the same as the value obtained from the accepted equation.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126990799","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}
Mustafa Can Gursoy, B. C. Akdeniz, T. Tuğcu, A. E. Pusane
{"title":"Error Probability Calculation with Reduced Complexity for Molecular Communications","authors":"Mustafa Can Gursoy, B. C. Akdeniz, T. Tuğcu, A. E. Pusane","doi":"10.1109/TSP.2018.8441167","DOIUrl":"https://doi.org/10.1109/TSP.2018.8441167","url":null,"abstract":"Molecular Communication via Diffusion (MCvD) aims to establish communication links at the nanoscale by utilizing chemical signals for information transmission. After encoding the bits in a physical property of a molecular wave, the transmitter releases the molecules into the fluid environment where they diffuse randomly according to the laws of Brownian motion. For consequent bit transmission scenarios, the random nature of the channel causes inter-symbol interference (ISI) for the system, which affects communication performance and poses limits on the range and the bit rate of the communication. Due to facing different amounts of ISI for different bit sequences, each sequence combination should be evaluated when deriving the theoretical bit error rate of an MCvD system. Emphasizing the fact that some bit sequences produce considerably more bit errors than others, this paper aims to reduce the number of evaluations required to derive theoretical approximate bit error rates while preserving sufficient precision.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133490665","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}
Petr Blazek, Tomas Gerlich, Zdenek Martinasek, Jakub Frolka
{"title":"Comparison of Linux Filtering Tools for Mitigation of DDoS Attacks","authors":"Petr Blazek, Tomas Gerlich, Zdenek Martinasek, Jakub Frolka","doi":"10.1109/TSP.2018.8441309","DOIUrl":"https://doi.org/10.1109/TSP.2018.8441309","url":null,"abstract":"Every year, the intensity and quantity of Distributed Denial of Service (DDoS) attacks realized is incessantly increasing, that is confirmed by companies such as Kaspersky, Imperva or Verisign. Moreover, this reality is also confirmed by the published losses of victims. The popularity of these attacks is mainly trigger for the simplicity of realization therefore the actual costs of the attack realization are cheap. The main goal of this article is to compare open source tools for network data processing. This research is realized in order to identify the most effective tool including the settings that will be implemented into DDoS mitigation system. The final system provide adaptive network filtering based on the decomposition of network traffic and filtering utilizing commodity servers.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133995752","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}
{"title":"Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes","authors":"V. Usatyuk, I. Vorobyev","doi":"10.1109/TSP.2018.8441303","DOIUrl":"https://doi.org/10.1109/TSP.2018.8441303","url":null,"abstract":"We present a simulated annealing method that construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. The proposed method is applicable to both regular and irregular protograph codes. The method show improvement in term of minimal circulant size compare with previous described methods: Hill-Climbing and improved PEG. Simulated results are presented to demonstrate performance gain of proposed construction method in error-floor region under base graph 2 (BG2) using 5G eMBB standard length adaption method.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134398767","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}
{"title":"Secure Information Exchange in Defining the Location of the Vehicle","authors":"Vadim V. Davydov, S. Bezzateev","doi":"10.1109/TSP.2018.8441262","DOIUrl":"https://doi.org/10.1109/TSP.2018.8441262","url":null,"abstract":"With the advent of the electric vehicle market, the problem of locating a vehicle is becoming more and more important. Smart roads are creating, where the car control system can work without a person - communicating with the elements on the road. The standard technologies, such as GPS, can't always accurately determine the location, and not all vehicles have a GPS-module. It is very important to build an effective secure communication protocol between the vehicle and the base stations on the road. In this paper we consider different methods of location determination, propose the improved communicating protocol between the vehicle and the base station.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114868018","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}
{"title":"Clothing Color Based De-Identification","authors":"J. Prinosil","doi":"10.1109/TSP.2018.8441413","DOIUrl":"https://doi.org/10.1109/TSP.2018.8441413","url":null,"abstract":"Color of clothing can be easily used in the process of people identification as a non-biometric trait. This trait would be modified appropriately to preserve personal anonymity in social media or in video surveillance systems. This paper deals with a proposal of new method for clothing color de-identification in image records. The method consists of silhouette segmentation and clothing color segmentation algorithms. The de-identification is done by modifying components of HSV color space upon segmented clothing. The process of de-identification is reversible, i.e. original clothing color can be restored in case of transformation parameters that were used are known.","PeriodicalId":383018,"journal":{"name":"2018 41st International Conference on Telecommunications and Signal Processing (TSP)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116125027","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}