搜索资源列表
Soft_demapping_QPSK.zip
- soft Demapping QPSK : LLR computation using Euclidian distance approach, Parallel-to-Serial converter : needs I and Q components of QPSK symbols at the input,soft Demapping QPSK : LLR computation using Euclidian distance approach, Parallel-to-Serial
maugis
- 模拟退火和对称 *欧几里德旅行商问题。 * *为基础的解决办法的本地搜索启发式 *非过境道路和近邻 -/* * Simulated annealing and the Symetric * Euclidian Traveling Salesman Problem. * * Solution based on local search heuristics for * non-crossing paths and nearest neighbor
Good_ver_Soft_demapping_QPSK
- good version of soft Demapping QPSK : LLR computation using Euclidian distance approache, Parallel-to-Serial converter, needs I and Q componets of QPSK symbols at the input
Soft_demapping_8PSK
- soft Demapping 8PSK : LLR computation using Euclidian distance approach, Parallel-to-Serial converter, needs I and Q componets of 8PSK symbols at the input
demapping_soft_QPSK_good_version
- corrected version of Demapping QPSK : LLR computation using Euclidian distance approach, Parallel-to-Serial converter, needs I and Q componets of QPSK symbols at the input
Hard_decision_demapping_8PSK
- Demapping 8PSK : LLR computation using Euclidian distance approach, Parallel-to-Serial converter, Hard decision, needs I and Q componets of 8PSK symbols at the input
reval
- Euclidean Distance Transform has been widely studied in computational geometry, image processing, computer graphics and pattern recognition. Euclidean distance has been computed through different algorithms like parallel, linear time algorithms etc.
An-Improved-Ant-Colony-Clustering-Algorithm-Based
- Focused on the disadvantage of classical Euclidian distance in data clustering analysis, we propose an improved distance calculation formula, which describes the local compactness and global connectivity between data points. Furthermore, we i
speech-test
- it is a collection of matlab program. 1.to find the euclidian distance 2.to create mel frequency filter bank 3.
ppt
- After identifying the best MNT− 1 nodes with the simplified branch metric and the accumulated branch metric at stage NT − 1, we then calculate the LLR of each coded bit utilizing the standard squared Euclidian distance metric. The log-lik
pro2
- Theme: Object recognition using Geometric Properties(area, perimeter,circularity,etc) . In order to obtain the results the project was implemented using C++ and the tool C++Builder. For every geometric feature has been created a method that return a
DistEuclidian
- this code calculate the euclidian distance. h = waitbar(0, Distance Computation ) switch nargin case 1-this code calculate the euclidian distance. h = waitbar(0, Distance Computation ) switch nargin case 1
EuclideanDistance
- it s matlab code for Euclidian distane in data miningin pattern recognition
SkPoint
- Returns the square of the Euclidian distance to (dx,dy).