scispace - formally typeset
Search or ask a question

Showing papers on "Encoding (memory) published in 1984"


Journal ArticleDOI
TL;DR: Evidence shows that frequency information is stored for a wide variety of naturally occurring events, and laboratory research shows that usually powerful task variables and subject variables do not influence the encoding process.
Abstract: One view of memory supposes that several fundamental aspects of experience are stored in memory by an implicit or automatic encoding process. In this article we review the evidence that suggests that information about frequency of occur- rence is encoded in such a manner. This evidence shows that frequency information is stored for a wide variety of naturally occurring events. Laboratory research shows that usually powerful task variables (for example, instructions, practice) and subject vari- ables (for example, age, ability) do not influence the encoding process. Evidence is also reviewed that either directly or indirectly implicates the use of frequency information across issues in psychology ranging from the acquisition and representation of knowledge domains to decision making to sex role development.

743 citations


Journal ArticleDOI
TL;DR: Tulving as discussed by the authors argues for the distinction between episodic and semantic memory as functionally separate albeit closely interacting systems and discusses empirical and theoretical reasons for a tentative acceptance of the functional distinction between the two systems and its possible extensions.
Abstract: Elements of episodic memory (Tulving 1983b) consists of three parts. Part I argues for the distinction between episodic and semantic memory as functionally separate albeit closely interacting systems. It begins with a review of the 1972 essay on the topic (Tulving 1972) and its shortcomings, presents a somewhat more complete characterization of the two forms of memory than the one that was possible in 1972, and proceeds to discuss empirical and theoretical reasons for a tentative acceptance of the functional distinction between the two systems and its possible extensions. Part II describes a framework for the study of episodic memory, dubbed General Abstract Processing System (GAPS). The basic unit in such study is an act of remembering. It begins with the witnessing of an event and ends with recollective experience of the event, with related memory performance, or both. The framework specifies a number of components (elements) of the act of remembering and their interrelations, classified under two broad categories of encoding and retrieval. Part III discusses experimental research under the label of “synergistic ecphory.” Ecphory is one of the central elements of retrieval; “synergistic” refers to the joint influence that the stored episodic information and the cognitively present retrieval information exert on the construction of the product of ecphory, the so-called ecphoric information. The concept of encoding specificity and the phenomenon of recognition failure of recallable words figure prominently in Part III. The final chapter of the book describes a model, named the synergistic ecphory model of retrieval, that relates qualitative characteristics of recollective experience and quantitative measures of memory performance in recall and recognition to the conjunction of episodic-memory traces and semantic-memory retrieval cues.

708 citations


Journal ArticleDOI
TL;DR: In this article, the importance of both relational and individual information for precise recall was discussed. But, they did not establish a consistent function relating memory and category size, and the results of their experiments showed that small categories are better recalled following relational processing, and large categories are; better recalling following individual item processing.
Abstract: Memory for events varies as a function of the number of events in a given class, but previous research from organization theory did not succeed in establishing a consistent function relating memory and category size. We suggest that prior research can be systematized within a framework of relational and individual item processing. Relational processing refers to the encoding of similarities among events, and individual item, processing refers to encoding of distinctive information for each event. Assuming the importance of both types of information for precise recall and that the type of information encoded will depend on category size and the subject's attention to relational or distinctive features, predictions are derived concerning the interaction of orienting activity and category size. The predicted interaction was obtained in two experiments that demonstrated that small categories are better recalled following relational processing, and large categories are; better recalled following individual item processing. Additional dependent measures (clustering, category recall, items per category recall, and cued recall) provided highly consistent converging evidence for the proposed theoretical analysis. The general conclusion is that theories of memory must explain the paradoxical fact of the simultaneous importance of both similarity and difference.

160 citations


