T. Kuriyama, H. Yoshida, A. Taira, F. Maehara, F. Takahata
This paper presents the performance of periodic spectrum transmission for single-carrier with frequency-domain equalization (SC-FDE) using channel coding. So far, we have proposed periodic spectrum transmission and showed the effectiveness of enhancing a frequency diversity benefit compared with the typical case when adopting a low rate transmission such as 1-bit/sample. In this paper, the impact of channel coding on the proposed scheme is intensively discussed compared with coded OFDM (COFDM) as well as the typical SC-FDE. This is because OFDM is sure to be the promising approach when taking channel coding into account. Computer simulation results show that the proposed scheme 1-bit/sample transmission outperforms COFDM irrespective of coding rate.
{"title":"Performance of Periodic Spectrum Transmission for Single-Carrier with Frequency-Domain Equalization using Channel Coding","authors":"T. Kuriyama, H. Yoshida, A. Taira, F. Maehara, F. Takahata","doi":"10.1109/CCE.2006.350852","DOIUrl":"https://doi.org/10.1109/CCE.2006.350852","url":null,"abstract":"This paper presents the performance of periodic spectrum transmission for single-carrier with frequency-domain equalization (SC-FDE) using channel coding. So far, we have proposed periodic spectrum transmission and showed the effectiveness of enhancing a frequency diversity benefit compared with the typical case when adopting a low rate transmission such as 1-bit/sample. In this paper, the impact of channel coding on the proposed scheme is intensively discussed compared with coded OFDM (COFDM) as well as the typical SC-FDE. This is because OFDM is sure to be the promising approach when taking channel coding into account. Computer simulation results show that the proposed scheme 1-bit/sample transmission outperforms COFDM irrespective of coding rate.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130211600","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}
Ad hoc network is an extensive research area in wireless communications nowadays, and is particularly studied under energy constraints, since energy consumption of the network should be minimized. The physical layer (power control), link layer (scheduling), and network layer (routing) are known to have great impact on network performance as well as on power consumption. In this paper, we present an optimization problem that there may exist a power vector that minimizes the overall transmission power of the network which at the same time supports a particular data rate on each link and satisfies the SINR and maximum transmission power constraints at each node. We also formulate an optimization problem where we use both the energy consumed of each node in the routing path and the delay associated on each link as link costs. We provide numerical examples for our schemes and relationships between the parameters. An overview of our intended routing algorithm for ad hoc networks is also given as a preliminary step towards our distributed joint scheduling, power control and routing algorithm for ad hoc networks using cross layer approach.
{"title":"Link Scheduling, Power Control, and Routing in Ad Hoc Wireless Networks: A Joint Optimization","authors":"R. Casaquite, W. Hwang","doi":"10.1109/CCE.2006.350846","DOIUrl":"https://doi.org/10.1109/CCE.2006.350846","url":null,"abstract":"Ad hoc network is an extensive research area in wireless communications nowadays, and is particularly studied under energy constraints, since energy consumption of the network should be minimized. The physical layer (power control), link layer (scheduling), and network layer (routing) are known to have great impact on network performance as well as on power consumption. In this paper, we present an optimization problem that there may exist a power vector that minimizes the overall transmission power of the network which at the same time supports a particular data rate on each link and satisfies the SINR and maximum transmission power constraints at each node. We also formulate an optimization problem where we use both the energy consumed of each node in the routing path and the delay associated on each link as link costs. We provide numerical examples for our schemes and relationships between the parameters. An overview of our intended routing algorithm for ad hoc networks is also given as a preliminary step towards our distributed joint scheduling, power control and routing algorithm for ad hoc networks using cross layer approach.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117278130","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}
We propose and theoretically analyze the performance of two-dimensional wavelength hopping/time spreading optical code division multiplexing (2-D WH/TS OCDM) systems using heterodyne detection receiver and pulse-position modulation (PPM) signaling The analysis is carried out taking into account various kinds of noise and interference, including multiple access interference (MAI), optical beating interference (OBI), crosstalk and receiver's noise. We compare the performance of the proposed system with the one using OOK signaling. Numerical results show the improvement in both number of users and optical power gain. In particular, when the PPM signaling with M = 4 is used, we can achieve a more than 6 times increase in the number of users and an optical power gain of 15 dB in comparison with the conventional system.
{"title":"Novel 2-D Wavelength Hopping/Time Spreading OCDM System using Heterodyne Detection Receiver and PPM Signaling","authors":"A. Pham, H. Yashima","doi":"10.1109/CCE.2006.350821","DOIUrl":"https://doi.org/10.1109/CCE.2006.350821","url":null,"abstract":"We propose and theoretically analyze the performance of two-dimensional wavelength hopping/time spreading optical code division multiplexing (2-D WH/TS OCDM) systems using heterodyne detection receiver and pulse-position modulation (PPM) signaling The analysis is carried out taking into account various kinds of noise and interference, including multiple access interference (MAI), optical beating interference (OBI), crosstalk and receiver's noise. We compare the performance of the proposed system with the one using OOK signaling. Numerical results show the improvement in both number of users and optical power gain. In particular, when the PPM signaling with M = 4 is used, we can achieve a more than 6 times increase in the number of users and an optical power gain of 15 dB in comparison with the conventional system.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125151568","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}
B. Moon, Jeonghoon Mo, J. Ryoo, S. Chong, Hoyoung Song
Most proposed system objectives such as max-min fairness or proportional fairness are based on the bandwidth of application. However, satisfaction of end users may not be proportional to the bandwidth itself. In this paper, we propose a simple algorithm to achieve so called utility max-min fairness, in which all users can achieve fairness in the application level not in the bandwidth level. Our algorithm is based on XCP and we modified the end user side slightly but not the router side for the sake of scalability. We showed the performance of our algorithm with simulations.
{"title":"A Flow Control Algorithm Achieving Application Level Fairness","authors":"B. Moon, Jeonghoon Mo, J. Ryoo, S. Chong, Hoyoung Song","doi":"10.1109/CCE.2006.350831","DOIUrl":"https://doi.org/10.1109/CCE.2006.350831","url":null,"abstract":"Most proposed system objectives such as max-min fairness or proportional fairness are based on the bandwidth of application. However, satisfaction of end users may not be proportional to the bandwidth itself. In this paper, we propose a simple algorithm to achieve so called utility max-min fairness, in which all users can achieve fairness in the application level not in the bandwidth level. Our algorithm is based on XCP and we modified the end user side slightly but not the router side for the sake of scalability. We showed the performance of our algorithm with simulations.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115591643","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}
The application of path computation elements (PCEs) has been widely discussed to reduce route calculation burden from GMPLS nodes. Current PCE proposals, however, have not yet covered path backup schemes, which is prerequisite for providing tremendous capacity such as core optical networks. We already presented a hierarchically distributed path computation element (HDPCE) architecture to improve existing PCE techniques. In this paper, we describe detailed path backup methods performed by HDPCEs to demonstrate the promising potential of HDPCE architecture. The key idea is the interdomain HDPCE, which manages the bridging optical domains, stores shared risk link group (SRLG) information, and discovers accurate disjointed SRLG backups. The proposed technique is sufficiently flexible to allow three variants of path backup methods that are commonly required in commercial networks. We analyze the features and performance of three types of path-backup methods. We also show the superiority of the proposed HDPCE-based backup methods compared to legacy OSPF-based backup methods in terms of path accommodation and processing time.
{"title":"Hierarchically distributed PCE for backup strategies on an optical network","authors":"H. Matsuura, N. Morita, T. Murakami, K. Takami","doi":"10.1109/CCE.2006.350841","DOIUrl":"https://doi.org/10.1109/CCE.2006.350841","url":null,"abstract":"The application of path computation elements (PCEs) has been widely discussed to reduce route calculation burden from GMPLS nodes. Current PCE proposals, however, have not yet covered path backup schemes, which is prerequisite for providing tremendous capacity such as core optical networks. We already presented a hierarchically distributed path computation element (HDPCE) architecture to improve existing PCE techniques. In this paper, we describe detailed path backup methods performed by HDPCEs to demonstrate the promising potential of HDPCE architecture. The key idea is the interdomain HDPCE, which manages the bridging optical domains, stores shared risk link group (SRLG) information, and discovers accurate disjointed SRLG backups. The proposed technique is sufficiently flexible to allow three variants of path backup methods that are commonly required in commercial networks. We analyze the features and performance of three types of path-backup methods. We also show the superiority of the proposed HDPCE-based backup methods compared to legacy OSPF-based backup methods in terms of path accommodation and processing time.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129768711","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}
The expansion of the Internet and the development of a ubiquitous society are expected to bring about the convergence of ubiquitous networking technology and Web technology, which in turn will provide opportunities for the creation of entirely new services. In this paper, we propose a Web service tuned to individual users by integrating Internet home appliances (specifically weight scales) and Web service technology, and we discuss how it should be constructed. We further propose a system that holds VXML-written scenarios as metadata of Web pages, which enables Web page browsing to be controlled using voice dialog. We have built a prototype of the personal Web service including the use of Internet home appliances, and confirmed the system's feasibility. For the voice dialog, we have created VXML-defined metadata and carried out a desktop verification of the correspondence between Web page information and the associated dialog scenario.
{"title":"A study on the architecture and voice dialog scheme for a personal Web service in a ubiquitous communication environment","authors":"K. Takami, T. Yamaguchi, K. Unno","doi":"10.1109/CCE.2006.350883","DOIUrl":"https://doi.org/10.1109/CCE.2006.350883","url":null,"abstract":"The expansion of the Internet and the development of a ubiquitous society are expected to bring about the convergence of ubiquitous networking technology and Web technology, which in turn will provide opportunities for the creation of entirely new services. In this paper, we propose a Web service tuned to individual users by integrating Internet home appliances (specifically weight scales) and Web service technology, and we discuss how it should be constructed. We further propose a system that holds VXML-written scenarios as metadata of Web pages, which enables Web page browsing to be controlled using voice dialog. We have built a prototype of the personal Web service including the use of Internet home appliances, and confirmed the system's feasibility. For the voice dialog, we have created VXML-defined metadata and carried out a desktop verification of the correspondence between Web page information and the associated dialog scenario.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128618681","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}
One of objectives of the future 4G mobile network is to provide broadband connection to mobile users regardless of their speed. Microcellular-based mobile networks must be an essential one in the 4G mobile generation from the view of rich radio resource for multimedia communications. This paper presents the architecture of MM-MAN (mobile multimedia metropolitan area network) network of which target is to become one of mobile network candidates for the 4G systems. In this mobile network, high-bit rate packet transfer is stably guaranteed even to FMTs (fast moving terminals) by the operation of an LMC (logical macro cell) and parallel polling. The mechanism easily allows 5Mbps packet transfer to terminals with speed of 100km/h. To enable synchronization of parallel polling, ACK of polling is multicast to BSs in the same LMC through the backbone network. The time the polling ACK multicast transmitted in the terrestrial network is a significant factor that will decide the throughput of mobile terminals. Owing to PON (passive optical network), which constructs the terrestrial network of MM-MAN, parallel polling and LMC can be done easily. A key advantage of PON over MM-MAN is its high bandwidth broadcast functionality that can turn into multicast without vulnerability to its bandwidth is used to enable parallel polling and the LMC operation. In the case of EPON with static slot allocation scheme, ACK multicast time depends on the grant time for each ONU and the number of ONUs connected to an OLT on one fiber. From our evaluation, if the ACK multicast delivered in PON from 0.5 to 4ms, the throughput that a mobile terminal can get is from 25Mbps to 5Mbps for the case of 1500bytes of packet size. The PON system can work adaptively to fasten ACK multicast if the number of ONUs on which a base station stands connected to an optical line terminal (OLT) is 16.
未来4G移动网络的目标之一是为移动用户提供宽带连接，而不管他们的速度如何。从丰富的多媒体通信无线资源来看，基于微蜂窝的移动网络必然是4G移动时代必不可少的网络。本文提出了移动多媒体城域网(MM-MAN)的网络结构，其目标是成为4G系统的移动候选网之一。在这种移动网络中，通过逻辑宏单元(LMC)和并行轮询的操作，即使对FMTs(快速移动终端)也能稳定地保证高比特率的数据包传输。该机制可以轻松地将5Mbps的数据包传输到速度为100km/h的终端。为了实现并行轮询的同步，轮询的ACK通过骨干网组播给同一LMC中的BSs。轮询ACK组播在地面网络中的传输时间是决定移动终端吞吐量的重要因素。由于无源光网络PON (passive optical network)构成了MM-MAN地面网络，使得并行轮询和LMC可以很容易地实现。PON相对于MM-MAN的一个关键优势是它的高带宽广播功能，可以转换成多播而不受带宽的影响，用于实现并行轮询和LMC操作。对于采用静态时隙分配方案的EPON, ACK组播时间取决于每个ONU的授予时间和一根光纤连接到OLT上的ONU数量。从我们的评估来看，如果在PON中发送的ACK组播从0.5到4ms，在1500字节的数据包大小的情况下，移动终端可以获得的吞吐量从25Mbps到5Mbps。当一个基站连接到OLT (optical line terminal)的onu个数为16时，PON系统可以自适应地实现ACK组播。
{"title":"The Architecture of Mobile Multimedia Metropolitan Area Network towards the Future of the 4G Mobile System","authors":"P. T. Hoa, M. Eusuf, T. Yamada","doi":"10.1109/CCE.2006.350859","DOIUrl":"https://doi.org/10.1109/CCE.2006.350859","url":null,"abstract":"One of objectives of the future 4G mobile network is to provide broadband connection to mobile users regardless of their speed. Microcellular-based mobile networks must be an essential one in the 4G mobile generation from the view of rich radio resource for multimedia communications. This paper presents the architecture of MM-MAN (mobile multimedia metropolitan area network) network of which target is to become one of mobile network candidates for the 4G systems. In this mobile network, high-bit rate packet transfer is stably guaranteed even to FMTs (fast moving terminals) by the operation of an LMC (logical macro cell) and parallel polling. The mechanism easily allows 5Mbps packet transfer to terminals with speed of 100km/h. To enable synchronization of parallel polling, ACK of polling is multicast to BSs in the same LMC through the backbone network. The time the polling ACK multicast transmitted in the terrestrial network is a significant factor that will decide the throughput of mobile terminals. Owing to PON (passive optical network), which constructs the terrestrial network of MM-MAN, parallel polling and LMC can be done easily. A key advantage of PON over MM-MAN is its high bandwidth broadcast functionality that can turn into multicast without vulnerability to its bandwidth is used to enable parallel polling and the LMC operation. In the case of EPON with static slot allocation scheme, ACK multicast time depends on the grant time for each ONU and the number of ONUs connected to an OLT on one fiber. From our evaluation, if the ACK multicast delivered in PON from 0.5 to 4ms, the throughput that a mobile terminal can get is from 25Mbps to 5Mbps for the case of 1500bytes of packet size. The PON system can work adaptively to fasten ACK multicast if the number of ONUs on which a base station stands connected to an optical line terminal (OLT) is 16.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128709909","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}
In consideration of the exact matching characteristic of RIB lookups, we explore the applicability of hashing-based approaches for RIB management and evaluate their performance. Using real routing prefixes, we compare the efficiency of six different hash approaches mentioned in some papers about IP lookups: bit extraction from the routing prefix, CRC16 (cyclic redundancy checking polynomials), CRC32, Fletcher checksum, folding of prefix octets for using the exclusive-or operation and multiplication. This is the first comprehensive study of their performance using real core routing tables. We find that extracting the least significant bits from the routing prefix is a very efficient hash approach for RIB management. Then a RIB management scheme based on this hash approach is proposed. We use separate chaining as the collision resolution strategy, while not suffering from malloc/free overhead for frequent insertion or deletion. To keep the memory storage moderate, we set the hash table sizes based on the distribution of prefix lengths because it is not expected to change significantly with time. Through simulation, we find that this scheme can achieve very fast updates and fast lookups for routing prefixes while keep the memory storage moderate.
{"title":"An Efficient Hashing-Based Scheme for RIB Management","authors":"Feng Zhao, Yaping Liu, Baosheng Wang, Zexin Lu","doi":"10.1109/CCE.2006.350885","DOIUrl":"https://doi.org/10.1109/CCE.2006.350885","url":null,"abstract":"In consideration of the exact matching characteristic of RIB lookups, we explore the applicability of hashing-based approaches for RIB management and evaluate their performance. Using real routing prefixes, we compare the efficiency of six different hash approaches mentioned in some papers about IP lookups: bit extraction from the routing prefix, CRC16 (cyclic redundancy checking polynomials), CRC32, Fletcher checksum, folding of prefix octets for using the exclusive-or operation and multiplication. This is the first comprehensive study of their performance using real core routing tables. We find that extracting the least significant bits from the routing prefix is a very efficient hash approach for RIB management. Then a RIB management scheme based on this hash approach is proposed. We use separate chaining as the collision resolution strategy, while not suffering from malloc/free overhead for frequent insertion or deletion. To keep the memory storage moderate, we set the hash table sizes based on the distribution of prefix lengths because it is not expected to change significantly with time. Through simulation, we find that this scheme can achieve very fast updates and fast lookups for routing prefixes while keep the memory storage moderate.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130379392","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}
We consider the problem of estimating the geographic locations of nodes in a wireless sensor network where most sensors are without an effective self-positioning functionality. A solution to this localization problem is proposed, which uses support vector machines (SVM) and mere connectivity information only. We investigate two versions of this solution, each employing a different multiclass SVM strategy. They are shown to perform well in various aspects such as localization error, processing efficiency, and effectiveness in addressing the border issue.
{"title":"Support Vector Classification Strategies for Localization in Sensor Networks","authors":"D. Tran, T. Nguyen","doi":"10.1109/CCE.2006.350857","DOIUrl":"https://doi.org/10.1109/CCE.2006.350857","url":null,"abstract":"We consider the problem of estimating the geographic locations of nodes in a wireless sensor network where most sensors are without an effective self-positioning functionality. A solution to this localization problem is proposed, which uses support vector machines (SVM) and mere connectivity information only. We investigate two versions of this solution, each employing a different multiclass SVM strategy. They are shown to perform well in various aspects such as localization error, processing efficiency, and effectiveness in addressing the border issue.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129037089","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}
In this paper, an iterative joint channel-estimation and symbol-detection algorithm based on prediction is presented for orthogonal frequency-division multiplexing systems. Considering the correlation between impulse responses, we introduce the prediction method into the iterative channel estimation. The initial channel value of iterative estimation is predicted for each data symbol. Several prediction methods are simulated and compared with conventional algorithm. The simulation results show that contrasted to the conventional scheme, the proposed algorithm improves the convergence capability and system performance dramatically without excessive system complexity increase.
{"title":"An Interative Joint Channel Estimation and Symbol Detection Algorithm Based on Prediction for OFDM Systems","authors":"Zhang Peng, Bi Guangguo, Jin Xiu-feng, Yu Xiaohui","doi":"10.1109/CCE.2006.350805","DOIUrl":"https://doi.org/10.1109/CCE.2006.350805","url":null,"abstract":"In this paper, an iterative joint channel-estimation and symbol-detection algorithm based on prediction is presented for orthogonal frequency-division multiplexing systems. Considering the correlation between impulse responses, we introduce the prediction method into the iterative channel estimation. The initial channel value of iterative estimation is predicted for each data symbol. Several prediction methods are simulated and compared with conventional algorithm. The simulation results show that contrasted to the conventional scheme, the proposed algorithm improves the convergence capability and system performance dramatically without excessive system complexity increase.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124208910","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
扫码关注我们
求助内容：
应助结果提醒方式：