Thematische Bibliographien / Progressive Edge Growth

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Buchteile
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Progressive Edge Growth“

Autor: Grafiati

Veröffentlicht am 24. Juni 2021

Zuletzt aktualisiert am 1. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Progressive Edge Growth" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Progressive Edge Growth"

Chen, Lin, und Da-Zheng Feng. „Fast Implementation of the Progressive Edge-Growth Algorithm“. ETRI Journal 31, Nr. 2 (09.04.2009): 240–42. http://dx.doi.org/10.4218/etrij.09.0208.0358.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kraidy, Ghassan M. „On Progressive Edge-Growth Interleavers for Turbo Codes“. IEEE Communications Letters 20, Nr. 2 (Februar 2016): 200–203. http://dx.doi.org/10.1109/lcomm.2015.2504364.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xiao-Yu Hu, E. Eleftheriou und D. M. Arnold. „Regular and irregular progressive edge-growth tanner graphs“. IEEE Transactions on Information Theory 51, Nr. 1 (Januar 2005): 386–98. http://dx.doi.org/10.1109/tit.2004.839541.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Martinez-Mateo, Jesus, Dav Elkouss und Vicente Martin. „Improved Construction of Irregular Progressive Edge-Growth Tanner Graphs“. IEEE Communications Letters 14, Nr. 12 (Dezember 2010): 1155–57. http://dx.doi.org/10.1109/lcomm.2010.101810.101384.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vukobratovic, D., und V. Senk. „Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design“. IEEE Communications Letters 12, Nr. 1 (Januar 2008): 32–34. http://dx.doi.org/10.1109/lcomm.2008.071457.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Anbalgan, Anand, und Senthil Kumar.P. „Progressive edge growth LDPC Encoder with spiral search algorithm“. International Journal of Engineering & Technology 7, Nr. 1.3 (31.12.2017): 198. http://dx.doi.org/10.14419/ijet.v7i1.3.10673.

Der volle Inhalt der Quelle

Annotation:

Trapping set causes the drop of performance in error floor region. Identification of TS is done by graphical method and enumerators. The lowest odd degree (minimal) TS is increasing the formation of more unsaturated nodes in iterative decoding. Progressive edge growth (PEG) Low-density parity check code (LDPC) [2] avoidance of trapping sets are mainly based on the distance and degree calculation of successive CN. This simple tool is used to eliminate TS when the encoder ensemble designs itself. Non-zero neighborhood search also made an influence on error floor. The spiral search method is used for Non-zero codeword search (NZCW) search for the first time in this research, at the decoder part. So, Non-zero codeword spiral search (NZCSS) converge fast with less number iteration, and this reduces the iteration of the decoder.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sharon, E., und S. Litsyn. „Constructing LDPC codes by error minimization progressive edge growth“. IEEE Transactions on Communications 56, Nr. 3 (März 2008): 359–68. http://dx.doi.org/10.1109/tcomm.2008.050658.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jiang, Xueqin, Yi Yang, Moon Ho Lee und Minda Zhu. „Progressive edge-growth algorithm for low-density MIMO codes“. Journal of Communications and Networks 16, Nr. 6 (Dezember 2014): 639–44. http://dx.doi.org/10.1109/jcn.2014.000110.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

El-Maleh, Aiman H., Mohamed Adnan Landolsi und Esa A. AlGhoneim. „Window-constrained interconnect-efficient progressive edge growth LDPC codes“. AEU - International Journal of Electronics and Communications 67, Nr. 7 (Juli 2013): 588–94. http://dx.doi.org/10.1016/j.aeue.2012.12.006.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xiao, H., und A. H. Banihashemi. „Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC Codes“. IEEE Communications Letters 8, Nr. 12 (Dezember 2004): 715–17. http://dx.doi.org/10.1109/lcomm.2004.839612.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Progressive Edge Growth"

Silvaroli, Antonio. „Design and Analysis of Erasure Correcting Codes in Blockchain Data Availability Problems“. Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.

Den vollen Inhalt der Quelle finden

Annotation:

