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.
We consider the problem of reducing delays in block transmissions of packets over multicast erasure channels in heterogeneous networks using relay stations. The macro base station performs random linear network coding over a block of packets which are relayed to the relay station which broadcasts the packets to the users. We propose a fluid approximation to our problem, and obtain the optimal solution...
Despite vertical stacking, the lateral scaling of 3D NAND Flash is critically important because otherwise >16 stacking layers are needed to be cost competitive to 20nm 2D NAND. In this work, we propose a 3D vertical gate (VG) NAND using a self-aligned independently controlled double gate (IDG) string select transistor (SSL) decoding method. The IDG SSL provides excellent program inhibit and read...
The memory architecture of 3D vertical gate (3DVG) NAND Flash using plural island-gate SSL decoding method is discussed in detail. In order to provide a good array efficiency, 3DVG shares the wordlines (WL) in vertical direction, and BL's in lateral direction. In order to correctly decode the array, every channel BL has its own island-gate SSL device for the control. Meanwhile, many channel BL's are...
Based on the idea of plurality voting, we develop a low-complexity symbol-reliability based message-passing decoding algorithm for nonbinary low-density parity-check (LDPC) codes over finite fields. A key feature of the algorithm is that the message passed in the Tanner graph is the field element with the highest reliability. This leads to a very simple check node update. The algorithm requires only...
In this paper, we first propose a general framework for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on a two-dimensional (2-D) maximum distance separable (MDS) code. Two classes of QC-LDPC codes are defined, whose parity-check matrices are transposes of each other. We then use a 2-D generalized Reed-Solomon (GRS) code to give a concrete construction. The decoding parity-check...
Summary form only given: In all existing codec designs for asymmetric Slepian-Wolf coding (SWC), it is assumed that the source sequence is i.i.d and equiprobable. When it comes to more complex source statistics, the encoder should firstly remove the redundancy within the source. However, this increases the complexity of the encoder. In this paper, we propose an asymmetric SWC scheme which explores...
As an effective technology for copyright protection, digital watermarking has been applied in videos. Temporal synchronization is an important aspect for video watermarking. If synchronization is lost, the detector may fail in extracting the correct watermark. This paper proposes a temporal synchronous compressed MPEG-4 video watermarking scheme. This scheme utilizes DCT direct current coefficients...
A novel cooperative diversity scheme based on distributed space-time block code and multi-carrier code division multiple access (DSTBC-MC-CDMA) is proposed which works well in multiple single-antenna users in frequency selective fading channels. And an analytical model to describe the symbol decoding error between interusers is established, based on which a theoretical bit error rate (BER) performance...
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.