Signal processor and method for Fourier Transformation
    1.
    发明授权
    Signal processor and method for Fourier Transformation 失效
    傅立叶变换的信号处理器和方法

    公开(公告)号:US5968112A

    公开(公告)日:1999-10-19

    申请号:US923845

    申请日:1997-09-04

    IPC分类号: G06F17/14

    CPC分类号: G06F17/142

    摘要: Parallel signal processor (10) (FIG. 2) performs a Fourier Transformation of an input signal; The transformation coefficients are converted once to logarithmic form and stored in a cache memory. The input data is converted serially to logarithmic form, and fed to all processing units in parallel. The processing units compute their respective products as additions in the logarithmic domain. Then, the products are converted back to the normal domain. The products with the correct sign are summed by an accumulator of the respective processing element. After the last signal data point has run through the processing elements and the last products are added to their respective sums, all complex output signal data points are complete simultaneously.

    摘要翻译: 并行信号处理器(10)(图2)执行输入信号的傅里叶变换; 变换系数一次转换为对数形式并存储在高速缓冲存储器中。 输入数据被串行转换成对数形式,并且并行地馈送到所有处理单元。 处理单元计算它们各自的产物作为对数域中的添加。 然后,产品转换回正常域。 具有正确符号的产品由相应处理元件的累加器相加。 在最后一个信号数据点已经通过处理元件并且最后的产品被添加到它们各自的和之后,所有复杂的输出信号数据点都是同时完成的。

    Method for eletronically representing a number, adder circuit and
