A two-stage MMSE multiuser decision feedback detector using successive/parallel interference cancellation

In this paper, we present a novel two-stage minimum-mean-squared-error (MMSE) multiuser decision feedback detector (DFD) for code division multiple access systems working in the frequency-selective multipath fading environment. The first stage of the proposed cascaded structure is the noise-predictive successive DFD (NP-S-DFD), in which the active users are detected successively using the conventional bell labs layered space-time (BLAST) ordering criterion. The second stage includes an adaptive successive/parallel DFD (SP-DFD), which uses the tentative decisions obtained at the first stage for multiuser interference cancellation and data detection. Therefore, the proposed two-stage DFD may be called noise-predictive successive SP-DFD (NP-S-SP-DFD). Simulation results are presented to demonstrate the substantial improvement in the bit error rate performance of NP-S-SP-DFD over the conventional single-stage and cascaded DFDs. It may be inferred that the proposed DFD provides additional performance gain, when the order in which the users are detected is optimized according to the BLAST ordering based on MMSE criterion.     

使用GPU加速BLAST算法初探

应用GPU通用高性能编程技术实现了一种加速BLAST算法的新方法。BLAST是目前最常用的用于生物序列查询比对的算法和软件包,其处理速度受到串行化执行和磁盘I/O等因素的影响。本文通过实验分析了BLAST软件包中的典型程序BLASTN的运行热点,并选定关键热点模块,应用CUDA编程技术对其进行并行化改造。对比实验结果表明,对于平均序列长度较大的序列库,应用GPGPU并行化可明显缩短该模块的运行时间,获得超过35倍的加速比。这说明,我们可以利用GPGPU对BLAST进行并行化加速,以满足高性能生物序列查询的需求。     

CUDA兼容图形卡作为BLAST序列比对的有效硬件加速器研究

提出了在硬件产品上运行BLAST算法的方案,认为可以使BLAST达到目前为止最快的速度。它是在由NVIDIA发布的CUDA编程环境上执行的。做了详尽的模拟试验,在一个3GHz英特尔奔腾IV处理器上运行,比较了BLAST和SSEARCH的执行。方案与最新公布的GPU执行情况和一个SIMD解决方案进行了比较,测试表明,实现了在硬件产品上获得更大速度的目的,也降低了大规模比对的执行成本。     

多天线阵列中基于矩阵求逆的BLAST和准正交STBC结合的HARQ算法研究

提出了多天线阵列中基于BLAST和准正交STBC结合的HARQ算法,并采用低复杂度的矩阵求逆方法进行解码。推荐的算法不是如传统的ARQ算法那样重传同样的信号,而是将数据组成准正交空时码发射矩阵,重传的时候传输发射矩阵的下一行,并和以前传输数据联合进行空时码解码。所以椎荐的算法可以额外获得空时码的分集增益,而在信道条件好和信噪比高时,由于没有重传的发生而可以获得BLAST的复用增益。对于部分发射矩阵联合空时码解码,本文提出了采用矩阵求逆的解码算法。仿真表明该算法和最大似然算法的性能相近而复杂度下降很多。本算法结合了BLAST和STBC以及HARQ的优势并采用了低复杂度的矩阵求逆算法,是一个既能够提高系统传输速率也能够提高系统抗干扰性能的HARQ方案。特别是本算法在所有接收天线数大于等于发射天线数的多天线阵列中有很强的实用性。     

Soft‐output MMSE V‐BLAST receiver with MMSE channel estimation under correlated Rician fading MIMO channels

For wireless multiple‐input multiple‐output (MIMO) communications systems, both channel estimation error and spatial channel correlation should be considered when designing an effective signal detection system. In this paper, we propose a new soft‐output MMSE based Vertical Bell Laboratories Layered Space‐Time (V‐BLAST) receiver for spatially‐correlated Rician fading MIMO channels. In this novel receiver, not only the channel estimation errors and channel correlation but also the residual interference cancellation errors are taken into consideration in the computation of the MMSE filter and the log‐likelihood ratio (LLR) of each coded bit. More importantly, our proposed receiver generalizes all existing soft‐output MMSE V‐BLAST receivers, in the sense that, previously proposed soft‐output MMSE V‐BLAST receivers can be derived as the reduced forms of our receiver when the above three considered factors are partially or fully simplified. Simulation results show that the proposed soft‐output MMSE V‐BLAST receiver outperforms the existing receivers with a considerable gain in terms of bit‐error‐rate (BER) performance. Copyright © 2011 John Wiley & Sons, Ltd.     

