Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659796
T. Baykaş, A. Yongaçoğlu
In this paper, we investigate the performance of several advanced discrete-time RAKE receivers under the effect of channel statistics estimation errors. The name of the first receiver is the decorrelating discrete-time RAKE receiver (D-DTR), which improves the performance in the presence of channel estimation errors in diffuse channels. The second receiver is the discrete-time version of the generalized RAKE (G-DTR) receiver. The G-DTR has been proposed for correlated interference mitigation. The last system is the generalized decorrelating discrete-time RAKE receiver (GD-DTR), which combines the benefits of the D-DTR and the G-DTR. In the literature, it is shown that the D-DTR is sensitive to the estimation of the channel covariance matrix. In this work, we reduced this sensitivity and according to our results in worst case scenario the performance of the D-DTR is equal to a conventional discrete-time RAKE receiver (C-DTR). For the case of the GD-DTR, we introduce a very simple method for the estimation of the noise plus interference statistics and we modify the channel statistics estimation method of the D-DTR to be valid for the GD-DTR. Our simulations show that the GD-DTR needs an estimation quality above some threshold for a performance gain compared to the C-DTR
{"title":"Performance of Advanced Discrete-Time RAKE Receivers","authors":"T. Baykaş, A. Yongaçoğlu","doi":"10.1109/SIU.2006.1659796","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659796","url":null,"abstract":"In this paper, we investigate the performance of several advanced discrete-time RAKE receivers under the effect of channel statistics estimation errors. The name of the first receiver is the decorrelating discrete-time RAKE receiver (D-DTR), which improves the performance in the presence of channel estimation errors in diffuse channels. The second receiver is the discrete-time version of the generalized RAKE (G-DTR) receiver. The G-DTR has been proposed for correlated interference mitigation. The last system is the generalized decorrelating discrete-time RAKE receiver (GD-DTR), which combines the benefits of the D-DTR and the G-DTR. In the literature, it is shown that the D-DTR is sensitive to the estimation of the channel covariance matrix. In this work, we reduced this sensitivity and according to our results in worst case scenario the performance of the D-DTR is equal to a conventional discrete-time RAKE receiver (C-DTR). For the case of the GD-DTR, we introduce a very simple method for the estimation of the noise plus interference statistics and we modify the channel statistics estimation method of the D-DTR to be valid for the GD-DTR. Our simulations show that the GD-DTR needs an estimation quality above some threshold for a performance gain compared to the C-DTR","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126998699","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659689
A. Kaya, E. Y. Yuksel
Impedance matching networks are used extensively in radio communications. In this study Pi matching circuit has been used. This circuit impedance region has been investigated analytically under the variable load condition. The rectangular microstrip antenna was designed at 2.5 GHz frequency by using microstrip feed line. Better return loss level has been obtained for this antenna using pi matching circuit. It is shown that theoretical, simulation and laboratory results are good agreement
{"title":"The Performance Analysis of the Antenna System Designed by Using The PI Matching Circuit","authors":"A. Kaya, E. Y. Yuksel","doi":"10.1109/SIU.2006.1659689","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659689","url":null,"abstract":"Impedance matching networks are used extensively in radio communications. In this study Pi matching circuit has been used. This circuit impedance region has been investigated analytically under the variable load condition. The rectangular microstrip antenna was designed at 2.5 GHz frequency by using microstrip feed line. Better return loss level has been obtained for this antenna using pi matching circuit. It is shown that theoretical, simulation and laboratory results are good agreement","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132759067","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659684
S. Altunkaya, M. Bayrak
The aim of this study is to help to improve new diagnosis methods for cardiovascular disease by designing a computer program and a hardware which realizes the recording of Korotkoff sounds produced during the measurement of blood pressure and basic analysis process. Korotkoff sounds have been traditionally used to measure blood pressure noninvasively by employing the auscultatory method. The recording system developed in this study can be used to produce a large database by recording some important information such as weight, age, and disease name in addition to Korotkoff sounds. Basic analysis processes like filtering and finding frequency component of recorded data is accomplished by means of the designed software. Thus, the necessity of using different computer programs for analyzing and recording data has been eliminated
{"title":"Recording System For Korotkoff Sound Signals","authors":"S. Altunkaya, M. Bayrak","doi":"10.1109/SIU.2006.1659684","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659684","url":null,"abstract":"The aim of this study is to help to improve new diagnosis methods for cardiovascular disease by designing a computer program and a hardware which realizes the recording of Korotkoff sounds produced during the measurement of blood pressure and basic analysis process. Korotkoff sounds have been traditionally used to measure blood pressure noninvasively by employing the auscultatory method. The recording system developed in this study can be used to produce a large database by recording some important information such as weight, age, and disease name in addition to Korotkoff sounds. Basic analysis processes like filtering and finding frequency component of recorded data is accomplished by means of the designed software. Thus, the necessity of using different computer programs for analyzing and recording data has been eliminated","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134010889","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659692
T. Yerlikaya, E. Bulus, N. Bulus
In this study, first of all, we categorized encryption algorithms and exposed the structure and specifications of the symmetric and asymmetric algorithms. We explained that asymmetric encryption algorithms are based on hard problems (NP) and explained what these problems are. In addition, we showed how addition and doubling are realized on the elliptic curves and which theorems are used for that. We also showed how we can use Elliptic curves, which are very important development for asymmetric cryptosystems, in encryption process and explained how ECC algorithm using elliptic curves realize encryption and decryption process. As a result, we developed ECC application showing numerical results to compare with other asymmetric encryption algorithms in view of security
{"title":"Arithmatic of Elliptic Curves and Use in Cryptography","authors":"T. Yerlikaya, E. Bulus, N. Bulus","doi":"10.1109/SIU.2006.1659692","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659692","url":null,"abstract":"In this study, first of all, we categorized encryption algorithms and exposed the structure and specifications of the symmetric and asymmetric algorithms. We explained that asymmetric encryption algorithms are based on hard problems (NP) and explained what these problems are. In addition, we showed how addition and doubling are realized on the elliptic curves and which theorems are used for that. We also showed how we can use Elliptic curves, which are very important development for asymmetric cryptosystems, in encryption process and explained how ECC algorithm using elliptic curves realize encryption and decryption process. As a result, we developed ECC application showing numerical results to compare with other asymmetric encryption algorithms in view of security","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122373175","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659848
E. Esen, A. Alatan
A new concept is introduced to data hiding field. This concept, which is named as forbidden zone, corresponds to the region where it is forbidden to alter the host signal. A new data hiding method is devised depending on forbidden zone. The proposed method is formulated by using a single control parameter and quantizers. Using uniform source and uniform quantizers the proposed method is theoretically shown to be superior than QIM in 1D. The obtained theoretical result is also verified by experiments.
{"title":"A New Concept in Data Hiding: Forbidden Zone","authors":"E. Esen, A. Alatan","doi":"10.1109/SIU.2006.1659848","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659848","url":null,"abstract":"A new concept is introduced to data hiding field. This concept, which is named as forbidden zone, corresponds to the region where it is forbidden to alter the host signal. A new data hiding method is devised depending on forbidden zone. The proposed method is formulated by using a single control parameter and quantizers. Using uniform source and uniform quantizers the proposed method is theoretically shown to be superior than QIM in 1D. The obtained theoretical result is also verified by experiments.","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121239071","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}
Kıvan¸c K¨ose, A. Enis, C¸etin, Uˇgur G¨ud¨ukbay, L. Onural
We propose a new set partitioning in hierarchical trees (SPIHT) based mesh compression framework. The 3D mesh is first transformed to 2D images on a regular grid structure. Then, this image-like representation is wavelet transformed and SPIHT is applied on the wavelet domain data. The method is progressive because the resolution of the reconstructed mesh can be changed by varying the length of the one-dimensional data stream created by SPIHT algorithm. Nearly perfect reconstruction is possible if all of the data stream is received
{"title":"(Nonrectangular Wavelets for Multiresolution Mesh Analysis and Compression)","authors":"Kıvan¸c K¨ose, A. Enis, C¸etin, Uˇgur G¨ud¨ukbay, L. Onural","doi":"10.1117/12.666702","DOIUrl":"https://doi.org/10.1117/12.666702","url":null,"abstract":"We propose a new set partitioning in hierarchical trees (SPIHT) based mesh compression framework. The 3D mesh is first transformed to 2D images on a regular grid structure. Then, this image-like representation is wavelet transformed and SPIHT is applied on the wavelet domain data. The method is progressive because the resolution of the reconstructed mesh can be changed by varying the length of the one-dimensional data stream created by SPIHT algorithm. Nearly perfect reconstruction is possible if all of the data stream is received","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129070022","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659679
G. Karabulut, T. Kurt, A. Yongaçoğlu
In this paper, we study the application of sequential basis selection (SBS) algorithms in two different communication problems. These problems represent different cases in terms of the structure of their set of equations. The two considered cases are; undercomplete set of equations (sparse channel estimation problem) and overcomplete set of equations. These cases are carefully selected in order to demonstrate that SBS algorithms can be applied to both types of equations. The basic matching pursuit (BMP) and the orthogonal matching pursuit (OMP) algorithms are selected as the SBS algorithms. In sparse channel estimation problem, the BMP and the OMP algorithms are compared with the least square channel estimates and the minimum variance unbiased estimates (MVUE). It is shown that the OMP algorithm gives estimates that are almost converging to MVUE. In angle of arrival (AOA) detection problem, the detection performances of the BMP and OMP algorithms are compared with the well known MUSIC algorithm and the Cramer Rao bounds. It is shown that their performances exceed that of MUSIC for correlated signals
{"title":"Applications of Basis Selection Algorithms in Communication Problems","authors":"G. Karabulut, T. Kurt, A. Yongaçoğlu","doi":"10.1109/SIU.2006.1659679","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659679","url":null,"abstract":"In this paper, we study the application of sequential basis selection (SBS) algorithms in two different communication problems. These problems represent different cases in terms of the structure of their set of equations. The two considered cases are; undercomplete set of equations (sparse channel estimation problem) and overcomplete set of equations. These cases are carefully selected in order to demonstrate that SBS algorithms can be applied to both types of equations. The basic matching pursuit (BMP) and the orthogonal matching pursuit (OMP) algorithms are selected as the SBS algorithms. In sparse channel estimation problem, the BMP and the OMP algorithms are compared with the least square channel estimates and the minimum variance unbiased estimates (MVUE). It is shown that the OMP algorithm gives estimates that are almost converging to MVUE. In angle of arrival (AOA) detection problem, the detection performances of the BMP and OMP algorithms are compared with the well known MUSIC algorithm and the Cramer Rao bounds. It is shown that their performances exceed that of MUSIC for correlated signals","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129048988","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659795
B. Metin, E. Yuce, O. Cicekoglu
Negative impedance converter (NIC) is a useful component in the circuit synthesis theory especially for active RC filter design. In this paper, usefulness of the NIC is shown in a floating inductance realization topology that is an alternative application area for the component. A new floating parallel RL realization topology employing two negative impedance converters and three passive components is presented
{"title":"Floating Lossy Inductance Simulator with Negative Impedance Converters","authors":"B. Metin, E. Yuce, O. Cicekoglu","doi":"10.1109/SIU.2006.1659795","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659795","url":null,"abstract":"Negative impedance converter (NIC) is a useful component in the circuit synthesis theory especially for active RC filter design. In this paper, usefulness of the NIC is shown in a floating inductance realization topology that is an alternative application area for the component. A new floating parallel RL realization topology employing two negative impedance converters and three passive components is presented","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116919990","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659747
S. Değer, Birsen Saka, Elektrik Ve Elektronik, Muihendisligi B6lumui
In this study, performance of the array signal processing algorithms which are used for interference mitigation in radar and communication systems is analyzed while regarding the electromagnetic properties of the antenna elements. In real world applications electromagnetic characteristics of the antenna array have very significant effect on the performance of the algorithms and sometimes may cause a complete fail of the process. In the paper, particularly, effects of the mutual coupling are presented. Performances of the Schelkunoff array synthesis method, least-squares (LS) method and the least mean square (LMS) algorithms for interference suppression in adaptive array with dipole elements are analyzed. Null depth, nulling bandwidth, signal to interference plus noise ratio (SINR) and the changes in the fundamental properties of the array pattern are observed for different scenarios
{"title":"Effect of Mutual Coupling on the Performance of Adaptive Arrays","authors":"S. Değer, Birsen Saka, Elektrik Ve Elektronik, Muihendisligi B6lumui","doi":"10.1109/SIU.2006.1659747","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659747","url":null,"abstract":"In this study, performance of the array signal processing algorithms which are used for interference mitigation in radar and communication systems is analyzed while regarding the electromagnetic properties of the antenna elements. In real world applications electromagnetic characteristics of the antenna array have very significant effect on the performance of the algorithms and sometimes may cause a complete fail of the process. In the paper, particularly, effects of the mutual coupling are presented. Performances of the Schelkunoff array synthesis method, least-squares (LS) method and the least mean square (LMS) algorithms for interference suppression in adaptive array with dipole elements are analyzed. Null depth, nulling bandwidth, signal to interference plus noise ratio (SINR) and the changes in the fundamental properties of the array pattern are observed for different scenarios","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117223982","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659771
M. S. Erden, K. Leblebicioğlu
This paper dwells upon the torque distribution of a six-legged robot considering minimum energy consumption. This distribution, named "torque distribution", is performed by minimizing the square-sum of the joint torques. For multi-legged robots the conventional approach is to perform the force-moment distribution by minimizing the square-sum of the tip point force components. This general approach of "force distribution" is compared with the proposed approach of "torque distribution" and it is concluded that "torque distribution" is more energy efficient
{"title":"Torque Distribution for a Six-Legged Robot","authors":"M. S. Erden, K. Leblebicioğlu","doi":"10.1109/SIU.2006.1659771","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659771","url":null,"abstract":"This paper dwells upon the torque distribution of a six-legged robot considering minimum energy consumption. This distribution, named \"torque distribution\", is performed by minimizing the square-sum of the joint torques. For multi-legged robots the conventional approach is to perform the force-moment distribution by minimizing the square-sum of the tip point force components. This general approach of \"force distribution\" is compared with the proposed approach of \"torque distribution\" and it is concluded that \"torque distribution\" is more energy efficient","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115209160","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
扫码关注我们
求助内容：
应助结果提醒方式：