Journal ArticleDOI
TL;DR: The match between trait encoding and recognition in yielding high memory performance suggests strongly that trait judgments foster holistic processing of faces and that the recognition of faces also is holistic, involving topographical information with between-feature processing.
Abstract: The reliable finding that trait judgments of faces yield better recognition memory than do feature judgments of faces is conceptualized as an encoding-specificity effect. Specifically, both trait-judgment encodings of faces and face-recognition tests are argued to be holistic, involving topographical information with between-feature processing. Consistent with the concept that encoding and retrieval operations interact to produce retrieval success, it was expected that a memory-for-face test using the Identi-kit (which requires reconstructions of the face at a feature level of analysis) would show trait-encoding tasks to be inferior to feature-encoding tasks. Eighty subjects were assigned randomly to judge a face on 10 trait dimensions (e.g., honesty-dishonesty) or on 10 feature dimensions (e.g., narrow nose-wide nose) and subsequently attempted to recognize the target among five distractors or to reconstruct the face from an Identi-kit. The significant interaction between encoding and retrieval operations indicated that the face was best identified under trait-encoding conditions but best reconstructed under feature-encoding conditions. The match between trait encoding and recognition in yielding high memory performance suggests strongly that trait judgments foster holistic processing of faces (i.e., interfeature topographical information is p-art of the context) and that the recognition of faces also is holistic. Finally, the utility of the feature- vs. holistic-processing distinction is questioned, and an alternative is proposed.

125 citations


Patent
17 Oct 1984
TL;DR: In this article, a hybrid vocoder is proposed to maximize the quality of transmitted voice signals while yet permitting implementation within constrained digitial memory capacity and/or constrained transmission channel bandwidth, where the subband channels of a subband coder/decoder utilize different encoding/decoding algorithms so as to maximize overall signal transmission quality using a digital signal processor having limited digital memory capability.
Abstract: The subband channels of a subband coder/decoder utilize different encoding/decoding algorithms so as to maximize overall signal transmission quality using a digital signal processor having limited digital memory capability. In the exemplary embodiment, a digitized 180-2900 Hz voice band signal is divided into four octave-spaced subbands. The highest frequency subband (1450-2900 Hz) is encoded/decoded using a block companded pulse code modulation (BCPCM) algorithm while each of the lower frequency subbands is encoded/decoded using an adaptive pulse code modulation (APCM) or an adaptive differential pulse code modulation (ADPCM) algorithm. The resulting "hybrid" vocoder tends to maximize the quality of transmitted voice signals while yet permitting implementation within constrained digitial memory capacity and/or constrained transmission channel bandwidth.

73 citations


Journal ArticleDOI
TL;DR: This article examined the relationship between response accuracy and response latency as measures of memory, and questions are raised concerning the value of the unidimensionality assumption often invoked in theories of memory.

57 citations


Patent
18 Apr 1984
TL;DR: In this article, a data receiving apparatus constituted in such a manner that the received data is converted into a binary code and this binary code data is encoded and this encoded data is stored in a memory, whereby a large quantity of data can be stored in memory of a small capacity.
Abstract: The present invention provides a data receiving apparatus constituted in such a manner that the received data is converted into a binary code and this binary code data is encoded and this encoded data is stored in a memory, whereby a large quantity of data can be stored in a memory of a small capacity After subsequently decoding the received encoded data, this decoded data is further encoded by another encoding means and this encoded data is stored in the memory, thereby providing an efficient and economical data receiving apparatus which can smoothly perform the data processing even in the case where the transmission speed of the data and the recording speed of the recording apparatus remarkably differ

52 citations


Journal ArticleDOI
TL;DR: It is shown that asymptotically, as resolution is increased with respect to image detail, a multicolor image can be represented with less than 5 bits per intersected pixel, compared to the 2–3 bits required by chain encoding schemes.
Abstract: Linear representations of quad-trees and other pixel trees are studied for efficient encoding of both black-and-white and multicolor images. Based on a random-line model it is shown that asymptotically, as resolution is increased with respect to image detail, a multicolor image can be represented with less than 5 bits per intersected pixel. This can be compared to the 2–3 bits required by chain encoding schemes. It is also shown that binary pixel trees support linear encoding with the same or better efficiency than the traditional quad-tree. It is shown how geometric probability can help in the understanding of the behavior of image encoding schemes.