A General Reconfigurable Architecture for the BLAST Algorithm

The process of DNA sequence matching and database search is one of the major problems of the bioinformatics community. Major scientific efforts to address this problem have provided algorithms and software tools for molecular biologists since the early 1970s. At the algorithmic and software level BLAST is by far the most popular tool. It has been developed and continues to be maintained and distributed by the NCBI organization. The BLAST algorithm and software is computationally very intensive and as a result several computer vendors use it as a benchmark. On the other hand no systematic approach for hardware speedup of BLAST and its variants for different query and database size has been reported to date. In this paper we present our architecture that implements the BLAST algorithm for all of its major versions, and for any size of database and query. The system has been fully designed and partially implemented with reconfigurable logic. It consists of software and hardware parts and achieves a speedup of several times up to thousands of times vs general purpose computers.

分层空时编码及应用研究

分层空时编码是应用于多输入多输出系统中的一种空时编码,具有结构简单、易于实现且频带利用率随着发射天线数目的增加而线性增加等优点。针对分层空时编码传输速率高、无法获得最大分集增益以及系统抗衰落性能差等缺点,提出了一种结合空时分组码的混合结构模型——分层空时混合码。同时,介绍了分层空时编码检测算法的最新进展以及分层空时编码在自由空间光通信、OFDM系统中的研究成果及应用。     

用于MIMO单载波频域均衡的块BLAST算法

单载波频域均衡(SC-FDE)是多输入多输出(MIMO)无线通信中克服多径衰落的一种重要技术。本文基于V-BLAST信号检测的原理,对MIMO-SC-FDE系统提出了以块为单位进行分层检测的块BLAST算法。在该算法中,系统按一定的准则确定对各路发送信号进行频域均衡和检测的顺序,较先检测出的信号被变换到频域作为干扰从接收信号中去除,使得对以后各路信号进行频域均衡和检测的信干噪比得以提高,从而大大改善了MIMO-SC-FDE系统的误码性能。仿真实验结果显示,块BLAST算法取得了大大优越于MIMO-SC-FDE常规检测算法的误码性能。     

Performance analysis of uplink spatial multiplexing MIMO MT‐CDMA over multipath fading channels

In this paper, we consider multiple‐input multiple‐output (MIMO) multi‐tone code division multiple access (MT‐CDMA) uplink transmission over multipath fading channels. The zero‐forcing vertical Bell Laboratories layered space‐time architecture (ZF V‐BLAST) algorithm and maximum ratio combining scheme are applied at the receiver. The average bit error rate (BER) expression is derived provided that the number of receive antennas is not less than that of transmit antennas. The BER expression is verified by simulations. Numerical results show that the numbers of transmit and receive antennas have significant effects on the BER performance of the considered system. Spatial and path diversity show different capabilities to improve the BER performance. The MIMO MT‐CDMA system based on the ZF V‐BLAST algorithm is capable of achieving a better BER performance and a higher capacity than the conventional MT‐CDMA system. Copyright © 2011 John Wiley & Sons, Ltd.     

Grid-Enabled BLASTZ: Application to Comparative Genomics

BLASTZ is a sequence alignment tool designed mainly for aligning neutrally evolved bio-sequences and has been the choice for aligning noncoding sequences. However, its running time is impractical for high throughput alignment of long sequences, for example, for the alignment of human and mouse genomes. In order to improve the performance and efficiency for alignment at genome scale, BLASTZ was implemented using the GLOBUS toolkit on a computing grid. A dynamic load balancing technique was introduced to achieve enhanced performance on a grid which consists of sources of heterogeneous characteristics, such as resources of different computational powers. The robustness of the implementation to disturbances due to other processes on the grid is demonstrated.