首页 > 最新文献

Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)最新文献

英文 中文
On the Fixed-Point Properties of Mixed-Scaling-Rotation Cordic Algorithm 混合缩放-旋转Cordic算法的不动点性质
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387586
Chi-Li Yu, T. Yu, A. Wu
A novel analysis methodology on the quantization effect of existing CORDIC algorithms is presented. Based on the methodology, we first verified that MSR-CORDIC is a much favorable candidate for rotation-based applications due to its high numerical precision. Then, a new design flow is proposed to determine an ideal configuration for MSR-CORDIC with optimized accuracy performance under the same hardware cost. This would benefit many rotation-based DSP applications, such as FFT, QRD, and EVD.
提出了一种新的分析现有CORDIC算法量化效果的方法。基于方法,我们首先验证了MSR-CORDIC由于其高数值精度而非常适合基于旋转的应用。然后,提出了一种新的设计流程,以确定在相同硬件成本下具有最佳精度性能的MSR-CORDIC理想配置。这将有利于许多基于旋转的DSP应用,如FFT、QRD和EVD。
{"title":"On the Fixed-Point Properties of Mixed-Scaling-Rotation Cordic Algorithm","authors":"Chi-Li Yu, T. Yu, A. Wu","doi":"10.1109/SIPS.2007.4387586","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387586","url":null,"abstract":"A novel analysis methodology on the quantization effect of existing CORDIC algorithms is presented. Based on the methodology, we first verified that MSR-CORDIC is a much favorable candidate for rotation-based applications due to its high numerical precision. Then, a new design flow is proposed to determine an ideal configuration for MSR-CORDIC with optimized accuracy performance under the same hardware cost. This would benefit many rotation-based DSP applications, such as FFT, QRD, and EVD.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"9 1","pages":"430-435"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81797731","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}
引用次数: 1
Peak-to-Average Power Ratio Reduction in an FDM Broadcast System FDM广播系统中峰均功率比的降低
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387511
Zhengya Zhang, R. Winoto, A. Bahai, B. Nikolić
Digital predistortion is a technique used to reduce the signal dynamic range in a multichannel system in order to improve power amplifier (PA) efficiency. These techniques have been developed for orthogonal frequency-division multi-plexing (OFDM) systems, but are not directly applicable to general frequency-division multiplexing (FDM) systems such as those used in broadcast. A modification to the tone injection approach allows constellation translations to be directly applied at the digital intermediate frequency (IF) domain and provides redundancy in lowering peak-to-average ratio (PAR). Simulation of a 24-channel 256-QAM FDM cable television transmission system shows a 3.3 dB PAR reduction at 10-6 clipping probability.
数字预失真是一种在多通道系统中减小信号动态范围以提高功率放大器效率的技术。这些技术是为正交频分复用(OFDM)系统开发的,但不能直接应用于一般频分复用(FDM)系统,如广播中使用的系统。对音调注入方法的修改允许星座转换直接应用于数字中频(IF)域,并在降低峰均比(PAR)方面提供冗余。对一个24通道256-QAM FDM有线电视传输系统的仿真表明,在10-6裁剪概率下,PAR降低了3.3 dB。
{"title":"Peak-to-Average Power Ratio Reduction in an FDM Broadcast System","authors":"Zhengya Zhang, R. Winoto, A. Bahai, B. Nikolić","doi":"10.1109/SIPS.2007.4387511","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387511","url":null,"abstract":"Digital predistortion is a technique used to reduce the signal dynamic range in a multichannel system in order to improve power amplifier (PA) efficiency. These techniques have been developed for orthogonal frequency-division multi-plexing (OFDM) systems, but are not directly applicable to general frequency-division multiplexing (FDM) systems such as those used in broadcast. A modification to the tone injection approach allows constellation translations to be directly applied at the digital intermediate frequency (IF) domain and provides redundancy in lowering peak-to-average ratio (PAR). Simulation of a 24-channel 256-QAM FDM cable television transmission system shows a 3.3 dB PAR reduction at 10-6 clipping probability.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"45 1","pages":"25-30"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80255244","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}
引用次数: 2
Spectrum Sensing Using Cyclostationary Spectrum Density for Cognitive Radios 基于循环平稳频谱密度的认知无线电频谱感知
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387507
Zhuan Ye, J. Grosspietsch, G. Memik
Cognitive radios (CR) are proposed to alleviate the spectrum scarcity problems facing wireless service providers. In US, the FCC is considering spectrum regulation changes by allowing unlicensed operation in the TV broadcast bands provided that no harmful interference is caused. In this paper, we discuss the spectrum sensing aspects of cognitive radios. We particularly focus on the detection method based on cyclostationary spectrum density (CSD) estimation. The advantage of CSD is its relative robustness against noise uncertainty compared with energy detection methods. CSD estimation is a two dimensional transformation; therefore it is computationally complex. We transform the algorithm from the two dimensional space to a one dimensional case, therefore making the real time implementation more feasible. Through analysis and simulation, we identify the features with highest SNR to be used for CSD based detection. Based on the simulation results, we further propose dedicated hardware implementation architecture for CSD estimation using field programmable logic array (FPGA). Our implementation can achieve greater than 90% detection probability on BPSK signals with SNR of -18 dB, when the probability of false alarm is less than 10%.
认知无线电(CR)的提出是为了缓解无线服务提供商面临的频谱短缺问题。在美国,联邦通信委员会(FCC)正在考虑改变频谱规则,允许在不造成有害干扰的情况下,在电视广播频段内进行无证运营。在本文中,我们讨论了频谱感知方面的认知无线电。重点研究了基于循环平稳谱密度(CSD)估计的检测方法。与能量检测方法相比,CSD的优点是对噪声不确定性具有相对的鲁棒性。CSD估计是一个二维变换;因此它在计算上是复杂的。我们将算法从二维空间转换为一维情况,从而使实时实现更加可行。通过分析和仿真,我们确定了具有最高信噪比的特征,用于基于CSD的检测。基于仿真结果,我们进一步提出了使用现场可编程逻辑阵列(FPGA)进行CSD估计的专用硬件实现架构。我们的实现可以在虚警概率小于10%的情况下,对信噪比为-18 dB的BPSK信号实现大于90%的检测概率。
{"title":"Spectrum Sensing Using Cyclostationary Spectrum Density for Cognitive Radios","authors":"Zhuan Ye, J. Grosspietsch, G. Memik","doi":"10.1109/SIPS.2007.4387507","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387507","url":null,"abstract":"Cognitive radios (CR) are proposed to alleviate the spectrum scarcity problems facing wireless service providers. In US, the FCC is considering spectrum regulation changes by allowing unlicensed operation in the TV broadcast bands provided that no harmful interference is caused. In this paper, we discuss the spectrum sensing aspects of cognitive radios. We particularly focus on the detection method based on cyclostationary spectrum density (CSD) estimation. The advantage of CSD is its relative robustness against noise uncertainty compared with energy detection methods. CSD estimation is a two dimensional transformation; therefore it is computationally complex. We transform the algorithm from the two dimensional space to a one dimensional case, therefore making the real time implementation more feasible. Through analysis and simulation, we identify the features with highest SNR to be used for CSD based detection. Based on the simulation results, we further propose dedicated hardware implementation architecture for CSD estimation using field programmable logic array (FPGA). Our implementation can achieve greater than 90% detection probability on BPSK signals with SNR of -18 dB, when the probability of false alarm is less than 10%.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"44 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80407640","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}
引用次数: 70
AN ASIP Approach for H.264/AVC Implementation Having Novel Coprocessors 具有新型协处理器的H.264/AVC实现的ASIP方法
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387598
Jin Ho Ha, Jin Soo Kim, M. Sunwoo
We present an ASIP (application-specific instruction-set processor) approach for H.264 implementation having novel coprocessors. We have previously proposed the video specific instruction-set processor (VSIP) for H.264/AVC. To improve performance of motion estimation (ME) further, we propose a new improved ME accelerator using the modified normalized partial distortion search (MNPDS) algorithm. The proposed MNPDS can reduce the average computational complexity by 96.2-99.5% compared to the full search algorithm whereas the PSNR decreases only 0.04 dB. Hence, VSIP using MNPDS is one of promising candidates for real-time video processing.
我们提出了一种具有新颖协处理器的H.264实现的ASIP(应用特定指令集处理器)方法。我们之前已经提出了H.264/AVC的视频专用指令集处理器(VSIP)。为了进一步提高运动估计(ME)的性能,我们提出了一种新的改进的运动估计加速器,该加速器使用改进的归一化部分失真搜索(MNPDS)算法。与全搜索算法相比,MNPDS的平均计算复杂度降低了962 ~ 99.5%,而PSNR仅降低了0.04 dB。因此,使用MNPDS的VSIP是实时视频处理的一个很有前途的候选者。
{"title":"AN ASIP Approach for H.264/AVC Implementation Having Novel Coprocessors","authors":"Jin Ho Ha, Jin Soo Kim, M. Sunwoo","doi":"10.1109/SIPS.2007.4387598","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387598","url":null,"abstract":"We present an ASIP (application-specific instruction-set processor) approach for H.264 implementation having novel coprocessors. We have previously proposed the video specific instruction-set processor (VSIP) for H.264/AVC. To improve performance of motion estimation (ME) further, we propose a new improved ME accelerator using the modified normalized partial distortion search (MNPDS) algorithm. The proposed MNPDS can reduce the average computational complexity by 96.2-99.5% compared to the full search algorithm whereas the PSNR decreases only 0.04 dB. Hence, VSIP using MNPDS is one of promising candidates for real-time video processing.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"23 1","pages":"499-504"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81562415","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}
引用次数: 3
Face Detection Using Classifiers Cascade Based on Vector Angle Measure and Multi-Modal Representation 基于矢量角度测量和多模态表示的分类器级联人脸检测
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387605
F. Flitti, A. Bermak
This paper deals with face detection in still gray level images which is the first step in many automatic systems like video surveillance, face recognition, and images data base management. We propose a new face detection method using a classifiers cascade, each of which is based on a vector angle similarity measure between the investigated window and the face and nonface representatives (centroids). The latter are obtained using a clustering algorithm based on the same measure within the current training data sets, namely the low confidence classified samples at the previous stage of the cascade. First experiment results on refereed face data test sets are very satisfactory.
在视频监控、人脸识别、图像数据库管理等自动化系统中,静态灰度图像是人脸检测的第一步。我们提出了一种新的使用分类器级联的人脸检测方法,每个分类器级联都是基于被调查窗口与人脸和非人脸代表(质心)之间的向量角度相似性度量。后者是使用基于当前训练数据集内相同度量的聚类算法获得的,即级联前一阶段的低置信度分类样本。在参考的人脸数据测试集上进行了初步实验,取得了令人满意的结果。
{"title":"Face Detection Using Classifiers Cascade Based on Vector Angle Measure and Multi-Modal Representation","authors":"F. Flitti, A. Bermak","doi":"10.1109/SIPS.2007.4387605","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387605","url":null,"abstract":"This paper deals with face detection in still gray level images which is the first step in many automatic systems like video surveillance, face recognition, and images data base management. We propose a new face detection method using a classifiers cascade, each of which is based on a vector angle similarity measure between the investigated window and the face and nonface representatives (centroids). The latter are obtained using a clustering algorithm based on the same measure within the current training data sets, namely the low confidence classified samples at the previous stage of the cascade. First experiment results on refereed face data test sets are very satisfactory.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"22 1","pages":"539-542"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80957197","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}
引用次数: 2
Coarse Self-Synchronization Technique for GNSS Receivers GNSS接收机粗自同步技术
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387621
I. M. Mahafeno, L. Conde-Canencia, E. Boutillon
In this paper, an original low-complexity technique for fast PN code acquisition is proposed. Its major advantage is that the receiver does not need to know the PN code itself, but only its length. We have applied the proposed technique in the context of GNSS receivers, and more specifically to Galileo, the European contribution to GNSS. The analysis of its performances (mainly in realistic environments) shows that the proposed technique significantly accelerates the signal acquisition process since it greatly reduces the search space. In fact, the correlation process in the synchronization step is no longer carried out for the whole data sequence but within a window of small length, which can be about 100 times smaller than the code length. Moreover, its architecture has a low cost implementation.
本文提出了一种新颖的低复杂度快速伪码采集技术。它的主要优点是接收者不需要知道PN码本身,而只需要知道它的长度。我们已经在GNSS接收机的背景下应用了拟议的技术,更具体地说,是伽利略系统,欧洲对GNSS的贡献。对其性能(主要是在现实环境中)的分析表明,该技术大大减小了搜索空间,显著加快了信号采集过程。实际上,同步步骤中的相关处理不再是对整个数据序列进行,而是在一个小长度的窗口内进行,这个窗口可以比码长小100倍左右。此外,该体系结构实现成本低。
{"title":"Coarse Self-Synchronization Technique for GNSS Receivers","authors":"I. M. Mahafeno, L. Conde-Canencia, E. Boutillon","doi":"10.1109/SIPS.2007.4387621","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387621","url":null,"abstract":"In this paper, an original low-complexity technique for fast PN code acquisition is proposed. Its major advantage is that the receiver does not need to know the PN code itself, but only its length. We have applied the proposed technique in the context of GNSS receivers, and more specifically to Galileo, the European contribution to GNSS. The analysis of its performances (mainly in realistic environments) shows that the proposed technique significantly accelerates the signal acquisition process since it greatly reduces the search space. In fact, the correlation process in the synchronization step is no longer carried out for the whole data sequence but within a window of small length, which can be about 100 times smaller than the code length. Moreover, its architecture has a low cost implementation.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"113 1","pages":"621-626"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86766978","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}
引用次数: 0
Robust Packet Detector based Automatic Gain Control Algorithm for OFDM-based Ultra-WideBand systems 基于ofdm的超宽带系统鲁棒包检测自动增益控制算法
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387581
Chun-Yuan Chu, J. Lai, A. Wu
We propose a robust auto gain control (AGC) algorithm for OFDM-based ultra-wideband (UWB) system. In the UWB system, the transmitted signal power is limited to -41.25 dBm in a 1-MHz bandwidth. Therefore, it is difficult for front-end receiver operation by using traditional power estimation approach. Based on the proposed packet detector (PD), the signal power estimation is much more accurate. On the other hand, saturation of the ADC output is another critical issue. We provide a robust AGC convergence mechanism solving this problem. After the AGC operation converges, the received signal power is within the error margin relative to target power. This power error is less than 0.5 dB.
针对基于ofdm的超宽带(UWB)系统,提出了一种鲁棒的自动增益控制算法。在UWB系统中,在1mhz的带宽内,传输的信号功率被限制在-41.25 dBm。因此,采用传统的功率估计方法对前端接收机的操作存在一定的困难。基于所提出的包检测器(PD),信号功率估计更加准确。另一方面,ADC输出的饱和是另一个关键问题。我们提供了一个鲁棒的AGC收敛机制来解决这个问题。AGC运算收敛后,接收信号功率相对于目标功率在误差范围内。该功率误差小于0.5 dB。
{"title":"Robust Packet Detector based Automatic Gain Control Algorithm for OFDM-based Ultra-WideBand systems","authors":"Chun-Yuan Chu, J. Lai, A. Wu","doi":"10.1109/SIPS.2007.4387581","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387581","url":null,"abstract":"We propose a robust auto gain control (AGC) algorithm for OFDM-based ultra-wideband (UWB) system. In the UWB system, the transmitted signal power is limited to -41.25 dBm in a 1-MHz bandwidth. Therefore, it is difficult for front-end receiver operation by using traditional power estimation approach. Based on the proposed packet detector (PD), the signal power estimation is much more accurate. On the other hand, saturation of the ADC output is another critical issue. We provide a robust AGC convergence mechanism solving this problem. After the AGC operation converges, the received signal power is within the error margin relative to target power. This power error is less than 0.5 dB.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"520 1","pages":"403-406"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77210560","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}
引用次数: 4
Low-complexity Prediction Techniques of K-best Sphere Decoding for MIMO Systems MIMO系统k -最优球解码的低复杂度预测技术
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387515
Hsiu-Chi Chang, Yen-Chin Liao, Hsie-Chia Chang
In multiple-input multiple output (MIMO) systems, maximum likelihood (ML) detection can provide good performance, however, exhaustively searching for the ML solution becomes infeasible as the number of antenna and constellation points increases. Thus ML detection is often realized by K-best sphere decoding algorithm. In this paper, two techniques to reduce the complexity of K-best algorithm while remaining an error probability similar to that of the ML detection is proposed. By the proposed K-best with predicted candidates approach, the computation complexity can be reduced. Moreover, the proposed adaptive K-best algorithm provides a means to determine the value K according the received signals. The simulation result shows that the reduction in the complexity of 64-best algorithm ranges from 48% to 85%, whereas the corresponding SNR degradation is maintained within 0.13dB and 1.1dB for a 64-QAM 4 × 4 MIMO system.
在多输入多输出(MIMO)系统中,最大似然(ML)检测可以提供良好的性能,但随着天线和星座点数量的增加,彻底搜索最大似然解决方案变得不可行。因此,ML检测通常采用k -最优球解码算法来实现。本文提出了两种技术来降低K-best算法的复杂度,同时保持与ML检测相似的错误概率。通过提出的具有预测候选者的k -最优方法,可以降低计算复杂度。此外,本文提出的自适应K-best算法提供了一种根据接收信号确定K值的方法。仿真结果表明,对于64-QAM 4 × 4 MIMO系统,64-best算法的复杂度降低幅度在48% ~ 85%之间,而相应的信噪比下降幅度保持在0.13dB和1.1dB之间。
{"title":"Low-complexity Prediction Techniques of K-best Sphere Decoding for MIMO Systems","authors":"Hsiu-Chi Chang, Yen-Chin Liao, Hsie-Chia Chang","doi":"10.1109/SIPS.2007.4387515","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387515","url":null,"abstract":"In multiple-input multiple output (MIMO) systems, maximum likelihood (ML) detection can provide good performance, however, exhaustively searching for the ML solution becomes infeasible as the number of antenna and constellation points increases. Thus ML detection is often realized by K-best sphere decoding algorithm. In this paper, two techniques to reduce the complexity of K-best algorithm while remaining an error probability similar to that of the ML detection is proposed. By the proposed K-best with predicted candidates approach, the computation complexity can be reduced. Moreover, the proposed adaptive K-best algorithm provides a means to determine the value K according the received signals. The simulation result shows that the reduction in the complexity of 64-best algorithm ranges from 48% to 85%, whereas the corresponding SNR degradation is maintained within 0.13dB and 1.1dB for a 64-QAM 4 × 4 MIMO system.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"38 1","pages":"45-49"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91177549","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}
引用次数: 5
Early-Pruning K-Best Sphere Decoder for MIMO Systems MIMO系统的早期剪枝K-Best球解码器
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387514
Qingwei Li, Zhongfeng Wang
The sphere decoding algorithm has been used for maximum likelihood detection in MIMO systems, and the K-Best sphere decoding algorithm is proposed for MIMO detections for its fixed complexity and throughput. However, to achieve near-ML performance, the K needs to be sufficiently large, which leads to large computational complexity and power consumption in hardware implementation. In this paper, we have developed some efficient early-pruning schemes, which can eliminate the survival candidates that are unlikely to become ML solution at early stages. Therefore, the computational complexity and the power consumption can be significantly saved. The simulation results show that for the 4×4 64QAM MIMO system, totally 55% computational complexity (or power consumption) can be reduced by applying our proposed schemes.
球面译码算法已被用于MIMO系统的最大似然检测,而K-Best球面译码算法由于其固定的复杂度和吞吐量,被提出用于MIMO检测。然而,为了达到接近ml的性能,K需要足够大,这导致硬件实现中的计算复杂性和功耗很大。在本文中,我们开发了一些有效的早期修剪方案,可以在早期阶段消除不太可能成为ML解决方案的生存候选者。因此,可以显着节省计算复杂度和功耗。仿真结果表明,对于4×4 64QAM MIMO系统,采用本文提出的方案可降低55%的计算复杂度(或功耗)。
{"title":"Early-Pruning K-Best Sphere Decoder for MIMO Systems","authors":"Qingwei Li, Zhongfeng Wang","doi":"10.1109/SIPS.2007.4387514","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387514","url":null,"abstract":"The sphere decoding algorithm has been used for maximum likelihood detection in MIMO systems, and the K-Best sphere decoding algorithm is proposed for MIMO detections for its fixed complexity and throughput. However, to achieve near-ML performance, the K needs to be sufficiently large, which leads to large computational complexity and power consumption in hardware implementation. In this paper, we have developed some efficient early-pruning schemes, which can eliminate the survival candidates that are unlikely to become ML solution at early stages. Therefore, the computational complexity and the power consumption can be significantly saved. The simulation results show that for the 4×4 64QAM MIMO system, totally 55% computational complexity (or power consumption) can be reduced by applying our proposed schemes.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"43 1","pages":"40-44"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73558898","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}
引用次数: 11
Implementation Schemes of Regularization Super-Resolution Image Reconstruction 正则化超分辨率图像重建的实现方案
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387620
Hua Yan, Ju Liu
This paper proposes two effective synchronous and parallel recursion schemes to implement regularization super-resolution image reconstruction. In the synchronous recursion, iteration step is adaptively adjusted by the speed of gradient descent to each observation channel. When blur support is too large or low-resolution images are severely degraded, however, the high-frequency information of the desired high-resolution (HR) image is still smoothed. So for fusing the information from different observation channels more effectively, parallel recursion is proposed to reconstruct desired HR image. In the two recursion schemes, spatial integration in down-sampling process is removed as well as system blurs, and nearest interpolation in up-sampling process is used to restrain edge artifact. Simulation results demonstrate that the two proposed implementation schemes give more satisfying results in both objective and subjective measurements.
本文提出了两种有效的同步和并行递归方法来实现正则化超分辨率图像重建。在同步递归中,迭代步长根据各观测通道的梯度下降速度自适应调整。然而,当模糊支持过大或低分辨率图像严重退化时,所需的高分辨率(HR)图像的高频信息仍然是平滑的。因此,为了更有效地融合不同观测通道的信息,提出了并行递归重构期望的HR图像。在这两种递推方案中,分别去除了下采样过程中的空间积分和系统模糊,并在上采样过程中使用最近邻插值来抑制边缘伪影。仿真结果表明,所提出的两种实现方案在客观和主观测量方面都取得了令人满意的结果。
{"title":"Implementation Schemes of Regularization Super-Resolution Image Reconstruction","authors":"Hua Yan, Ju Liu","doi":"10.1109/SIPS.2007.4387620","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387620","url":null,"abstract":"This paper proposes two effective synchronous and parallel recursion schemes to implement regularization super-resolution image reconstruction. In the synchronous recursion, iteration step is adaptively adjusted by the speed of gradient descent to each observation channel. When blur support is too large or low-resolution images are severely degraded, however, the high-frequency information of the desired high-resolution (HR) image is still smoothed. So for fusing the information from different observation channels more effectively, parallel recursion is proposed to reconstruct desired HR image. In the two recursion schemes, spatial integration in down-sampling process is removed as well as system blurs, and nearest interpolation in up-sampling process is used to restrain edge artifact. Simulation results demonstrate that the two proposed implementation schemes give more satisfying results in both objective and subjective measurements.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"16 1","pages":"615-620"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88935320","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}
引用次数: 0
期刊
Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1