On the Sphere-Decoding Algorithm I.
Expected Complexity
Abstract—The problem of finding the least-squares solution
to a system of linear equations where the unknown vector is
comprised of integers, but the matrix coefficient and given vector
are comprised of real numbers, arises in many applications:
communications, cryptography, GPS, to name a few. The problem
is equivalent to finding the closest lattice point to a given point and
is known to be NP-hard. In communications applications, however, the given vector is not arbitrary but rather is an unknown
lattice point that has been perturbed by an additive noise vector
whose statistical properties are known. Therefore......
2022-05-06 18:32:46
250KB
1
基于并行计算的低复杂度SCMA检测算法，李静，赵慧，稀疏码分多址技术（Sparse Code Multiple Access，SCMA）作为5G物联网场景中讨论的一种非正交多址技术，可以有效提高接入量。其接收端采用消
2022-05-01 12:18:38
295KB
1
DBSCAN的时间复杂度
时间复杂度
DBSCAN算法要对每个数据对象进行邻域检查时间性能较低。
DBSCAN的基本时间复杂度是 O(n*找出ε-邻域中的点所需要的时间)。最坏情况下时间复杂度是O(n2)
在低维空间数据中,有一些数据结构如K-D树，使得可以有效的检索特定点给定距离内的所有点，时间复杂度可以降低到O(nlogn)
*
2022-04-16 22:54:25
2.49MB
1