会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Single-cycle accelerator for extremun state search
    • 单循环加速器用于extremun状态搜索
    • US06272188B1
    • 2001-08-07
    • US09074669
    • 1998-05-08
    • Mohammad Shafiul MobinSivanand SimanapalliLarry R. Tate
    • Mohammad Shafiul MobinSivanand SimanapalliLarry R. Tate
    • H04L2706
    • H03M13/37G06F7/544H03M13/41H03M13/45
    • The invention includes a method of identifying an extremum value and an index in a group of values where each value has an associated index. A count register is initialized to an initial count. A value from the group as well as a predetermined value are provided simultaneously to an arithmetic logic unit and a multiplexer. The value from the group and the predetermined value are compared in the arithmetic logic unit. A selector is set to one of a first or second logic state. In the first logic state the selector selects a minimum; in the second logic state the selector selects a maximum. One of the value and the predetermined value are selected as an extremum based on a flag set by the comparison in the arithmetic logic unit and the selector. The predetermined value is replaced with the extremum and the count register count is stored when the selector is set to a first state and the value is less than the predetermined value. The predetermined value is replaced with the extremum and the count register count is stored when the selector is set to the second state and the value is greater than the predetermined value.
    • 本发明包括一种识别极值值和一组值中的每个值具有相关联索引的值的方法。 计数寄存器初始化为初始计数。 同时向算术逻辑单元和多路复用器提供来自组中的值以及预定值。 在算术逻辑单元中比较来自组中的值和预定值。 选择器被设置为第一或第二逻辑状态之一。 在第一个逻辑状态下,选择器选择最小值; 在第二个逻辑状态下,选择器选择一个最大值。 基于通过算术逻辑单元和选择器中的比较设置的标志,将值和预定值中的一个选择为极值。 将预定值替换为极值,并且当选择器被设置为第一状态并且该值小于预定值时,存储计数寄存器计数。 将预定值替换为极值,并且当选择器设置为第二状态并且该值大于预定值时,存储计数寄存器计数。
    • 4. 发明授权
    • Bit insertion approach to convolutional encoding
    • 卷插入方法进行卷积编码
    • US6081921A
    • 2000-06-27
    • US974873
    • 1997-11-20
    • Sivanand Simanapalli
    • Sivanand Simanapalli
    • H03M13/23H03M13/03
    • H03M13/23
    • A convolutional encoder and method convolutionally encode input bits from an input frame. The convolutional encoder has a predetermined bit input source and a logic circuit. The predetermined bit input source inserts a plurality of predetermined bits into an input register with the input bits. The logic circuit has a plurality of shift registers, a plurality of polynomial generators, and an output generator. The plurality of shift registers shift the input register, including the predetermined bits, to generate shifted data. The plurality of polynomial generators generate respective polynomial values in a plurality of polynomial registers from the shifted data. The output generator generates output data in an output register from the polynomial values corresponding to convolutional encoding of the data in the input register.
    • 卷积编码器和方法从输入帧卷积编码输入比特。 卷积编码器具有预定位输入源和逻辑电路。 预定位输入源将多个预定位插入到具有输入位的输入寄存器中。 逻辑电路具有多个移位寄存器,多个多项式发生器和输出发生器。 多个移位寄存器移位包括预定位的输入寄存器以产生移位数据。 多个多项式生成器从移位数据生成多个多项式寄存器中的多项式值。 输出发生器根据与输入寄存器中的数据的卷积编码对应的多项式值,在输出寄存器中生成输出数据。
    • 6. 发明授权
    • FM discriminator with automatic gain control for digital signal
processors
    • FM鉴频器,用于数字信号处理器的自动增益控制
    • US6002726A
    • 1999-12-14
    • US975997
    • 1997-11-21
    • Sivanand SimanapalliXiao-An Wang
    • Sivanand SimanapalliXiao-An Wang
    • H03D3/00H04L27/14H04L27/08G06F7/52
    • H04L27/14H03D3/007
    • A method of extracting an information bearing signal .omega.(n) from a base-band signal in the form of an inverse function with a digital signal processor. The processor includes memory and utilizes a minimum number of instructions stored in the memory. The base-band waveform comprises a plurality of complex-valued samples having respective I and Q components. The method includes the steps of receiving a first sample at an instant n having respective I(n) and Q(n) components and defining an interval for evaluating potential values for the I(n) and Q(n) components. Next, a step of transforming said I(n) and Q(n) components is performed to have respective threshold values residing in the predefined interval. Then, a step of estimating the transformed components with a series of non-inverted polynomial functions is carried out over the predefined interval. The method proceeds by extracting the information-bearing signal with the digital signal processor according to the instructions to evaluate the series of non-inverted polynomial functions.
    • 一种从数字信号处理器的反函数形式的基带信号中提取信息承载信号ω(n)的方法。 处理器包括存储器并利用存储在存储器中的最少数目的指令。 基带波形包括具有相应I和Q分量的多个复值样本。 该方法包括以下步骤:在具有相应的I(n)和Q(n)分量的时刻n接收第一采样,并且定义用于评估I(n)和Q(n)分量的电位值的间隔。 接下来,执行变换所述I(n)和Q(n)分量的步骤以具有驻留在预定间隔中的相应阈值。 然后,在预定义的间隔内执行用一系列非反相多项式函数估计变换分量的步骤。 该方法通过根据指令提取具有数字信号处理器的信息承载信号来评估一系列非反相多项式函数。
    • 7. 发明授权
    • Determining an extremum value and its index in an array using a
