Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054789
Cong Shen, M. Fitz
Opportunistic Spatial Orthogonalization (OSO) is a new cognitive radio scheme that allows the existence of secondary users and hence increases the system throughput, even if the primary user occupies all the frequency bands all the time. Notably, this throughput advantage is obtained without sacrificing the performance of the primary user, if the interference margin is carefully chosen. The key idea is to exploit the spatial dimensions to orthogonalize users and hence minimize interference. However, unlike the time and frequency dimensions, there is no universal basis for the set of all multi-dimensional spatial channels, which motivated the development of OSO. On one hand, OSO can be viewed as a multi-user diversity scheme that exploits the channel randomness and independence. On the other hand, OSO can be interpreted as an opportunistic interference alignment scheme, where the interference from multiple secondary users is opportunistically aligned at the direction that is orthogonal to the primary user's signal space. Throughput advantages are studied both analytically and numerically.
{"title":"Dynamic spatial spectrum access with opportunistic orthogonalization","authors":"Cong Shen, M. Fitz","doi":"10.1109/CISS.2009.5054789","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054789","url":null,"abstract":"Opportunistic Spatial Orthogonalization (OSO) is a new cognitive radio scheme that allows the existence of secondary users and hence increases the system throughput, even if the primary user occupies all the frequency bands all the time. Notably, this throughput advantage is obtained without sacrificing the performance of the primary user, if the interference margin is carefully chosen. The key idea is to exploit the spatial dimensions to orthogonalize users and hence minimize interference. However, unlike the time and frequency dimensions, there is no universal basis for the set of all multi-dimensional spatial channels, which motivated the development of OSO. On one hand, OSO can be viewed as a multi-user diversity scheme that exploits the channel randomness and independence. On the other hand, OSO can be interpreted as an opportunistic interference alignment scheme, where the interference from multiple secondary users is opportunistically aligned at the direction that is orthogonal to the primary user's signal space. Throughput advantages are studied both analytically and numerically.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128874440","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054729
Shanshan Zheng, T. Jiang, J. Baras
This paper compares the performance of parametric and non-parametric sequential change detection algorithms for detecting in-band wormholes in wireless ad hoc networks. The algorithms considered are the non-parametric cumulative sum (NP-CUSUM) and the repeated sequential probability ratio test (R-SPRT). Theoretical performance of the two is compared using metrics that take into account the algorithms' repeated nature, and the advantage of the parametric method is illustrated. On the other hand, connections between the parametric and non-parametric methods are made in the proposed worst case adversary model, where the non-parametric method is shown to be more robust to attack strategy changes. Experimental evaluation of wormhole detection schemes based on the two algorithms is presented. This work has implications for both the theoretical understanding and practical design of wormhole detection schemes based on parametric and nonparametric change detection algorithms.
{"title":"Performance comparison of two sequential change detection algorithms on detection of in-band wormholes","authors":"Shanshan Zheng, T. Jiang, J. Baras","doi":"10.1109/CISS.2009.5054729","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054729","url":null,"abstract":"This paper compares the performance of parametric and non-parametric sequential change detection algorithms for detecting in-band wormholes in wireless ad hoc networks. The algorithms considered are the non-parametric cumulative sum (NP-CUSUM) and the repeated sequential probability ratio test (R-SPRT). Theoretical performance of the two is compared using metrics that take into account the algorithms' repeated nature, and the advantage of the parametric method is illustrated. On the other hand, connections between the parametric and non-parametric methods are made in the proposed worst case adversary model, where the non-parametric method is shown to be more robust to attack strategy changes. Experimental evaluation of wormhole detection schemes based on the two algorithms is presented. This work has implications for both the theoretical understanding and practical design of wormhole detection schemes based on parametric and nonparametric change detection algorithms.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127944259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054844
Weilin Gong, Huarui Yin, Lei Ke, Quan Fu
This paper considers the practical implementation of low-resolution digital receivers in impulse radio ultra-wideband (IR-UWB) communication systems for low complexity and low power consumption. The performance of 1-bit digital receivers is investigated. The maximum mutual information per sample is derived and the structure of the maximum likelihood receiver is analyzed. The bit error rate performances under different modulation schemes are also studied. The analysis demonstrates that the signal to noise ratio degradation for 1-bit receivers in multi-path UWB channel is only 1.96 dB. The simulation is in good agreement with our analytical derivations.
{"title":"Performance analysis of IR-UWB 1-bit digital receivers","authors":"Weilin Gong, Huarui Yin, Lei Ke, Quan Fu","doi":"10.1109/CISS.2009.5054844","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054844","url":null,"abstract":"This paper considers the practical implementation of low-resolution digital receivers in impulse radio ultra-wideband (IR-UWB) communication systems for low complexity and low power consumption. The performance of 1-bit digital receivers is investigated. The maximum mutual information per sample is derived and the structure of the maximum likelihood receiver is analyzed. The bit error rate performances under different modulation schemes are also studied. The analysis demonstrates that the signal to noise ratio degradation for 1-bit receivers in multi-path UWB channel is only 1.96 dB. The simulation is in good agreement with our analytical derivations.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129560057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054805
Yasuhiro Ito, Kazuki Saruta, Yuki Terata, K. Takeda
Visual category recognition is challenging in computer vision and has several problem. Some of problems on visual category recognition are variance to the object instance position and background clutter. In this paper, we propose method select region of interest(ROI) in training and recognizing automatically. This provide invariance to object instance position and removing background clutter. In training phase, we make object detector to select ROI in recognizing automatically. The object detector is made by training regions of object and non-object, which determine a ROI without user annotation by using class label and some same class image of set of training image set. In this paper, the set of experiments is on the image database. We prove our proposed method can achieve high accuracy and recognize object position in training and recognizing
{"title":"Category classification with ROIs using object detector","authors":"Yasuhiro Ito, Kazuki Saruta, Yuki Terata, K. Takeda","doi":"10.1109/CISS.2009.5054805","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054805","url":null,"abstract":"Visual category recognition is challenging in computer vision and has several problem. Some of problems on visual category recognition are variance to the object instance position and background clutter. In this paper, we propose method select region of interest(ROI) in training and recognizing automatically. This provide invariance to object instance position and removing background clutter. In training phase, we make object detector to select ROI in recognizing automatically. The object detector is made by training regions of object and non-object, which determine a ROI without user annotation by using class label and some same class image of set of training image set. In this paper, the set of experiments is on the image database. We prove our proposed method can achieve high accuracy and recognize object position in training and recognizing","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128753736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054736
H. Bagheri, A. Motahari, A. Khandani
We consider a two-user symmetric Gaussian Interference Channel (IC), in which one encoder is connected to the other by a unidirectional orthogonal cooperative link with specific capacity. In this setup, we employ a simplified Han-Kobayashi scheme used in [1], along with cooperative communication. We characterize the generalized degrees of freedom [1] of the channel for interference-limited regimes by comparing the achievable sum-rate with some existing upper bounds and also with a new upper bound, introduced in this paper. In particular, we express the number of degrees of freedom available for communication as a function of the interference-to-noise ratio and the multiplexing gain of the cooperative link. In addition, we give the sum-capacity of the channel for the strong interference regime when the capacity of the cooperative link is large enough in terms of the channel parameters. Finally, we show that for noise-limited regimes, treating interference as noise and not using the cooperative link, offer a sum-rate that is at most one bit less than the sum-capacity of the channel.
{"title":"Generalized degrees of freedom of the symmetric gaussian interference channel with partial unidirectional transmitter cooperation","authors":"H. Bagheri, A. Motahari, A. Khandani","doi":"10.1109/CISS.2009.5054736","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054736","url":null,"abstract":"We consider a two-user symmetric Gaussian Interference Channel (IC), in which one encoder is connected to the other by a unidirectional orthogonal cooperative link with specific capacity. In this setup, we employ a simplified Han-Kobayashi scheme used in [1], along with cooperative communication. We characterize the generalized degrees of freedom [1] of the channel for interference-limited regimes by comparing the achievable sum-rate with some existing upper bounds and also with a new upper bound, introduced in this paper. In particular, we express the number of degrees of freedom available for communication as a function of the interference-to-noise ratio and the multiplexing gain of the cooperative link. In addition, we give the sum-capacity of the channel for the strong interference regime when the capacity of the cooperative link is large enough in terms of the channel parameters. Finally, we show that for noise-limited regimes, treating interference as noise and not using the cooperative link, offer a sum-rate that is at most one bit less than the sum-capacity of the channel.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125797285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054818
A. A. Moghadam, H. Radha
In this paper, we propose a new approach for compressed sensing of integer-valued signals using prime numbers. In particular, we utilize the logarithmic values of prime numbers to construct projection matrices that are capable of significant reductions in the number of observations (m) needed for the recovery of integer-valued signals when compared to leading compressed-sensing methods. At one extreme, and under ideal conditions, the proposed Log of Prime-numbers (LoP) projection enables single-observation compressed sensing, where one sample (m = 1) can be used for the recovery of a sparse signal with N original integer samples. More importantly, we design a practical LoP projection system and a corresponding low-complexity solver that only requires m = k observations, where k is the sparsity of the signal S in some space ?. We compare the performance of the proposed LoP system with popular Basis Pursuit (BP) and Orthogonal Matching Pursuit (OMP) methods, and demonstrate the significant improvements that can be achieved by utilizing LoP projection matrices.
本文提出了一种利用素数对整数值信号进行压缩感知的新方法。特别是，我们利用素数的对数值来构建投影矩阵，与领先的压缩感知方法相比，该矩阵能够显著减少恢复整数值信号所需的观测数(m)。在一个极端和理想的条件下，所提出的Log of Prime-numbers (LoP)投影可以实现单观测压缩感知，其中一个样本(m = 1)可以用于恢复具有N个原始整数样本的稀疏信号。更重要的是，我们设计了一个实用的LoP投影系统和相应的低复杂度求解器，它只需要m = k个观测值，其中k为信号S在某个空间中的稀疏度。我们将所提出的LoP系统的性能与流行的基追踪(BP)和正交匹配追踪(OMP)方法进行了比较，并证明了使用LoP投影矩阵可以实现显著的改进。
{"title":"Practical compressed sensing with log-of-prime projections","authors":"A. A. Moghadam, H. Radha","doi":"10.1109/CISS.2009.5054818","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054818","url":null,"abstract":"In this paper, we propose a new approach for compressed sensing of integer-valued signals using prime numbers. In particular, we utilize the logarithmic values of prime numbers to construct projection matrices that are capable of significant reductions in the number of observations (m) needed for the recovery of integer-valued signals when compared to leading compressed-sensing methods. At one extreme, and under ideal conditions, the proposed Log of Prime-numbers (LoP) projection enables single-observation compressed sensing, where one sample (m = 1) can be used for the recovery of a sparse signal with N original integer samples. More importantly, we design a practical LoP projection system and a corresponding low-complexity solver that only requires m = k observations, where k is the sparsity of the signal S in some space ?. We compare the performance of the proposed LoP system with popular Basis Pursuit (BP) and Orthogonal Matching Pursuit (OMP) methods, and demonstrate the significant improvements that can be achieved by utilizing LoP projection matrices.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127230054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054782
M. Jiang, N. Prasad, Xiaodong Wang
DFT-Spread-OFDMA (DFT-S-OFDMA) technique has been adopted as the uplink access scheme in emerging cellular systems such as the 3GPP long term evolution (3GPP-LTE), in order to reduce the peak-to-average-power ratio (PAPR). In this scheme, data symbols are precoded using a DFT operation at the transmitter before being sent to the OFDM modulator. Moreover, emerging cellular systems will also deploy multiple antennas at the base-station to increase the transmission reliability and/or system capacity. The design of low-complexity, low-latency and high-performance receivers for such DFT-S-OFDMA systems is an important open problem that has hitherto received little attention. In this paper, three receivers are proposed and examined for such DFT-S-OFDMA systems, which include a highly efficient group soft demodulator (referred to as the GMLSD), an enhanced iterative block decision feedback equalizer (IBDFE) and the conventional linear minimum mean square error (LMMSE) receiver. Monte Carlo simulations are performed to compare the performance of the proposed receiver algorithms. It is shown that the GMLSD receiver is ideal for the DFT-S-OFDMA based systems due to its low complexity and superior performance.
{"title":"Design of efficient receivers for DFT-S-OFDMA systems","authors":"M. Jiang, N. Prasad, Xiaodong Wang","doi":"10.1109/CISS.2009.5054782","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054782","url":null,"abstract":"DFT-Spread-OFDMA (DFT-S-OFDMA) technique has been adopted as the uplink access scheme in emerging cellular systems such as the 3GPP long term evolution (3GPP-LTE), in order to reduce the peak-to-average-power ratio (PAPR). In this scheme, data symbols are precoded using a DFT operation at the transmitter before being sent to the OFDM modulator. Moreover, emerging cellular systems will also deploy multiple antennas at the base-station to increase the transmission reliability and/or system capacity. The design of low-complexity, low-latency and high-performance receivers for such DFT-S-OFDMA systems is an important open problem that has hitherto received little attention. In this paper, three receivers are proposed and examined for such DFT-S-OFDMA systems, which include a highly efficient group soft demodulator (referred to as the GMLSD), an enhanced iterative block decision feedback equalizer (IBDFE) and the conventional linear minimum mean square error (LMMSE) receiver. Monte Carlo simulations are performed to compare the performance of the proposed receiver algorithms. It is shown that the GMLSD receiver is ideal for the DFT-S-OFDMA based systems due to its low complexity and superior performance.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127332514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054699
Xiantao Sun, L. Cimini, L. Greenstein, D. Chan
An orthogonal frequency division multiplexing (OFDM) system suffers performance degradation when the length of the cyclic prefix (CP) is less than the channel impulse response. The root cause of this degradation is the inter-carrier interference (ICI) and inter-symbol interference (ISI) introduced by the excessive multipath delay. Generally, MIMO beamforming is helpful in mitigating such interference because it can spatially suppress some of the multipath. However, the effectiveness of this suppression is very limited. In this paper, we propose an ICI/ISIaware beamforming algorithm which explicitly takes into account the multipath characteristic of the channel. Optimal steering vectors are derived to maximize the signal-to-interference-plus-noise ratio (SINR). This technique not only achieves the beamforming benefit, but also significantly mitigates the ICI and ISI. We show, via simulations, that the proposed algorithm can dramatically reduce the block error rate, permitting good performance for channel delay profiles that would break conventional links. This is vitally important for the extension of indoor WLAN designs to outdoor uses.
{"title":"ICI/ISI aware beamforming for MIMO-OFDM wireless system","authors":"Xiantao Sun, L. Cimini, L. Greenstein, D. Chan","doi":"10.1109/CISS.2009.5054699","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054699","url":null,"abstract":"An orthogonal frequency division multiplexing (OFDM) system suffers performance degradation when the length of the cyclic prefix (CP) is less than the channel impulse response. The root cause of this degradation is the inter-carrier interference (ICI) and inter-symbol interference (ISI) introduced by the excessive multipath delay. Generally, MIMO beamforming is helpful in mitigating such interference because it can spatially suppress some of the multipath. However, the effectiveness of this suppression is very limited. In this paper, we propose an ICI/ISIaware beamforming algorithm which explicitly takes into account the multipath characteristic of the channel. Optimal steering vectors are derived to maximize the signal-to-interference-plus-noise ratio (SINR). This technique not only achieves the beamforming benefit, but also significantly mitigates the ICI and ISI. We show, via simulations, that the proposed algorithm can dramatically reduce the block error rate, permitting good performance for channel delay profiles that would break conventional links. This is vitally important for the extension of indoor WLAN designs to outdoor uses.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127648137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054831
David J. Dorsey, M. Kam
In this paper, we consider the problem of placing, with course-grained control, a large number of wireless networked sensor nodes employing a clustering network architecture. The goal of the deployment strategy is to maximize the lifetime while ensuring connectivity between cluster-heads so that samples from the monitored area may be forwarded to a fusion center. A model is derived to approximate the lifetime of a differentially deployed random network using both the density of cluster-heads and non-clusterheads as variables. Through optimization of the lifetime expression over both variables and through simulation results, it is shown that 1) a differential node deployment with a uniform cluster-head density increases the lifetime of the network over a uniform deployment and 2) the addition of a suitable differential cluster-head density further increases lifetime over the differential node deployment with uniform cluster-head density.
{"title":"Non-uniform deployment of nodes in clustered wireless sensor networks","authors":"David J. Dorsey, M. Kam","doi":"10.1109/CISS.2009.5054831","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054831","url":null,"abstract":"In this paper, we consider the problem of placing, with course-grained control, a large number of wireless networked sensor nodes employing a clustering network architecture. The goal of the deployment strategy is to maximize the lifetime while ensuring connectivity between cluster-heads so that samples from the monitored area may be forwarded to a fusion center. A model is derived to approximate the lifetime of a differentially deployed random network using both the density of cluster-heads and non-clusterheads as variables. Through optimization of the lifetime expression over both variables and through simulation results, it is shown that 1) a differential node deployment with a uniform cluster-head density increases the lifetime of the network over a uniform deployment and 2) the addition of a suitable differential cluster-head density further increases lifetime over the differential node deployment with uniform cluster-head density.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114162692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054748
D. Chebanov
In this paper we study some autocorrelation properties of a train of identical signals overlaid with a phase coding. Prior publications have investigated this problem under the assumption that, for the purpose of the phase coding, the original (uncoded) signal forming the train is divided into a number of bits that are either all identical or all distinct. This paper extends the discussion to the case of repeated bits. We derive and analyze sufficient conditions for cancelation of the waveform's autocorrelation sidelobes located around the main lobe area.
{"title":"Some autocorrelation properties of phase-coded waveforms","authors":"D. Chebanov","doi":"10.1109/CISS.2009.5054748","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054748","url":null,"abstract":"In this paper we study some autocorrelation properties of a train of identical signals overlaid with a phase coding. Prior publications have investigated this problem under the assumption that, for the purpose of the phase coding, the original (uncoded) signal forming the train is divided into a number of bits that are either all identical or all distinct. This paper extends the discussion to the case of repeated bits. We derive and analyze sufficient conditions for cancelation of the waveform's autocorrelation sidelobes located around the main lobe area.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123512334","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
扫码关注我们
求助内容：
应助结果提醒方式：