scispace - formally typeset
Search or ask a question
Topic

Encoding (memory)

About: Encoding (memory) is a research topic. Over the lifetime, 7547 publications have been published within this topic receiving 120214 citations. The topic is also known as: memory encoding & encoding of memories.


Papers
More filters
Patent
17 May 2010
TL;DR: In this article, multiple logical pages are jointly encoded into a single code word and are stored in the same physical page of a solid state non-volatile memory (NVM) device having multi-level memory cells.
Abstract: Multiple logical pages are jointly encoded into a single code word and are stored in the same physical page of a solid state non-volatile memory (NVM) device having multi-level memory cells. A first logical page of the multiple logical pages is stored in the memory device as first bits of the multi-level memory cells while a second logical page of the multiple logical pages is temporarily cached. After the first logical page is stored as the first bits of the memory cell, the second logical page is stored as second bits of the memory cells.

26 citations

Proceedings ArticleDOI
01 Sep 2015
TL;DR: A model for more effectively predicting the behavior of the encoder in each encoding pass is presented, which minimizes this problem and delivers more stable reconstructed quality for parallel video transcoding frameworks.
Abstract: Low latency video transcoding is an important feature in video sharing platforms. Typically this is achieved by splitting a clip into short segments, followed by parallel encoding of the segments. However, this introduces quality artifacts due to transients in encoder rate control. We present a model for more effectively predicting the behavior of the encoder in each encoding pass, which minimizes this problem. We learn the model using measurements from more than 500 video clips, hence ensuring reliable estimation. Finally, we show that the proposed multipass strategy delivers more stable reconstructed quality for parallel video transcoding frameworks.

26 citations

01 Jan 2003
TL;DR: This paper deals with fast and efficient algorithms to generate and process octrees - even on-the-fly - from surface-oriented models for applications in civil engineering, and obtains a reliable volume-oriented attributed model that can serve for numerical simulations as well as to determine relations between parts of the model to ensure global consistency.
Abstract: Dealing with surface-oriented models - e.g. B-Rep models - is very popular and appropriate for many applications. They can be read by most CAD programs and they provide all freedom of modelling. Concerning a lot of other tasks - consistency checks, collision detection, structural analysis, flow simulation, e.g. - these models become difficult to handle, and a volume-oriented model has to be derived from the existing surface-oriented one. Hierarchical volume-oriented models, represented by octrees for example, provide an easy access to solve the latter tasks with respect to their spatial decomposition of the underlying geometry. This paper deals with fast and efficient algorithms to generate and process octrees - even on-the-fly - from surface-oriented models for applications in civil engineering. Encoding these octrees as binary streams makes them suitable to get multiplexed with other octree-coded objects or for the usage in pipe-like constructs. Conventional algorithms for octree generation or processing don't exploit the full potential of these structures. In spite of the principal advantages of octrees concerning complexity, objects of a higher resolution typically still entail too high run-time and memory requirements. Usually, an expensive floating-point-based decision whether or not to refine the structure has to be taken in each voxel (cell) successively. In our approach, instead, the refinement decision is done by a simple parameter comparison of plane equations, avoiding all these costs. By treating each face of the surface-oriented model as a plane that divides the whole space into two half spaces - inside and outside -, the volume-oriented model can be built from intersecting all inside-attributed half spaces. The steps for generating an octree presentation for each corresponding plane, intersecting these octrees, and encoding the result as a binary stream can be done at once - thus, the octree generation is free of any redundant calculations, and the overall memory requirements are reduced to a minimum due to the usage of stacks. The highest gain can be achieved in run-time, e.g. an octree generation for an average geometry with more than 1.5 billion voxels can be done in best time on a standard PC. Several of these binary streams can be multiplexed to perform further Boolean or more sophisticated operations (e.g. collision detection), while one always has the choice to perform this operations on-the-fly or to perform consecutive operations - like with Unix pipes - on binary streams written to the hard disk. One target application of this method deals with consistency checks for CAD models in the scope of simplifying and unifying planning processes in civil engineering. Before a connection model for structural analysis is created out of an (Eurostep) IFC model, any modelling errors (geometric inconsistencies) - wrong intersections or gaps between parts of the model - can be detected fast and easily. Hence, this proceeding enables us to obtain a reliable volume-oriented attributed model that can serve for numerical simulations as well as to determine relations between parts of the model to ensure global consistency, which brings us one step closer to the long-term objective of completely embedded simulation processes.

26 citations

Patent
31 Oct 2002
TL;DR: In this article, the authors proposed an encoding sequence controller that determines the upper limit of the code amount of the input image data currently being encoded, and monitors whether this upper limit is exceeded.
Abstract: This invention does not unconditionally fix the upper limit of encoding but adjusts it in accordance with the size of an input image, thereby effectively utilizing a memory and maintaining high image quality regardless of an image size. In this invention, input image data is compression-encoded by an encoder 102 and stored in first and second memories 104 and 106. An image size detector 111 detects the size of the input image data. An encoding sequence controller 108 determines the upper limit of the code amount of the input image data currently being encoded, and monitors whether this upper limit is exceeded. Upon determining that the upper limit is exceeded, the encoding sequence controller 108 sets encoding parameters of the encoder 102 to set a higher compression ratio, and continues the encoding. Encoded data before this determination is decoded and re-encoded by a re-encoder 109 so as to have a compression ratio higher than before.

26 citations

Patent
22 Apr 2003
TL;DR: In this paper, a picture element memory receives and stores picture elements within a predetermined range, and a mode determinator selects an encoding mode based upon a reference picture element, and then predicts the value of the encoded picture element and determines whether the prediction is correct.
Abstract: Encoding efficiency is enhanced by actively combining a plurality of encoding methods. A picture element memory receives and stores picture elements within a predetermined range. A mode determinator selects an encoding mode based upon a reference picture element. A first encoding section and a second encoding section predicts the value of the encoded picture element, determines whether the prediction is correct, and then encodes the value of the encoding picture element based on the determination result and outputs a codeword for the encoding picture element. An encoding controller selectively operates the first encoding section and the second encoding section based upon one of the specific encoding modes and the other encoding mode other than the specific encoding mode selected by the mode determinator.

26 citations


Network Information
Related Topics (5)
Artificial neural network
207K papers, 4.5M citations
83% related
Deep learning
79.8K papers, 2.1M citations
83% related
Feature extraction
111.8K papers, 2.1M citations
82% related
Convolutional neural network
74.7K papers, 2M citations
81% related
Cluster analysis
146.5K papers, 2.9M citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20231,083
20222,253
2021450
2020378
2019358
2018363