The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper identifies a small, essential set of static software code metrics linked to the software product quality characteristics of reliability and maintainability and to the most commonly identified sources of technical debt. A plug-in is created for the Understand code visualization and static analysis tool that calculates and aggregates the metrics. The plug-in produces a high-level interactive...
Polar codes are a new candidates channel coding techniques for the 5th generation of wireless communication. It is due to their explicit construction with very low encoding and decoding complexity and also they are the first ever provably capacity achieving codes of symmetric binary discrete memoryless (SB-DMS) channel. The capacity-achieving performance of such codes is based on a new concept called...
We present two geometric routing algorithms that reliably deliver messages to all devices in a geocast region. One algorithm is based on flooding, the other on concurrent geometric routing. They are the fist known stateless geocasting algorithms. We formally prove the algorithms correct, evaluate their performance through abstract and concrete simulation and estimate their message complexity.
In this paper a log-MAP turbo decoding algorithm which incorporates reliability threshold based trellis branch elimination together with mean based early iteration termination has been proposed. The proposed algorithm reduces computational complexity by eliminating branches in trellis. Since the minimum Log Likelihood Ratio (LLR) obtained for each iteration varies with channel conditions, an early...
This paper proposes a modified bit flipping algorithm and its weighted variants based on reliability derived from intrinsic information. Compared to other existing algorithms where extrinsic information based reliability was used in the flipping function, here intrinsic information based reliability is also equally considered. This algorithm only uses additions and subtractions to modify reliability...
Low Power Wide Area (LPWA) networks present a new communication paradigm in wireless sensor networks. Their ability to convey information over larger geographical areas, while still enabling low-power consumption and longer lifetime, gives them a special place in realization of Internet of Things (IoT) systems and applications. Compared to traditional cellular networks and other short range technologies...
Fault Tree Analysis (FTA) is widely applied to evaluating failure probability related to complex engineering system. A large number of minimal cut sets (MCSs) may be involved in FTA when dealing with complex system, and searching for these MCSs may be time-consuming. Modules of fault trees have been employed to reduce the computational burden relevant to basic operations of fault trees. Based on the...
This paper analyzes the performance of multicarrier index modulation (MCIM) with greedy detection (GD) in a dual hop, multiple decode and forward (DF) relay network. We propose a novel partial relay selection (PRS) technique combined with index modulation and its energy detection. For performance analysis, we derive novel closed form solutions for both the average pairwise error probability (PEP)...
Multistage Interconnection Networks (MINs) remain interesting for research and are continuously being improved as they are essential devices for constructing scalable parallel computers or for connecting networks. In this paper a new idea - new architecture - is introduced. The proposed construction uses switch elements connected with redundancy internal paths and fan out at the end of the construction...
Complexity is a term that is currently used not only in research articles but also in the methodologies and standards used to manage information and projects. The complexity can represent the size of a system, process, program or project, the number of functions and the cost of their acquisition, operation and maintenance. Within the context of this work, the complexity is a variable that represents...
The theory of belief functions is an effective tool to deal with the multiple uncertain information. In recent years, many evidence combination rules have been proposed in this framework, such as the conjunctive rule, the cautious rule, the PCR (Proportional Conflict Redistribution) rules and so on. These rules can be adopted for different types of sources. However, most of these rules are not applicable...
Multiple Object Association (MOA) is an essential process in making vehicles smarter. It consists in associating newly detected objects to previously known ones at each instant in a scene. To treat such matter, the paper proceeds by the use of the Belief Theory introduced by Dempster-Shafer. A crucial concern in this application is the data association complexity and its relative computation time...
This paper proposes a modified IMWBF decoding algorithm for low-density parity-check (LDPC) codes. In the proposed modification, the magnitude of the received signal is updated when the number of the unsatisfied parity-check equations participated by this received signal is larger than a predetermined threshold. Through this modification, the outlier, defined as the undesired large-magnitude received...
This paper proposes a context-aware, graph-based approach for identifying anomalous user activities via user profile analysis, which obtains a group of users maximally similar among themselves as well as to the query during test time. The main challenges for the anomaly detection task are: (1) rare occurrences of anomalies making it difficult for exhaustive identification with reasonable false-alarm...
Channel Coding for the 5G wireless networks is facing novel challenges to endorse innumerable emerging use cases and applications with miscellaneous performance aspects. With respect to existing state of art codes; 5G channel Codes have diverse requirements of code lengths and rates, as well as throughput, latency and decoding complexity. Therefore, Turbo codes and LDPC codes that played key enablers...
The problem of search for delay of broadband signals on the basis of code sequences is considered. The problem arises when using long code sequences in conditions of limited signal observation time and high requirements to reliability and synchronization accuracy. In these conditions use of various non-optimal methods and search algorithms, in particular, sequential-parallel search, consecutive algorithms...
Non-orthogonal multiple access (NOMA) is a promising technology for handling massive connectivity in future 5G wireless networks. Even though the spectral efficiency can be promoted, the transmission reliability is sometimes poor, due to the introduced multiple access interference (MAI), and the computational complexity for multiuser detection is usually high in NOMA. To solve this problem, we investigate...
A novel scheme is presented for encoding and decoding of Reed-Solomon codes of prime lengths. Encoding is performed on a collection of codewords which are mapped through Galois Fourier transform into a codeword in a low-density parity-check code with a binary parity-check matrix for transmission. Using this matrix, a binary iterative soft-decision decoding algorithm is applied to jointly decode a...
This paper proposes a two-stage decoding algorithm (called BP-LED) for short nonbinary low-density parity-check (LDPC) codes. It consists of the classical belief propagation (BP) decoder and a list erasure decoder (LED). Simulation results show that, for the (16, 8) LDPC code over GF(256) in the CCSDS standard, our proposed BP-LED algorithm can achieve a coding gain of 0.6 dB with respect to the FFT-QSPA...
This paper defines and studies the problem of universal clustering using responses of crowd workers, without knowledge of worker reliability or task difficulty. We model stochastic worker response distributions by incorporating traits of memory for similar objects and traits of distance among differing objects. We are particularly interested in two limiting worker types — temporary and long-term workers,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.