S. Barbarossa, T. Battisti, L. Pescosolido, S. Sardellitti, G. Scutari
Designing sensor networks with decentralized and autonomous decisions capabilities, i.e., without the need to send all the collected data to a fusion center, is a big challenge that is receiving considerable attention. One of the major drawbacks of distributed algorithms is their iterative nature. This makes them prone to an energy consumption that depends on the convergence time and on the power transmitted by each node to guarantee the network connectivity. Furthermore, in a realistic environment, the interaction among sensor is inevitably corrupted by noise which affects the final decision. In this work, we describe decentralized algorithms for implementing various processing tasks, from spatial smoothing to distributed decision, characterized by fast convergence properties, for a given network topology, and resilience against inter-sensor communication noise.
{"title":"Distributed Processing Algorithms for Wireless Sensor Networks Having Fast Convergence and Robustness Against Coupling Noise","authors":"S. Barbarossa, T. Battisti, L. Pescosolido, S. Sardellitti, G. Scutari","doi":"10.1109/ISSSTA.2008.7","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.7","url":null,"abstract":"Designing sensor networks with decentralized and autonomous decisions capabilities, i.e., without the need to send all the collected data to a fusion center, is a big challenge that is receiving considerable attention. One of the major drawbacks of distributed algorithms is their iterative nature. This makes them prone to an energy consumption that depends on the convergence time and on the power transmitted by each node to guarantee the network connectivity. Furthermore, in a realistic environment, the interaction among sensor is inevitably corrupted by noise which affects the final decision. In this work, we describe decentralized algorithms for implementing various processing tasks, from spatial smoothing to distributed decision, characterized by fast convergence properties, for a given network topology, and resilience against inter-sensor communication noise.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116011674","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 enormous growth of wireless communication systems makes it important to evaluate the capacity of such channels. Multiple input multiple output (MIMO) wireless communication systems are shown to yield significant performance improvement to data rates when compared to the traditional single input single output (SISO) wireless systems. The benefits of multiple antenna elements at the transmitter and receiver have become necessary to the research and the development of the next generation of mobile communication systems. In this paper we propose the use of relaying MIMO wireless communication systems for use over long throughput. We investigate how relays can be used in a "demodulate-and-forward" operation when the transmitter is equipped with spatially correlated multiple antenna elements and the receiver has only partial knowledge of the statistics of the channel. We show that relays between the source and destination nodes of a wireless communication system in MIMO configuration improve the throughput of the system when compared to the typical MIMO systems, or achieve the desired channel capacity with significantly lower power resources needed.
{"title":"Radio Propagation Modeling for Capacity Optimization in Wireless Relay MIMO Systems with Partial CSI","authors":"T. Kanakis, P. Rapajic","doi":"10.1109/ISSSTA.2008.44","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.44","url":null,"abstract":"The enormous growth of wireless communication systems makes it important to evaluate the capacity of such channels. Multiple input multiple output (MIMO) wireless communication systems are shown to yield significant performance improvement to data rates when compared to the traditional single input single output (SISO) wireless systems. The benefits of multiple antenna elements at the transmitter and receiver have become necessary to the research and the development of the next generation of mobile communication systems. In this paper we propose the use of relaying MIMO wireless communication systems for use over long throughput. We investigate how relays can be used in a \"demodulate-and-forward\" operation when the transmitter is equipped with spatially correlated multiple antenna elements and the receiver has only partial knowledge of the statistics of the channel. We show that relays between the source and destination nodes of a wireless communication system in MIMO configuration improve the throughput of the system when compared to the typical MIMO systems, or achieve the desired channel capacity with significantly lower power resources needed.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"316 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116120451","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}
Orthogonal Frequency Division Multiplexing (OFDM) is a transmission technique which is robust in multipath channels. It is though sensitive to frequency errors that may be caused by several factors such as frequency offset at the local oscillator, phase noise and mobility of the receiver. These errors introduce Inter-Carrier Interference (ICI) that may be represented in the frequency domain by means of an ICI matrix. Since these types of errors greatly affect the performance of an OFDM system, estimation of this matrix is crucial. In this work we propose an iterative method that uses pilot tones in the frequency domain and converges very quickly. It works in two steps. In the first, correlation between received signal and estimated transmitted signal is used to estimate the channel matrix, and the second estimates the actual transmitted data by means of Minimum Mean Square Error (MMSE) equalization. Results, in the case of high frequency offset and of a time varying flat fading channel, show that the proposed method is very effective.
{"title":"Frequency Domain Estimation and Compensation of Intercarrier Interference in OFDM Systems","authors":"L. Favalli, P. Savazzi, A. Vizziello","doi":"10.1109/ISSSTA.2008.93","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.93","url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) is a transmission technique which is robust in multipath channels. It is though sensitive to frequency errors that may be caused by several factors such as frequency offset at the local oscillator, phase noise and mobility of the receiver. These errors introduce Inter-Carrier Interference (ICI) that may be represented in the frequency domain by means of an ICI matrix. Since these types of errors greatly affect the performance of an OFDM system, estimation of this matrix is crucial. In this work we propose an iterative method that uses pilot tones in the frequency domain and converges very quickly. It works in two steps. In the first, correlation between received signal and estimated transmitted signal is used to estimate the channel matrix, and the second estimates the actual transmitted data by means of Minimum Mean Square Error (MMSE) equalization. Results, in the case of high frequency offset and of a time varying flat fading channel, show that the proposed method is very effective.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"380 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116351918","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 report we consider adaptive multistage interference cancellation within asynchronous spread spectrum multiple access (SSMA) communication systems using spreading sequences of Markov chains. We show that for synchronous systems, the empirical mean of the multiple access interference (MAI) at the second stage of interference cancellation satisfies the large deviations principle (LDP) with the convex, good rate function. By refinement of the large deviations analysis, we obtain exact asymptotics of bit error probabilities in such systems. We also discuss evaluations of bit error probabilities in asynchronous systems based on the LDP.
{"title":"Large Deviations Analysis of Interference Cancellation for SSMA Communication Systems with Spreading Sequences of Markov Chains","authors":"H. Fujisaki","doi":"10.1109/ISSSTA.2008.145","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.145","url":null,"abstract":"In this report we consider adaptive multistage interference cancellation within asynchronous spread spectrum multiple access (SSMA) communication systems using spreading sequences of Markov chains. We show that for synchronous systems, the empirical mean of the multiple access interference (MAI) at the second stage of interference cancellation satisfies the large deviations principle (LDP) with the convex, good rate function. By refinement of the large deviations analysis, we obtain exact asymptotics of bit error probabilities in such systems. We also discuss evaluations of bit error probabilities in asynchronous systems based on the LDP.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117033158","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 work the effects of channel estimation errors on the performance of a maximum likelihood detector in a MIMO OFDM system are assessed. The analysis is conducted in the framework of a long term evolution air interface and is based on a robust pilot aided channel estimator. To this end the correlation coefficient between the estimate and the real channel is computed and the impact of interpolation errors on the detector is evaluated as a function of key design parameters such as the pilot spacing, the filter length, and the number of transmit antennas. The effect of partial knowledge of the channel statistics at the receiver side is also studied.
{"title":"Performance Analysis of MIMO OFDM ML Detection in the Presence of Channel Estimation Error","authors":"C. Carbonelli, S. Franz","doi":"10.1109/ISSSTA.2008.135","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.135","url":null,"abstract":"In this work the effects of channel estimation errors on the performance of a maximum likelihood detector in a MIMO OFDM system are assessed. The analysis is conducted in the framework of a long term evolution air interface and is based on a robust pilot aided channel estimator. To this end the correlation coefficient between the estimate and the real channel is computed and the impact of interpolation errors on the detector is evaluated as a function of key design parameters such as the pilot spacing, the filter length, and the number of transmit antennas. The effect of partial knowledge of the channel statistics at the receiver side is also studied.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126610729","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}
Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm for services that require end-to-end guarantees. Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. By jointly considering the time varying channel conditions in both uplink and downlink directions, the proposed end-to-end scheduling algorithm achieves an increased number of active connections and a lower packet drop in comparison to other schemes. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction, we propose an implementation over clusters within the network.
{"title":"On End-to-End Scheduling in Wireless Cellular Networks","authors":"W. Saad, Z. Dawy, S. Sharafeddine","doi":"10.1109/ISSSTA.2008.99","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.99","url":null,"abstract":"Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm for services that require end-to-end guarantees. Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. By jointly considering the time varying channel conditions in both uplink and downlink directions, the proposed end-to-end scheduling algorithm achieves an increased number of active connections and a lower packet drop in comparison to other schemes. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction, we propose an implementation over clusters within the network.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128143144","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 we address the implementation complexity of a recently proposed uplink transmission scheme. The scheme concatenates an inner filtered multitone (FMT) modulator with transmission over multiple antennas, and an outer space-time cyclically prefixed discrete multitone (ST-CP-DMT) modulator. We show that the transmitter can be implemented via a concatenation of IDoFTs and a single low rate polyphase filter bank independently of the number of transmit antennas. Further, we propose a multiuser receiver architecture that requires a single polyphase filter bank and a concatenation of DFTs, which allows for a deep complexity reduction. The multiuser receiver is capable of achieving the performance of the bank of synchronous single user receivers. Moreover we prove that the efficient implementation yields a significant reduction of the complexity for both the transmitter and the receiver.
{"title":"Implementation Complexity Analysis of the Concatenated MIMO DMT-FMT Multiuser System","authors":"A. Tonello, M. Bellin","doi":"10.1109/ISSSTA.2008.138","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.138","url":null,"abstract":"In this paper we address the implementation complexity of a recently proposed uplink transmission scheme. The scheme concatenates an inner filtered multitone (FMT) modulator with transmission over multiple antennas, and an outer space-time cyclically prefixed discrete multitone (ST-CP-DMT) modulator. We show that the transmitter can be implemented via a concatenation of IDoFTs and a single low rate polyphase filter bank independently of the number of transmit antennas. Further, we propose a multiuser receiver architecture that requires a single polyphase filter bank and a concatenation of DFTs, which allows for a deep complexity reduction. The multiuser receiver is capable of achieving the performance of the bank of synchronous single user receivers. Moreover we prove that the efficient implementation yields a significant reduction of the complexity for both the transmitter and the receiver.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125958420","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}
D. L. Milliner, E. Zimmermann, J. Barry, G. Fettweis
In this work we present a unifying framework to characterize different types of breadth-first tree search detectors for multiple antenna systems. All considered algorithms operate at fixed complexity and require only a single pass through the detection tree, making them very attractive for practical implementation. Existing approaches are placed into this framework and a performance-complexity analysis is performed for both hard-output and soft-output detection. The B-Chase and the parallel smart candidate adding algorithm emerge as the most attractive schemes for hard-output and soft-output detection, respectively.
{"title":"A Framework for Fixed Complexity Breadth-First MIMO Detection","authors":"D. L. Milliner, E. Zimmermann, J. Barry, G. Fettweis","doi":"10.1109/ISSSTA.2008.31","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.31","url":null,"abstract":"In this work we present a unifying framework to characterize different types of breadth-first tree search detectors for multiple antenna systems. All considered algorithms operate at fixed complexity and require only a single pass through the detection tree, making them very attractive for practical implementation. Existing approaches are placed into this framework and a performance-complexity analysis is performed for both hard-output and soft-output detection. The B-Chase and the parallel smart candidate adding algorithm emerge as the most attractive schemes for hard-output and soft-output detection, respectively.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126422750","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}
U. Her, Kwang-Soo Jeong, J. Yi, Hyoung-Kyu Song, Y. You
In this paper, a fine carrier frequency offset (CFO) estimator is proposed for ultra-wideband multi-band orthogonal frequency division multiplexing (UWB MB-OFDM) systems. The proposed scheme uses a frequency domain spreaded data symbol which is provided in the MB-OFDM system. To demonstrate the efficiency of the proposed CFO estimator, comparisons are made with other existing estimator in terms of mean square error (MSE) and bit error rate (BER).
{"title":"An Improved Residual CFO Estimation Scheme for UWB Multiband OFDM","authors":"U. Her, Kwang-Soo Jeong, J. Yi, Hyoung-Kyu Song, Y. You","doi":"10.1109/ISSSTA.2008.122","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.122","url":null,"abstract":"In this paper, a fine carrier frequency offset (CFO) estimator is proposed for ultra-wideband multi-band orthogonal frequency division multiplexing (UWB MB-OFDM) systems. The proposed scheme uses a frequency domain spreaded data symbol which is provided in the MB-OFDM system. To demonstrate the efficiency of the proposed CFO estimator, comparisons are made with other existing estimator in terms of mean square error (MSE) and bit error rate (BER).","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125188166","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}
Trends in wireless communication systems are in the direction of multi-mode systems using different algorithms to implement the baseband processing and the channel decoding. Efficient implementation of such multi-mode support requires flexible hardware. We present design and implementation of a reconfigurable processing element for a multi-processor architecture catering to both turbo and LDPC decoding needs in the context of the WiMaX (IEEE 802.16e) standard for high-throughput applications. As a case study, we evaluate the performance of our Multi Processor System on Chip (MPSoC) architecture for a 2-D Torus/Mesh interconnect topology. Evaluation results are presented based on the communication centric parameters that include network latency, network size and can be extended to any other System on Chip (SoC) interconnect topology without loss of generality.
{"title":"Reconfigurable Architecture for LDPC and Turbo Decoding: A NoC Case Study","authors":"M. Scarpellino, A. Singh, E. Boutillon, G. Masera","doi":"10.1109/ISSSTA.2008.131","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.131","url":null,"abstract":"Trends in wireless communication systems are in the direction of multi-mode systems using different algorithms to implement the baseband processing and the channel decoding. Efficient implementation of such multi-mode support requires flexible hardware. We present design and implementation of a reconfigurable processing element for a multi-processor architecture catering to both turbo and LDPC decoding needs in the context of the WiMaX (IEEE 802.16e) standard for high-throughput applications. As a case study, we evaluate the performance of our Multi Processor System on Chip (MPSoC) architecture for a 2-D Torus/Mesh interconnect topology. Evaluation results are presented based on the communication centric parameters that include network latency, network size and can be extended to any other System on Chip (SoC) interconnect topology without loss of generality.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121604598","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
扫码关注我们
求助内容：
应助结果提醒方式：