An efficient square-root algorithm for BLAST
An efficient square-root algorithm for BLAST
复制标题
DOI：
10.1109/icassp.2000.859065
复制
发表时间：
2000-06
期刊：
影响因子：
--
通讯作者：
B. Hassibi
中科院分区：
文献类型：
--
作者：
B. Hassibi
贝尔实验室分层时空 (BLAST) 是一种使用多个接收和发射天线在丰富散射的无线环境中传输信息的方案。 BLAST 算法中的主要计算瓶颈是“归零和消除”步骤，其中确定接收信号的顺序估计和检测的最佳顺序。为了降低 BLAST 的计算成本，我们为归零和取消步骤开发了一种有效的平方根算法。该算法的主要特点包括效率：计算成本降低了0.7 M，其中M是发射天线的数量，以及数值稳定性：该算法是免除的并且仅使用正交变换。在设计用于在 30 kHz 信道上传输 1 Mbit/s 的 14 天线系统中，归零和消除计算从 190 MFlops/s 减少到 19 MFlops/s，总体计算从 220 MFlops/s 减少到 49 MFlops/s。该算法的数值稳定性也使其对于定点（而不是浮点）架构中的实现具有吸引力。
Bell Labs Layered Space-Time (BLAST) is a scheme for transmitting information over a rich-scattering wireless environment using multiple receive and transmit antennas. The main computational bottleneck in the BLAST algorithm is a "nulling and cancellation" step, where the optimal ordering for the sequential estimation and detection of the received signals is determined. To reduce the computational cost of BLAST, we develop an efficient square-root algorithm for the nulling and cancellation step. The main features of the algorithm include efficiency: the computational cost is reduced by 0.7 M, where M is the number of transmit antennas, and numerical stability: the algorithm is division-free and uses only orthogonal transformations. In a 14 antenna system designed for transmission of 1 Mbit/s over a 30 kHz channel, the nulling and cancellation computation is reduced from 190 MFlops/s to 19 MFlops/s, with the overall computations being reduced from 220 MFlops/s to 49 MFlops/s. The numerical stability of the algorithm also make it attractive for implementation in fixed-point (rather than floating-point) architectures.