检索结果-内蒙古大学图书馆

Precoding scheme maximizing SINR for mImO broadcast channels

SCIENCE CHINA Information Sciences 2010年第7期53卷 1431-1438页

作者： ZHENG JianPing BAI Baoming mA Xiao WANG Xinmei ZHENG JianPing1* BAI BaoMing1 MA Xiao2 WANG XinMei1

An improved precoding scheme for multiple-input multiple-output (mImO) broadcast channel (BC) is proposed to maximize the detection signal-to-interference-plus-noise ratio (SINR) at user side based on the vector-perturbation technique. With the derived maximum detection SINR criterion, a new tree search based detection algorithm, called iterative m-algorithm (ImA), is utilized to find out the optimal perturbation vector. Simulations show that the proposed scheme outperforms the existing schemes which are based on the maximum detection signal-to-noise ratio (SNR) criterion. moreover, the proposed scheme can achieve the same bit error rate (BER) performance as the vector-perturbation scheme based on sphere encoder and the maximum detection SINR criterion, with guaranteed polynomial worst-case complexity.

关键词： multiple-input multiple-output (mImO) system broadcast channel precoding m-algorithm

来源：评论

学校读者我要写书评

暂无评论

2-step QRm-mLBD using Detection Ordering for Single-Carrier Transmission

2-step QRM-MLBD using Detection Ordering for Single-Carrier ...

引用

IEEE Vehicular Technology Conference

作者： Katsuhiro TEmmA Tetsuya YAmAmOTO Fumiyuki ADACHI Dept. of Electrical and Communication Engineering Graduate School of Engineering Tohoku University 6-6-05 Aza-Aoba Aramaki Aoba-ku Sendai 980-8579 Japan

ISBN: (纸本)9781467309899

2-step maximum likelihood block signal detection employing QR decomposition and m-algorithm (QRm-mLBD) can significantly improve the bit error rate (BER) performance of single-carrier (SC) transmission while reducing the computational complexity compared to maximum likelihood detection (mLD). In 2-step QRm-mLBD, unreliable symbol candidates are removed by performing minimum mean square error based frequency-domain equalization (mmSE-FDE) prior to QRm-mLBD. However, a large number m of surviving paths is still required in the m-algorithm to achieve a BER performance close to the matched filter (mF) bound. In this paper, to remedy this problem, we introduce a detection ordering to 2-step QRm-mLBD. We will show by computer simulation that the use of detection ordering can achieve the same BER performance as 2-step QRm-mLBD while reducing the computational complexity.

关键词： component Single-carrier near maximum likelihood detection mmSE-FDE QR decomposition m-algorithm checking sequence bit error rate performance mean square error m-algorithm carrier transfer complexity classes

来源：评论

学校读者我要写书评

暂无评论

mean-Shift algorithm Fusing multi Feature

Mean-Shift Algorithm Fusing Multi Feature

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Xian Zhong Kun Tu Hongxia Xia School of Science Wuhan University of Technology

The mean shift algorithm(mean Shift, mS) has been widely used because of the advantages of fewer iteration times and better real-time performance. In the other hand, because of the use of single color

ISBN: (纸本)9781467389808

关键词： Target tracking Color feature Texture feature mean-shift color feature Photopic Vision Target tracking m-algorithm algorithms mass spectroscopy multiple Sclerosis

来源：评论

学校读者我要写书评

暂无评论

Efficient Iterative mean Shift based Cosine Dissimilarity for multi-Recording Speaker Clustering

Efficient Iterative Mean Shift based Cosine Dissimilarity fo...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： mohammed Senoussaoui Patrick Kenny Pierre Dumouchel Themos Stqfylakis Ecole de Technologie Superieure (ETS) Canada Centre de Recherche Informatique de Montreal (CRIM) Canada

ISBN: (纸本)9781479903573

Speaker clustering is an important task in many applications such as Speaker Diarization as well as Speech Recognition. Speaker clustering can be done within a single multi-speaker recording (Diarization) or for a set of different recordings. In this work we are interested by the former case and we propose a simple iterative mean Shift (mS) algorithm to deal with this problem. Traditionally, mS algorithm is based on Euclidean distance. We propose to use the Cosine distance in order to build a new version of mS algorithm. We report results as measured by speaker and cluster impurities on NIST SRE 2008 datasets.

关键词： Loudspeakers m-algorithm Cosine Euclidean distance Iterative mass spectroscopy multiple Sclerosis

来源：评论

学校读者我要写书评

暂无评论

A Sphere Detection Based Adaptive mImO Detection algorithm for LTE-A System

A Sphere Detection Based Adaptive MIMO Detection Algorithm f...

引用

2013 Spring International Conference on Wireless Communications and Networks(CWCN-S)

作者： Xuanli Wu Lukuan Sun mingxin Luo School of Electronics and Information Engineering Harbin Institute of Technology Department of Electrical and Computer Engineering McGill University

An adaptive mImO detection algorithm for LTE-A system which is based on sphere detection is proposed in this paper. The proposed algorithm uses m-algorithm for reference to remove unreliable constellation candidates before search, and the number of constellation reservation is adaptively adjusted according to SNR. Simulations of LTE-A downlink show that the BER performance of the proposed detection algorithm is nearly the same as maximum likelihood （mL） detection algorithm. However, the complexity is reduced by about 30% compared with full constellation sphere detection.

