Abstract:
An in-memory computing method and apparatus, adapted for a processor to perform MAC operations on a memory, are provided. In the method, a format of binary data of weights is transformed from a floating-point format into a quantized format by truncating at least a portion of fraction bits of the binary data and calculating complements of remaining bits, and programming the transformed binary data into cells of the memory. A tuning procedure is performed by iteratively inputting binary data of input signals into the memory, integrating outputs of the memory, and adjusting the weights programmed to the cells based on the integrated outputs. The binary data of the weights is reshaped based on a probability of reducing bits with a value of one in the binary data of each weight. The tuning procedure is repeated until an end condition is met.
Abstract:
A method for determining a mapping between two code spaces is disclosed. The method may include receiving first and second plurality of data words. The least-significant-bits (LSBs) of a first data word of a first subset of the first plurality of data words may be compared to the LSBs of each data word of a second subset of the second plurality of data words. The first data word may then be mapped to a second data word of the second subset. A number of LSBs of the second data word matching LSBs of the first data word may be greater than a respective number of LSBs of each data word of a third subset of the second subset matching the LSBs of the first data word, where the third subset excludes the second data word and a most-significant-bit (MSB) of the second data word may be the same as a MSB of the first data word.
Abstract:
Apparatuses and a method for transmitting a counter signal in an imaging system are provided. Counter states of the counter signal are Gray coded to Gray coded counter states before transmission. Every second Gray coded counter state is inverted to an inverted counter state. The Gray coded counter states inverted in every second counter state are transmitted and are decoded on receipt.
Abstract:
Methods for generating Gray count for an odd length sequence using a virtual space. More than one set of Gray codes can be generated for a given odd multiple virtual domains that assists in achieving more robust systems which are fault tolerant. Broadly contemplated herein is the use of a simple and elegant algorithm which is less complex and uses only an N-bit sequence.
Abstract:
In general, in one aspect, the invention features a Gray code decoder for decoding input numbers according to a K-bit Gray code and a Gray code encoder for encoding input numbers according to the K-bit Gray code. The K-bit Gray code is constructed from a M-bit Gray code having a one-bit separation I and a two-bit separation J and a N-bit Gray code number from a N-bit Gray code, wherein K=M+N, M≧N, and at least one of I and J is greater than, or equal to, 2N.
Abstract translation:通常,在一个方面,本发明的特征在于一种格雷码解码器,用于根据K位格雷码解码输入号码,格格码编码器根据K位格雷码对输入号进行编码。 K位格雷码由具有一比特间隔I和两比特间隔J的M位格雷码构成,N位格雷码由N位格雷码组成,其中K = M + N,M> = N,I和J中的至少一个大于或等于2 N。
Abstract:
The method and apparatus use two inequalities to determine whether an estimated value obtained from conventional method and a correct value obtained from ideal conversion is identical. When those values are the same, the estimated value is not corrected; otherwise, according to the difference between those values, one is added or subtracted from the estimated value to obtain the correct result.
Abstract:
A rate 5/7, d=0 channel code encodes a Gray code servo track address into channel data recorded on a magnetic disk; a PR4 sliding threshold Viterbi sequence detector detects the recorded servo track address upon read back; a cost effective d=0 decoder decodes the recorded servo track address into its Gray code representation; and a 1/1+D filter decodes the Gray code track address into its binary representation. Detecting the servo data with a PR4 Viterbi sequence detector, which is already provided in a read channel for detecting user data, increases the data density of the storage system. The cost and complexity of the decoder is reduced by encoding/decoding the Gray code track address in sections of five bits.
Abstract:
An apparatus converts m-bit digital data having a scale factor of K.sub.1 to n-bit digital data having a scale factor of K.sub.2. The apparatus comprises a digital to analog converter which receives the m-bit digital data, for outputting a first analog signal representative of a value associated with the m-bit digital data. An amplifier receives the first analog signal multiplies it by a factor, and outputs a second analog signal. The factor of the amplifier is K.sub.2 /K.sub.1, such that the second analog signal has a value with the scale factor of K.sub.2 associated therewith. An analog to digital converter receives the second analog signal, and converts the second analog signal to the n-bit digital data. The n-bit digital data has the scale factor of K.sub.2 associated therewith, the value representative of the n-bit digital data being essentially equal in the example of the present application to the value representative of the m-bit digital data, however, this is not always a requirement.
Abstract:
In order to obtain sufficiently long values of T.sub.min and T.sub.w data conversion, and to reduce the dc or the low frequency component, a method for converting a binary data train comprises a first step for dividing the binary data train into a plurality of successive blocks each having M (M being a natural number) bit data, a second step for converting the M bit data into N (N being a natural number, and where N.gtoreq.M+1), and a third step for converting the N bit data in every L (L being a natural number) blocks into J (J being a natural number) bit data.
Abstract translation:为了获得足够长的Tmin和Tw数据转换值,并且为了减小直流或低频分量,用于转换二进制数据串的方法包括第一步骤,用于将二进制数据序列分成多个连续的块 具有M(M是自然数)比特数据的第二步骤,用于将M比特数据转换为N(N是自然数,并且其中N> / = M + 1)的第二步骤,以及用于将N比特 每个L(L是自然数)的数据块成J(J为自然数)位数据。
Abstract:
Position measurement apparatus which utilizes a digital code to accurately determine the position of a movable body along a travel path. The digital code is selected to provide, for any N consecutive bits of the code, a bit pattern which is unique. Indicia defining the code, and a reader, are arranged for relative motion in synchronism with movement of the movable body. Translating apparatus converts each combination of N consecutive bits read by the reader into an address defining the location of the movable body relative to the travel path. In a preferred embodiment, the digital code is a maximum length digital code, which is conveniently generated by a polynomial generator. The bit length of the code, which is equal to 2.sup.N -1, is selected according to the length of the travel path and the desired resolution.