Location:
Search - pba
Search list
Description: ％ 信道容量C的迭代算法 ％
％ 函数说明： ％
％ [CC,Paa]=ChannelCap(P,k) 为信道容量函数 ％
％ 变量说明： ％
％ P：输入的正向转移概率矩阵，k：迭代计算精度 ％
％ CC：最佳信道容量，Paa：最佳输入概率矩阵 ％
％ Pa：初始输入概率矩阵，Pba：正向转移概率矩阵 ％
％ Pb：输出概率矩阵 ％
％ C：初始信道容量， r：输入符号数，s：输出符号数 ％
Platform: |
Size: 1098 |
Author: 风 |
Hits:
Description: 一些指纹识别的资料，里面有PBA，LOGO，单一登陆等内容。
Platform: |
Size: 14066519 |
Author: 刘林 |
Hits:
Description: PowerBuilder Windows API 查询-PowerBuilder Windows API inquiries
Platform: |
Size: 208896 |
Author: VerVe |
Hits:
Description: ％ 信道容量C的迭代算法 ％
％ 函数说明： ％
％ [CC,Paa]=ChannelCap(P,k) 为信道容量函数 ％
％ 变量说明： ％
％ P：输入的正向转移概率矩阵，k：迭代计算精度 ％
％ CC：最佳信道容量，Paa：最佳输入概率矩阵 ％
％ Pa：初始输入概率矩阵，Pba：正向转移概率矩阵 ％
％ Pb：输出概率矩阵 ％
％ C：初始信道容量， r：输入符号数，s：输出符号数 ％- Channel capacity C of the iterative algorithm Function Description: [CC, Paa] = ChannelCap (P, k) for the channel capacity function Variable Description: P: input positive transition probability matrix, k: iterative calculation accuracy CC: the best channel capacity, Paa: optimal input probability matrix Pa: initial input probability matrix, Pba: positive transition probability matrix Pb: output probability matrix C: initial channel capacity, r: the number of input symbols, s: output symbol number
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 一些指纹识别的资料，里面有PBA，LOGO，单一登陆等内容。-Number of fingerprint identification data, which have PBA, LOGO, the contents of a single landing.
Platform: |
Size: 14066688 |
Author: 刘林 |
Hits:
Description: 蓝牙pbap profile 源代码，可下载手机端的电话本-Bluetooth pbap profile source code, downloadable mobile phone side of the phone book
Platform: |
Size: 36864 |
Author: harry |
Hits:
Description: 运行并行的mpif77文件用的pba文件-for mpif77
Platform: |
Size: 1024 |
Author: 志远 |
Hits:
Description: 信道容量C的迭代算法
函数说明：
[CC,Paa]=ChannelCap(P,k) 为信道容量函数
变量说明：
P：输入的正向转移概率矩阵，k：迭代计算精度
CC：最佳信道容量，Paa：最佳输入概率矩阵
Pa：初始输入概率矩阵，Pba：正向转移概率矩阵
Pb：输出概率矩阵，Pab：反向转移概率矩阵
C：初始信道容量， r：输入符号数，s：输出符号数
-Channel capacity C of the iterative algorithm Function Description: [CC, Paa] = ChannelCap (P, k) for the channel capacity function variable declaration: P: Enter a positive transition probability matrix, k: Diego generation of precision CC: Best channel capacity, Paa: optimal input probability matrix Pa: initial input probability matrix, Pba: positive transition probability matrix Pb: output probability matrix, Pab: reverse transition probability Matrix C: the initial channel capacity, r: the number of input symbols, s: output symbol number
Platform: |
Size: 6144 |
Author: lijing |
Hits:
Description: 信道容量C的迭代算法
函数说明：
[CC,Paa]=ChannelCap(P,k) 为信道容量函数
变量说明：
P：输入的正向转移概率矩阵，k：迭代计算精度
CC：最佳信道容量，Paa：最佳输入概率矩阵
Pa：初始输入概率矩阵，Pba：正向转移概率矩阵
Pb：输出概率矩阵，Pab：反向转移概率矩阵
C：初始信道容量， r：输入符号数，s：输出符号数
-Channel capacity C of the iterative algorithm Function Description: [CC, Paa] = ChannelCap (P, k) for the channel capacity function variable declaration: P: Enter a positive transition probability matrix, k: Diego generation of precision CC: Best channel capacity, Paa: optimal input probability matrix Pa: initial input probability matrix, Pba: positive transition probability matrix Pb: output probability matrix, Pab: reverse transition probability Matrix C: the initial channel capacity, r: the number of input symbols, s: output symbol number
Platform: |
Size: 3072 |
Author: lijing |
Hits:
Description: 信道容量C的迭代算法
函数说明：
[CC,Paa]=ChannelCap(P,k) 为信道容量函数
变量说明：
P：输入的正向转移概率矩阵，k：迭代计算精度
CC：最佳信道容量，Paa：最佳输入概率矩阵
Pa：初始输入概率矩阵，Pba：正向转移概率矩阵
Pb：输出概率矩阵，Pab：反向转移概率矩阵
C：初始信道容量， r：输入符号数，s：输出符号数
-Channel capacity C of the iterative algorithm function Description: [CC Paa] = ChannelCap (P, k) for the channel capacity functions variable Description: P: input forward transfer probability matrix k: iterative calculation precision CC: best channel capacity, Paa: optimal input probability matrix Pa: initial input probability matrix, Pba: positive transition probability matrix Pb: output probability matrix, Pab: reverse transition probability matrix C: the capacity of the initial channel, r: the number of input symbols, s: the number of output symbols
Platform: |
Size: 1024 |
Author: 龙哥 |
Hits:
Description: 信息率失真函数的迭代计算
信息率失真函数的迭代计算，迭代精度取为10^(-7)
在信源的输入概率分布Pa和失真矩阵d已知的条件下求出信息率失真函数
函数说明：
[Pba,Rmin,Dmax,Smax]=RateDF(Pa,d,S) 为信息率失真函数
变量说明：
Pa：信源的输入概率矩阵，d：失真矩阵，S：拉氏乘子
Pba：最佳正向转移概率矩阵， Smax：最大拉氏乘子
Rmin：最小信息率，Dmax：允许的最大失真度
-Information rate distortion function iteration rate-distortion function iteration, iteration accuracy 10 ^ (-7) source input probability distribution of Pa and distortion matrix d known conditions obtained information rate distortion function Function Description: [Pba, Rmin, Dmax, Smax] = RateDF (Pa, d, S) for the information rate distortion function Variable Description: Pa: source input probability matrix, d: Distortion matrix, S: Lagrangian multiplier Pba: Best forward transition probability matrix, Smax: maximum Lagrangian multiplier Rmin: Minimum information rate, Dmax: Allow the maximum distortion
Platform: |
Size: 2048 |
Author: 龙哥 |
Hits:
Description: 信息率失真函数的迭代计算 信息率失真函数的迭代计算，迭代精度取为10^(-7) 在信源的输入概率分布Pa和失真矩阵d已知的条件下求出信息率失真函数 函数说明： [Pba,Rmin,Dmax,Smax]=RateDF(Pa,d,S) 为信息率失真函数 变量说明： Pa：信源的输入概率矩阵，d：失真矩阵，S：拉氏乘子 Pba：最佳正向转移概率矩阵， Smax：最大拉氏乘子 Rmin：最小信息率，Dmax：允许的最大失真度-Information on the calculation of the rate-distortion function iteration iterative information rate-distortion function calculations, iterative precision is taken as 10 ^ (-7) in the source input probability distributions Pa and distortion matrix d information obtained under conditions known rate-distortion Function Description : [Pba, Rmin, Dmax, Smax] = RateDF (Pa, d, S) for the information rate-distortion function variables Description: Pa: source input probability matrix, d: distortion matrix, S: Lagrange multiplier Pba: most the maximum allowable distortion: Best forward transition probability matrix, Smax: maximum Lagrange multiplier Rmin: minimum information rate, Dmax
Platform: |
Size: 2048 |
Author: ray |
Hits:
Description: 设有A、B、P三点，A、B为已知坐标的点，P为未知点，用仪器测得∠PAB和∠PBA,根据A、B的坐标可求得P点的坐标，这种方法叫做前方交会-Features A, B, P three points, A, B point coordinates are known, P is an unknown point, as measured by the instrument ∠PAB and ∠PBA, the coordinates A, B coordinates of point P can be obtained, which method is called forward intersection
Platform: |
Size: 1814528 |
Author: 蛋烧的饼干 |
Hits:
Description: IT IS REPORT ON PUBLICATION AND PLAGIARISM REPORT OF MTECH POWER SYSTEMS
Platform: |
Size: 285696 |
Author: raviks |
Hits: