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.
With the technology scaling of solid state drives (SSDs), data reliability has to be ensured by advanced Low-Density Parity-Check (LDPC) codes. As LDPC reads often take high latency, read performance involved in traditional garbage collection, called external GC, is largely decreased, which affects system performance. GC can choose not to correct data with LD-PC codes but just copy valid pages into...
NAND flash memory has decreasing storage reliability, as the density or program/erase (P/E) cycle increases. To ensure data integrity, error correction codes (ECCs) are widely employed and typically stored in the out-of-band area (OOB) of flash pages. However, the worst-case oriented ECC is largely under-utilized in the early stage (small P/E cycles), and the required ECC redundancy may be too large...
Continuous technology scaling makes NAND flash cells much denser. As a result, NAND flash is becoming more prone to various interference errors. Due to the hardware circuit design mechanisms of NAND flash, retention errors have been recognized as the most dominant errors, which affect the data reliability and flash lifetime. Furthermore, after experiencing a large number of programm/erase (P/E) cycles,...
The degree distribution of Fountain Codes has a very important influence on Fountain Codes decoding process. So optimizing the Fountain Codes degree distribution is very significant. In this paper, we present a new way to design the degree distribution with the idea of combining several different degree distributions and integrating them to one degree distribution, namely combined degree distribution...
In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is presented. In this modified algorithm, the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the assistance of the check-node computation outputs of the Normalized Min-Sum algorithm. As a result, the offset factor in our modified algorithm can be calculated adaptively...
Based on time-domain modified Berlekamp-Massey (BM) algorithm, a Reed-Solomon (RS (204,188)) decoder under the DVB-C standard is designed optimally. New pipeline architecture is adopted in this decoder. In addition, finite-field constant multipliers and specially the time-division-multiplex structure used for key equation solution are proposed, which reduce the bulk of circuit and simplify the complexity...
This paper introduces the broadband wireless access technology which is applied in WMAN. And the design of Reed-Solomon (RS (255, 239)) in IEEE802.16a/d FEC based on time-domain Berlekamp-Massey (BM) algorithm is implemented. In this decoder pipeline architecture is adopted. Furthermore, finite-field constant multipliers and specially the time-division- multiplex structure used for key equation solution...
In this paper, we propose a novel scheme using computing complexity layered scalable video coding (CCLSVC) to optimize the user experience of broadcasting video in the computing capability limited handheld terminals. To address the heterogeneity of computing capability among different handheld devices, we employ hierarchal B reference structure of SVC to divide the frames into multiple computing 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.