Pub Date : 2007-11-21DOI: 10.1109/SIPS.2007.4387518
Guoguang Chen, R. Ansari
The integration of Orthogonal Frequency Division Multiplexing (OFDM) into Multiple Input Multiple Output (MIMO) systems is regarded as a promising technology to provide high performance in fourth generation (4G) broadband wireless communication systems. However, the inherent drawback of large Peak-to-Average Power Ratio (PAPR) for OFDM carries over to MIMO systems. This paper examines the use of Erasure Pattern Selection (EPS) developed for Single Input Single Output (SISO) systems for the task of reducing PAPR in MIMO-OFDM systems. A MIMO-EPS scheme is proposed for minimizing the peak power value over all antennas, which is shown to produce a PAPR reduction gain around 1.5dB for 2 transmit antennas compared with the conventional MIMO-OFDM. The scheme is analyzed to show its significant performance advantages and lower computational complexity compared with an existing SeLective Mapping (SLM) scheme.
{"title":"Frame Expansion Based Peak to Average Power Ratio Reduction in MIMO OFDM Systems","authors":"Guoguang Chen, R. Ansari","doi":"10.1109/SIPS.2007.4387518","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387518","url":null,"abstract":"The integration of Orthogonal Frequency Division Multiplexing (OFDM) into Multiple Input Multiple Output (MIMO) systems is regarded as a promising technology to provide high performance in fourth generation (4G) broadband wireless communication systems. However, the inherent drawback of large Peak-to-Average Power Ratio (PAPR) for OFDM carries over to MIMO systems. This paper examines the use of Erasure Pattern Selection (EPS) developed for Single Input Single Output (SISO) systems for the task of reducing PAPR in MIMO-OFDM systems. A MIMO-EPS scheme is proposed for minimizing the peak power value over all antennas, which is shown to produce a PAPR reduction gain around 1.5dB for 2 transmit antennas compared with the conventional MIMO-OFDM. The scheme is analyzed to show its significant performance advantages and lower computational complexity compared with an existing SeLective Mapping (SLM) scheme.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"3 1","pages":"61-66"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88911824","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387625
J. Park, M. Sunwoo, Pansoo Kim, D. Chang
This paper presents an efficient initial frequency synchronizer for DVB-S2. An initial frequency offset of the DVB-S2 is around ±5 MHz, which represents 20% of the symbol rate at 25 Mbaud. To estimate a large initial frequency offset, the algorithm which can provide a large estimation range is required. Through the analysis of the Data-aided (DA) algorithms, we find that the Mengali and Moreli (M&M) algorithm can estimate a large initial frequency offset at low SNR. Based on the algorithm, we propose an efficient initial frequency synchronizer to reduce hardware complexity. The proposed architecture can reduce about 68% multipliers, 55% arctan units and 54% adder/subtractors compared with the direct implementation. The proposed architecture has been thoroughly verified using a FPGA board having the the XilinxTM Virtex II.
{"title":"An Efficient Data-Aided Initial Frequency Synchronizer for DVB-S2","authors":"J. Park, M. Sunwoo, Pansoo Kim, D. Chang","doi":"10.1109/SIPS.2007.4387625","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387625","url":null,"abstract":"This paper presents an efficient initial frequency synchronizer for DVB-S2. An initial frequency offset of the DVB-S2 is around ±5 MHz, which represents 20% of the symbol rate at 25 Mbaud. To estimate a large initial frequency offset, the algorithm which can provide a large estimation range is required. Through the analysis of the Data-aided (DA) algorithms, we find that the Mengali and Moreli (M&M) algorithm can estimate a large initial frequency offset at low SNR. Based on the algorithm, we propose an efficient initial frequency synchronizer to reduce hardware complexity. The proposed architecture can reduce about 68% multipliers, 55% arctan units and 54% adder/subtractors compared with the direct implementation. The proposed architecture has been thoroughly verified using a FPGA board having the the XilinxTM Virtex II.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"46 17","pages":"645-650"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/SIPS.2007.4387625","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72422780","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387558
G. Song, W. Zhuang, Zhigang Wei, Aiguo Song
In order to better control the mobile nodes in wireless sensor networks, an effective navigation algorithm is proposed in this paper. The static nodes are used as beacons. The methods of topology credits and TDOA (time difference of arrival) are adopted. Credits of nodes are used to create topology of the networks. Meanwhile, the TDOA method is used to calculate the distance of neighbor nodes to determine the next turning angle. Simulation and experimental results show that the proposed algorithm is effective in navigating the mobile nodes precisely to the region of interest. The comparison between the proposed algorithm and the VFF (virtual force field) method shows that the former has better performance in guiding mobile nodes in wireless sensor networks.
{"title":"An Effective Algorithm for Guiding Mobile Nodes in Wireless Sensor Networks","authors":"G. Song, W. Zhuang, Zhigang Wei, Aiguo Song","doi":"10.1109/SIPS.2007.4387558","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387558","url":null,"abstract":"In order to better control the mobile nodes in wireless sensor networks, an effective navigation algorithm is proposed in this paper. The static nodes are used as beacons. The methods of topology credits and TDOA (time difference of arrival) are adopted. Credits of nodes are used to create topology of the networks. Meanwhile, the TDOA method is used to calculate the distance of neighbor nodes to determine the next turning angle. Simulation and experimental results show that the proposed algorithm is effective in navigating the mobile nodes precisely to the region of interest. The comparison between the proposed algorithm and the VFF (virtual force field) method shows that the former has better performance in guiding mobile nodes in wireless sensor networks.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"123 1","pages":"279-282"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75743010","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387606
Shi Chen, Youxing Gao
We describe representations of gait appearance features for the purpose of pedestrian identification. We construct two kinds of scalar valued spatiotemporal templates in 2D images, backward stride history image (bSHI) and forward stride history image (fSHI), to represent how change of pedestrian silhouettes is evolved. To define the stride length and ensure an invariant analysis due to differences in gait period, we perform a gait period estimation procedure using nonlinear analysis beforehand. We make use of a family of multi-layer windows to capture SHI image signature in the form of combined moment feature vectors for individual identification. The proposed approach achieves identification capability by an 86.56% CCR on Soton database and improvements are seen with respect to other methods.
{"title":"Stride History Image: A New Feature Representation for Pedestrian Identification","authors":"Shi Chen, Youxing Gao","doi":"10.1109/SIPS.2007.4387606","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387606","url":null,"abstract":"We describe representations of gait appearance features for the purpose of pedestrian identification. We construct two kinds of scalar valued spatiotemporal templates in 2D images, backward stride history image (bSHI) and forward stride history image (fSHI), to represent how change of pedestrian silhouettes is evolved. To define the stride length and ensure an invariant analysis due to differences in gait period, we perform a gait period estimation procedure using nonlinear analysis beforehand. We make use of a family of multi-layer windows to capture SHI image signature in the form of combined moment feature vectors for individual identification. The proposed approach achieves identification capability by an 86.56% CCR on Soton database and improvements are seen with respect to other methods.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"64 1","pages":"543-547"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76828622","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387613
Lu Yang, S. Attallah, G. Mathew
The aim of this paper is twofold: 1) to stabilize a fast adaptive noise subspace algorithm, which was proposed earlier in the literature under the name of FRANS algorithm; and 2) to present a low computational cost version that is free from any square root and division operations, which is very suitable for VLSI implementation. A theoretical mean-square analysis and simulation results are also given in order to assess the performance of this algorithm.
{"title":"Stable Noise Subspace Estimation Algorithm Suitable for VLSI Implementation","authors":"Lu Yang, S. Attallah, G. Mathew","doi":"10.1109/SIPS.2007.4387613","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387613","url":null,"abstract":"The aim of this paper is twofold: 1) to stabilize a fast adaptive noise subspace algorithm, which was proposed earlier in the literature under the name of FRANS algorithm; and 2) to present a low computational cost version that is free from any square root and division operations, which is very suitable for VLSI implementation. A theoretical mean-square analysis and simulation results are also given in order to assess the performance of this algorithm.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"92 1","pages":"579-583"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76370127","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387537
Jiun-Ping Wang, Shiann-Rong Kuang
In this paper, a framework of designing a low-error signed fixed-width multiplier that receives two n-bits operands and generates an n-bits product is proposed. The proposed error compensation circuit not only leads signed fixed-width multipliers to very low maximum error, mean error and mean-square error but also can be easily constructed with a simple logic gate. Moreover, the proposed signed fixed-width multiplier is also applied to the inverse discrete cosine transform computation in JPEG image compression. Experimental results demonstrate that the proposed circuit not only improves the accurate performance but also significantly reduces the hardware complexity and power consumption when compared with the previous published compensation circuit.
{"title":"Area-Efficient Signed Fixed-Width Multipliers with Low-Error Compensation Circuit","authors":"Jiun-Ping Wang, Shiann-Rong Kuang","doi":"10.1109/SIPS.2007.4387537","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387537","url":null,"abstract":"In this paper, a framework of designing a low-error signed fixed-width multiplier that receives two n-bits operands and generates an n-bits product is proposed. The proposed error compensation circuit not only leads signed fixed-width multipliers to very low maximum error, mean error and mean-square error but also can be easily constructed with a simple logic gate. Moreover, the proposed signed fixed-width multiplier is also applied to the inverse discrete cosine transform computation in JPEG image compression. Experimental results demonstrate that the proposed circuit not only improves the accurate performance but also significantly reduces the hardware complexity and power consumption when compared with the previous published compensation circuit.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"5 1","pages":"157-162"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75170079","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387609
A. Vijayakumar, G. Abhilash
This paper contains the application of Unimodular Filterbanks (UMFBs) based on two new structures for audio coding. Two key properties make UMFBs ideal for audio coding applications. Firstly, they have the lowest possible system delay of M ¿ 1 samples, where M is the number of channels. This property resolves the problem of pre-echoes. Secondly, the presence of nilpotent matrix in the structure furnishes unequal lengths of analysis and synthesis filters to adapt to perceptual limits; long analysis filters for good frequency selectivity and short synthesis filters for noise reduction. The proposed structures ensure perfect reconstruction (PR) and are of minimum delay in the McMillan sense. The number of free parameters is as low as 2M and the optimal set of parameters can be obtained with unconstrained optimization. The low computational overhead makes it suitable for simple and efficient hardware implementation. We have also carried out a brief study of the quantization noise shaping with the proposed structures.
{"title":"Application of Unimodular Filterbanks for Audio Coding","authors":"A. Vijayakumar, G. Abhilash","doi":"10.1109/SIPS.2007.4387609","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387609","url":null,"abstract":"This paper contains the application of Unimodular Filterbanks (UMFBs) based on two new structures for audio coding. Two key properties make UMFBs ideal for audio coding applications. Firstly, they have the lowest possible system delay of M ¿ 1 samples, where M is the number of channels. This property resolves the problem of pre-echoes. Secondly, the presence of nilpotent matrix in the structure furnishes unequal lengths of analysis and synthesis filters to adapt to perceptual limits; long analysis filters for good frequency selectivity and short synthesis filters for noise reduction. The proposed structures ensure perfect reconstruction (PR) and are of minimum delay in the McMillan sense. The number of free parameters is as low as 2M and the optimal set of parameters can be obtained with unconstrained optimization. The low computational overhead makes it suitable for simple and efficient hardware implementation. We have also carried out a brief study of the quantization noise shaping with the proposed structures.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"60 1","pages":"556-561"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76021808","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387611
T. Tsai, Chung-Yuan Lin
The task of automatic gesture segmentation is highly challenging due to the computational burden, the presence of unpredictable body motion and ambiguous nongesture hand motion. In this paper, a new approach is developed using Hausdorff based model tracking technique for the application of real-time human-computer interaction. This paper proposed a Three Phases Model Tracking approach, which consists of two main stages; one is motion history analysis, which classifies dynamic gesture into preparation, retraction and nucleus state based on temporal relationship. The other is model tracking, which tracks signer model and object model with different constraint based on the classified state. Finally, gesture model is extracted based on matching object model and signer model and the hand gesture region is segmented from the gesture model. Experiments are performed to test the robustness of gesture segmentation under various hand scale and complex background. The segmentation error rate and computational complexity are also analyzed to demonstrate that the proposed Three Phases Model Tracking approach can be applicable to real-time human-computer interaction system.
{"title":"Visual Hand Gesture Segmentation Using Signer Model for Real-Time Human-Computer Interaction Application","authors":"T. Tsai, Chung-Yuan Lin","doi":"10.1109/SIPS.2007.4387611","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387611","url":null,"abstract":"The task of automatic gesture segmentation is highly challenging due to the computational burden, the presence of unpredictable body motion and ambiguous nongesture hand motion. In this paper, a new approach is developed using Hausdorff based model tracking technique for the application of real-time human-computer interaction. This paper proposed a Three Phases Model Tracking approach, which consists of two main stages; one is motion history analysis, which classifies dynamic gesture into preparation, retraction and nucleus state based on temporal relationship. The other is model tracking, which tracks signer model and object model with different constraint based on the classified state. Finally, gesture model is extracted based on matching object model and signer model and the hand gesture region is segmented from the gesture model. Experiments are performed to test the robustness of gesture segmentation under various hand scale and complex background. The segmentation error rate and computational complexity are also analyzed to demonstrate that the proposed Three Phases Model Tracking approach can be applicable to real-time human-computer interaction system.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"14 1","pages":"567-572"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91104258","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387614
Lu Yang, S. Attallah
In this paper, we propose a new optimal diagonal-matrix step-size for the fast data projection method (FDPM) algorithm. The proposed step-sizes control the decoupled subspace vectors individually as compared to conventional methods where all the subspace vectors are multiplied by the same step-size value (scalar case). Simulation results show that FDPM with this optimal diagonal-matrix step-size outperforms the original algorithm as it offers faster convergence rate, smaller steady state error and smaller orthogonality error simultaneously. The proposed method can easily be applied to other subspace algorithms as well.
{"title":"Adaptive Noise Subspace Estimation Algorithm with an Optimal Diagonal-Matrix Step-Size","authors":"Lu Yang, S. Attallah","doi":"10.1109/SIPS.2007.4387614","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387614","url":null,"abstract":"In this paper, we propose a new optimal diagonal-matrix step-size for the fast data projection method (FDPM) algorithm. The proposed step-sizes control the decoupled subspace vectors individually as compared to conventional methods where all the subspace vectors are multiplied by the same step-size value (scalar case). Simulation results show that FDPM with this optimal diagonal-matrix step-size outperforms the original algorithm as it offers faster convergence rate, smaller steady state error and smaller orthogonality error simultaneously. The proposed method can easily be applied to other subspace algorithms as well.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"2 1","pages":"584-588"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87419263","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387568
Zhu Gang, Yang Ping, Yun He
Multi-view Video Coding (MVC) is a fundamental encoding technique for FTV (free-viewpoint television), 3DTV (3D television) and surveillance. Efficient MVC requires coding algorithms exploiting temporal as well as inter-view dependencies between cameras. Assisted by the camera parameters the inter-view dependencies can be properly utilized. We propose in this paper a new inter-view prediction method based on camera parameters. The comparative test results based on the JSVM software platform are shown.
{"title":"A New Inter-View Prediction Method for Multi-View Video Coding","authors":"Zhu Gang, Yang Ping, Yun He","doi":"10.1109/SIPS.2007.4387568","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387568","url":null,"abstract":"Multi-view Video Coding (MVC) is a fundamental encoding technique for FTV (free-viewpoint television), 3DTV (3D television) and surveillance. Efficient MVC requires coding algorithms exploiting temporal as well as inter-view dependencies between cameras. Assisted by the camera parameters the inter-view dependencies can be properly utilized. We propose in this paper a new inter-view prediction method based on camera parameters. The comparative test results based on the JSVM software platform are shown.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"2016 1","pages":"337-340"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86583465","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
扫码关注我们
求助内容：
应助结果提醒方式：