dual-accumulation processor
    • 使用双累积处理器确定数组中的极值及其索引
    • US5991785A
    • 1999-11-23
    • US969252
    • 1997-11-13
    • Mazhar M. AlidinaSivanand Simanapalli
    • Mazhar M. AlidinaSivanand Simanapalli
    • G06F7/544G06F7/02
    • G06F7/544
    • A data processor determines an overall extremum value of an input set of array data, with the input set of array data partitionable into a first set of array data and a second set of array data. The data processor includes a pair of compare-select circuits implemented in an adder as well as in an arithmetic-logic unit (ALU), respectively, which operate in parallel for respectively processing the first set and the second set, and for respectively determining first and second extremum values of the first set and the second set, respectively. A first compare-select circuit of the pair of compare-select circuits determines the overall extremum value of the input set of array data from the first and second extremum values. The first compare-select circuit also determines the location of the overall extremum value in the input set of array data. The computational complexity in determining extrema is reduced by implementing compare-select features in an adder in addition to an ALU to operate in parallel to reduce the number of processing cycles.
    • 数据处理器确定阵列数据的输入集合的整体极值,其中阵列数据的输入组可分割成第一组阵列数据和第二组阵列数据。 数据处理器包括分别在加法器和算术逻辑单元(ALU)中实现的一对比较选择电路,其并行操作以分别处理第一组和第二组,并分别确定第一组 和第一组和第二组的第二极值。 一对比较选择电路的第一比较选择电路从第一和第二极值确定阵列数据的输入集合的总极值。 第一个比较选择电路还确定阵列数据的输入集合中的整体极值的位置。 通过在加法器中实现比较选择特征,除了ALU以并行操作以减少处理周期数之外,减少了确定极值的计算复杂度。
    • 8. 发明授权
    • Method of efficient branch metric computation for a Viterbi
convolutional decoder
    • 维特比卷积解码器的有效分支度量计算方法
    • US5912908A
    • 1999-06-15
    • US976358
    • 1997-11-21
    • Richard Adam CesariSivanand Simanapalli
    • Richard Adam CesariSivanand Simanapalli
    • H03M13/23H03M13/41H04L1/00G06F11/10
    • H04L1/0052H04L1/0054
    • A method of efficient branch metric computation for a Viterbi convolutional decoder wherein a reduced and optimized set of branch metrics is distributed among one or more base sets is provided. A sequence of data transformations and associations are defined according to the connections of the delay elements in the convolutional encoder to its outputs. Each encoder state is associated with one of the base sets and one of several groups of path metric equations. During the add portion of the add-compare-select phase of Viterbi decoding, a branch metric value is extracted from the base set associated with the encoder state being evaluated. The group of path metric equations associated with state being evaluated are evaluated using the extracted branch metric value. The results of the addition are then be processed according to the remaining steps of the Viterbi algorithm.
    • 提供了一种用于维特比卷积解码器的有效分支度量计算的方法,其中在一个或多个基本集合之间分布减小和优化的分支度量集合。 根据卷积编码器中的延迟元件与其输出的连接来定义数据变换和关联序列。 每个编码器状态与基本集合之一和路径度量方程的几组中的一个相关联。 在维特比解码的加法 - 比较选择阶段的添加部分期间,从与所评估的编码器状态相关联的基本集合中提取分支量度值。 使用提取的分支度量值来评估与正在评估的状态相关联的路径度量方程组。 然后根据维特比算法的剩余步骤处理相加的结果。
    • 9. 发明授权
    • Method for optimally encoding a set of instruction codes for a digital processor having a plurality of instruction selectable resource types and an associated optimized set of instruction codes
    • 用于对具有多个指令可选择资源类型的数字处理器的一组指令代码进行最佳编码的方法和相关联的优化的指令代码组
    • US06801995B1
    • 2004-10-05
    • US09129116
    • 1998-08-04
    • Mazhar M. AlidinaSivanand SimanapalliMark E. Thierbach
    • Mazhar M. AlidinaSivanand SimanapalliMark E. Thierbach
    • G06F900
    • G06F8/447G06F9/30145G06F9/30149G06F9/30181
    • A method of assigning unique instruction codes to instructions in an instruction set is disclosed. Such an encoded instruction set is also disclosed. Instructions are grouped according to the particular resources used, where all of the instructions in a group have one or more resource types in common. The position of the highest order active bit in the code is used to identify which resource group a particular instruction belongs to. Instructions in a resource group reserve the same number of bits to identify the specific resources to be used, and no more bits are reserved than required. The remaining unassigned bits are used to encode particular command codes. When such an encoded command is decoded, the resource group is identified by determining the highest order active bit in the instruction. This information is used to determine which bits in the instruction are command bits and which are resource-identifying bits. The specific resource information is extracted and used to select the designated resources to be used in executing the command. This encoding scheme eliminates wasted bits in instructions and thereby increases the number of instructions which can be implemented.
    • 公开了一种将唯一指令代码分配给指令集中的指令的方法。 还公开了这样的编码指令集。 指令根据所使用的特定资源进行分组,其中组中的所有指令都具有一个或多个共同的资源类型。 代码中最高有效位的位置用于标识特定指令属于哪个资源组。 资源组中的指令保留相同数量的位以标识要使用的特定资源,并且不再保留比所需的更多位。 剩余的未分配位用于编码特定的命令代码。 当这样的编码命令被解码时,通过确定指令中的最高有效位来识别资源组。 该信息用于确定指令中哪些位是命令位,哪些是资源标识位。 提取特定资源信息并用于选择在执行命令时要使用的指定资源。 该编码方案消除了指令中的浪费比特,从而增加了可以实现的指令数量。