In questo lavoro viene affrontato il concetto di Blockchain e Bitcoin, con enfasi sugli attacchi alla disponibilità riguardanti le transazioni, nel caso in cui nella rete vengano considerati alcuni nodi detti "light nodes", che migliorano la scalabilità del sistema. Quindi, si analizza il funzionamento della Blockchain di Bitcoin quando la struttura dati "Merkle Tree" viene codificata, in modo da aumentare la probabilità dei light nodes di rilevare cancellazioni di transazioni, attuate da parte di nodi attaccanti. Attraverso una codifica con erasure codes, in particolare con codici low density parity check (LDPC), si riesce ad aumentare la probabilità di detection di una cancellazione e, grazie alla decodifica iterativa è possibile recuperare tale cancellazione. Viene affrontato il problema degli stopping sets, cioè quelle strutture che impediscono il recupero dei dati tramite decodifica iterativa e si progetta un algoritmo per l'enumerazione di tali strutture. Sono poi testate, in modo empirico, alcune soluzioni teoriche presenti in letteratura. Successivamente vengono progettati nuovi codici, seguendo un metodo di design diverso da quello presente in letteratura. Tali codici comportano un miglioramento delle performance, in quanto il minimo stopping set per tali codici risulta più alto di quello di codici già analizzati. In questo modo eventuali attacchi alla disponibilità risultano, in probabilità, più difficili. Come conseguenza, il throughput della rete risulta più stabile dato che, con minori attacchi che vanno a buon fine, la frequenza di generazione di nuovi codici, per un nuovo processo di codifica delle transazioni, tende ad essere più bassa. Infine vengono proposti dei possibili miglioramenti.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dang, Rajdeep Singh. „Experimental Studies On A New Class Of Combinatorial LDPC Codes“. Thesis, 2007. http://hdl.handle.net/2005/523.

Der volle Inhalt der Quelle

Annotation:

We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth graph construction technique, and study the performance of the codes so constructed on both the Additive White Gaussian Noise (AWGN) channel as well as the Binary Erasure Channel (BEC). Our codes are “near regular”, meaning thereby that the the left degree of any node in the Tanner graph constructed varies by at most 1 from the average left degree and so also the right degree. The simulations for rate half codes indicate that the codes perform better than both the regular Progressive Edge Growth (PEG) codes which are constructed using a similar random technique, as well as the MacKay random codes. For high rates the ARG (Almost Regular high Girth) codes perform better than the PEG codes at low to medium SNR’s but the PEG codes seem to do better at high SNR’s. We have tried to track both near codewords as well as small weight codewords for these codes to examine the performance at high rates. For the binary erasure channel the performance of the ARG codes is better than that of the PEG codes. We have also proposed a modiﬁcation of the sum-product decoding algorithm, where a quantity called the “node credibility” is used to appropriately process messages to check nodes. This technique substantially reduces the error rates at signal to noise ratios of 2.5dB and beyond for the codes experimented on. The average number of iterations to achieve this improved performance is practically the same as that for the traditional sum-product algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Progressive Edge Growth"

Barrons, Kevin Paul. „Can Applied On-Job Training Yield Increased Productivity?“ In Strategic Collaborative Innovations in Organizational Systems, 160–76. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7390-6.ch008.

Der volle Inhalt der Quelle

Annotation:

On-job training (OJT) and the zone of proximal learning (ZPL) remain some of the top innovative approaches to increasing the efficacies required in progressive enterprises. Available data indicate that there is a positive correlation between OJT and cumulated productivity. The ZPL is at the cutting-edge of improving cognitive and affective and sensory practices while OJT upsurge the skillfulness required to boost performance in the value creation system. OJT and ZPL can be juxtaposed to progress explicit knowledge difficult for the competition to mimic. A case study is drawn to illustrate how OJT and the ZPL can be applied in the divided labor to grow specialization and design and implement the technology required to upsurge productivity in a successful organization.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Balakrishnan, P., Veeramuthu Venkatesh und Pethuru Raj. „Fog Computing“. In Handbook of Research on Cloud and Fog Computing Infrastructures for Data Science, 68–84. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-5972-6.ch004.

Der volle Inhalt der Quelle

Annotation:

The evolutions of world wide web (WWW) promise the revolution in personal, professional, and social aspects of human beings. These evolutions begin with static web pages to more sophisticated brain-computer interfaces. Among them, Web 4.0 plays a significant role that aimed to integrate mobile devices and things into the web to realize smarter environments. Further, it leads to the progression of machine-to-machine communication, wireless sensor networks, cyber physical systems, and internet of things (IoT). The drastic development of IoT applications led to unprecedented growth of data which can be processed using more powerful far-end cloud resources or less powerful local edge devices. Fog computing compromises the demerits of both approaches and conducts the data analysis at the network-end itself. This chapter provides the benefits of fog computing architectures together with the simulator as well as different software platforms for realizing the fog computing.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gohil, Maitri Rajesh, Sumukh Sandeep Maduskar, Vikrant Gajria und Ramchandra Mangrulkar. „Blockchain and Its Applications in Healthcare“. In Advances in Information Security, Privacy, and Ethics, 271–94. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-5839-3.ch012.

Der volle Inhalt der Quelle

Annotation:

