D. Chase · 1984
It is well-known, that by choosing the data rate below the channel capacity, error-free communications is possible. Furthermore, existing practical error-correction coding techniques can be used to meet reliability constraints. However, a basic design problem for reliable digital communications is the selection of the code rate. The popular rate-1/2 code is a good choice for AWGN channels, but is a poor choice for channels where a large fraction of the transmitted bits are destroyed by interference. Designing a system for the worst-case scenario may require extremely low rate codes to bring the data rate below channel capacity (ref. 1). Code combining is an adaptive technique, which matches the code rate to the prevailing channel conditions.
Cited by 4
LC Villar dos Santos, van Jtj Jos Eijndhoven, Jag Jochen Jess · 1996
This work addresses a resourceconstrained optimization problem which arises in the context of the high-level synthesis of an ASIC or in the code generation for an ASIP. For a given behavioral description containing conditional constructs, scheduling and code motion are combined and encoded in the form of a unified optimization problem. As taking code motion into account may lead to a larger search space, a code-motion pruning technique has been developed. Optimal solutions are kept in the search space and a local-search method is used to seek for potential solutions. We show that our technique can cope with issues like speculative execution and code duplication. Moreover, it can be extended to tackle constraints imposed by the advance choice of a controller, such as pipelined-control delay and limited branch capabilities. For all cases tested so far, our experimental results have reached the best published results. Keywords--- high-level synthesis, code generation, scheduling, code mo...
Cited by 8
Villar dos Santos, LC, Eijndhoven, JTJ Jos van, Jess, JAG Jochen · TU/e Research Portal (Eindhoven University of Technology) · 1996
Cited by 0
Byung K. Yi · 1999
A novel satellite direct audio broadcasting (DAB) system based on code combining, packet combining (CCPC), and iterative decoding-so called the turbo coding principle, is presented. This new scheme provides not only the unprecedented coding gain from the turbo code and its iterative decoding, but also the gains induced by the code combining and the packet combining. We demonstrate the performance improvements, in terms of the bit error rate (BER) and word error rate (WER) for an AWGN channel and a Rayleigh fading channel with perfect channel state information (CSI) through simulations.
Cited by 4
Jan Svoboda · 2014
Staticka analýza a manualni revize kodu jsou dvě metody pro zajistěni jeho kvality. Obě metody mohou detekovat urcite druhy chyb a maji svoje silne a slabe stranky. Tato prace zkouma možne cesty pro kombinaci těchto dvou metod. Na zakladě výsledků state-of-the-art a state-of-the-practice výzkumů navrhuje jejich kombinaci v podobě několika funkci integrujicich Klocwork (nastroj pro statickou analýzu) a Crucible(nastroj pro manualni revize kodu). Tata prace dale navrhuje metodu pro evaluaci navržených funkci. Na zakladě výsledků evaluace jsou navržene funkce pozměněny tak, aby lepe vyhovovaly potřebam uživatelů. Na zavěr je zminěno několik napadů pro budouci praci a vylepseni.
Cited by 0
Bjorn De Sutter, Bruno De Bus, Koen De Bosschere et al. · 2001
Computers are increasingly being incorporated in devices with a limited amount of available memory. As a result research is increasingly focusing on the automated reduction of program size. Existing literature focuses on either data or code compaction or on highly language dependent techniques. This paper shows how combined code and data compaction can be achieved using a link-time code compaction system that reasons about the use of both code and data addresses. The analyses proposed rely only on fundamental properties of linked code and are therefore generally applicable. The combined code and data compaction is implemented in SQUEEZE, a link-time program compaction system, and evaluated on SPEC2000, MediaBench and C++ programs, resulting in total binary program size reductions of 23.6%-46.6%. This compaction involves no speed trade-off, as the compacted programs are on average about 8% faster.
Cited by 16
P.A. Putro, P.A. Putro · Proceedings of the Institute for System Programming of RAS · 2018
When developing programs in high-level languages, developers have to make assumptions about the correctness of the compiler. However, this may be unacceptable for critical systems. As long as there are no full-fledged formally verified compilers, the author proposes to solve this problem by proving the correctness of the generated machine code by deductive verification. To achieve this goal, it is required to combine the pre- and postcondition specifications with the machine code behavior model. The paper presents an approach how to combine them for the case of C functions without loops. The essence of the approach is to build models, both machine code and its specifications in a single logical language, and use target processor ABI to bind machine registers with the parameters of the high-level function. For the successful implementation of this approach, you have to take a number of measures to ensure the compatibility of the high-level specification model with the machine code behavior model. Such measures include the use of a register type in the high-level specifications and the translation of the pre- and postconditions into the abstract predicates. Also in the paper the choice of logical language for building models is made and justified, the most suitable tools for implementing the approach of merging specifications are selected and the evaluation of the system of deductive verification of machine code built on the basis of the proposed approach is made using test examples obtained by compiling C programs without loops.
Cited by 2Open access
Luyao Ma, Lijun Zhang · 2021
Both polar code and Low-Density Parity-Check (LDPC) code have been adopted in 3GPP eMBB scenario. Some scholars have proposed a serial concatenation structure combining these two codes. However, the inner code needs to add redundant bits to protect the redundant bits of the outer code in the serial concatenation. In this paper, we propose a parallel concatenation code combining polar code and LDPC code on the AWGN channel, which does not distinguish the inner code from the outer code. In the proposed concatenated structure, the BP algorithm is used to decode polar code, and the output soft information of BP decoder is logarithmically processed before LDPC decoding. According to the simulation results, compared with the serial concatenated code with the same code rate and code length, the parallel concatenated code has better BER(Bit-Error-Rate) performance.
Cited by 6
Plasmeijer, M.J., Smetsers, S., Weelden, A. van · Radboud Repository (Radboud University) · 2008
Contains fulltext : 290062.pdf (Publisher’s version ) (Open Access)
Cited by 0Open access
Tiffany Timbers, Trevor Campbell, Melissa Lee et al. · Data Science · 2024
Cited by 0Open access
Jacquemet, Guillaume, Elnaz Fazeli, Laine, Romain F. et al. · Zenodo (CERN European Organization for Nuclear Research) · 2020
Archived sourced code for the paper "Automated cell tracking using StarDist and TrackMate" Contains the #ZeroCostDL4Mic StarDist 2D notebook, a Fiji script to enable automated TrackMate analysis and an R script to automatically compile the data.
Cited by 0Open access
Samir Kallel, David Haccoun · 1987
In this paper we consider sequential decoding with ARQ and code combining under the time-out condition. That is whenever the decoding time of a given packet exceeds some predetermined duration, decoding is stopped and retransmission of the packet is requested. However the unsuccessfull packets are not discarded, but are combined with their retransmitted copies. We show that the use of code combining allows sequential decoding to operate efficiently even when the coding rate R exceeds the computational cut-off rate R <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">como</inf> . Furthermore, an analysis of the Ideal-Selective-Repeat ARQ scheme shows that the use of code combining yields a significant throughput even at very high channel error rates, thus making it a very robust hybrid FEC/ARQ system.
Cited by 12
Giovanni E. Corazza, Claudio Palestini, Raffaella Pedone et al. · 2014
Global Navigation Satellite System (GNSS) is an exciting technology with the potential to have an ever increasing role in modern, mobile societies. The advent of Galileo, the European satellite navigation project, will allow a deeper impact in the quality of services supplied to the users, and consequently, into diffusion and development of mass market receivers. Obviously, in order to respond to mobility demands, an important aim will be to guarantee continuous outdoor and indoor location availability. The main challenging problem for indoor location is to find a solution between low signal to noise ratios characteristic of indoor scenario, and low complexity of user terminals. In a noise limited situation like this, to ensure a good synchronization, it is necessary to integrate over a longer period, with inevitable increase of complexity. The analysis done in this paper is based on acquisition of Galileo pilot signal in L1 band, L1-C signal, that is a hierarchical code, constituted by a repetition of a 4092 chips primary code, modulated by a long duration secondary code of 25 chips. The resulting code has a total length of 102300 chips [1]. In this way, it is possible to achieve synchronization in two phases: the first step foresees the acquisition of the primary code synchronism, while the synchronization with the overlaying secondary code is pursued in the second phase with a limited uncertainty equal to only 25 acquisition hypothesis. Generally, the integration over a word of 4092 chips is not enough to cope with the harsh indoor scenario when performing the primary code synchronization. A classic approach to overcome this problem consists in trying to detect not a single primary code sequence, but a larger number of sequences, up to the entire 102300 chips concatenated code word. This approach has the great disadvantage to
Cited by 0
Brigitte Fröhlich, Peter Gorm Larsen · Lecture notes in computer science · 1996
Cited by 16Open access
Michael Homer, James Noble · 2014
Jigsaw puzzle programming environments manipulate programs primarily by drag-and-drop. Generally these environments are based on their own special-purpose languages, meaning students must move on to another language as their programs grow. Tiled Grace is a tile-based editor for Grace, an educational programming language with a conventional textual syntax. Using Tiled Grace, programmers can move seamlessly between visualising their programs as tiles or source code, editing their programs via tiles or text, and continue on to traditional textual environments, all within the same programming language. We conducted a user experiment with Tiled Grace, and present the results of that experiment showing that users find dual views helpful.
Cited by 47
Sherlock A. Licorish, Markus Wagner · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2022
Software developers are increasingly dependent on question and answer portals and blogs for coding solutions. While such interfaces provide useful information, there are concerns that code hosted here is often incorrect, insecure or incomplete. Previous work indeed detected a range of faults in code provided on Stack Overflow through the use of static analysis. Static analysis may go a far way towards quickly establishing the health of software code available online. In addition, mechanisms that enable rapid automated program improvement may then enhance such code. Accordingly, we present this proof of concept. We use the PMD static analysis tool to detect performance faults for a sample of Stack Overflow Java code snippets, before performing mutations on these snippets using GIN. We then re-analyse the performance faults in these snippets after the GIN mutations. GIN's RandomSampler was used to perform 17,986 unique line and statement patches on 3,034 snippets where PMD violations were removed from 770 patched versions. Our outcomes indicate that static analysis techniques may be combined with automated program improvement methods to enhance publicly available code with very little resource requirements. We discuss our planned research agenda in this regard.
Cited by 6
PALESTINI, CLAUDIO, PEDONE, RAFFAELLA, VILLANTI, MARCO et al. · Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) · 2006
Cited by 0
Bjorn De, Sutterbruno De, Bus Koen · 2008
Cited by 0
Robert H. Deng · Electronics Letters · 1991
A hybrid automatic-repeat-request scheme using trelliscoded modulation and code combining is described. Analytical results show that the proposed scheme offers an improved throughput efficiency and is more adaptive to channel noise conditions than the existing schemes.
Cited by 14Open access
Breslau, A., Winkel, M., Arnold, L. et al. · JuSER (Forschungszentrum Jülich) · 2012
Cited by 0