41 citations


Journal ArticleDOI
TL;DR: This article reported a systematic study of a man (T.E.) with astonishing mnemonic skills, who used the figure alphabet as a mnemonist to recall the number matrices and the effects of imagery and deep structure complexity upon recall.
Abstract: This paper reports a systematic study of a man (T.E.) with astonishing mnemonic skills. After a brief description of his most favoured mnemonic technique, the ‘figure alphabet’, his performance and the mnemonic techniques used on five classical memory tasks are described. These are: one task involving both short- and long-term memory (the Atkinson-Shiffrin ‘keeping track’ task), two tasks involving just long-term memory (recall of number matrices and the effects of imagery and deep structure complexity upon recall), and two tasks involving just short-term memory (short-term retention of individual verbal items and digit span). Whenever possible, T.E.'s performance was compared with that of normal subjects, and also with other mnemonists who have been studied in the past. There was no evidence to suggest that T.E. has any unusual basic memory abilities; rather he employs mnemonic techniques to aid memory, and the evidence suggests that previous mnemonists who have been studied by psychologists have used very similar techniques.

28 citations


Journal ArticleDOI
TL;DR: In this paper, an interaction was found between difficulty of the algebra problem and concurrent memory load, but the point at which interference occurred was at or above span, and it is argued that competition between reasoning and memory occurs only when the memory task entails some form of active processing (such as encoding or rehearsal) that occurs simultaneously with reasoning.
Abstract: Adult participants were required to solve algebraic problems involving identification of unknown operations while they held a concurrent load in short-term memory. The load was varied in relation to participants’ previously measured spans for the same materials. The algebra problems were at two levels of difficulty, Level 2 or Level 3, as defined by Halford and Wilson (1980). An interaction was found between difficulty of the algebra problem and concurrent memory load, but the point at which interference occurred was at or above span. These results support the contentions of Baddeley and Hitch (1974) and refute those of Evans and Brooks (1981). Several findings from the literature on concurrent memory and reasoning tasks are considered, and it is argued that competition between reasoning and memory occurs only when the memory task entails some form of active processing (such as encoding or rehearsal) that occurs simultaneously with reasoning. Simple storage of a concurrent memory load, or rehearsal that can be alternated with reasoning, does not interfere. It is also suggested that future studies of this problem should take care to adjust memory loads in relation to spans and to analyze the basis of the task difficulty manipulation they employ.

22 citations


Patent
Brady G. Williams1
28 Jun 1984
TL;DR: A disk controller system utilizes a single state machine having random access memory which is loaded with program code to translate between computer data and signals obtained by reading from, or developed for writing onto, a magnetic disk in accordance with a selected data encoding technique as mentioned in this paper.
Abstract: A disk controller system utilizes a single state machine having random access memory which is loaded with program code to translate between computer data and signals obtained by reading from, or developed for writing onto, a magnetic disk in accordance with a selected data encoding technique. The encoding techniques that are discussed include FM, MFM, GCR and RLL. Different program code is loaded into the state machine's memory to make the controller operate with each of these techniques.

Proceedings ArticleDOI
Jon M. Slack1
02 Jul 1984
TL;DR: The paper demonstrates how principles of Lexical Functional Grammar can be derived from the properties of the memory mechanisms of distributed memory machines.
Abstract: The paper begins by defining a class of distributed memory machines which have useful properties as retrieval and filtering devices. These memory mechanisms store large numbers of associations on a single composite vector. They provide a natural format for encoding the syntactic and semantic constraints associated with linguistic elements. A computational architecture for parsing natural language is proposed which utilises the retrieval and associative features of these devices. The parsing mechanism is based on the principles of Lexical Functional Grammar and the paper demonstrates how these principles can be derived from the properties of the memory mechanisms.