computer system
    2.
    发明授权
    Method for eletronically representing a number, adder circuit and computer system 失效
    用于电子表示数字,加法器电路和计算机系统的方法

    公开(公告)号:US5923575A

    公开(公告)日:1999-07-13

    申请号:US912257

    申请日:1997-08-15

    IPC分类号: G06F7/38 G06F7/485 G06F7/50

    CPC分类号: G06F7/485 G06F7/38

    摘要: The invention relates to a method for electronically representing a number V in a binary data word. Both the exponent and the mantissa are represented as 2' complement. The mantissa is normalized to 0.1.F if the number V is positive where F is the fraction of the mantissa. In case that the number V is negative the fraction F is normalized to 10.F. Usage of this format allows to design an improved adder which requires less hardware.

    摘要翻译: 本发明涉及一种用于电子地表示二进制数据字中的数字V的方法。 指数和尾数均表示为2'补码。 如果数字V为正,则尾数归一化为0.1.F,其中F是尾数的分数。 在数字V为负的情况下,分数F归一化为10.F。 这种格式的使用允许设计一种需要较少硬件的改进加法器。

    Signal processor and method for fast Fourier transformation
    4.
    发明授权
    Signal processor and method for fast Fourier transformation 失效
    用于快速傅里叶变换的信号处理器和方法

    公开(公告)号:US6023719A

    公开(公告)日:2000-02-08

    申请号:US923687

    申请日:1997-09-04

    IPC分类号: G06F17/14

    CPC分类号: G06F17/142

    摘要: With reference to FIG. 1 signal processor (10) for performing transformations of sets of input data points comprises a memory for storing a first half input data points and a second half input data points, an adder unit for pairwise adding one real part of each one first half input data point and a second half input data point and providing adder output data, and a computing unit for performing transformations upon the adder output data. Addition for data reduction and data transformation are carried out simultaneously by different units.

    摘要翻译: 参考图1。 1信号处理器(10)用于执行输入数据点集合的变换,包括用于存储前半个输入数据点和第二半输入数据点的存储器,用于将每个前半个输入数据的一个实部成对加法的加法器单元 点和第二半输入数据点,并提供加法器输出数据;以及计算单元,用于根据加法器输出数据进行变换。 用于数据缩减和数据转换的增加由不同的单元同时进行。

    Method and system for encoding
    5.
    发明授权
    Method and system for encoding 失效
    编码方法和系统

    公开(公告)号:US5946039A

    公开(公告)日:1999-08-31

    申请号:US911901

    申请日:1997-08-15

    IPC分类号: G06T9/00 H04N7/26 H04N7/30

    摘要: An encoding system (400) receives samples and coefficients from a bus (422). The system comprises a plurality of parallel operating memory devices (430-k), registers (435-k), computing units (440-k), and accumulator units (460-k). The system (400) further comprises a parallel-to-serial buffer (470) coupled to the accumulator units (440-k) and a pair generator (480) for providing amplitude/index pairs. The system (400) performs encoding steps such as transforming, quantizing, zigzagging, rate controlling, and run-length coding. Transforming is explained for the example of a Forward Discrete Cosine Transformation (FDCT). According to a method (500) of the present invention, zigzagging (510) occurs prior to transforming (570) and performed only once when transformation coefficients are provided to the memory devices (430-k) in a zigzag arrangement. Quantizing occurs prior to transforming by pre-calculating the coefficients with quantizers. Pair generator (480) performes rate-controlling and run-length encoding (550). (with reference to FIGS. 2 and 9)

    摘要翻译: 编码系统(400)从总线(422)接收采样和系数。 该系统包括多个并行操作存储器件(430-k),寄存器(435-k),计算单元(440-k)和累加器单元(460-k)。 系统(400)还包括耦合到累加器单元(440-k)的并行 - 串行缓冲器(470)和用于提供振幅/折射率对的一对发生器(480)。 系统(400)执行变换,量化,曲折,速率控制和游程长度编码等编码步骤。 对于前向离散余弦变换(FDCT)的示例解释变换。 根据本发明的方法(500),在变换之前发生锯齿形(510)(570),并且在以Z字形排列向存储器件(430-k)提供变换系数时仅执行一次。 通过用量化器预先计算系数,在变换前进行量化。 配对发生器(480)执行速率控制和游程长度编码(550)。 (参照图2和图9)

    Apparatus and method for matrix multiplication
    6.
    发明授权
    Apparatus and method for matrix multiplication 失效
    矩阵乘法的装置和方法

    公开(公告)号:US6055556A

    公开(公告)日:2000-04-25

    申请号:US912224

    申请日:1997-08-15

    IPC分类号: G06F17/16 G06F7/00 G06F7/52

    CPC分类号: G06F17/16

    摘要: A system (400) alternatively performs real matrix operation in a first mode or performs complex matrix multiplication in a second mode. One input matrix (e.g., {B}) stays in a plurality of memory fields (430-k), while the other input matrix (e.g., {A}) is loaded into a plurality of registers (410-k). Parallel operating groups (405-k, 409-(k+1)) combine elements of {A} with elements of {B}. The groups (405-k, 409-(k+1)) comprise the memory fields (430-k), the registers (410-k) as well as computational units (440-k), switches (420-k) and adder units (460-k). The adder units (460-k) are configured by the switches (420-k) to operate as adders or to operate as accumulators, depending on the mode. Adders provide intermediate results and accumulators accumulate these intermediate results (e.g., Sum) to elements of the resulting matrix {C}. For complex multiplication, real (Re) and imaginary (Im) parts of matrix elements are in processed in adjacent groups. The system (400) uses logarithmic representations of the matrix elements and further comprises a log converter (490) and a plurality of inverse log converters (450-k).

    摘要翻译: 系统(400)可选地以第一模式执行实矩阵运算或在第二模式中执行复矩阵乘法。 一个输入矩阵(例如{+ E,uns B + EE})停留在多个存储器场(430-k)中,而另一个输入矩阵(例如,{+ E,uns A + EE})被加载到 多个寄存器(410-k)。 并行操作组(405-k,409-(k + 1))将{+ E,uns A + EE}的元素与{+ E,uns B + EE}的元素组合。 组(405-k,409-(k + 1))包括存储器字段(430-k),寄存器(410-k)以及计算单元(440-k),开关(420-k)和 加法器单元(460-k)。 加法器单元(460-k)由开关(420-k)配置,作为加法器运行或者作为累加器运行,这取决于模式。 加法器提供中间结果,并且累加器将这些中间结果(例如,Sum)累积到所得矩阵{+ E,C C + EE}的元素。 对于复数乘法,在相邻组中处理矩阵元素的实数(Re)和虚部(Im)部分。 系统(400)使用矩阵元素的对数表示,并且还包括对数转换器(490)和多个逆对数转换器(450-k)。

    Apparatus and methods for performing arithimetic operations on vectors
and/or matrices
    7.
    发明授权
    Apparatus and methods for performing arithimetic operations on vectors and/or matrices 失效
    对向量和/或矩阵执行算术运算的装置和方法

    公开(公告)号:US6003058A

    公开(公告)日:1999-12-14

    申请号:US924288

    申请日:1997-09-05

    IPC分类号: G06F17/16

    CPC分类号: G06F17/16

    摘要: A multiply-multiply-accumulate (MMA) system (10) efficiently evaluates matrix products X=F*C. Matrix C is dissected into submatrices A and B taking advantage of symmetry in C. LOG unit (14) converts B, A, and F to LOG values B', A' and F'. These are summed in K parallel calculating units CU's (18) and converted back to Normal domain as P=F*B*A in ALOG units (22) and sent to accumulators ACU's (24). The ACU's (24) accumulate the results. An output buffer (26) combines the results. The B', A' values (32,34) are held in a cache memory (20) and the LOG sums are performed in two steps with intermediate storage.

    摘要翻译: 乘法 - 累积(MMA)系统(10)有效地评估矩阵乘积X = F * C。 利用C中的对称性将矩阵C解剖为子矩阵A和B. LOG单元(14)将B,A和F转换为LOG值B',A'和F'。 这些以K并行计算单元CU(18)相加,并在ALOG单元(22)中被转换回正常域为P = F * B * A并发送到累加器ACU(24)。 ACU(24)积累了结果。 输出缓冲器(26)组合结果。 B',A'值(32,34)被保存在高速缓冲存储器(20)中,并且LOG和数以两个步骤执行中间存储。

    Memory system and data communications system
    8.
    发明授权
    Memory system and data communications system 失效
    内存系统和数据通信系统

    公开(公告)号:US5710944A

    公开(公告)日:1998-01-20

    申请号:US599016

    申请日:1996-02-09

    IPC分类号: G11C7/00 G06F13/00

    CPC分类号: G11C7/00

    摘要: A memory system (3) for storing data messages communicated between a processor unit (13) and a communication module (11), each data message comprising at least one data word, comprises a memory array (4) having a plurality of memory buffers (B0-BM), each buffer for storing a data message, and logic circuitry (24) coupled to the memory array (4). The logic circuitry (24) sets one bit of a data message stored in a memory buffer to a first logic state during a processor unit read access when the processor unit (13) reads a current data message from the memory buffer, and negates the one bit to a second logic state during a communication module write access when the communication module (11) writes a new data message into the memory buffer. When the communication module (11) is to write a new data message to one of the memory buffers, the state of the one bit of the current data message stored in the one memory buffer provides an indication as to whether the new data message will overwrite the current data message, which current data message has not been read by the processor unit (13) or whether the new data message will overwrite the current data message, which current data message has been read by the processor unit (13).

    摘要翻译: 一种用于存储在处理器单元(13)和通信模块(11)之间传送的数据消息的存储器系统(3),每个数据消息包括至少一个数据字,包括具有多个存储器缓冲器的存储器阵列(4) B0-BM),用于存储数据消息的每个缓冲器以及耦合到存储器阵列(4)的逻辑电路(24)。 当处理器单元(13)从存储器缓冲器读取当前数据消息时,逻辑电路(24)在处理器单元读取访问期间将存储在存储器缓冲器中的数据消息的一位设置为第一逻辑状态,并且否定一个 当通信模块(11)将新的数据消息写入到存储器缓冲器中时,在通信模块写访问期间,位被置为第二逻辑状态。 当通信模块(11)要向存储器缓冲器之一写入新的数据消息时,存储在一个存储器缓冲器中的当前数据消息的一位的状态提供关于新数据消息是否将覆盖的指示 当前数据消息,当前数据消息未被处理器单元(13)读取,或者新数据消息是否将覆盖当前数据消息,哪个当前数据消息已被处理器单元(13)读取。