关键词： Adaptive mImO Detection Sphere Detection m-algorithm LTE-A System

来源：评论

学校读者我要写书评

暂无评论

HARQ Throughput Performance of Training Sequence Aided SC-mImO Using Reduced Complexity mL Block Detection

HARQ Throughput Performance of Training Sequence Aided SC-MI...

引用

IEEE Vehicular Technology Conference

作者： Tetsuya YAmAmOTO Fumiyuki ADACHI Dept. of Electrical and Communication Engineering Graduate School of Engineering Tohoku University 6-6-05 Aza-Aoba Aramaki Aoba-ku Sendai 980-8579 Japan

ISBN: (纸本)9781467309899

For high-speed packet access, hybrid automatic repeat request (HARQ) and multi-input multi-output (mImO) multiplexing are indispensable techniques. Single-carrier (SC) mImO block transmission using frequency-domain signal detection such as the frequency-domain linear detection based on the minimum mean square error criterion (mmSED) can improve the HARQ throughput performance over the frequency-selective fading channel. However, the performance improvement is limited due to not only an inter-antenna interference (IAI) but also an intersymbol interference (ISI) resulting from a severe frequencyselective fading. In this paper, we propose to jointly use a training sequence (TS) aided SC block transmission and a near maximum likelihood (mL) block detection using QR decomposition and malgorithm (QRm-mLBD) for SC-mImO HARQ. It is shown, by computer simulation, that SC-mImO using TS aided QRmmLBD significantly improves the HARQ throughput performance compared to an often used cyclic prefix (CP) inserted SCmImO while significantly reducing the computational complexity. It is also shown that proposed TS aided QRm-mLBD achieves a significantly higher throughput than the mmSED particularly when higher level modulation is used.

关键词： component Single-carrier mImO HARQ near mL detection QR decomposition m-algorithm training sequence

来源：评论

学校读者我要写书评

暂无评论

Adaptive Quantization and Density Estimation in Silicon 02

Adaptive Quantization and Density Estimation in Silicon

引用

Annual Conference on Neural Information Processing Systems

作者： David Hsu Seth Bridges miguel Figueroa Chris Diorio Department of Computer Science and Engineering University of Washington 114 Sieg Hall Box 352350 Seattle WA 98195-2350 USA

ISBN: (纸本)0262025507

We present the bump mixture model, a statistical model for analog data where the probabilistic semantics, inference, and learning rules derive from low-level transistor behavior. The bump mixture model relies on translinear circuits to perform probabilistic inference, and floating-gate devices to perform adaptation. This system is low power, asynchronous, and fully parallel, and supports various on-chip learning algorithms. In addition, the mixture model can perform several tasks such as probability estimation, vector quantization, classification, and clustering. We tested a fabricated system on clustering, quantization, and classification of handwritten digits and show performance comparable to the E-m algorithm on mixtures of Gaussians.

关键词： adaptive quantization ANALOG DATA m-algorithm Bayesian inference Gauss Taxonomy translinear circuit Religious missions Cluster Analysis Cognitive Hypothesis Testing learning algorithms mixtures mixture models

来源：评论

学校读者我要写书评

暂无评论

A NONLINEAR EQUALIZATION algorithm FOR SINGLE-CARRIER BLOCK TRANSmISSION SYSTEmS

A NONLINEAR EQUALIZATION ALGORITHM FOR SINGLE-CARRIER BLOCK ...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Shih-Jung Wang Jiun-Jie Jia Kuei-Chiang Lai Szu-Lin Su Department of Electrical Engineering National Cheng Kung University Taiwan R.O.C.

ISBN: (纸本)9781479928941

Combating the intersymbol interference is an important issue in single-carrier block transmission systems. In this paper, we present a nonlinear equalizer that combines frequency-domain (FD) pre-filtering with time-domain tree search detection. Simulation results show that the proposed algorithm achieves a detection performance that is very close to that of the conventional tree search equalizer (which employs the QRD-m algorithm), but with a much lower complexity. In addition, the proposed algorithm performs significantly better than the linear equalizers and decision-feedback equalizers, with only a modest increase in complexity.

关键词： intersymbolic interference linear equalizer Tree searching Equalizers HELIOS DEVICES m-algorithm algorithms Packet transmission Prefiltration

来源：评论

学校读者我要写书评

暂无评论

A Discrete Harmonic Potential Approach to motion Planning on A Weighted Graph

A Discrete Harmonic Potential Approach to Motion Planning on...

引用

2008 American Control Conference, Pages 441-879

作者： Ahmad A. masoud Electrical Engineering Department KFUPM P.O. Box 287 Dhaharan 31261 Saudi Arabia

ISBN: (纸本)9781424420780

A provably-correct discrete version of the harmonic potential field (HPF) approach to motion planning was suggested in [20]. The approach utilizes the strong relation between graph theory and electrical network theory for developing a framework of theories and definitions that, among other things, can strongly aid in developing a discrete HPF planning approach. This framework was used to suggest an efficient, optimal, novel, discrete planning method called the m~(*) algorithm. In this paper an in-place, successive relaxation procedure is suggested for implementing the m~(*) algorithm. Also, the utility of the discrete HPF approach is demonstrated in robust, data network routing.

关键词： m-algorithm motion planning Network theory Harmonic potential discrete element Graph theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：