1 of 30
Download to read offline
![燕２ 匯違晒 a} 2 UEP 憲催 [Masnick67] [Boyarinov81] [Saito06] a} 1 ┌嶷`り 屎憲催 [Hedayat99] 協尖 1 a} 3](https://image.slidesharecdn.com/ma22006id4111995/85/ma22006id411-15-320.jpg)
![燕 4 岷住柴鮫の燕F圭隈にvする サンプリング協尖の蛍 匯違晒 協尖 3 協尖 2[ 検弥 03] [ {云 97] 岷住柴鮫の燕F](https://image.slidesharecdn.com/ma22006id4111995/85/ma22006id411-25-320.jpg)
Recommended
ma92008id393
ma92008id393matsushimalab
?
This document discusses universal lossless source coding for independent piecewise identically distributed (i.p.i.d.) sources. It proves that Bayes codes, which are universal source codes, minimize the mean redundancy asymptotically for i.p.i.d. sources where the number of stationary segments increases to infinity as the data size increases. Specifically, it shows that the mean redundancy of the Bayes codes does not depend on the coding probability and equals the Bayes redundancy asymptotically, demonstrating that the Bayes codes optimize compression in this scenario.
ma112008id371
ma112008id371matsushimalab
?
The document proposes a new multiuser detection algorithm for CDMA based on the belief propagation algorithm. It develops a factor graph that represents the posterior distribution of information bits in a way that reduces the number of cycles compared to previous factor graphs. Numerical simulations show the proposed belief propagation algorithm outperforms the parallel interference canceller detector, especially for signature sequences that produce factor graphs with fewer cycles and weaker cross-correlations between users. The approach shows promise for application to other communication systems.ma52009id421
ma52009id421matsushimalab
?
The document proposes a new method for document classification with small training data. It discusses previous methods that estimate parameters for prior distributions either using fixed values or estimating data. The new proposed method estimates parameters for prior distributions as a weighted combination of estimating data and training data. Experiments show the new method achieves higher accuracy than previous methods, especially with small training data sizes.
ma112006id337
ma112006id337matsushimalab
?
The document proposes reducing the computational complexity of message passing algorithms like belief propagation (BP) and concave-convex procedure (CCCP) for multiuser detection in CDMA systems. It does this by changing the factor graph structure used to represent the detection problem from a fully connected graph (Factor Graph I) to a sparsely connected graph (Factor Graph II). Simulation results show the proposed CCCP detector for the new factor graph achieves near optimal performance with lower complexity than existing approaches.ma52006id386
ma52006id386matsushimalab
?
The document discusses methods for statistical spelling correction based on decision theory. It defines the spelling correction problem and previous approaches. It then presents two new methods: 1) Evaluating the error rate per sentence using Bayes optimal and approximate algorithms based on dynamic programming. 2) Evaluating the error rate per word also using Bayes optimal and approximate algorithms like the BCJR algorithm. The goal is to minimize error rates with computational efficiency for real-world applications.ma12012id536
ma12012id536matsushimalab
?
This document analyzes the asymptotic properties of expected cumulative logarithmic loss in Bayesian estimation when models are nested and when there is misspecification. The main theorem states that if the true distribution does not belong to the model class, the asymptotic loss per symbol goes to the Kullback-Leibler divergence between the true and model distributions, rather than 0. If the true distribution does belong to the model class, the results reduce to previous studies. The proof is separated into two parts and relies on a lemma showing posterior concentration at the true model.ma99992012id537
ma99992012id537matsushimalab
?
This document proposes a unified framework for approximating the optimal key estimation of stream ciphers using probabilistic inference. It formulates the key estimation problem as determining the secret key that maximizes the joint probability based on the observed keystream. An approximation algorithm called the sum-product algorithm is used to efficiently compute approximate marginal probabilities on a factor graph representing the cipher structure. Preprocessing techniques can reduce the complexity of the sum-product algorithm when applied to ciphers using linear feedback shift registers.
ma112011id535
ma112011id535matsushimalab
?
This document proposes a linear programming (LP) based approach for solving maximum a posteriori (MAP) estimation problems on factor graphs that contain multiple-degree non-indicator functions. It presents an existing LP method for problems with single-degree functions, then introduces a transformation to handle multiple-degree functions by introducing auxiliary variables. This allows applying the existing LP method. As an example, it applies this to maximum likelihood decoding for the Gaussian multiple access channel. Simulation results demonstrate the LP approach decodes correctly with polynomial complexity.
ma52009id420
ma52009id420matsushimalab
?
The document proposes a method to calculate the theoretical throughput limit of type-I hybrid selective-repeat ARQ with a finite receiver buffer using Markov decision processes. The authors model the problem as an MDP and develop an algorithm to compute the maximum expected utility and throughput limit by applying dynamic programming. Simulation results show the throughput of previous methods approaches the proposed theoretical limit with increasing buffer size.
More Related Content
Viewers also liked (14)
ma112008id371
ma112008id371matsushimalab
?
The document proposes a new multiuser detection algorithm for CDMA based on the belief propagation algorithm. It develops a factor graph that represents the posterior distribution of information bits in a way that reduces the number of cycles compared to previous factor graphs. Numerical simulations show the proposed belief propagation algorithm outperforms the parallel interference canceller detector, especially for signature sequences that produce factor graphs with fewer cycles and weaker cross-correlations between users. The approach shows promise for application to other communication systems.ma52009id421
ma52009id421matsushimalab
?
The document proposes a new method for document classification with small training data. It discusses previous methods that estimate parameters for prior distributions either using fixed values or estimating data. The new proposed method estimates parameters for prior distributions as a weighted combination of estimating data and training data. Experiments show the new method achieves higher accuracy than previous methods, especially with small training data sizes.ma112006id337
ma112006id337matsushimalab
?
The document proposes reducing the computational complexity of message passing algorithms like belief propagation (BP) and concave-convex procedure (CCCP) for multiuser detection in CDMA systems. It does this by changing the factor graph structure used to represent the detection problem from a fully connected graph (Factor Graph I) to a sparsely connected graph (Factor Graph II). Simulation results show the proposed CCCP detector for the new factor graph achieves near optimal performance with lower complexity than existing approaches.ma52006id386
ma52006id386matsushimalab
?
The document discusses methods for statistical spelling correction based on decision theory. It defines the spelling correction problem and previous approaches. It then presents two new methods: 1) Evaluating the error rate per sentence using Bayes optimal and approximate algorithms based on dynamic programming. 2) Evaluating the error rate per word also using Bayes optimal and approximate algorithms like the BCJR algorithm. The goal is to minimize error rates with computational efficiency for real-world applications.ma12012id536
ma12012id536matsushimalab
?
This document analyzes the asymptotic properties of expected cumulative logarithmic loss in Bayesian estimation when models are nested and when there is misspecification. The main theorem states that if the true distribution does not belong to the model class, the asymptotic loss per symbol goes to the Kullback-Leibler divergence between the true and model distributions, rather than 0. If the true distribution does belong to the model class, the results reduce to previous studies. The proof is separated into two parts and relies on a lemma showing posterior concentration at the true model.ma99992012id537
ma99992012id537matsushimalab
?
This document proposes a unified framework for approximating the optimal key estimation of stream ciphers using probabilistic inference. It formulates the key estimation problem as determining the secret key that maximizes the joint probability based on the observed keystream. An approximation algorithm called the sum-product algorithm is used to efficiently compute approximate marginal probabilities on a factor graph representing the cipher structure. Preprocessing techniques can reduce the complexity of the sum-product algorithm when applied to ciphers using linear feedback shift registers.More from matsushimalab (8)
ma112011id535
ma112011id535matsushimalab
?
This document proposes a linear programming (LP) based approach for solving maximum a posteriori (MAP) estimation problems on factor graphs that contain multiple-degree non-indicator functions. It presents an existing LP method for problems with single-degree functions, then introduces a transformation to handle multiple-degree functions by introducing auxiliary variables. This allows applying the existing LP method. As an example, it applies this to maximum likelihood decoding for the Gaussian multiple access channel. Simulation results demonstrate the LP approach decodes correctly with polynomial complexity.ma52009id420
ma52009id420matsushimalab
?
The document proposes a method to calculate the theoretical throughput limit of type-I hybrid selective-repeat ARQ with a finite receiver buffer using Markov decision processes. The authors model the problem as an MDP and develop an algorithm to compute the maximum expected utility and throughput limit by applying dynamic programming. Simulation results show the throughput of previous methods approaches the proposed theoretical limit with increasing buffer size.ma22006id411
- 1. 岷住柴鮫と褒憲催のvSにvする匯深賀 検弥 鋲猟 + 防 樗密 ++ + 罪篋斌親寄僥 斌僥何 U喃麪Э ++ 壼R弥寄僥 尖垢僥何 U咼轡好謄犢ぱЭ
- 2. k燕の送れ
- 3. 1. はじめに
- 4. ?
- 5. 2. 芝催の協吶
- 6. 芝催の協吶
- 7. ?
- 8. ?
- 9. ?
- 10. 鹿栽にvする協
- 11. 3.
- 12. ?
- 13. 燕 1 さらに匯違晒するとどうなるか 匯違晒
- 14. ?
- 15. 燕２ 匯違晒 a} 2 UEP 憲催 [Masnick67] [Boyarinov81] [Saito06] a} 1 ┌嶷`り 屎憲催 [Hedayat99] 協尖 1 a} 3
- 16. H と C のvSの匯違晒
- 17. 燕 3 秘薦によるx柊フ`リエQの蛍 4. ブ`ルドメイン貧のv方にする サンプリング協尖
- 18. ｡囃崙泙砲茲觀崟
- 19. 児久v方
- 21. 岷住柴鮫
- 22. 岷住柴鮫
- 23. 5. 巓襖方｡囃が嶷ならない訳周を 喘いたサンプリング協尖 ブ`ルドメイン貧のv方にする炎云晒v方
- 24. ?
- 25. 燕 4 岷住柴鮫の燕F圭隈にvする サンプリング協尖の蛍 匯違晒 協尖 3 協尖 2[ 検弥 03] [ {云 97] 岷住柴鮫の燕F
- 27. ６まとめ
- 28. gY柴鮫隈のモデル
- 29. gY柴鮫隈における恷癖なgY柴鮫
- 30. 原h