Pub Date : 2008-12-08DOI: 10.1109/ICOSP.2008.4697509
Ling-yun Lu, Yang Xiao, Shujun Zhang
MIMO-OFDM is considered as candidates for future 3G/B3G broadband wireless services. High quality mobile services have to eliminate multiple-access interference (MAI) that affects multi-user receiver performance in MIMO-OFDM system. For conventional MIMO system, the various multiplexing schemes are proposed under multiple user scenarios in order to gain the appropriate performance. In this paper, we analyze the effect of MAI on MIMO-OFDM system and propose an adaptive MMSE space-time multi-user detector for MIMO-OFDM system. We adopt the Lagrange multipliers method and extend the constraint space scheme for decreasing the complexity of system. The simulation experiments make suitable comparisons for the different users and the different SNR conditions in the novel scheme for the MIMO-OFDM system. The results show that the scheme has some significant.
{"title":"MMSE space-time multi-user detection in MIMO-OFDM system","authors":"Ling-yun Lu, Yang Xiao, Shujun Zhang","doi":"10.1109/ICOSP.2008.4697509","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697509","url":null,"abstract":"MIMO-OFDM is considered as candidates for future 3G/B3G broadband wireless services. High quality mobile services have to eliminate multiple-access interference (MAI) that affects multi-user receiver performance in MIMO-OFDM system. For conventional MIMO system, the various multiplexing schemes are proposed under multiple user scenarios in order to gain the appropriate performance. In this paper, we analyze the effect of MAI on MIMO-OFDM system and propose an adaptive MMSE space-time multi-user detector for MIMO-OFDM system. We adopt the Lagrange multipliers method and extend the constraint space scheme for decreasing the complexity of system. The simulation experiments make suitable comparisons for the different users and the different SNR conditions in the novel scheme for the MIMO-OFDM system. The results show that the scheme has some significant.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"221 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120870205","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697068
Chao Zhang, Shaohai Hu, Yang Xiao, Xue-fen Wang
For the 2D continuous space-time (CST) systems are described by linear 2-D partial equations, generally, it is impossible to get the closed solutions of the CST systems. To get the space-time response of CST systems needs the inverse 2-D Laplace transform. However, the 2-D inverse Laplace transform (ILT) does not exist for unstable CST, a theorem is proposed to ensure the 2-D ILT to be obtained for stable CST systems. In this paper, we present the approach to get the solutions of CST systems, we also derive an algorithm of numerical 2-D ILT for the vector spatial-time response analysis of CST systems.
{"title":"The application of 2-D numerical inversion of Laplace transform","authors":"Chao Zhang, Shaohai Hu, Yang Xiao, Xue-fen Wang","doi":"10.1109/ICOSP.2008.4697068","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697068","url":null,"abstract":"For the 2D continuous space-time (CST) systems are described by linear 2-D partial equations, generally, it is impossible to get the closed solutions of the CST systems. To get the space-time response of CST systems needs the inverse 2-D Laplace transform. However, the 2-D inverse Laplace transform (ILT) does not exist for unstable CST, a theorem is proposed to ensure the 2-D ILT to be obtained for stable CST systems. In this paper, we present the approach to get the solutions of CST systems, we also derive an algorithm of numerical 2-D ILT for the vector spatial-time response analysis of CST systems.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124003408","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697554
Chih-Jen Lee, I. Jeng, Tai-Ning Yang, Chun-Jung Chen, Keng-Li Lin
In fingerprints, singular points, including cores and deltas, are very important features. To classify the types of fingerprints, the number and the position of cores and deltas are concerned. For fingerprint matching, some approaches used the core point to align two fingerprint images to overcome the problems from rotation and translation. Therefore, singular points detection is a critical process for both fingerprint matching and fingerprint classification. The process of singular points detection must be robust; otherwise, the performance of the whole fingerprint recognition system would be influenced heavily. In this paper, we will use Gabor transform, sampling by a complete set of Gabor basis functions, to demonstrate the phenomenon of the regions of singular points. Besides, we will develop a robust method to detect singular points.
{"title":"Singular points detection in fingerprint images using Gabor transform","authors":"Chih-Jen Lee, I. Jeng, Tai-Ning Yang, Chun-Jung Chen, Keng-Li Lin","doi":"10.1109/ICOSP.2008.4697554","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697554","url":null,"abstract":"In fingerprints, singular points, including cores and deltas, are very important features. To classify the types of fingerprints, the number and the position of cores and deltas are concerned. For fingerprint matching, some approaches used the core point to align two fingerprint images to overcome the problems from rotation and translation. Therefore, singular points detection is a critical process for both fingerprint matching and fingerprint classification. The process of singular points detection must be robust; otherwise, the performance of the whole fingerprint recognition system would be influenced heavily. In this paper, we will use Gabor transform, sampling by a complete set of Gabor basis functions, to demonstrate the phenomenon of the regions of singular points. Besides, we will develop a robust method to detect singular points.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125707404","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697667
Peng Chen, Xiang Tian, Yao-wu Chen, Xiaofan Yang
This paper presents one multi-FPGA system board for implementing delay-sum beamforming of three-dimensional (3-D) sonar in the frequency-domain. The Matlab simulation is demonstrated by splitting the delay-sum beamforming into two steps where two stages FPGAs system implementation is utilized. This paper also analyzes discrete Fourier transform (DFT) of sample data, the communication bandwidth and memory requirements of this system architecture. The paper illustrates that the proposed multi-FPGA system can implement 10,000 beams and 576 sensors of 2 KHz beamspsila array update rate per second. The performance advantage is supported by the rapid development of serial communication and the configurable high performance FPGAs.
{"title":"Delay-sum beamforming on FPGA","authors":"Peng Chen, Xiang Tian, Yao-wu Chen, Xiaofan Yang","doi":"10.1109/ICOSP.2008.4697667","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697667","url":null,"abstract":"This paper presents one multi-FPGA system board for implementing delay-sum beamforming of three-dimensional (3-D) sonar in the frequency-domain. The Matlab simulation is demonstrated by splitting the delay-sum beamforming into two steps where two stages FPGAs system implementation is utilized. This paper also analyzes discrete Fourier transform (DFT) of sample data, the communication bandwidth and memory requirements of this system architecture. The paper illustrates that the proposed multi-FPGA system can implement 10,000 beams and 576 sensors of 2 KHz beamspsila array update rate per second. The performance advantage is supported by the rapid development of serial communication and the configurable high performance FPGAs.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126138038","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697745
L. Song, Yi-nan Mu, Xiao-lin Qiao, Qun Wu
The mono-pulse radars have been widely used in many fields such as target tracking because they have high angle measurement accuracy and good anti-jamming ability. It is important to research, develop and measure the mono-pulse radar antennas. This paper design a kind of mono-pulse antenna measurement system based on turning table, step motor controller, vector network analyzer and the Visual Basic development environment. The antenna measurement system has two channels to acquire and analyze data, then the sum and difference directional pattern of the antenna can be measured fast and accurately. Based on the theorem of the mono-pulse antenna measurement system, this paper introduces the system hardware structure and the software implementation scheme in detail. Finally, some basic practical measurements were done and the experiment measurement results indicate that the system can basically satisfy the design requirements.
{"title":"Design and implementation of an antenna measurement system for the mono-pulse radar","authors":"L. Song, Yi-nan Mu, Xiao-lin Qiao, Qun Wu","doi":"10.1109/ICOSP.2008.4697745","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697745","url":null,"abstract":"The mono-pulse radars have been widely used in many fields such as target tracking because they have high angle measurement accuracy and good anti-jamming ability. It is important to research, develop and measure the mono-pulse radar antennas. This paper design a kind of mono-pulse antenna measurement system based on turning table, step motor controller, vector network analyzer and the Visual Basic development environment. The antenna measurement system has two channels to acquire and analyze data, then the sum and difference directional pattern of the antenna can be measured fast and accurately. Based on the theorem of the mono-pulse antenna measurement system, this paper introduces the system hardware structure and the software implementation scheme in detail. Finally, some basic practical measurements were done and the experiment measurement results indicate that the system can basically satisfy the design requirements.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124748211","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697596
Zhao Zhao, Xiang-Quan Shi
Orthogonal netted radar systems (ONRS) can fundamentally improve radar performance by using a group of specially designed orthogonal polyphase code signals. However, the existing numerical solutions only address autocorrelation and cross-correlation properties with the result that the signals degrade severely in the presence of small Doppler shifts. In the context of these problems, a new hybrid polyphase code set which combines single frequency pulse with the designed orthogonal polyphase signal, is presented to implement Doppler compensation and keep ONRS a good resilience to Doppler shifts. Doppler frequency of the target is firstly estimated based on interpolated FFT in the time span of single frequency pulse and the Doppler compensated signal can be constructed to maintain Doppler tolerance. The construction of Doppler compensated signals is illustrated. Simulation results show that the proposed hybrid polyphase code set is effective for moving target detection in ONRS.
{"title":"Doppler compensation for orthogonal netted radar systems","authors":"Zhao Zhao, Xiang-Quan Shi","doi":"10.1109/ICOSP.2008.4697596","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697596","url":null,"abstract":"Orthogonal netted radar systems (ONRS) can fundamentally improve radar performance by using a group of specially designed orthogonal polyphase code signals. However, the existing numerical solutions only address autocorrelation and cross-correlation properties with the result that the signals degrade severely in the presence of small Doppler shifts. In the context of these problems, a new hybrid polyphase code set which combines single frequency pulse with the designed orthogonal polyphase signal, is presented to implement Doppler compensation and keep ONRS a good resilience to Doppler shifts. Doppler frequency of the target is firstly estimated based on interpolated FFT in the time span of single frequency pulse and the Doppler compensated signal can be constructed to maintain Doppler tolerance. The construction of Doppler compensated signals is illustrated. Simulation results show that the proposed hybrid polyphase code set is effective for moving target detection in ONRS.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129457046","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697357
Jin Li, M. Gabbouj, J. Takala, Hexin Chen
Most mobile devices are currently suffering from the lack of computational power and energy-consumption constraints, there is significant interest and research in reducing the computational complexity for fast video coding. This paper proposes a statistical model to predict the zero-quantized DCT (ZQDCT) coefficients for 3-D DCT video coding and thus to speech up the encoding process. First, each 8times8times8 pixel cube at the input of DCT is decomposed into a mean value and a residual 8times8times8 pixel cube. Subsequently, a statistical Laplacian model is mathematically developed to predict the ZQDCT coefficients. Finally, the redundant calculations for these ZQDCT coefficients are skipped. Compared to the baseline encoding method, the proposed model can significantly simplify the complexity and achieve better real-time performance at the expense of negligible visual degradation. Computational reduction also implies longer battery lifetime and energy economy for portable devices.
{"title":"Simplified video coding for digital mobile devices","authors":"Jin Li, M. Gabbouj, J. Takala, Hexin Chen","doi":"10.1109/ICOSP.2008.4697357","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697357","url":null,"abstract":"Most mobile devices are currently suffering from the lack of computational power and energy-consumption constraints, there is significant interest and research in reducing the computational complexity for fast video coding. This paper proposes a statistical model to predict the zero-quantized DCT (ZQDCT) coefficients for 3-D DCT video coding and thus to speech up the encoding process. First, each 8times8times8 pixel cube at the input of DCT is decomposed into a mean value and a residual 8times8times8 pixel cube. Subsequently, a statistical Laplacian model is mathematically developed to predict the ZQDCT coefficients. Finally, the redundant calculations for these ZQDCT coefficients are skipped. Compared to the baseline encoding method, the proposed model can significantly simplify the complexity and achieve better real-time performance at the expense of negligible visual degradation. Computational reduction also implies longer battery lifetime and energy economy for portable devices.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128365120","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697482
Lanying Zhang, Sijie Yuan, X. Hou
This paper proposes a novel pulse code modulation /frequency modulation (PCM/FM) demodulation method using an efficient recursive algorithm to compute discrete short-time Fourier transform (DSTFT) of the signal. In this approach, instead of excluding the old samples, their importance is diminished by using all-pole moving-windows. The DSTFT-based PCM/FM demodulation method is simple because it expands the signal in a time-frequency plane and demodulates it only by searching the instantaneous spectral peaks without complicated carrier-recovery circuit. The computation is reduced and the bit error rate(BER) is degraded. Its effectiveness is illustrated by the simulation and test results.
{"title":"A novel PCM/FM demodulation method using DSTFT analysis","authors":"Lanying Zhang, Sijie Yuan, X. Hou","doi":"10.1109/ICOSP.2008.4697482","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697482","url":null,"abstract":"This paper proposes a novel pulse code modulation /frequency modulation (PCM/FM) demodulation method using an efficient recursive algorithm to compute discrete short-time Fourier transform (DSTFT) of the signal. In this approach, instead of excluding the old samples, their importance is diminished by using all-pole moving-windows. The DSTFT-based PCM/FM demodulation method is simple because it expands the signal in a time-frequency plane and demodulates it only by searching the instantaneous spectral peaks without complicated carrier-recovery circuit. The computation is reduced and the bit error rate(BER) is degraded. Its effectiveness is illustrated by the simulation and test results.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129587446","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697739
Wang Ning, Xu De
Dataspace systems are typically pay-as-you-go systems compared with traditional integration systems. Integration semantics and relationships among resources can be gradually enhanced over time. A system should support graceful transition between keyword query and structured query. A resource summary can be of great help in this situation, which provides an approximate overview of the entire structure of the dataspace. It can be refined over time when more and more semantics are obtained. We formally define a resource summary in this paper, and develop algorithms that allow us to automatically generate resource summaries and to refine them with the system running. Resource summaries are obviously important for advanced users and could be used in query optimization for pay-as-you-go dataspace systems.
{"title":"Resource summary for pay-as-you-go dataspace systems","authors":"Wang Ning, Xu De","doi":"10.1109/ICOSP.2008.4697739","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697739","url":null,"abstract":"Dataspace systems are typically pay-as-you-go systems compared with traditional integration systems. Integration semantics and relationships among resources can be gradually enhanced over time. A system should support graceful transition between keyword query and structured query. A resource summary can be of great help in this situation, which provides an approximate overview of the entire structure of the dataspace. It can be refined over time when more and more semantics are obtained. We formally define a resource summary in this paper, and develop algorithms that allow us to automatically generate resource summaries and to refine them with the system running. Resource summaries are obviously important for advanced users and could be used in query optimization for pay-as-you-go dataspace systems.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129798732","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 : 2008-12-08DOI: 10.1109/ICOSP.2008.4697367
Jing Wu, Xin Du, Yunfang Zhu, Gu Wei-kang
In order to improve the perceptual quality and the compression efficiency in video transition, a new adaptive fuzzy filter algorithm for real-time Gaussian noise removal is proposed. Based on the analysis of noise and video properties, it exploits the spatiotemporal neighbor information through noise estimation, motion detection, and spatiotemporal neighborspsila similarity measurement. Then, an adaptive fuzzy filter is applied to remove noise. Experimental results showed that the proposed method achieved better performances of noise removal and detail preservation. Compared with other methods, PSNR of the denoised video was improved 1~ 6 dB. And, benefited from its low complexity and fast computation, it could meet the real-time requirements of the video transition.
{"title":"Adaptive fuzzy filter algorithm for real-time video denoising","authors":"Jing Wu, Xin Du, Yunfang Zhu, Gu Wei-kang","doi":"10.1109/ICOSP.2008.4697367","DOIUrl":"https://doi.org/10.1109/ICOSP.2008.4697367","url":null,"abstract":"In order to improve the perceptual quality and the compression efficiency in video transition, a new adaptive fuzzy filter algorithm for real-time Gaussian noise removal is proposed. Based on the analysis of noise and video properties, it exploits the spatiotemporal neighbor information through noise estimation, motion detection, and spatiotemporal neighborspsila similarity measurement. Then, an adaptive fuzzy filter is applied to remove noise. Experimental results showed that the proposed method achieved better performances of noise removal and detail preservation. Compared with other methods, PSNR of the denoised video was improved 1~ 6 dB. And, benefited from its low complexity and fast computation, it could meet the real-time requirements of the video transition.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129801606","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
扫码关注我们
求助内容：
应助结果提醒方式：