Patent
22 Feb 1984
TL;DR: In this article, a decoding circuit detects the level of an identification signal and uses it to generate a decoding axis having the same level as the reference level, and the decoding circuit at the receiver is thus able to accurately restore the encoded signal by reinverting the inverted portions about a decoding orientation having a similar level as encoding orientation.
Abstract: A video signal is encoded prior to broadcasting by inverting portions of the signal about an encoding axis at a predetermined reference level. To enable the reference level to be determined accurately after the received signal has been recorded and played back using a VTR having a noise reduction circuit, two identification signals having the same level are included in two consecutive horizontal periods of the signal, respectively. The level of the identification signal in the second horizontal period is unaffected by the noise reduction circuit. A decoding circuit detects the level of that identification signal and uses it to generate a decoding axis having the reference level. The decoding circuit at the receiver is thus able to accurately restore the encoded signal by reinverting the inverted portions about a decoding axis having the same level as the encoding axis.

Patent
Hideo Kuroda1, Naoki Mukawa1, Hiraoka Makoto1, Kiichi Matsuda1, Mitsuo Nishiwaki1, Shuzo Tsugane1 
14 Jun 1984
TL;DR: In this paper, an inter-frame encoding/decoding equipment for television signals consists of interframe encoding equipment encoding a difference between television signals and the output of a frame memory and interframe decoding equipment which receives an encoded signal sent from the inter frame encoding device via a transmission line, which decodes by adding the output output of the frame memory to the encoded signal.
Abstract: An inter-frame encoding/decoding equipment for television signals consists of inter-frame encoding equipment encoding a difference between television signals and the output of a frame memory and inter-frame decoding equipment which receives an encoded signal sent from the inter-frame encoding device via a transmission line, which decodes by adding the output of the frame memory to the encoded signal. The inter-frame encoding equipment is provided with a first operation circuit which operates the remainders obtained by dividing, by a predetermined value, the number of bits of logic "1" in the bit groups into which the output or the input of the frame memory is divided by a predetermined unit. The inter-frame decoding equipment is provided with a second operation circuit which operates the remainders obtained by dividing, by a predetermined value, the number of bits of logic "1" in the bit groups into which the output or the input of the frame memory is divided by a predetermined unit. The inter-frame decoding equipment is further provided with a comparator circuit which compares and checks the values operated by the first and the second operation circuits to detect a transmission error.

Patent
17 Feb 1984
TL;DR: In this paper, the file bit is inserted between the memory and the coder with a control signal, allowing to prevent surely the overflow of the memory at the receiving side and to reduce the transmission time.
Abstract: PURPOSE:To improve the encoding and decoding speed to decrease the transmission time and preventing surely the overflow of a buffer memory at the receiving side, by inserting a suitable file bit so that the encoding speed does not exceed the decoding speed at the transmission side. CONSTITUTION:Document and picture information is read at a reader 11 at the transmission side, the redundancy of the information is eliminated by a coder 12 and coded, and stored once in a buffer memory 13. Further, the coded data demodulated by an MODEM 24 at the receiving side is stored once in a buffer memory 23, and the data decoded by a decoder 22 is applied to a recorder 21. The decoding speed VD of the decoder 22 and a memory size MR of the memory 23 at the receiving side are informed to the transmission side at the protocol procedure. Further, the file bit is inserted between the memory 13 and the coder 12 with a control signal, allowing to prevent surely the overflow of the memory 23 at the receiving side and to reduce the transmission time.


Patent
06 Feb 1984
TL;DR: In this paper, a test bit is added to data from each input terminal through an encoding circuit 1 and a prescribed memory cell is selected by a word line selecting circuit 3 and a data line-selecting circuit 4 to write the data in the selected memory cell.
Abstract: PURPOSE:To correct an error easily when multivalue information is lossed by a soft error by collecting the multivalue information stored in one memory cell as one symbol and using a code adopting the symbol as a unit. CONSTITUTION:A test bit is added to data from each input terminal through an encoding circuit 1 and a prescribed memory cell is selected by a word line selecting circuit 3 and a data line selecting circuit 4 to write the data in the selected memory cell. The data read out from the memory cell are corrected at its error by a decoding circuit 2 and the corrected data are written in the original cell and sent to respective output terminals. At the encoding and decoding time, two bits ai0, ai1 (i=0-4) stored in the same memory cell are collected as one symbol consisting of four elements. If no error is generated in other four memory cells even if a soft error is generated in one memory cell, correction is made possible.