Growing organizations, institutions, and SMEs demand for transformation in all the aspects of their businesses along with the progression in time and technology. When it comes to healthcare, the growth should be heightened to higher levels with necessity. The need of providing quality of service (QoS) in healthcare is taking significant place, allowing health institutions and medical compliances to develop an ecosystem with cutting-edge technology with the same reliability but better productivity and performance. Moreover, the healthcare systems are aiming for a more patient-centric strategy. Healthcare systems work on complicated and traditional methods, oftentimes administered via teams of professionals who manage data and supportive mechanisms of the system. Blockchain could streamline and automate those methods, conserving weeks of effort in the company's production line to increase the overall revenue and discover new opportunities. This chapter aims to illustrate blockchain technology along with its state-of-the-art applications in healthcare.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Osborne, Evan. „Realignment“. In Self-Regulation and Human Progress. Stanford University Press, 2018. http://dx.doi.org/10.11126/stanford/9780804796446.003.0006.

Der volle Inhalt der Quelle

Annotation:

The later nineteenth and early twentieth centuries witnessed arguments from social reformers and artists and economists that the new, spontaneously evolving society was deficient. It worsened poverty, and it impoverished the soul. The tool of political regulation, exercised in the growing political power of the emerging organization known as the nation, was called in to polish the rough edges of the self-regulating society. As time went on, political regulation gradually came to be seen as the default, and self-regulation needed to be justified. The chapter particularly emphasizes the growth in such thinking among socialists and progressives in the United States and Western Europe. The catastrophe of the Great Depression, combined with admiration for a Soviet Union, Italy, and Germany, where political regulators said they were rationally designing a better society, meant that by the onset of World War II, this presumption was firmly in place throughout the West.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Waterlow, J. C. „Needs for Food: Are We Asking Too Much?“ In Feeding a World Population of More Than Eight Billion People. Oxford University Press, 1998. http://dx.doi.org/10.1093/oso/9780195113129.003.0006.

Der volle Inhalt der Quelle

Annotation:

The Royal Society has in recent years taken a great interest in the growth of the world’s population and has been represented at the two big international congresses on this subject, in Delhi and in Cairo (Graham-Smith, 1994). According to U.N. projections, in 20 year’s time the world population will be between 7.5 and 8.5 billion (Demeny, 1996). There does not seem to be much controversy about these figures. On the other hand, when it comes to the question of whether it will be possible to feed these 8 billion people, opinions diverge widely between optimists and pessimists. McCalla (1995), the director of the Agriculture and Natural Resources Department of the World Bank, in a very illuminating discussion of the controversy, has said, “The economists are always wrong,” presumably because they have to deduce future trends from those of the past. It seemed to us that the best way to make a useful contribution is to look at the subject and assess the possibilities from an objective scientific point of view. The Royal Society has done this twice in the past, with two discussion meetings: one on Agricultural Efficiency (Cooke et al., 1977) and the other on Technology in the 1990s: Agriculture and Food (Blaxter and Fowden, 1985). Now, 10 years on, it is time to have another go, widening the scope of the recent discussion meeting “Land Resources: On the Edge of the Malthusion Precipice?” The late Kenneth Blaxter, in a scries of lectures called “People, Food and Resources,” published in 1986, recalled a quotation from Friedrich Engels, writing in 1844 about the Malthusian dilemma: “Science advances in proportion to the knowledge bequeathed to it by the previous generation and thus under the most ordinary conditions grows in geometrical progression — and what is impossible for science?” (my italics).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chochliouros, Ioannis, Anastasia S. Spiliopoulou und Stergios P. Chochliouros. „Developing Content Delivery Networks“. In Encyclopedia of Multimedia Technology and Networking, Second Edition, 341–48. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-014-1.ch047.

Der volle Inhalt der Quelle

Annotation:

