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.
Today's Internet usage evolves rapidly from host-to-host communication to content dissemination. Content-Centric Networking (CCN) is proposed to embrace this trend by providing in-network caching capability via built-in Content Store (CS). However, to satisfy per-packet queries in high-speed networks, CS suffers a noticeable performance penalty and probably becomes the bottleneck of the entire packet...
The design of a Ku-band reconfigurable reflectarray element is presented in this paper. The element structure of a microstrip patch loaded with two asymmetric slots are employed, on which two MEMS switches are integrated to achieve a 2-bit phase reconfigurability. Simulation results show that four well-distributed phase states can be electronically controlled, and the maximum element amplitude loss...
According to the fact that the random construction method of LDPC(Low Density Parity Check) codes are lack of structure and are difficult to be implemented in hardware, two construction methods of QC-LDPC(Quasi-Cyclic LDPC) codes-sequential and random search method based on distance graph are proposed. The two algorithms can produce flexible QC-LDPC codes by setting the parameters such as code length,...
In this paper, we propose an improved sphere decoder (SD) and fixed-complexity sphere decoder (FSD) for multiple-input multiple-output (MIMO) wireless systems in detail. Furthermore, we analyze the performance and complexity of SD, FSD and other popular algorithms (such as Zero Forcing (ZF), Minimum Mean-Square Error (MMSE), Ordered Successive Interference Cancellation based on ZF criterion (ZF- OSIC)...
Requirements discovery is important in the context of system-of-systems because the requirements are not clear at the outset of the project and the future system may bring innovation to users through integration and orchestration. Modelling the existing systems in order to understand the current work practice of domain users is the first step towards requirements elicitation. Use case diagrams can...
This article has researched encoding and decoding algorithms of Turbo Product Codes focusing on analysis of Chase-Pyndiah algorithm-based soft in/soft out (SISO) iterative decoding algorithm. The algorithm simulation done under matlab7.0 environment shows that, on an AWGN channel using BPSK modulation, Turbo Product Codes do a similar decoding performance as Turbo codes with a simpler decoding method...
The challenge for wireless sensor networks (WSNs) is to minimize the energy consumption while maintaining user constraints. In this paper, turbo-like (TL) codes with two simplified serial message passing algorithms are proposed for star-WSN. The two algorithms are implemented based on variable node updating. One is the modified sum-product algorithm (MSPA) and the other is the simplified feedback...
In this paper, we investigate soft interference cancellation algorithms for vertical Bell Laboratories layered space- time (V-BLAST) systems. By using Gaussian-forcing technique and fast matrix computation, we first derive a simplified version of the conventional generalized probabilistic data association (GPDA) algorithm, called the fast soft interference cancellation (FSIC) algorithm, whose complexity...
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.