首页 > 最新文献

2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)最新文献

英文 中文
Estimating sparse signals using integrated wide-band dictionaries 利用集成宽带字典估计稀疏信号
Maksim Butsenko, Johan Sward, A. Jakobsson
In this paper, we present a technique for reducing the size of the dictionary in sparse signal reconstruction by formulating an initial dictionary containing elements that spans bands of the considered parameter space. We allow for the use of this banded dictionary in a first-stage estimation procedure, in which large parts of the parameter space is discarded for further analysis, thereby reducing the overall computationally complexity required to allow for a reliable signal reconstruction. We illustrate the presented principle on the problem of estimating sinusoidal components corrupted by white noise.
在本文中,我们提出了一种在稀疏信号重建中减少字典大小的技术,该技术通过制定一个包含元素的初始字典来跨越所考虑的参数空间的波段。我们允许在第一阶段估计过程中使用这种带状字典,其中大部分参数空间被丢弃以进行进一步分析,从而降低了实现可靠信号重建所需的总体计算复杂性。我们在估计被白噪声破坏的正弦分量的问题上说明了所提出的原理。
{"title":"Estimating sparse signals using integrated wide-band dictionaries","authors":"Maksim Butsenko, Johan Sward, A. Jakobsson","doi":"10.1109/ICASSP.2017.7952993","DOIUrl":"https://doi.org/10.1109/ICASSP.2017.7952993","url":null,"abstract":"In this paper, we present a technique for reducing the size of the dictionary in sparse signal reconstruction by formulating an initial dictionary containing elements that spans bands of the considered parameter space. We allow for the use of this banded dictionary in a first-stage estimation procedure, in which large parts of the parameter space is discarded for further analysis, thereby reducing the overall computationally complexity required to allow for a reliable signal reconstruction. We illustrate the presented principle on the problem of estimating sinusoidal components corrupted by white noise.","PeriodicalId":6443,"journal":{"name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"10 1","pages":"4426-4430"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78338591","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
Low rank phase retrieval 低秩相位检索
Seyedehsara Nayer, Namrata Vaswani, Yonina C. Eldar
We study the problem of recovering a low-rank matrix, X, from phaseless measurements of random linear projections of its columns. We develop a novel solution approach, called AltMinTrunc, that consists of a two-step truncated spectral initialization step, followed by a three-step alternating minimization algorithm. We obtain sample complexity bounds for the AltMinTrunc initialization to provide a good approximation of the true X. When the rank of X is low enough, these are significantly smaller than what existing single vector phase retrieval algorithms need. Via extensive experiments, we demonstrate the same for the entire algorithm.
我们研究了一个低秩矩阵X从其列的随机线性投影的无相测量中恢复的问题。我们开发了一种新的解决方法,称为AltMinTrunc,它包括一个两步截断的频谱初始化步骤,然后是一个三步交替最小化算法。我们获得了AltMinTrunc初始化的样本复杂度边界,以提供真实X的良好近似值。当X的秩足够低时,这些边界明显小于现有的单向量相位检索算法所需的复杂度。通过大量的实验,我们证明了整个算法是相同的。
{"title":"Low rank phase retrieval","authors":"Seyedehsara Nayer, Namrata Vaswani, Yonina C. Eldar","doi":"10.1109/ICASSP.2017.7952997","DOIUrl":"https://doi.org/10.1109/ICASSP.2017.7952997","url":null,"abstract":"We study the problem of recovering a low-rank matrix, X, from phaseless measurements of random linear projections of its columns. We develop a novel solution approach, called AltMinTrunc, that consists of a two-step truncated spectral initialization step, followed by a three-step alternating minimization algorithm. We obtain sample complexity bounds for the AltMinTrunc initialization to provide a good approximation of the true X. When the rank of X is low enough, these are significantly smaller than what existing single vector phase retrieval algorithms need. Via extensive experiments, we demonstrate the same for the entire algorithm.","PeriodicalId":6443,"journal":{"name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"9 1","pages":"4446-4450"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80910499","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
A real-time example-based single-image super-resolution algorithm via cross-scale high-frequency components self-learning 基于跨尺度高频分量自学习的实时样本单图像超分辨算法
Chang Su, Li Tao
In this paper, we propose a fast and dictionary-free example-based super-resolution (EBSR) algorithm to solve the contradiction in EBSR methods of their high performance in achieving high visual quality and their low efficiency and high costs. With a novel cross-scale high-frequency components (HFC) self-learning strategy, the missed HFC of a high-resolution (HR) image are approximated from its low-resolution counterparts. A high-quality estimation of the HR image is thus obtained by compensating the HFC to its initial guess. Simulations show that the proposed algorithm gets comparable results to the state-of-the-art EBSR but with much higher efficiency and lower costs.
本文提出了一种快速且无字典的基于示例的超分辨率(EBSR)算法,解决了EBSR方法在实现高视觉质量方面性能优异与效率低、成本高的矛盾。采用一种新颖的跨尺度高频分量(HFC)自学习策略,从低分辨率图像中逼近高分辨率图像的缺失HFC。因此,通过将HFC补偿到其初始猜测,可以获得高质量的HR图像估计。仿真结果表明,该算法与目前最先进的EBSR算法效果相当,但具有更高的效率和更低的成本。
{"title":"A real-time example-based single-image super-resolution algorithm via cross-scale high-frequency components self-learning","authors":"Chang Su, Li Tao","doi":"10.1109/ICASSP.2016.7471962","DOIUrl":"https://doi.org/10.1109/ICASSP.2016.7471962","url":null,"abstract":"In this paper, we propose a fast and dictionary-free example-based super-resolution (EBSR) algorithm to solve the contradiction in EBSR methods of their high performance in achieving high visual quality and their low efficiency and high costs. With a novel cross-scale high-frequency components (HFC) self-learning strategy, the missed HFC of a high-resolution (HR) image are approximated from its low-resolution counterparts. A high-quality estimation of the HR image is thus obtained by compensating the HFC to its initial guess. Simulations show that the proposed algorithm gets comparable results to the state-of-the-art EBSR but with much higher efficiency and lower costs.","PeriodicalId":6443,"journal":{"name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"49 1","pages":"1676-1680"},"PeriodicalIF":0.0,"publicationDate":"2016-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81532488","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
Pseudo-coherence-based MVDR beamformer for speech enhancement with ad hoc microphone arrays 基于伪相干的MVDR波束形成器,用于自组织麦克风阵列语音增强
Vincent Mohammad Tavakoliy, Jesper Rindom Jenseny, Mads Graesboll Christenseny, Jacob Benestyz
Speech enhancement with distributed arrays has been met with various methods. On the one hand, data independent methods require information about the position of sensors, so they are not suitable for dynamic geometries. On the other hand, Wiener-based methods cannot assure a distortionless output. This paper proposes minimum variance distortionless response filtering based on multichannel pseudo-coherence for speech enhancement with ad hoc microphone arrays. This method requires neither position information nor control of the trade-off used in the distortion weighted methods. Furthermore, certain performance criteria are derived in terms of the pseudo-coherence vector, and the method is compared with the multichannel Wiener filter. Evaluation shows the suitability of the proposed method in terms of noise reduction with minimum distortion in ad hoc scenarios.
基于分布式阵列的语音增强方法有很多种。一方面,数据独立的方法需要传感器的位置信息,因此不适合动态几何。另一方面,基于维纳的方法不能保证无失真输出。本文提出了一种基于多通道伪相干的最小方差无失真响应滤波方法,用于自组织麦克风阵列的语音增强。该方法既不需要位置信息,也不需要失真加权方法的权衡控制。在此基础上,推导了伪相干矢量的性能准则,并与多通道维纳滤波器进行了比较。评估结果表明,在特殊情况下,该方法在最小化失真的降噪方面是合适的。
{"title":"Pseudo-coherence-based MVDR beamformer for speech enhancement with ad hoc microphone arrays","authors":"Vincent Mohammad Tavakoliy, Jesper Rindom Jenseny, Mads Graesboll Christenseny, Jacob Benestyz","doi":"10.1109/ICASSP.2015.7178453","DOIUrl":"https://doi.org/10.1109/ICASSP.2015.7178453","url":null,"abstract":"Speech enhancement with distributed arrays has been met with various methods. On the one hand, data independent methods require information about the position of sensors, so they are not suitable for dynamic geometries. On the other hand, Wiener-based methods cannot assure a distortionless output. This paper proposes minimum variance distortionless response filtering based on multichannel pseudo-coherence for speech enhancement with ad hoc microphone arrays. This method requires neither position information nor control of the trade-off used in the distortion weighted methods. Furthermore, certain performance criteria are derived in terms of the pseudo-coherence vector, and the method is compared with the multichannel Wiener filter. Evaluation shows the suitability of the proposed method in terms of noise reduction with minimum distortion in ad hoc scenarios.","PeriodicalId":6443,"journal":{"name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"1 1","pages":"2659-2663"},"PeriodicalIF":0.0,"publicationDate":"2015-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81468499","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}
引用次数: 13
An outreach after-school program to introduce high-school students to electrical engineering 一个向高中生介绍电气工程的课外拓展项目
Monica F. Bugalloy, Angela M. Kellyz
We report on a university-based pilot initiative to introduce students in grades 9–12 to electrical engineering practices. The after-school program consisted of two modules of four two-hour sessions and targeted students from two different local schools. They were exposed to hands-on electronic activities as well as programming practices related to image processing. The data collected from weekly surveys revealed that students found the program more challenging and engaging as the course progressed and they were motivated to pursue future engineering study. Additional schools in the region have requested the opportunity for their students to participate in the program at the university.
我们报告了一项以大学为基础的试点计划,旨在向9-12年级的学生介绍电气工程实践。课后项目由两个模块组成,每个模块分为四个小时,针对来自当地两所不同学校的学生。他们接触到动手电子活动以及与图像处理相关的编程实践。从每周调查中收集的数据显示,随着课程的进展,学生们发现该课程更具挑战性和吸引力,他们有动力继续从事未来的工程学习。该地区的其他学校也要求让他们的学生有机会参加该大学的项目。
{"title":"An outreach after-school program to introduce high-school students to electrical engineering","authors":"Monica F. Bugalloy, Angela M. Kellyz","doi":"10.1109/ICASSP.2015.7179031","DOIUrl":"https://doi.org/10.1109/ICASSP.2015.7179031","url":null,"abstract":"We report on a university-based pilot initiative to introduce students in grades 9–12 to electrical engineering practices. The after-school program consisted of two modules of four two-hour sessions and targeted students from two different local schools. They were exposed to hands-on electronic activities as well as programming practices related to image processing. The data collected from weekly surveys revealed that students found the program more challenging and engaging as the course progressed and they were motivated to pursue future engineering study. Additional schools in the region have requested the opportunity for their students to participate in the program at the university.","PeriodicalId":6443,"journal":{"name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"20 1","pages":"5540-5544"},"PeriodicalIF":0.0,"publicationDate":"2015-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73801141","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
The convergence guarantees of a non-convex approach for sparse recovery using regularized least squares 正则最小二乘稀疏恢复非凸方法的收敛性保证
Laming Chen, Yuantao Gu
Existing literatures suggest that sparsity is more likely to be induced with non-convex penalties, but the corresponding algorithms usually suffer from multiple local minima. In this paper, we introduce a class of sparsity-inducing penalties and provide the convergence guarantees of a non-convex approach for sparse recovery using regularized least squares. Theoretical analysis demonstrates that under some certain conditions, if the non-convexity of the penalty is below a threshold (which is in inverse proportion to the distance between the initialization and the sparse signal), the sparse signal can be stably recovered. Numerical simulations are implemented to verify the theoretical results in this paper and to compare the performance of this approach with other references.
现有文献表明,非凸惩罚更容易产生稀疏性,但相应的算法通常存在多个局部最小值。本文引入了一类稀疏性诱导惩罚,并给出了正则化最小二乘稀疏恢复非凸方法的收敛性保证。理论分析表明,在一定条件下,如果惩罚的非凸性低于阈值(与初始化与稀疏信号的距离成反比),稀疏信号可以稳定恢复。通过数值仿真验证了本文的理论结果,并与其他文献进行了性能比较。
{"title":"The convergence guarantees of a non-convex approach for sparse recovery using regularized least squares","authors":"Laming Chen, Yuantao Gu","doi":"10.1109/ICASSP.2014.6854221","DOIUrl":"https://doi.org/10.1109/ICASSP.2014.6854221","url":null,"abstract":"Existing literatures suggest that sparsity is more likely to be induced with non-convex penalties, but the corresponding algorithms usually suffer from multiple local minima. In this paper, we introduce a class of sparsity-inducing penalties and provide the convergence guarantees of a non-convex approach for sparse recovery using regularized least squares. Theoretical analysis demonstrates that under some certain conditions, if the non-convexity of the penalty is below a threshold (which is in inverse proportion to the distance between the initialization and the sparse signal), the sparse signal can be stably recovered. Numerical simulations are implemented to verify the theoretical results in this paper and to compare the performance of this approach with other references.","PeriodicalId":6443,"journal":{"name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"162 1","pages":"3350-3354"},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73486620","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}
引用次数: 16
A conditional random field approach for audio-visual people diarization 一种条件随机场方法在视听人物分类中的应用
P. Gay, E. Khoury, S. Meignier, J. Odobez, P. Deléglise
We investigate the problem of audio-visual (AV) person diarization in broadcast data. That is, automatically associate the faces and voices of people and determine when they appear or speak in the video. The contributions are twofolds. First, we formulate the problem within a novel CRF framework that simultaneously performs the AV association of voices and face clusters to build AV person models, and the joint segmentation of the audio and visual streams using a set of AV cues and their association strength. Secondly, we use for this AV association strength a score that does not only rely on lips activity, but also on contextual visual information (face size, position, number of detected faces,...) that leads to more reliable association measures. Experiments on 6 hours of broadcast data show that our framework is able to improve the AV-person diarization especially for speaker segments erroneously labeled in the mono-modal case.
我们研究了广播数据中的视听个性化问题。也就是说,自动将人们的面孔和声音联系起来,并确定他们在视频中出现或说话的时间。贡献是双重的。首先,我们在一个新的CRF框架中提出了这个问题,该框架同时执行声音和面部聚类的AV关联以构建AV人物模型,并使用一组AV线索及其关联强度对音频和视觉流进行联合分割。其次,我们对AV关联强度使用的评分不仅依赖于嘴唇活动,还依赖于上下文视觉信息(面部大小、位置、检测到的面部数量等),从而产生更可靠的关联测量。在6小时的广播数据上的实验表明,我们的框架能够改善自动驾驶人的二化,特别是对于在单模态情况下被错误标记的说话人片段。
{"title":"A conditional random field approach for audio-visual people diarization","authors":"P. Gay, E. Khoury, S. Meignier, J. Odobez, P. Deléglise","doi":"10.1109/ICASSP.2014.6853569","DOIUrl":"https://doi.org/10.1109/ICASSP.2014.6853569","url":null,"abstract":"We investigate the problem of audio-visual (AV) person diarization in broadcast data. That is, automatically associate the faces and voices of people and determine when they appear or speak in the video. The contributions are twofolds. First, we formulate the problem within a novel CRF framework that simultaneously performs the AV association of voices and face clusters to build AV person models, and the joint segmentation of the audio and visual streams using a set of AV cues and their association strength. Secondly, we use for this AV association strength a score that does not only rely on lips activity, but also on contextual visual information (face size, position, number of detected faces,...) that leads to more reliable association measures. Experiments on 6 hours of broadcast data show that our framework is able to improve the AV-person diarization especially for speaker segments erroneously labeled in the mono-modal case.","PeriodicalId":6443,"journal":{"name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"1 1","pages":"116-120"},"PeriodicalIF":0.0,"publicationDate":"2014-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87983603","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}
引用次数: 16
Pitch adaptive training for hmm-based singing voice synthesis 基于hmm的歌唱声音合成的音调自适应训练
K. Shirota, Kazuhiro Nakamura, Kei Hashimoto, Keiichiro Oura, Yoshihiko Nankaku, K. Tokuda
A statistical parametric approach to singing voice synthesis based on hidden Markov Models (HMMs) has been growing in popularity over the last few years. The spectrum, excitation, vibrato, and duration of singing voices in this approach are simultaneously modeled with context-dependent HMMs and waveforms are generated from the HMMs themselves. HMM-based singing voice synthesis systems are heavily based on the training data in performance because these systems are “corpus-based.” Therefore, HMMs corresponding to contextual factors that hardly ever appear in the training data cannot be well-trained. Pitch should especially be correctly covered since generated F0 trajectories have a great impact on the subjective quality of synthesized singing voices. We applied the method of “speaker adaptive training” (SAT) to “pitch adaptive training,” which is discussed in this paper. This technique made it possible to normalize pitch based on musical notes in the training process. The experimental results demonstrated that the proposed technique could alleviate the data sparseness problem.
一种基于隐马尔可夫模型(hmm)的统计参数方法在过去几年中越来越受欢迎。在这种方法中,歌唱声音的频谱、激发、振动和持续时间同时与上下文相关的hmm建模,并从hmm本身生成波形。基于hmm的歌唱语音合成系统在很大程度上基于表演中的训练数据,因为这些系统是“基于语料库的”。因此,与训练数据中很少出现的上下文因素相对应的hmm不能得到很好的训练。因为生成的F0轨迹对合成歌唱声音的主观质量有很大的影响,所以音高尤其应该被正确地覆盖。本文将“说话人自适应训练”(SAT)方法应用于“音高自适应训练”。这种技术使得在训练过程中基于音符规范化音高成为可能。实验结果表明,该方法可以有效地缓解数据稀疏性问题。
{"title":"Pitch adaptive training for hmm-based singing voice synthesis","authors":"K. Shirota, Kazuhiro Nakamura, Kei Hashimoto, Keiichiro Oura, Yoshihiko Nankaku, K. Tokuda","doi":"10.1109/ICASSP.2014.6854062","DOIUrl":"https://doi.org/10.1109/ICASSP.2014.6854062","url":null,"abstract":"A statistical parametric approach to singing voice synthesis based on hidden Markov Models (HMMs) has been growing in popularity over the last few years. The spectrum, excitation, vibrato, and duration of singing voices in this approach are simultaneously modeled with context-dependent HMMs and waveforms are generated from the HMMs themselves. HMM-based singing voice synthesis systems are heavily based on the training data in performance because these systems are “corpus-based.” Therefore, HMMs corresponding to contextual factors that hardly ever appear in the training data cannot be well-trained. Pitch should especially be correctly covered since generated F0 trajectories have a great impact on the subjective quality of synthesized singing voices. We applied the method of “speaker adaptive training” (SAT) to “pitch adaptive training,” which is discussed in this paper. This technique made it possible to normalize pitch based on musical notes in the training process. The experimental results demonstrated that the proposed technique could alleviate the data sparseness problem.","PeriodicalId":6443,"journal":{"name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"31 1","pages":"5377-5380"},"PeriodicalIF":0.0,"publicationDate":"2014-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86653818","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}
引用次数: 21
Auditory attention based mobile audio quality assessment 基于听觉注意的移动音频质量评估
Yuhong Yang, Hongjiang Yu, R. Hu, Li Gao, Song Wang, Qing Zhai, Songbo Xie
{"title":"Auditory attention based mobile audio quality assessment","authors":"Yuhong Yang, Hongjiang Yu, R. Hu, Li Gao, Song Wang, Qing Zhai, Songbo Xie","doi":"10.1109/ICASSP.2014.6853825","DOIUrl":"https://doi.org/10.1109/ICASSP.2014.6853825","url":null,"abstract":"","PeriodicalId":6443,"journal":{"name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"25 1","pages":"1389-1393"},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73749375","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
Large deviation delay analysis of queue-aware multi-user MIMO systems with two timescale mobile-driven feedback 具有双时间尺度移动驱动反馈的队列感知多用户MIMO系统的大偏差延迟分析
Junting Chen, V. Lau
Multi-user multi-input-multi-output (MU-MIMO) systems usually require users to feedback the channel state information (CSI) for scheduling. Most of the existing literature on the reduced feedback user scheduling focused on the throughput performance and the queueing delay was usually ignored. As the delay is important for real-time applications, it is desirable to have a low feedback queue-aware user scheduling algorithm for MU-MIMO systems. This paper proposes a two timescale queue-aware user scheduling algorithm, which consists of a queue-aware mobile-driven feedback filtering stage and a SINR-based user scheduling stage. The feedback policy is obtained by solving a queue-weighted optimization problem. In addition, we evaluate the associated queueing delay performance by using the large deviation analysis. The large deviation decay rate for the proposed algorithm is shown to be much larger than the CSI-only scheduling algorithm. Numerical results demonstrate the large performance gain of the proposed algorithm over the CSI-only algorithm, while the proposed one requires only a small amount of feedback.
多用户多输入多输出(MU-MIMO)系统通常需要用户反馈信道状态信息(CSI)来进行调度。现有的关于减反馈用户调度的文献大多关注吞吐量性能,而忽略了排队延迟。由于延迟对实时应用非常重要,因此需要一种低反馈队列感知的MU-MIMO系统用户调度算法。本文提出了一种双时间尺度的队列感知用户调度算法,该算法由队列感知移动驱动的反馈过滤阶段和基于sinr的用户调度阶段组成。通过求解一个队列加权优化问题得到反馈策略。此外,我们还利用大偏差分析来评估相关的排队延迟性能。该算法的大偏差衰减率比仅使用csi的调度算法大得多。数值结果表明,该算法比仅使用csi的算法有较大的性能增益,且只需要少量的反馈。
{"title":"Large deviation delay analysis of queue-aware multi-user MIMO systems with two timescale mobile-driven feedback","authors":"Junting Chen, V. Lau","doi":"10.1109/ICASSP.2013.6638620","DOIUrl":"https://doi.org/10.1109/ICASSP.2013.6638620","url":null,"abstract":"Multi-user multi-input-multi-output (MU-MIMO) systems usually require users to feedback the channel state information (CSI) for scheduling. Most of the existing literature on the reduced feedback user scheduling focused on the throughput performance and the queueing delay was usually ignored. As the delay is important for real-time applications, it is desirable to have a low feedback queue-aware user scheduling algorithm for MU-MIMO systems. This paper proposes a two timescale queue-aware user scheduling algorithm, which consists of a queue-aware mobile-driven feedback filtering stage and a SINR-based user scheduling stage. The feedback policy is obtained by solving a queue-weighted optimization problem. In addition, we evaluate the associated queueing delay performance by using the large deviation analysis. The large deviation decay rate for the proposed algorithm is shown to be much larger than the CSI-only scheduling algorithm. Numerical results demonstrate the large performance gain of the proposed algorithm over the CSI-only algorithm, while the proposed one requires only a small amount of feedback.","PeriodicalId":6443,"journal":{"name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"89 1","pages":"5036-5040"},"PeriodicalIF":0.0,"publicationDate":"2013-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84232648","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
期刊
2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
全部 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