Gotowa bibliografia na temat „A posteriori probability decoding”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „A posteriori probability decoding”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "A posteriori probability decoding"
Arar, Maher, Claude D'Amours i Abbas Yongacoglu. "Simplified LLRs for the Decoding of Single Parity Check Turbo Product Codes Transmitted Using 16QAM". Research Letters in Communications 2007 (2007): 1–4. http://dx.doi.org/10.1155/2007/53517.
Pełny tekst źródłaLiu, Jia, Mingyu Zhang, Chaoyong Wang, Rongjun Chen, Xiaofeng An i Yufei Wang. "Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra". Discrete Dynamics in Nature and Society 2020 (29.01.2020): 1–11. http://dx.doi.org/10.1155/2020/1469090.
Pełny tekst źródłaShrestha, Rahul, i Roy Paily. "Memory-Reduced Maximum A Posteriori Probability Decoding for High-Throughput Parallel Turbo Decoders". Circuits, Systems, and Signal Processing 35, nr 8 (22.09.2015): 2832–54. http://dx.doi.org/10.1007/s00034-015-0168-4.
Pełny tekst źródłaShafieipour, Mohammad, Heng-Siong Lim i Teong-Chee Chuah. "Decoding of Turbo Codes in Symmetric Alpha-Stable Noise". ISRN Signal Processing 2011 (29.03.2011): 1–7. http://dx.doi.org/10.5402/2011/683972.
Pełny tekst źródłaWang, Li Na, i Xiao Liu. "Improved BP Decoding Algorithm for LDPC Codes". Advanced Materials Research 846-847 (listopad 2013): 925–28. http://dx.doi.org/10.4028/www.scientific.net/amr.846-847.925.
Pełny tekst źródłaPARK, HEE-SEON, BONG-KEE SIN, JONGSUB MOON i SEONG-WHAN LEE. "A 2-D HMM METHOD FOR OFFLINE HANDWRITTEN CHARACTER RECOGNITION". International Journal of Pattern Recognition and Artificial Intelligence 15, nr 01 (luty 2001): 91–105. http://dx.doi.org/10.1142/s0218001401000757.
Pełny tekst źródłaKim, Sang Wu, Taha Khalaf i Sangmun Kim. "MAP Detection of Misbehaving Relay in Wireless Multiple Access Relay Networks". IEEE Communications Letters 15, nr 3 (marzec 2011): 340–42. http://dx.doi.org/10.1109/lcomm.2011.012511.101323.
Pełny tekst źródłaRavi Kumar, Ch, i K. Padmaraju. "Hard Decision Decoding Performance Improved Using Turbo Product Codes". International Journal of Engineering & Technology 7, nr 3.12 (20.07.2018): 228. http://dx.doi.org/10.14419/ijet.v7i3.12.16030.
Pełny tekst źródłaRaza, Hasnain, Syed Azhar Ali Zaidi, Aamir Rashid i Shafiq Haider. "An area efficient and high throughput implementation of layered min-sum iterative construction a posteriori probability LDPC decoder". PLOS ONE 16, nr 3 (29.03.2021): e0249269. http://dx.doi.org/10.1371/journal.pone.0249269.
Pełny tekst źródłaChen, Xianqing, i Lenan Wu. "Nonlinear Demodulation and Channel Coding in EBPSK Scheme". Scientific World Journal 2012 (2012): 1–7. http://dx.doi.org/10.1100/2012/180469.
Pełny tekst źródłaRozprawy doktorskie na temat "A posteriori probability decoding"
Griffiths, Wayne Bradley. "On a posteriori probability decoding of linear block codes over discrete channels". University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0156.
Pełny tekst źródłaBlad, Anton. "Efficient Decoding Algorithms for Low-Density Parity-Check Codes". Thesis, Linköping University, Department of Electrical Engineering, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2794.
Pełny tekst źródłaLow-density parity-check codes have recently received much attention because of their excellent performance and the availability of a simple iterative decoder. The decoder, however, requires large amounts of memory, which causes problems with memory consumption.
We investigate a new decoding scheme for low density parity check codes to address this problem. The basic idea is to define a reliability measure and a threshold, and stop updating the messages for a bit whenever its reliability is higher than the threshold. We also consider some modifications to this scheme, including a dynamic threshold more suitable for codes with cycles, and a scheme with soft thresholds which allow the possibility of removing a decision which have proved wrong.
By exploiting the bits different rates of convergence we are able to achieve an efficiency of up to 50% at a bit error rate of less than 10^-5. The efficiency should roughly correspond to the power consumption of a hardware implementation of the algorithm.
Blasco-Serrano, Ricardo, Ragnar Thobaben, Vishwambhar Rathi i Mikael Skoglund. "Polar codes for compress-and-forward in binary relay channels". KTH, Kommunikationsteori, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-43727.
Pełny tekst źródła© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20111207
Xie, Li Information Technology & Electrical Engineering Australian Defence Force Academy UNSW. "Finite horizon robust state estimation for uncertain finite-alphabet hidden Markov models". Awarded by:University of New South Wales - Australian Defence Force Academy. School of Information Technology and Electrical Engineering, 2004. http://handle.unsw.edu.au/1959.4/38664.
Pełny tekst źródłaElfverson, Daniel. "Multiscale Methods and Uncertainty Quantification". Doctoral thesis, Uppsala universitet, Avdelningen för beräkningsvetenskap, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-262354.
Pełny tekst źródłaGuenda, Kenza. "On algebraic geometric codes and some related codes". Thesis, Stellenbosch : University of Stellenbosch, 2006. http://hdl.handle.net/10019.1/2033.
Pełny tekst źródłaThe main topic of this thesis is the construction of the algebraic geometric codes (Goppa codes), and their decoding by the list-decoding, which allows one to correct beyond half of the minimum distance. We also consider the list-decoding of the Reed–Solomon codes as they are subclass of the Goppa codes, and the determination of the parameters of the non primitive BCH codes. AMS Subject Classification: 4B05, 94B15, 94B35, 94B27, 11T71, 94B65,B70. Keywords: Linear codes, cyclic codes, BCH codes, Reed–Solomon codes, list-decoding, Algebraic Geometric codes, decoding, bound on codes, error probability.
Tamatoro, Johng-Ay. "Approche stochastique de l'analyse du « residual moveout » pour la quantification de l'incertitude dans l'imagerie sismique". Thesis, Pau, 2014. http://www.theses.fr/2014PAUU3044/document.
Pełny tekst źródłaThe main goal of the seismic imaging for oil exploration and production as it is done nowadays is to provide an image of the first kilometers of the subsurface to allow the localization and an accurate estimation of hydrocarbon resources. The reservoirs where these hydrocarbons are trapped are structures which have a more or less complex geology. To characterize these reservoirs and allow the production of hydrocarbons, the geophysicist uses the depth migration which is a seismic imaging tool which serves to convert time data recorded during seismic surveys into depth images which will be exploited by the reservoir engineer with the help of the seismic interpreter and the geologist. During the depth migration, seismic events (reflectors, diffractions, faults …) are moved to their correct locations in space. Relevant depth migration requires an accurate knowledge of vertical and horizontal seismic velocity variations (velocity model). Usually the so-called Common-Image-Gathers (CIGs) serve as a tool to verify correctness of the velocity model. Often the CIGs are computed in the surface offset (distance between shot point and receiver) domain and their flatness serve as criteria of the velocity model correctness. Residual moveout (RMO) of the events on CIGs due to the ratio of migration velocity model and effective velocity model indicates incorrectness of the velocity model and is used for the velocity model updating. The post-stacked images forming the CIGs which are used as data for the RMO analysis are the results of an inverse problem and are corrupt by noises. An uncertainty analysis is necessary to improve evaluation of the results. Dealing with the uncertainty is a major issue, which supposes to help in decisions that have important social and commercial implications. The goal of this thesis is to contribute to the uncertainty analysis and its quantification in the analysis of various parameters computed during the seismic processing and particularly in RMO analysis. To reach these goals several stages were necessary. We began by appropriating the various geophysical concepts necessary for the understanding of:- the organization of the seismic data ;- the various processing ;- the various mathematical and methodological tools which are used (chapters 2 and 3). In the chapter 4, we present different tools used for the conventional RMO analysis. In the fifth one, we give a statistical interpretation of the conventional RMO analysis and we propose a stochastic approach of this analysis. This approach consists in hierarchical statistical model where the parameters are: - the variance which express the noise level in the data ;- a functional parameter which express coherency of the amplitudes along events ; - the ratio which is assume to be a random variable and not an unknown fixed parameter as it is the case in conventional approach. The adjustment of data to the model done by using smoothing methods of data, combined with the using of the wavelets for the estimation of allow to compute the posterior distribution of given the data by the empirical Bayes methods. An estimation of the parameter is obtained by using Markov Chain Monte Carlo simulations of its posterior distribution. The various quantiles of these simulations provide different estimations of . The proposed methodology is validated in the sixth chapter by its application on synthetic data and real data. A sensitivity analysis of the estimation of the parameter was done. The using of the uncertainty of this parameter to quantify the uncertainty of the spatial positions of reflectors is presented in this thesis
Erdogan, Ahmet Yasin. "Analysis of the effects of phase noise and frequency offset in orthogonal frequency division multiplexing (OFDM) systems". Thesis, Monterey California. Naval Postgraduate School, 2004. http://hdl.handle.net/10945/1712.
Pełny tekst źródłaOrthogonal frequency division multiplexing (OFDM) is being successfully used in numerous applications. It was chosen for IEEE 802.11a wireless local area network (WLAN) standard, and it is being considered for the fourthgeneration mobile communication systems. Along with its many attractive features, OFDM has some principal drawbacks. Sensitivity to frequency errors is the most dominant of these drawbacks. In this thesis, the frequency offset and phase noise effects on OFDM based communication systems are investigated under a variety of channel conditions covering both indoor and outdoor environments. The simulation performance results of the OFDM system for these channels are presented.
Lieutenant Junior Grade, Turkish Navy
Hatefi, Atoosa. "Distributed Coding for Wireless Cooperative Networks". Thesis, Supélec, 2012. http://www.theses.fr/2012SUPL0015/document.
Pełny tekst źródłaWith the rapid growth of wireless technologies, devices and mobile applications, the quest of high throughput and ubiquitous connectivity in wireless communications increases rapidly as well. Relaying is undoubtedly a key concept to provide coverage extension and capacity increase in wireless networks. Network coding, which allows the intermediate nodes to share their computation capabilities in addition to their resource and their power, has grabbed a significant research attention since its inception in information theory. It has become an attractive candidate to bring promising performance improvement, especially in terms of throughput, in relay-based cellular networks. Substantial research efforts are currently focused on theoretical analysis, implementation and evaluation of network coding from a physical layer perspective. The question is, what is the most efficient and practical way to use network coding in wireless relay-based networks, and whether it is beneficial to exploit the broadcast and multiple-access properties of the wireless medium to perform network coding. It is in such a context, that this thesis proceeds. In the first part of the thesis, the problem of Joint Network-Channel Coding (JNCC) for a Multiple Access Relay Channel (MARC) is investigated in the presence of multiple access interferences and for both of the relay operating modes, namely, half-duplex and full-duplex. To this end, three new classes of MARC, referred to as Half-Duplex Semi-Orthogonal MARC (HD-SOMARC), Half-Duplex Non-Orthogonal MARC (HD-NOMARC), and Full-Duplex Non-Orthogonal MARC (FD-NOMARC) have been introduced and studied. The relaying function in all of the classes is based on a Selective Decode-and-Forward (SDF) strategy, which is individually implemented for each source, i.e, the relay forwards only a deterministic function of the error-free decoded messages. For each class, an information-theoretic analysis is conducted, and practical coding and decoding techniques are proposed. The proposed coding schemes, perform very close to the outage limit for both cases of HD-SOMARC and HD-NOMARC. Besides, in the case of HD-NOMARC, the optimal allocation of the transmission time to the relay is considered. It is also verified that exploiting multiple access interferences, either partially or totally, results in considerable gains for MARC compared to the existing interference-avoiding structures, even in the case of single receive antenna. In the second part of the thesis, the network model is extended by considering multiple relays which help multiple sources to communicate with a destination. A new class of Multiple Access Multiple Relay Channel (MAMRC), referred to as Half-Duplex Semi-Orthogonal MAMRC (HD-SOMAMRC) is then proposed and analyzed from both information theoretic and code design perspective. New practical JNCC schemes are proposed, in which binary channel coding and non binary network coding are combined, and they are shown to perform very close to the outage limit. Moreover, the optimal allocation of the transmission time to the sources and relays is considered. Finally, in the third part of the thesis, different ways of implementing cooperation, including practical relaying protocols are investigated for the half-duplex MARC with semi-orthogonal transmission protocol and in the case of JNCC. The hard SDF approach is compared with two Soft Decode and Forward (SoDF) relaying functions: one based on log a posterior probability ratios (LAPPRs) and the other based on Mean Square Error (MSE) estimate. It is then shown that SDF works well in most of the configurations and just in some extreme cases, soft relaying functions (based on LAPPR or MSE estimate) can slightly outperform the hard selective one
"Use of tone information in Cantonese LVCSR based on generalized character posterior probability decoding". Thesis, 2005. http://library.cuhk.edu.hk/record=b6074029.
Pełny tekst źródłaThe decoding in conventional LVCSR systems aims at finding the sentence hypothesis, i.e. the string of words, which has the maximum a posterior (MAP) probability in comparison with other hypotheses. However, in most applications, the recognition performance is measured in terms of word error rate (or word accuracy). In Chinese languages, given that "word" is a rather ambiguous concept, speech recognition performance is usually measured in terms of the character error rate. In this thesis, we develop a decoding algorithm that can minimize the character error rate. The algorithm is applied to a reduced search space, e.g. a word graph or the N-best sentence list, which results from the 1st pass of search, and the generalized character posterior probability (GCPP) is maximized. (Abstract shortened by UMI.)
This thesis addresses two major problems of the existing large vocabulary continuous speech recognition (LVCSR) technology: (1) inadequate exploitation of alternative linguistic and acoustic information; and (2) the mismatch between the decoding (recognition) criterion and the performance evaluation. The study is focused on Cantonese, one of the major Chinese dialects, which is also monosyllabic and tonal. Tone is somewhat indispensable for lexical access and disambiguation of homonyms in Cantonese. However, tone information into Cantonese LVCSR requires effective tone recognition as well as a seamless integration algorithm.
Qian Yao.
"July 2005."
Adviser: Tan Lee.
Source: Dissertation Abstracts International, Volume: 67-07, Section: B, page: 4009.
Thesis (Ph.D.)--Chinese University of Hong Kong, 2005.
Includes bibliographical references (p. 100-110).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstract in English and Chinese.
School code: 1307.
Książki na temat "A posteriori probability decoding"
Lamel, Lori, i Jean-Luc Gauvain. Speech Recognition. Redaktor Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0016.
Pełny tekst źródłaCzęści książek na temat "A posteriori probability decoding"
Stankiewicz, Olgierd, Krzysztof Wegner i Marek Domanski. "Depth Estimation Based on Maximization of a Posteriori Probability". W Computer Vision and Graphics, 253–65. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46418-3_23.
Pełny tekst źródłaSpiteri, Trevor, i Victor Buttigieg. "Maximum a Posteriori Decoding of Arithmetic Codes in Joint Source-Channel Coding". W Communications in Computer and Information Science, 363–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25206-8_24.
Pełny tekst źródłaFrego, Marco. "On the Probability of Incorrect Decoding for Linear Codes". W Cryptography and Coding, 103–15. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71045-7_5.
Pełny tekst źródłaKatsman, Gregory L., Michael A. Tsfasman i Serge G. Vladut. "Spectra of linear codes and error probability of decoding". W Lecture Notes in Mathematics, 82–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0087994.
Pełny tekst źródłaBattail, Gérard. "Weighted decoding as a means for reestimating a probability distribution (abstract)". W Coding Theory and Applications, 150–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-19368-5_16.
Pełny tekst źródłaWalrand, Jean. "Digital Link—A". W Probability in Electrical Engineering and Computer Science, 115–42. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-49995-2_7.
Pełny tekst źródłaNa, Seung-Hoon, In-Su Kang i Jong-Hyeok Lee. "Improving Relevance Feedback in Language Modeling Approach: Maximum a Posteriori Probability Criterion and Three-Component Mixture Model". W Natural Language Processing – IJCNLP 2004, 130–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30211-7_14.
Pełny tekst źródłaWalrand, Jean. "Speech Recognition: A". W Probability in Electrical Engineering and Computer Science, 205–15. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-49995-2_11.
Pełny tekst źródłaTolhuizen, L. M. G. M. "A Universal Upper Bound on the Miscorrection Probability with Bounded Distance Decoding for a Code Used on an Error-Value Symmetric Channel". W Eurocode ’92, 313–20. Vienna: Springer Vienna, 1993. http://dx.doi.org/10.1007/978-3-7091-2786-5_26.
Pełny tekst źródłaLabghough, Souad, Fouad Ayoub i Mostafa Belkasmi. "A Closed Form Expression for the Bit Error Probability for Majority Logic Decoding of CSOC Codes over $$\varGamma \varGamma $$ Γ Γ Channels". W Advances in Intelligent Systems and Computing, 200–210. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-76354-5_18.
Pełny tekst źródłaStreszczenia konferencji na temat "A posteriori probability decoding"
Yoshikawa, H. "Theoretical analysis of bit error probability for maximum a posteriori probability decoding". W IEEE International Symposium on Information Theory, 2003. Proceedings. IEEE, 2003. http://dx.doi.org/10.1109/isit.2003.1228291.
Pełny tekst źródłaSadjadpour, Hamid R. "Maximum a posteriori decoding algorithms for turbo codes". W AeroSense 2000, redaktorzy Raghuveer M. Rao, Soheil A. Dianat i Michael D. Zoltowski. SPIE, 2000. http://dx.doi.org/10.1117/12.394081.
Pełny tekst źródłaPopescu, Theodor D. "Signal segmentation using maximum a posteriori probability estimator". W 2013 7th International Conference on Application of Information and Communication Technologies (AICT). IEEE, 2013. http://dx.doi.org/10.1109/icaict.2013.6722734.
Pełny tekst źródłaRatnayake, Ruwan, Aleksandar Kavcic i Gu-Yeon Wei. "A High-Throughput Maximum a posteriori Probability Detector". W 2007 IEEE 29th Custom Integrated Circuits Conference. IEEE, 2007. http://dx.doi.org/10.1109/cicc.2007.4405772.
Pełny tekst źródłaOno, Y., i S. Nakagawa. "Estimation of a posteriori probability using neural network". W 1991 IEEE International Joint Conference on Neural Networks. IEEE, 1991. http://dx.doi.org/10.1109/ijcnn.1991.170497.
Pełny tekst źródłaHorne, B., i D. Hush. "Estimating a posteriori probability with P-type nodes". W 1990 IJCNN International Joint Conference on Neural Networks. IEEE, 1990. http://dx.doi.org/10.1109/ijcnn.1990.137649.
Pełny tekst źródłaKanda, Naoyuki, Xugang Lu i Hisashi Kawai. "Maximum a posteriori Based Decoding for CTC Acoustic Models". W Interspeech 2016. ISCA, 2016. http://dx.doi.org/10.21437/interspeech.2016-71.
Pełny tekst źródłaWhite, L. B. "Maximum a posteriori probability line tracking for nonstationary processes". W [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing. IEEE, 1991. http://dx.doi.org/10.1109/icassp.1991.150128.
Pełny tekst źródłaHamamura, T., T. Akagi i B. Irie. "An Analytic Word Recognition Algorithm Using a Posteriori Probability". W Ninth International Conference on Document Analysis and Recognition (ICDAR 2007) Vol 2. IEEE, 2007. http://dx.doi.org/10.1109/icdar.2007.4376999.
Pełny tekst źródłaBlackhall, Lachlan, i Michael Rotkowitz. "Maximum a posteriori vs maximum probability recursive sparse estimation". W 2009 European Control Conference (ECC). IEEE, 2009. http://dx.doi.org/10.23919/ecc.2009.7074447.
Pełny tekst źródła