Pub Date : 2013-03-20DOI: 10.1109/CISS.2013.6552323
Yin Zhou, Kai Liu, Jinglun Gao, K. Barner, F. Kiamilev
In computer-vision-based human computer interaction (HCI), higher-quality signal leads to better system performance. In this paper, we develop a real-time high-resolution 3D object scanning system based on structured light illumination (SLI). Our system fuses depth information with RGB texture to reconstruct high-resolution 3D point cloud. The point cloud preserves accurate surface geometry of the object (e.g., finger postures of hands, facial expressions, etc). Respectively, for a 640 × 480 video stream, our system can generate phase and texture video at 1500 frames per second (fps) and produce full 3D point clouds at 300 fps. For gesture recognition, we propose to combine the module of robust face recognition with the module of 3D point cloud classification. Moreover, rather than extracting sophisticated features, we leverage the accurate reconstruction and classify each point cloud by directly matching the whole 3D surface geometry with the templates of different classes. The proposed recognition system is robust to the scaling, translation, rotation and texture of objects. Finally, utilizing the system, we contribute to the research community two large-scale high-resolution 3D point cloud databases, i.e., SLI 3D Hand Gesture Database and SLI 3D Face Database. The proposed point cloud recognition approach achieves recognition rates up to 98.0% over the gesture database and 88.2% over the face database in our pilot study.
{"title":"High-speed structured light scanning system and 3D gestural point cloud recognition","authors":"Yin Zhou, Kai Liu, Jinglun Gao, K. Barner, F. Kiamilev","doi":"10.1109/CISS.2013.6552323","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552323","url":null,"abstract":"In computer-vision-based human computer interaction (HCI), higher-quality signal leads to better system performance. In this paper, we develop a real-time high-resolution 3D object scanning system based on structured light illumination (SLI). Our system fuses depth information with RGB texture to reconstruct high-resolution 3D point cloud. The point cloud preserves accurate surface geometry of the object (e.g., finger postures of hands, facial expressions, etc). Respectively, for a 640 × 480 video stream, our system can generate phase and texture video at 1500 frames per second (fps) and produce full 3D point clouds at 300 fps. For gesture recognition, we propose to combine the module of robust face recognition with the module of 3D point cloud classification. Moreover, rather than extracting sophisticated features, we leverage the accurate reconstruction and classify each point cloud by directly matching the whole 3D surface geometry with the templates of different classes. The proposed recognition system is robust to the scaling, translation, rotation and texture of objects. Finally, utilizing the system, we contribute to the research community two large-scale high-resolution 3D point cloud databases, i.e., SLI 3D Hand Gesture Database and SLI 3D Face Database. The proposed point cloud recognition approach achieves recognition rates up to 98.0% over the gesture database and 88.2% over the face database in our pilot study.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124057747","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552254
Emine Merve Kaya, Mounya Elhilali
A key component in computational analysis of the auditory environment is the detection of novel sounds in the scene. Deviance detection aids in the segmentation of auditory objects and is also the basis of bottom-up auditory saliency, which is crucial in directing attention to relevant events. There is growing evidence that deviance detection is executed in the brain through mapping of the temporal regularities in the acoustic scene. The violation of these regularities is reflected as mismatch negativity (MMN), a signature electrical response observed using electro-encephalograpy (EEG) or magneto-encephalograpy (MEG). While numerous experimental results have quantified the properties of this MMN response, there have been few attempts at developing general computational frameworks of MMN that can be integrated in comprehensive models of scene analysis. In this work, we interpret the underlying mechanism of the MMN response as a Kalman-filter formulation that provides a recursive prediction of sound features based on the past sensory information; eliciting an MMN when predictions are violated. The model operates in a high-dimensional space, mimicking the rich set of features that underlie sound encoding up the level of auditory cortex. We test the proposed scheme on a variety of simple oddball paradigms adapted to various features of sounds: Pitch, intensity, direction, and inter-stimulus interval. Our model successfully finds the deviant onset times when the deviant varies from the standard in one or more of the calculated dimensions. Our results not only lay a foundation for modeling more complex elicitations of MMN, but also provide a versatile and robust mechanism for outlier detection in temporal signals and ultimately parsing of auditory scenes.
{"title":"A model of auditory deviance detection","authors":"Emine Merve Kaya, Mounya Elhilali","doi":"10.1109/CISS.2013.6552254","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552254","url":null,"abstract":"A key component in computational analysis of the auditory environment is the detection of novel sounds in the scene. Deviance detection aids in the segmentation of auditory objects and is also the basis of bottom-up auditory saliency, which is crucial in directing attention to relevant events. There is growing evidence that deviance detection is executed in the brain through mapping of the temporal regularities in the acoustic scene. The violation of these regularities is reflected as mismatch negativity (MMN), a signature electrical response observed using electro-encephalograpy (EEG) or magneto-encephalograpy (MEG). While numerous experimental results have quantified the properties of this MMN response, there have been few attempts at developing general computational frameworks of MMN that can be integrated in comprehensive models of scene analysis. In this work, we interpret the underlying mechanism of the MMN response as a Kalman-filter formulation that provides a recursive prediction of sound features based on the past sensory information; eliciting an MMN when predictions are violated. The model operates in a high-dimensional space, mimicking the rich set of features that underlie sound encoding up the level of auditory cortex. We test the proposed scheme on a variety of simple oddball paradigms adapted to various features of sounds: Pitch, intensity, direction, and inter-stimulus interval. Our model successfully finds the deviant onset times when the deviant varies from the standard in one or more of the calculated dimensions. Our results not only lay a foundation for modeling more complex elicitations of MMN, but also provide a versatile and robust mechanism for outlier detection in temporal signals and ultimately parsing of auditory scenes.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127992154","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552343
G. Yue, S. Rangarajan
In this paper, we develop low-complexity methods to compute the soft estimation of quadrature amplitude modulation (QAM) symbols with applications to iterative receivers. To reduce the complexity of the soft QAM estimation, we first consider squared QAM constellations and present a bit flipping based soft estimation scheme. With the gray mapping we derive an efficient approach which has a very low complexity of O(log N) for an NQAM constellation. To further simplify the approach, we propose a method which completely removes the multiplication operations at a cost of a slight performance degradation. Finally, we extend the proposed method to the non-squared QAM.
{"title":"Low-complexity methods for soft estimation of QAM Symbols","authors":"G. Yue, S. Rangarajan","doi":"10.1109/CISS.2013.6552343","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552343","url":null,"abstract":"In this paper, we develop low-complexity methods to compute the soft estimation of quadrature amplitude modulation (QAM) symbols with applications to iterative receivers. To reduce the complexity of the soft QAM estimation, we first consider squared QAM constellations and present a bit flipping based soft estimation scheme. With the gray mapping we derive an efficient approach which has a very low complexity of O(log N) for an NQAM constellation. To further simplify the approach, we propose a method which completely removes the multiplication operations at a cost of a slight performance degradation. Finally, we extend the proposed method to the non-squared QAM.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"35 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128606205","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552328
Bingwen Zhang, L. Lai
Uncoordinated frequency hopping (UFH) has recently emerged as an effective mechanism to defend against jamming attacks. Existing research focuses on the optimal design of the hopping pattern, which implicitly assumes that the strategy of the attacker is fixed. In practice, the attacker might adjust its strategy to maximize its damage on the communication system. In this paper, we study the design of optimal hopping pattern (the defense strategy) as long as the optimal jamming pattern (the attack strategy). In particular, we model the dynamic between the legitimate users and the attacker as a zero sum game, and study the property of this game. We show that when the legitimate users and the jammer can access only one channel at any time, the game has a unique Nash equilibrium. In the Nash equilibrium, the legitimate users and Eve will access or jam only a subset of channels that have good channel quality. Furthermore, the better the channel, the larger the probability that Eve will jam the channel and the smaller the probability the legitimate users will access this channel. We further extend the study to multiple access multiple jamming case and characterize the Nash equilibrium. We also give numerical results to illustrate the analytical results derived in this paper.
{"title":"Optimal strategies in jamming resistant uncoordinated frequency hopping systems","authors":"Bingwen Zhang, L. Lai","doi":"10.1109/CISS.2013.6552328","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552328","url":null,"abstract":"Uncoordinated frequency hopping (UFH) has recently emerged as an effective mechanism to defend against jamming attacks. Existing research focuses on the optimal design of the hopping pattern, which implicitly assumes that the strategy of the attacker is fixed. In practice, the attacker might adjust its strategy to maximize its damage on the communication system. In this paper, we study the design of optimal hopping pattern (the defense strategy) as long as the optimal jamming pattern (the attack strategy). In particular, we model the dynamic between the legitimate users and the attacker as a zero sum game, and study the property of this game. We show that when the legitimate users and the jammer can access only one channel at any time, the game has a unique Nash equilibrium. In the Nash equilibrium, the legitimate users and Eve will access or jam only a subset of channels that have good channel quality. Furthermore, the better the channel, the larger the probability that Eve will jam the channel and the smaller the probability the legitimate users will access this channel. We further extend the study to multiple access multiple jamming case and characterize the Nash equilibrium. We also give numerical results to illustrate the analytical results derived in this paper.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115999878","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 : 2013-03-20DOI: 10.1109/CISS.2013.6616689
Matthieu Ambroise, T. Levi, Y. Bornat, S. Saighi
In this paper, we present a digital hardware implementation of a biorealistic spiking neural network composed of 117 Izhikevich neurons. This digital system works in hard real-time, which means that it keeps the same biological time of simulation at the millisecond scale. The Izhikevich neuron implementation requires few resources. The neurons behavior is validated by comparing their firing rate to biological data. The interneuron connections are composed of biorealistic synapses. The architecture of the network implementation allows working on a single computation core. It is freely configurable from an independent-neuron configuration to all-to-all configuration or a mix with several independent small networks. This spiking neural network will be used for the development of a new proof-of-concept Brain Machine Interface, i.e. a neuromorphic chip for neuroprosthesis, which has to replace the functionality of a damaged part of the central nervous system.
{"title":"Biorealistic spiking neural network on FPGA","authors":"Matthieu Ambroise, T. Levi, Y. Bornat, S. Saighi","doi":"10.1109/CISS.2013.6616689","DOIUrl":"https://doi.org/10.1109/CISS.2013.6616689","url":null,"abstract":"In this paper, we present a digital hardware implementation of a biorealistic spiking neural network composed of 117 Izhikevich neurons. This digital system works in hard real-time, which means that it keeps the same biological time of simulation at the millisecond scale. The Izhikevich neuron implementation requires few resources. The neurons behavior is validated by comparing their firing rate to biological data. The interneuron connections are composed of biorealistic synapses. The architecture of the network implementation allows working on a single computation core. It is freely configurable from an independent-neuron configuration to all-to-all configuration or a mix with several independent small networks. This spiking neural network will be used for the development of a new proof-of-concept Brain Machine Interface, i.e. a neuromorphic chip for neuroprosthesis, which has to replace the functionality of a damaged part of the central nervous system.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117183359","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552329
Waqar Asif, H. K. Qureshi, M. Rajarajan
Data communication has a strong impact on the design of a Wireless Sensor Network (WSN), since the data transmission energy cost is typically higher than the data processing cost. In order to reduce the data transmission cost, small world phenomenon is introduced into WSNs. Networks that do not have the small world structure can be converted to achieve a small world property by the addition of few extra links. The problem is that most large scale WSNs are inherently unstructured and a node has no precise information of the overall model of the network and thus has to rely on the knowledge of its neighbor. For this reason, in most unstructured networks, information is propagated using gossiping. In this paper, we exploit this information propagation mechanism and use Neighbor Avoiding Walk (NAW), where the information is propagated to node that has not been visited previously and which is not the neighbor of a previously visited node. Using this, a novel approach is presented, in which nodes with highest betweenness centrality form a long distance relay path by using a lower order modulation scheme and therefore resulting in a relatively reduced data rate, but maintaining the same bit error rate. Our empirical and analytical evaluations demonstrate that this leads to a significant reduction in average path length and an increase in node degree.
{"title":"Variable rate adaptive modulation (VRAM) for introducing small-world model into WSNs","authors":"Waqar Asif, H. K. Qureshi, M. Rajarajan","doi":"10.1109/CISS.2013.6552329","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552329","url":null,"abstract":"Data communication has a strong impact on the design of a Wireless Sensor Network (WSN), since the data transmission energy cost is typically higher than the data processing cost. In order to reduce the data transmission cost, small world phenomenon is introduced into WSNs. Networks that do not have the small world structure can be converted to achieve a small world property by the addition of few extra links. The problem is that most large scale WSNs are inherently unstructured and a node has no precise information of the overall model of the network and thus has to rely on the knowledge of its neighbor. For this reason, in most unstructured networks, information is propagated using gossiping. In this paper, we exploit this information propagation mechanism and use Neighbor Avoiding Walk (NAW), where the information is propagated to node that has not been visited previously and which is not the neighbor of a previously visited node. Using this, a novel approach is presented, in which nodes with highest betweenness centrality form a long distance relay path by using a lower order modulation scheme and therefore resulting in a relatively reduced data rate, but maintaining the same bit error rate. Our empirical and analytical evaluations demonstrate that this leads to a significant reduction in average path length and an increase in node degree.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"1958 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128034043","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552320
Qi Wang
For many popular stochastic approximation algorithms, such as simultaneous perturbation stochastic approximation method and stochastic gradient method, the practical gain sequence selections are different from the optimal selection, which is theoretically derived from asymptotically performance. We provide formal justification for the reasons why we choose such gain sequence in practice.
{"title":"Formal analysis for practical gain sequence selection in recursive stochastic approximation algorithms","authors":"Qi Wang","doi":"10.1109/CISS.2013.6552320","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552320","url":null,"abstract":"For many popular stochastic approximation algorithms, such as simultaneous perturbation stochastic approximation method and stochastic gradient method, the practical gain sequence selections are different from the optimal selection, which is theoretically derived from asymptotically performance. We provide formal justification for the reasons why we choose such gain sequence in practice.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"602 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121979416","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 : 2013-03-20DOI: 10.1109/CISS.2013.6624261
Kuang Cai, Hongbin Li, J. Mitola
The subspace method is an effective approach for blind channel identification. It works in the case when information such as the pulse shaping filter and the anti-aliasing filter responses are fully known. In practice, unknown perturbation may cause the transmitter/receiver filter response to be partially known, such as with I/Q imbalance and distortions of the filter due to environmental factors (temperature, humidity. etc.). Here we introduce two blind channel identification algorithms for two common situations, improving the performance of channel identification in cases when perturbation exists. Specifically, if the perturbation is totally unknown, we propose an iterative channel identification algorithm; for the situation in which some statistical knowledge of perturbation, such as the covariance of the perturbation, is known, we propose a robust knowledgeaided iterative channel identification algorithm to improve the estimation accuracy. Our simulation results demonstrate the performance of our new approaches.
{"title":"Robust knowledge-aided multipath channel identification based on partial filter information","authors":"Kuang Cai, Hongbin Li, J. Mitola","doi":"10.1109/CISS.2013.6624261","DOIUrl":"https://doi.org/10.1109/CISS.2013.6624261","url":null,"abstract":"The subspace method is an effective approach for blind channel identification. It works in the case when information such as the pulse shaping filter and the anti-aliasing filter responses are fully known. In practice, unknown perturbation may cause the transmitter/receiver filter response to be partially known, such as with I/Q imbalance and distortions of the filter due to environmental factors (temperature, humidity. etc.). Here we introduce two blind channel identification algorithms for two common situations, improving the performance of channel identification in cases when perturbation exists. Specifically, if the perturbation is totally unknown, we propose an iterative channel identification algorithm; for the situation in which some statistical knowledge of perturbation, such as the covariance of the perturbation, is known, we propose a robust knowledgeaided iterative channel identification algorithm to improve the estimation accuracy. Our simulation results demonstrate the performance of our new approaches.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125306579","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552294
M. Joham, Andreas Gründinger, A. Pastore, J. Fonollosa, W. Utschick
For the vector broadcast channel (BC), the case of erroneous channel state information (CSI) at the receiver is considered. Employing a well established lower bound for the mutual information with Gaussian signaling, a rate balancing problem is formulated where the rates of the different users are maximized under a transmit power constraint, but the rates of the different users have fixed ratios. A duality w.r.t. the signal-to-interference-and-noise ratio (SINR) between the vector BC with erroneous receiver CSI and an appropriately constructed vector multiple access channel (MAC) is established. Based on the observation that an interference function can be defined in the dual vector MAC that is standard, an iterative algorithm can be found for an appropriately formulated quality-of-service (QoS) optimization that is used for solving the balancing problem.
{"title":"Rate balancing in the vector BC with erroneous CSI at the receivers","authors":"M. Joham, Andreas Gründinger, A. Pastore, J. Fonollosa, W. Utschick","doi":"10.1109/CISS.2013.6552294","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552294","url":null,"abstract":"For the vector broadcast channel (BC), the case of erroneous channel state information (CSI) at the receiver is considered. Employing a well established lower bound for the mutual information with Gaussian signaling, a rate balancing problem is formulated where the rates of the different users are maximized under a transmit power constraint, but the rates of the different users have fixed ratios. A duality w.r.t. the signal-to-interference-and-noise ratio (SINR) between the vector BC with erroneous receiver CSI and an appropriately constructed vector multiple access channel (MAC) is established. Based on the observation that an interference function can be defined in the dual vector MAC that is standard, an iterative algorithm can be found for an appropriately formulated quality-of-service (QoS) optimization that is used for solving the balancing problem.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133957012","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552313
F. Yang, Xi Zhang, Jingsong Leng
In this paper, we propose a preamble-based symbol timing estimator for wireless orthogonal frequency division multiplexing (OFDM) systems. The preamble is designed with repeated structure. By using several candidate sequences generated by the preamble, the addressed estimator is robust to the degree of channel distortions. The generated sequences with the best correlation properties are selected based on correlation ranking. Compared with the existing representative schemes, our estimator has performance improvement in ETU channel with acceptable complexity.
{"title":"A novel preamble-based robust coarse symbol timing estimators for OFDM systems","authors":"F. Yang, Xi Zhang, Jingsong Leng","doi":"10.1109/CISS.2013.6552313","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552313","url":null,"abstract":"In this paper, we propose a preamble-based symbol timing estimator for wireless orthogonal frequency division multiplexing (OFDM) systems. The preamble is designed with repeated structure. By using several candidate sequences generated by the preamble, the addressed estimator is robust to the degree of channel distortions. The generated sequences with the best correlation properties are selected based on correlation ranking. Compared with the existing representative schemes, our estimator has performance improvement in ETU channel with acceptable complexity.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133088024","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
扫码关注我们
求助内容：
应助结果提醒方式：