Results 11 to 20 of about 2,722,658 (361)

EXIT-chart aided near-capacity quantum turbo code design [PDF]

open access: yesIEEE Transactions on Vehicular Technology, 2014
High detection complexity is the main impediment in future Gigabit-wireless systems. However, a quantum-based detector is capable of simultaneously detecting hundreds of user signals by virtue of its inherent parallel nature.
Babar, Zunaira   +2 more
core   +4 more sources

VeriGen: A Large Language Model for Verilog Code Generation [PDF]

open access: yesACM Trans. Design Autom. Electr. Syst., 2023
In this study, we explore the capability of Large Language Models (LLMs) to automate hardware design by automatically completing partial Verilog code, a common language for designing and modeling digital systems. We fine-tune pre-existing LLMs on Verilog
Shailja Thakur   +6 more
semanticscholar   +1 more source

Using an LLM to Help with Code Understanding [PDF]

open access: yesInternational Conference on Software Engineering, 2023
Understanding code is challenging, especially when working in new and complex development environments. Code comments and documentation can help, but are typically scarce or hard to navigate.
Daye Nam   +4 more
semanticscholar   +1 more source

Structured Chain-of-Thought Prompting for Code Generation [PDF]

open access: yesACM Transactions on Software Engineering and Methodology, 2023
Large Language Models (LLMs) have shown impressive abilities in code generation. Chain-of-Thought (CoT) prompting is the state-of-the-art approach to utilizing LLMs.
Jia Li, Ge Li, Yongming Li, Zhi Jin
semanticscholar   +1 more source

Bias Testing and Mitigation in LLM-based Code Generation [PDF]

open access: yesACM Transactions on Software Engineering and Methodology, 2023
As the adoption of LLMs becomes more widespread in software coding ecosystems, a pressing issue has emerged: does the generated code contain social bias and unfairness, such as those related to age, gender, and race?
Dong Huang   +5 more
semanticscholar   +1 more source

Near Capacity Irregular Turbo Code [PDF]

open access: yesarXiv.org, 2015
The purpose of this study is to construct a near capacity Irregular Turbo Code and to evaluate its performance over Gaussian channel. The methodology used to evaluate and measure the performance of the new design is by simulating the system by developing
Abiodun O. Sholiyi   +4 more
semanticscholar   +1 more source

Irregular Vector Turbo Codes with low complexity

open access: yesEURASIP Journal on Wireless Communications and Networking, 2022
The term Block Turbo Code typically refers to the iterative decoding of a serially concatenated two-dimensional systematic block code. This paper introduces a Vector Turbo Code that is irregular but with code rates comparable to those of a Block Turbo ...
Abiodun O. Sholiyi, Timothy O’Farrell
doaj   +1 more source

Where to go from here? New cross layer techniques for LTE Turbo-Code decoding at high code rates [PDF]

open access: yesAdvances in Radio Science, 2018
The wide range of code rates and code block sizes supported by todays wireless communication standards, together with the requirement for a throughput in the order of Gbps, necessitates sophisticated and highly parallel channel decoder architectures ...
S. Weithoffer, N. Wehn
doaj   +1 more source

Turbo code

open access: yesScholarpedia, 2010
Turbo codes are error-correcting codes with performance close to the Shannon theoretical limit [SHA]. These codes have been invented at ENST Bretagne (now TELECOM Bretagne), France, in the beginning of the 90's [BER]. The encoder is formed by the parallel concatenation of two convolutional codes separated by an interleaver or permuter.
Kerouedan, Sylvie, Berrou, Claude
openaire   +2 more sources

Shaping EXIT Functions of Turbo Codes [PDF]

open access: yes, 2008
This paper investigates the shaping of the extrinsic information transfer (EXIT) functions of parallel turbo codes, when the turbo code is used as an outer code in a serially concatenated scheme.
Grant, Alex   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy