{"title":"Modified Sphere Detection algorithm with decreased bit error rate and lower complexity","authors":"F. E. Hosseini, A. Salahi, S. Shirvani","doi":"10.1109/ISTEL.2008.4651318","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651318","url":null,"abstract":"There are many maximum likelihood (ML) solutions to the detection problem for multiple-input multiple-output systems (MIMO). Recently, sphere detection (SD) method has been used as a powerful mean to find ML point. This method searches closest lattice point using number theory tools. Several algorithms for SD method were presented and among them, the algorithm II is an efficient one. In different papers, some adjustments to this algorithm were proposed to reduce its complexity. In this paper, to improve the performance and to reduce the complexity of algorithm II, two suggestions are proposed. Simulation results, confirm the improvements over the last version of this algorithm.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121392293","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}
M.T. Vakil Baghmisheh, M. Alinia Ahandani, M. Talebi
{"title":"Frequency modulation sound parameter identification using novel hybrid evolutionary algorithms","authors":"M.T. Vakil Baghmisheh, M. Alinia Ahandani, M. Talebi","doi":"10.1109/ISTEL.2008.4651273","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651273","url":null,"abstract":"The frequency modulation sound parameter identification is a complex multimodal optimization problem. In this paper, we proposed four evolutionary hybrid algorithms to solve this problem. First we combine genetic algorithm (GA) and queen-bee algorithm (QB) with a random optimization method (RO) and generate memetic and QB-memetic hybrid algorithms, respectively; then modified Nelder-Mead simplex algorithm (MNM) combine with particle swarm optimization (PSO) and differential evolution (DE) algorithms and generate MNM-PSO and MNM-DE hybrid algorithms, respectively. The proposed algorithms are compared in terms of three measures: success rate, average values of the cost function in all successful runs, and the minimum cost in 20 runs. The obtained results demostrate the proposed hybrid algorithms have the better performance than their non-hybrid competitors in the most times. Also The PSO has the best minimum and average value of the cost function and the MNM-PSO has the best success rate.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114891984","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":"Speech enhancement using combinational adaptive filtering","authors":"A. Abdollahy, M. Geravanchizadeh","doi":"10.1109/ISTEL.2008.4651404","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651404","url":null,"abstract":"Combination approaches provide an interesting way to improve adaptive filter performance. In this paper, we use one of such approaches known as dasiaconvex combination of two transversal filterspsila for speech enhancement. In addition, both fixed and variable step size cases are examined. As our simulation results show, the variable step size version of the algorithm outperforms the other case in a sense of convergence rate and steady-state error.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130689779","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":"Code-shifted reference for internally coded time hopping UWB communication system","authors":"M. A. Sedaghat, M. N. Kenari","doi":"10.1109/ISTEL.2008.4651302","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651302","url":null,"abstract":"In this paper, we consider a code-shifted reference (CSR) for the previously introduced internally coded time hopping UWB communication systems in order to avoid channel estimation. We evaluate the performance of our proposed scheme and compare the results with those of the uncoded coded-shifted reference (CSR) UWB system. Our numerical results show the substantial performance improvement when using the proposed scheme compared to the uncoded CSR system.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131893273","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":"Performance analysis of optical CDMA systems using APD for two types of receiver structures in the presence of interference and receiver noise","authors":"A. Sabbagh, M. M. Kakhki, M. Mirsalehi","doi":"10.1109/ISTEL.2008.4651295","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651295","url":null,"abstract":"In this paper, a rigorous performance analysis of optical CDMA (OCDMA) systems is presented for three different structures. These structures are on-off orthogonal (OOO), on-off orthogonal with single optical hard limiter (OOO-SHL) and on-off orthogonal with double optical hard limiters (OOO-DHL). For each of the above schemes two types of receiver structures is evaluated. The approximation for an avalanche photodiode (APD) output where the effect of APD noise, thermal noise and interference are included. Also, the numerical results have been plotted.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133388616","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":"The supertree of the compact codes","authors":"H. Narimani, M. Khosravifard","doi":"10.1109/ISTEL.2008.4651381","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651381","url":null,"abstract":"An instantaneous D-ary code which minimizes the average codeword length for an information source is called a compact code. It is known that for a D-ary compact code with codeword lengths lscr<sub>1</sub>,lscr<sub>2</sub>,.....,lscr<sub>n</sub> (where n is the form of n=k(D-1)+1 for some positive integer k ), we have SigmaD<sup>-lscr</sup> <sub>i</sub> = 1 . Since construction of n D-ary codewords given codeword lengths lscr<sub>1</sub>,lscr<sub>2</sub>,.....,lscr<sub>n</sub> is a straight forward task, we generate all possible codeword length sequences. In this paper, we present an algorithm which gets all compact codes with k(D-1)+1 codewords and generates all compact codes with (k+1)(D-1)+1 codewords. Based on this algorithm, ST <sup>n</sup>(D), the supertree of all D-ary compact codes, is introduced. Any node in the m-th level of ST <sup>n</sup>(D) is associated with a unique compact code with 2D-1+m(D-1) codewords. Following the proposed approach, any D-ary compact code with n codewords can be represented by lceil(n-1)/(D-1)rceil-2 bits.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124336255","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":"Performance enhancement for TCP Vegas in Slow Start phase over a satellite link","authors":"S. Servati, H. Taheri, M. N. Moghaddam","doi":"10.1109/ISTEL.2008.4651355","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651355","url":null,"abstract":"Space communication protocol standard-transport protocol (SCPS-TP) is an acceleration protocol, used to improve the performance of TCP protocol over satellite links. Because of the everyday improvements in satellite communication technology, the amount of bandwidth offered by satellite links is growing more and more. The issue of using this growing bandwidth by SCPS-TP as efficient as possible is an open research area. TCP-Vegas is the congestion control mechanism used by SCPS-TP. The performance of TCP-Vegas is under utilized in slow start phase of the connection, when being used over satellite links with high bandwidth and high round trip delay. In this paper we discuss the performance of TCP-Vegas in slow start phase and propose a new pacing method to solve the problem. Also, we suggest using ssthresh to avoid premature exit from slow start phase. In this research we use NS2 simulation environment to investigate the performance of these solutions.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123925145","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":"Minimum power intelligent routing in wireless sensors networks using self organizing neural networks","authors":"H. Shahbazi, M. Araghizadeh, M. Dalvi","doi":"10.1109/ISTEL.2008.4651327","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651327","url":null,"abstract":"The routing problem in wireless sensor networks is one of the most important issues that guarantee the optimum functionality of a sensor network. Due to the energy limitation of each node in a sensor network, routing should be done in a way that the overall network life time will be maximized. In this paper we present an intelligent method based on self organizing neural networks which optimizes the routing according to the amount of energy of each node in the network and its computation power.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121190499","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":"Blockage mitigation in adaptive rate land mobile satellite links using cooperative ARQ","authors":"M. Mardani, B. Eliasi, F. Lahouti, J. S. Harsini","doi":"10.1109/ISTEL.2008.4651392","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651392","url":null,"abstract":"In this paper, we consider efficient communication over land mobile satellite channels (LMSC) based on a cooperative automatic repeat request (ARQ) strategy. Specifically, we propose a cross-layer design which combines adaptive modulation and coding (AMC) at the physical layer with cooperative truncated ARQ protocol at the data link layer. We first derive a closed form expression for the spectral efficiency in this setting. Aiming at maximizing this performance measure, we then optimize an AMC scheme which directly satisfies a prescribed packet loss rate constraint at the data-link layer. The results indicate that utilizing cooperative diversity to mitigate channel blockage in a LMSC, noticeably enhances the spectral efficiency compared with the system that employs only AMC at the physical layer. Moreover, the proposed combining scheme outperforms the fixed rate cooperative ARQ when the transmission rates at the source and relay are chosen based on channel statistics.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129022450","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":"Design and fabrication of a DVB-RCS tester platform in Ka-band","authors":"R. Solat, R. Khosravi, P. Parvand, N. Molanian","doi":"10.1109/ISTEL.2008.4651279","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651279","url":null,"abstract":"High quality digital video broadcasting by satellite links is a recent satellite broadband service. This service is applicable through satellite links by a DVB-RCS network. The new generation of these systems operate at Ka-band frequency range in different digital modulations with 2 to 50 Mbps bit-rates, it is necessary to facilitate tester platforms to generate different digital modulations in Ka-band, and to evaluate different DVB-RCS demodulators. In this paper the method of implementation for this platform, utilizing MMIC devices and Lab-equipments in Ka-band is presented.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115484266","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}