Proceedings ArticleDOI
09 Jul 1984
TL;DR: The NS32032 avoids hogging the bus by increasing the information content of memory transactions, and by keeping key data where it's needed rather than moving it across the bus each time it's used.
Abstract: The key element in the high-performance systems toward which the 32-bit microprocessors are targeted is the memory and its buses. Viewing memory rather than the CPU as the key system element leads to an important rule for CPU designers: don't hog the bus. The NS32032 avoids hogging the bus by increasing the information content of memory transactions, and by keeping key data where it's needed rather than moving it across the bus each time it's used. The information content of transactions is increased through the use of a wide bus and a compact instruction encoding. Key data is kept in registers and in an MMU translation lookaside buffer.

01 Jan 1984
TL;DR: A taxonomy of VLSI layouts are presented for the implementation of maximum likelihood sequence estimators realized by the Viterbi algorithm, a dynamic programming solution to estimating a state sequence that is appropriate for convolutional decoding.
Abstract: A taxonomy of VLSI layouts are presented for the implementation of maximum likelihood sequence estimators realized by the Viterbi algorithm (VA), a dynamic programming solution to estimating a state sequence. These are classified in terms of increasing interprocessor wire area each of which are capable of increased data throughput. Cascade, Linearly and Orthogonally Connected Mesh, Shuffle-Exchange and Cube-Connected Cycle layouts can efficiently embed the VA in silicon. These structures are generalized to accommodate an arbitrary source alphabet size and algorithm memory length. The algorithm-structured layouts by implication are appropriate for convolutional decoding. The area * time and area * time('2) measures of complexity for the VA are presented and interpreted within the context of digital communications. One important result based on hardware considerations suggests that the algorithm memory length should be prime. Viterbi receivers for correlative encoded MSK, using first and second order encoding polynominals, are shown to reside in a generalized class of Cube-Connected Cycle layouts.


Patent
25 Feb 1984
TL;DR: In this paper, a block encoding method is used to encode a block of picture information and then the resolution information is converted before decoding to be used for preservation or information for a reproduced picture.
Abstract: PURPOSE:To improve a processing speed during processing when secret information is written in a memory, by performing encoding compression by a block encoding method and then converting resolution information. CONSTITUTION:Resolution information phi in at least one block of picture information encoded by the block encoding method is sent and processed by a shift reigister 10 having N stages corresponding to the number N of picture elements during the processing when the secret information is written in the memory, obtaining new resolution information phi'. This new resolution information and density representative values a0 and a1 are regarded as information for preservation or information for a reproduced picture. When the processing is carried out during the reproduction of picture information after writing to the memory by mere block encoding, the resolution information is converted before decording.

Patent
15 Jun 1984
TL;DR: In this article, an inter-frame encoding/decoding equipment for television signals consists of interframe encoding equipment encoding a difference between television signals and the output of a frame memory and interframe decoding equipment which receives an encoded signal sent from the inter frame encoding device via a transmission line, which decodes by adding the output output of the frame memory to the encoded signal.
Abstract: An inter-frame encoding/decoding equipment for television signals consists of inter-frame encoding equipment encoding a difference between television signals and the output of a frame memory and inter-frame decoding equipment which receives an encoded signal sent from the inter-frame encoding device via a transmission line, which decodes by adding the output of the frame memory to the encoded signal. The inter-frame encoding equipment is provided with a first operation circuit which operates the remainders obtained by dividing, by a predetermined value, the number of bits of logic "1" in the bit groups into which the output or the input of the frame memory is divided by a predetermined unit. The inter-frame decoding equipment is provided with a second operation circuit which operates the remainders obtaiend by dividing, by a predetermined value, the number of bits of logic "1" in the bit groups into which the output or the input ot the frame memory is divided by a predetermined unit. The inter-frame decoding equipment is further provided with a comparator circuit which compares and checks the values operated by the first and the second operation circuits to detect a transmission error.

Patent
30 May 1984
TL;DR: In this paper, the authors propose to enhance the access efficiency of a memory device and make the data processing speed high, by encoding the access direction for every block to give it to the memory device.
Abstract: PURPOSE:To enhance the access efficiency of a memory device and make the data processing speed high, by encoding the access direction for every block to give it to the memory device and performing the access control in the memory device side. CONSTITUTION:Operation designating information, access direction designating information, and an access block length are inputted from a CPU through terminals D, E, and G, registers 10 and 29, etc. to a memory access/sequence control part 11. The control part 11 inputs an address and an operation designating signal to a memory array address register/decoder part 18 and a memory access timing generating part 19 and supplies control information to a memory array 24. The timing outputted from the timing generating part 19 is sent to a read data control part 27 to control a data register 25 and a gate 26 of a bus, and data read out from the memory 24 is sent from a terminal J to an input/output device or the like through the register 25 and etc. The access direction and etc. are given to the memory device in this manner to make the memory access and the data processing high-speed.

Book ChapterDOI
01 Jan 1984
TL;DR: In this article, a general framework of the processes involved in autobiographical memory in order to explain why some events of the past history of a person can be retrieved particularly well is presented.
Abstract: The former directors of the Laboratory of Experimental Psychology at the University of Leuven were Albert MICHOTTE who died in 1965 and J.R. NUTTIN who retired in 1980. In recent years, the work at the Laboratory has become more and more concerned with basic and applied research on memory. Together with our collaborators we tried to approach memory from various angles. Work has been carried out on artificial intelligence andmemory (DELHAYE, 1982) and R. PEETERS has begun a research project on autobiographical memory which is still a rather neglected field of research in memory. The purpose of this project is to construct a general framework of the processes involved in autobiographical memory in order to explain why some events of the past history of a person can be retrieved particularly well. One fundamental concern of the research program is to relate episodic and semantic memory in encoding and retrieval processes. Also, some work of CRAIK and LOCKHART (1972) has been done mainly in order to disentangle encoding and retrieval effects from memory scores. The same framework has been applied in the area of consumer psychology (D’YDEWALLE, DELHAYE and GOESSENS, 1983). The subjects made decisions about pictures that induced them to process the advertisements structurally, semantically, or in relation to themselves. The extent of the processing elaboration was also manipulated by requiring decisions on one- or two-attribute questions.

Patent
14 Jul 1984
TL;DR: In this paper, the output of an ROM12 wherein restoration unit length is set is stored temporarily in a memory in the beginning of a line, and when previously restored data is stored in the memory 23, a logical adding circuit 22 adds the contents of memory 23 to the pattern 26 logically to restore picture elements.
Abstract: PURPOSE:To increase the operation speed of a device greatly by restoring a picture while regarding plural picture elements as one unit. CONSTITUTION:Run-length data 1 and a B/W signal 3 are stored in a run-length memory 2' and a B/W memory 4. The output of an ROM12 wherein restoration unit length is set is stored temporarily in a memory in the beginning of a line. Then, an operator 16 compares the contents of the memories 2' and 13 with each other; when the contents of the memory 2' are larger than those of the memory 13, the contents of the memory 13 are subtracted from those of the memory 2' and the result is set in the memory 2'. Further, the smaller contents between the memories 2' and 13 are stored in a memory 29 temporarily. Then, a decoding ROM18 generates a picture-element pattern 26 on the basis of the values of the memories 4, 29, and 19. On the other hand, when previously restored data is stored in a memory 23, a logical adding circuit 22 adds the contents of the memory 23 to the pattern 26 logically to restore picture elements.

Patent
12 Mar 1984
TL;DR: In this paper, the authors propose to prevent the quality of a circuit from deterioration due to attenuation caused by rainfall, by encoding always a signal to be transmitted from an earth station to correct its error and assigning an error correction decoding circuit with high gain only to a necessary channel on a communication sattelite.
Abstract: PURPOSE:To prevent the quality of a circuit from deterioration due to attenuation caused by rainfall, by encoding always a signal to be transmitted from an earth station to correct its error and assigning an error correction decoding circuit with high gain only to a necessary channel on a communication sattelite CONSTITUTION:A TDMA signal received in a form containing an error correcting code is amplified, frequency-converted 2 and then demodulated 3 At the usual time, each burst data is picked up and errors are detected through a switch 4, inputting to a base band processor 7 through a buffer memory 6 An error correction switching controlling device 8 monitors channels of which errors are increased by rainfall or the like, and if the errors of a data burst of a certain channel are increased, the errors of the burst of the channel concerned are corrected 10 with high gain through a buffer memory 9 and the corrected signal is inputted to the base band processor 7 through a buffer memory 11 The error correction switching controlling device 8 monitors a pass memory part in the high-gain error correction decoding circuit 10 or the metric status of each pass, and when the errors are reduced, returns the memory part or the metric status to the original status

Patent
22 Oct 1984
TL;DR: In this paper, the authors propose to execute encoding with high efficiency without increasing a distortion quantity by executing variable length enooding with respect to a combination of each component obtained by a sum and difference conversion of an original picture element group and its forecasting conversion.
Abstract: PURPOSE:To execute encoding with high efficiency without increasing a distortion quantity by executing variable length enooding with respect to a combination of each component obtained by a sum and difference conversion of an original picture element group and its forecasting conversion. CONSTITUTION:A sum component S0 and a difference component S1 of input picture element groups Uj1, Uj2 of a block Bij are calculated, forecasting error components DELTAS0, DELTAS1 are calculated by a forecasting converter 3, and also they are quantized adaptively. Its quantized forecasting error components DELTAS0, DELTAS1 are brought to variable encoding by an encoder 4, inputted to a buffer memory 5, and in case of an actual time processing, they are read out asynchronously from an input by a prescribed bit rate from the buffer memory 5 at the same time, and sent onto a trasmission line by adding a redundant code which is capable of correcting an error generated on the transmission line. Accordingly, deterioration of a reproducing picture is reduced, considering a high compression rate.

Journal ArticleDOI
TL;DR: An adaptive approach to two-dimensional tree encoding of images is presented based upon the use of spatial masking concepts that makes use of an adaptive encoding filter of the smoothing variety whose smoothing action is controlled by the local visibility of the encoding noise.
Abstract: An adaptive approach to two-dimensional tree encoding of images is presented based upon the use of spatial masking concepts. Specifically, we make use of an adaptive encoding filter of the smoothing variety whose smoothing action is controlled by the local visibility of the encoding noise. The approach is an attempt to obtain an optimum compromise between slope overload and granular noise characteristics associated with existing two-dimensional tree encoding schemes. We demonstrate that this adaptive approach can provide improved overall image coding performance, both objectively and subjectively, compared to existing tree encoding schemes at a reduced order of complexity. The subjective improvements are clear and striking to the eye.

Patent
17 Feb 1984
TL;DR: In this paper, a polynomial expression is introduced in a data transducer for encoding and decoding a digital data, or further decoding a key for decoding the digital data.
Abstract: PURPOSE:To generate a data by a key at a high speed, by introducing a polynomial expression, in a data transducer for encoding and decoding a digital data, or further encoding and decoding a key for said encoding and decoding. CONSTITUTION:A selector 104 outputs a polynomial expression from an input terminal 101 if a key bit from an input terminal 103 is ''1'', and outputs a polynomial expression from an input terminal 105 if said bit is ''0''. A code converter 106 outputs the remainder obtained by dividing by a polynomial with respect to that which multiplies a polynomial from the selector 104 by square of a polynomial from a memory 107, and the memory 107 stores the output from the code converter 106.