Over the past decades, the expansion of the converged Web-based facilities/infrastructures, together with new business perspectives, have created new needs for all (potential) categories of end-users. Although various effects were significant in most sectors (European Commission, 2005) the fast progress has, however, promoted more complex issues, especially for the delivery of multimedia-based applications. It is now a common view that there is a growing need for delivering high-quality services in the scope of liberalized and competitive markets, where multiple factors of different origin (i.e., technological, business, economic, regulatory, social, etc.) can drastically affect further deployment, establishment or upgrading of existing infrastructures and of any possible (innovative) services offered through them, especially if considering the continuous expansion of the broadband perspective (Chochliouros, & Spiliopoulou, 2005). Furthermore, multimedia applications are bandwidth consuming and new applications for absorbing the available assets appear. As the “converged” sector of information technologies, communication, and media industries is currently on the “edge” of a crucial phase of growth, several challenges appear in the global scene: Appropriate infrastructures for delivering mails, exchanging data files (of various forms of content) and simple Web browsing are now required to be adopted and used, to support the streaming of multimedia content and, simultaneously, to “compose” a reliable means of transmitting information between several entities (physical and legal persons) using digital facilities. Although technological advances have enhanced the deployment of faster (lesser latency) and greater (more bandwidth) “network lines” possessing significant advantages, the demands of the extravagant use of Internet from users worldwide (Dilley, Maggs, Parikh, Prokop, Sitaraman, & Weihl, 2002; Shoniregun, Chochliouros, Laperche, Logvynovskiy, & Spiliopoulou-Chochliourou, 2004), together with an extensive variance of services offered, were primary motives for researchers to develop a specific category of modern infrastructures, known as content distribution (or delivery) networks (CDNs) (Hull, 2002; Verma, 2002). The development of suitable content delivery networking comprises one of the most important challenges in the global networking area, together with the expansion of various IP trends. Content networks influence high-layer network intelligence to efficiently manage the delivery of various forms of data (which is becoming progressively more multimedia in nature). At an initial stage, they were built upon the structure of the public Internet (Saroiu, Gummadi, Dunn, Gribble, & Levy, 2002), to accelerate Web site performance (Johnson, Carr, Day, & Frans Kaashoek, 2000). This option has been fulfilled in numerous cases, and such intelligent network tools can be applied in other beneficial and profitable ways.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Progressive Edge Growth"

Venkiah, Auguste, David Declercq und Charly Poulliat. „Randomized Progressive Edge-Growth (RandPEG)“. In 2008 5th International Symposium on Turbo Codes and Related Topics. IEEE, 2008. http://dx.doi.org/10.1109/turbocoding.2008.4658712.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Healy, C. T., und R. C. de Lamare. „Decoder Optimised Progressive Edge Growth Algorithm“. In 2011 IEEE Vehicular Technology Conference (VTC 2011-Spring). IEEE, 2011. http://dx.doi.org/10.1109/vetecs.2011.5956769.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lustosa, Mauro Q., und Weiler A. Finamore. „Progressive Edge-Growth in IRA Codes“. In XXVII Simpósio Brasileiro de Telecomunicações. Sociedade Brasileira de Telecomunicações, 2009. http://dx.doi.org/10.14209/sbrt.2009.58014.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jiang, Xueqin, Mi Sung Lee und Moon Ho Lee. „Modified Progressive Edge-Growth Algorithm for Fast-Encoding LDPC Codes“. In 2010 IEEE Vehicular Technology Conference (VTC 2010-Fall). IEEE, 2010. http://dx.doi.org/10.1109/vetecf.2010.5594175.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rave, W. „Selected Mapping with LPDC Codes Constructed by Modifed Progressive Edge Growth“. In 2007 IEEE International Conference on Communications. IEEE, 2007. http://dx.doi.org/10.1109/icc.2007.159.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rasheed, Omran Al, Daj ana M. Radovic und Predrag N. Ivanis. „Performances of Progressive Edge-Growth LDPC codes in Nakagami fading channel“. In 2012 20th Telecommunications Forum Telfor (TELFOR). IEEE, 2012. http://dx.doi.org/10.1109/telfor.2012.6419272.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Alkanhel, Reem, und Marcel Adrian Ambroze. „Extended grouping of RFID tags based on progressive edge-growth methods“. In 2016 5th International Conference on Electronic Devices, Systems and Applications (ICEDSA). IEEE, 2016. http://dx.doi.org/10.1109/icedsa.2016.7818544.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jiang, Xueqin, Papa Ousmance Thiaw Diagne, Moon Ho Lee und Wujun Xu. „Low Complexity Progressive Edge-Growth Algorithm Based on Chinese Remainder Theorem“. In 2012 IEEE Vehicular Technology Conference (VTC Fall). IEEE, 2012. http://dx.doi.org/10.1109/vtcfall.2012.6399027.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Uchoa, Andre G. D., Cornelius Healy, Rodrigo C. de Lamare und Richard D. Souza. „LDPC codes based on Progressive Edge Growth techniques for block fading channels“. In 2011 8th International Symposium on Wireless Communication Systems (ISWCS 2011). IEEE, 2011. http://dx.doi.org/10.1109/iswcs.2011.6125390.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Catherine, P. C., und K. M. S. Soyjaudah. „A density-based progressive edge-growth matrix creation technique for LDPC codes“. In Iterative Information Processing (ISTC). IEEE, 2010. http://dx.doi.org/10.1109/istc.2010.5613841.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!