The primary goal of this paper is to provide a comparative assessment to the two cases where different criteria are used in joint user minimum mean squared error (JU MMSE) spatial filtering in wireless relay networks in the presence of unknown interference. In the relay networks, even though multiple access coding (MAC) has been proposed at the first time- slot to provide the separability of the signals transmitted from the multiple users, and space-time transmission (STT) at the second time-slot to achieve the diversity gain, additional constraint in JU MMSE spatial filtering to preserve the MAC-encoded/ST-encoded signal structure places floor in bit error rate (BER) performance, while imposing no additional constraint places no error floor.
{"title":"Preserving The Coding Structure in Relay Transmission in The Presence of Unknown Interference","authors":"A. Hong, T. Matsumoto","doi":"10.1109/ISSSTA.2008.129","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.129","url":null,"abstract":"The primary goal of this paper is to provide a comparative assessment to the two cases where different criteria are used in joint user minimum mean squared error (JU MMSE) spatial filtering in wireless relay networks in the presence of unknown interference. In the relay networks, even though multiple access coding (MAC) has been proposed at the first time- slot to provide the separability of the signals transmitted from the multiple users, and space-time transmission (STT) at the second time-slot to achieve the diversity gain, additional constraint in JU MMSE spatial filtering to preserve the MAC-encoded/ST-encoded signal structure places floor in bit error rate (BER) performance, while imposing no additional constraint places no error floor.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"15 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":"122217758","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, a low-complexity correlation based symbol timing synchronization (CBTS) algorithm for UWB MB- OFDM systems is presented. The scheme attempts to locate the start of the fast Fourier transformation (FFT) window during frame synchronization (FS) sequence of the received preamble by identifying the first significant multi-path component with the help of a predefined threshold. The algorithm is tested by computer simulation over UWB channel models (CM), CM1 and CM2 as suggested by IEEE 802.15 channel modeling subcommittee. Performance of the proposed algorithm is measured through mean-squared error (MSE) of timing estimation and probability of synchronization. Each of the UWB CM environments is simulated for 100,000 noisy channel realizations for different signal-to-noise ratio (SNR) e.g. 17 dB, 10 dB, and 5 dB. Synchronization probabilities at 17 dB SNR reach maximum of '94.63%' for CM1, and '80.23%' for CM2, for 320 Mbps data rate.
{"title":"A Low Complexity Timing Estimation Scheme for Multi-Band OFDM Based Ultra-Wideband System","authors":"D. Sen, S. Chakrabarti, R. R. Raja Kumar","doi":"10.1109/ISSSTA.2008.124","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.124","url":null,"abstract":"In this paper, a low-complexity correlation based symbol timing synchronization (CBTS) algorithm for UWB MB- OFDM systems is presented. The scheme attempts to locate the start of the fast Fourier transformation (FFT) window during frame synchronization (FS) sequence of the received preamble by identifying the first significant multi-path component with the help of a predefined threshold. The algorithm is tested by computer simulation over UWB channel models (CM), CM1 and CM2 as suggested by IEEE 802.15 channel modeling subcommittee. Performance of the proposed algorithm is measured through mean-squared error (MSE) of timing estimation and probability of synchronization. Each of the UWB CM environments is simulated for 100,000 noisy channel realizations for different signal-to-noise ratio (SNR) e.g. 17 dB, 10 dB, and 5 dB. Synchronization probabilities at 17 dB SNR reach maximum of '94.63%' for CM1, and '80.23%' for CM2, for 320 Mbps data rate.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"504 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":"133467656","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 derive and propose constrained blind adaptive multiuser detection algorithm for DS-CDMA UWB multipath channel to suppress the multi access interference (MAI). Variance of the receiver output is minimized subject to appropriate constraints. Receiver does not require spreading code knowledge of all users other than that of the user of interest. Simulation results show that bit error probability performance of the proposed method is better than that of adaptive minimum mean square error (MMSE) detector and much better than RAKE receiver performance in multipath AWGN channel.
{"title":"Constrained Blind Adaptive Multiuser Detector for DS-CDMA UWB in Multipath Channels","authors":"G. Biradar, S. Merchant, U. Desai","doi":"10.1109/ISSSTA.2008.42","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.42","url":null,"abstract":"In this paper we derive and propose constrained blind adaptive multiuser detection algorithm for DS-CDMA UWB multipath channel to suppress the multi access interference (MAI). Variance of the receiver output is minimized subject to appropriate constraints. Receiver does not require spreading code knowledge of all users other than that of the user of interest. Simulation results show that bit error probability performance of the proposed method is better than that of adaptive minimum mean square error (MMSE) detector and much better than RAKE receiver performance in multipath AWGN channel.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"33 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":"132706263","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}
T. Halford, M. Bayram, C. Kose, K. Chugg, A. Polydoros
Flexibility is an increasingly important aspect of radio modern design. In this paper, flexibility within the physical (PHY) layer in general, and the forward error correction (FEC) component in particular, is examined in detail. Following a discussion of the need for flexible modern code designs that exhibit universally good performance across a wide range of operational scenarios (i.e., input block size, code rate, modulation), TrellisWare Technologies, Inc.'s Flexible Low-Density Parity- Check (F-LDPC) codes are offered as an example of a high- performance modern coding solution for flexible radio designs. Specifically, the F-LDPC family offers performance within 0.8 dB of theoretical bounds across a wide range of operational scenarios with a design that is especially amenable to low-complexity, high- thoughput reconfigurable hardware implementation.
{"title":"The F-LDPC Family: High-Performance Flexible Modern Codes for Flexible Radio","authors":"T. Halford, M. Bayram, C. Kose, K. Chugg, A. Polydoros","doi":"10.1109/ISSSTA.2008.75","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.75","url":null,"abstract":"Flexibility is an increasingly important aspect of radio modern design. In this paper, flexibility within the physical (PHY) layer in general, and the forward error correction (FEC) component in particular, is examined in detail. Following a discussion of the need for flexible modern code designs that exhibit universally good performance across a wide range of operational scenarios (i.e., input block size, code rate, modulation), TrellisWare Technologies, Inc.'s Flexible Low-Density Parity- Check (F-LDPC) codes are offered as an example of a high- performance modern coding solution for flexible radio designs. Specifically, the F-LDPC family offers performance within 0.8 dB of theoretical bounds across a wide range of operational scenarios with a design that is especially amenable to low-complexity, high- thoughput reconfigurable hardware implementation.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"7 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":"114364924","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 study how to combine decoding and fusion at the access point (AP) in sensor networks for decentralized binary detection. We consider a scenario where all sensors make noisy observations of the same spatially constant binary phenomenon and communicate to the AP through noisy communication links. Simple distributed channel coding strategies are used, either using repetition coding at each sensor (i.e., multiple observations) or distributed systematic block channel coding. In all cases, the system performance is analyzed separating or joining the decoding and fusion operations. As expected, the schemes with joint decoding and fusion show a significant performance improvement with respect to that of schemes with separate decoding and fusion. Our results suggest that the use of multiple observations is often the winning choice at practical values of the probability of decision error at the AP.
{"title":"Decoding and Fusion in Sensor Networks with Noisy Observations and Communications","authors":"M. Martalò, G. Ferrari","doi":"10.1109/ISSSTA.2008.8","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.8","url":null,"abstract":"In this paper, we study how to combine decoding and fusion at the access point (AP) in sensor networks for decentralized binary detection. We consider a scenario where all sensors make noisy observations of the same spatially constant binary phenomenon and communicate to the AP through noisy communication links. Simple distributed channel coding strategies are used, either using repetition coding at each sensor (i.e., multiple observations) or distributed systematic block channel coding. In all cases, the system performance is analyzed separating or joining the decoding and fusion operations. As expected, the schemes with joint decoding and fusion show a significant performance improvement with respect to that of schemes with separate decoding and fusion. Our results suggest that the use of multiple observations is often the winning choice at practical values of the probability of decision error at the AP.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"8 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":"116277931","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 performance of conventional polyphase pulse compression codes such as the Frank, Frank-Zadoff-Chu (FZC), P1, P2, P3, P4, and Px codes will be compared with Oppermann codes. While the majority of the former code classes focus on radar applications, Oppermann codes have been discussed only within the context of code-division multiple-access (CDMA) systems. In this paper, we therefore consolidate findings on the conventional codes and extend the performance assessment to Oppermann codes by accounting for Doppler shifts as needed in radar applications. It is shown that Oppermann codes can conceptually support integrated radar and communication systems as compared to the P1, P2, P3, P4, and Px codes where this is not readily feasible. The numerical results given here illustrate that Oppermann codes outperform Px codes in the presence of Doppler shifts as supported by the ambiguity function.
{"title":"Performance Assessment of Polyphase Pulse Compression Codes","authors":"Momin Jamil, Hans-Jürgen Zepernick, M. Pettersson","doi":"10.1109/ISSSTA.2008.37","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.37","url":null,"abstract":"The performance of conventional polyphase pulse compression codes such as the Frank, Frank-Zadoff-Chu (FZC), P1, P2, P3, P4, and Px codes will be compared with Oppermann codes. While the majority of the former code classes focus on radar applications, Oppermann codes have been discussed only within the context of code-division multiple-access (CDMA) systems. In this paper, we therefore consolidate findings on the conventional codes and extend the performance assessment to Oppermann codes by accounting for Doppler shifts as needed in radar applications. It is shown that Oppermann codes can conceptually support integrated radar and communication systems as compared to the P1, P2, P3, P4, and Px codes where this is not readily feasible. The numerical results given here illustrate that Oppermann codes outperform Px codes in the presence of Doppler shifts as supported by the ambiguity function.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"37 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":"132133970","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}
Spatial modulation (SM) is a multiple antenna transmission approach that exploits the location of the transmitting antenna for conveying data information. In SM, only a single transmit antenna transmits at a time while all other antennas remain silent. The receiver estimates the transmitted symbol and the active transmit antenna index and uses both estimations to retrieve the original information bits. In this paper, two analytical approaches to symbol-error-ratio (SER) analysis of the SM algorithm in independent and identically distributed (i.i.d.) Rayleigh channels are developed. The validity of the approaches are discussed and the obtained analytical results are compared to Monte Carlo simulation results.
{"title":"Analytical SER Calculation of Spatial Modulation","authors":"R. Mesleh, S. Engelken, S. Sinanović, H. Haas","doi":"10.1109/ISSSTA.2008.55","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.55","url":null,"abstract":"Spatial modulation (SM) is a multiple antenna transmission approach that exploits the location of the transmitting antenna for conveying data information. In SM, only a single transmit antenna transmits at a time while all other antennas remain silent. The receiver estimates the transmitted symbol and the active transmit antenna index and uses both estimations to retrieve the original information bits. In this paper, two analytical approaches to symbol-error-ratio (SER) analysis of the SM algorithm in independent and identically distributed (i.i.d.) Rayleigh channels are developed. The validity of the approaches are discussed and the obtained analytical results are compared to Monte Carlo simulation results.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"347 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":"128086112","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}
This paper is concerned with orthogonal frequency- division multiplexing interleave-division multiple-access (OFDM- IDMA) systems over frequency-selective fading channels. Deliberate clipping is applied to reduce the peak-to-average power ratio (PAPR) of each user's transmitted signal. An iterative multiuser detection (MUD) technique is developed to recover the performance loss due to clipping. A semi-analytical signal-to- noise ratio (SNR) evolution technique is proposed, which can provide quick and accurate prediction of the iterative MUD performance. Numerical results show that the performance of OFDM-IDMA is not sensitive to the frequency selectivity of channels, and OFDM-IDMA is more power-efficient than other alternative multi-carrier transmission techniques.
{"title":"Performance Analysis of OFDM-IDMA Systems with Peak-Power Limitation","authors":"Jun Tong, Qinghua Guo, Li Ping","doi":"10.1109/ISSSTA.2008.109","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.109","url":null,"abstract":"This paper is concerned with orthogonal frequency- division multiplexing interleave-division multiple-access (OFDM- IDMA) systems over frequency-selective fading channels. Deliberate clipping is applied to reduce the peak-to-average power ratio (PAPR) of each user's transmitted signal. An iterative multiuser detection (MUD) technique is developed to recover the performance loss due to clipping. A semi-analytical signal-to- noise ratio (SNR) evolution technique is proposed, which can provide quick and accurate prediction of the iterative MUD performance. Numerical results show that the performance of OFDM-IDMA is not sensitive to the frequency selectivity of channels, and OFDM-IDMA is more power-efficient than other alternative multi-carrier transmission techniques.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"42 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":"133114414","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 novel COST 273 MIMO channel model is a good candidate for link-level and system-level simulations of multi-antenna communication systems. This geometry-based stochastic channel model is based on the concepts of multipath clusters, allowing for an implementation with low computational effort. The model is suitable to accurately reflect the frequency-selective, time-variant, fully-polarimetric nature of various propagation environments. Having only few external parameters, it is particularly interesting for signal processing engineers wanting to test their algorithms against realistic channels. A current shortcoming of the COST 273 MIMO channel model is its missing parametrisation for a number of scenarios. Particularly, the parametrisation of the cluster parameters is challenging, even more, since three different kinds of clusters are used to model the channel. This paper outlines an approach to consistently parametrise the clusters used in the COST 273 MIMO channel model from representative measurement data.
{"title":"The COST 273 MIMO Channel Model: Three Kinds of Clusters","authors":"N. Czink, Claude Oestges","doi":"10.1109/ISSSTA.2008.57","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.57","url":null,"abstract":"The novel COST 273 MIMO channel model is a good candidate for link-level and system-level simulations of multi-antenna communication systems. This geometry-based stochastic channel model is based on the concepts of multipath clusters, allowing for an implementation with low computational effort. The model is suitable to accurately reflect the frequency-selective, time-variant, fully-polarimetric nature of various propagation environments. Having only few external parameters, it is particularly interesting for signal processing engineers wanting to test their algorithms against realistic channels. A current shortcoming of the COST 273 MIMO channel model is its missing parametrisation for a number of scenarios. Particularly, the parametrisation of the cluster parameters is challenging, even more, since three different kinds of clusters are used to model the channel. This paper outlines an approach to consistently parametrise the clusters used in the COST 273 MIMO channel model from representative measurement data.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"13 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":"133525396","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}
A new approach is proposed on the design of pulse-shaped multicarrier systems that are robust to time and frequency selective channels which are known to limit the performance of conventional multicarrier schemes. In contrast to proposed approaches that result in inefficient bandwidth utilization, a tight packing of the subcarriers in the time-frequency domain is considered which renders them linearly dependent (i.e., transmission is achieved via a Gabor frame). System design requires selection of the Gabor frame parameters as well as the introduction of appropriate correlation on the transmitted data in order to allow simple channel compensation and data detection at the receiver. A sub-optimal design solution is proposed, based on an information-theoretic criterion, with the corresponding analysis demonstrating significant gains with respect to conventional multicarrier transmission. Practical detection schemes are also proposed that trade-off complexity versus performance.
{"title":"Multicarrier Transmission via Gabor Frames: Signal Design and Channel Compensation","authors":"S. Stefanatos, A. L. Moustakas, A. Polydoros","doi":"10.1109/ISSSTA.2008.92","DOIUrl":"https://doi.org/10.1109/ISSSTA.2008.92","url":null,"abstract":"A new approach is proposed on the design of pulse-shaped multicarrier systems that are robust to time and frequency selective channels which are known to limit the performance of conventional multicarrier schemes. In contrast to proposed approaches that result in inefficient bandwidth utilization, a tight packing of the subcarriers in the time-frequency domain is considered which renders them linearly dependent (i.e., transmission is achieved via a Gabor frame). System design requires selection of the Gabor frame parameters as well as the introduction of appropriate correlation on the transmitted data in order to allow simple channel compensation and data detection at the receiver. A sub-optimal design solution is proposed, based on an information-theoretic criterion, with the corresponding analysis demonstrating significant gains with respect to conventional multicarrier transmission. Practical detection schemes are also proposed that trade-off complexity versus performance.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"50 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":"124825546","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
扫码关注我们
求助内容：
应助结果提醒方式：