会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and system for hardware accelerator for implementing f9 integrity algorithm in WCDMA compliant handsets
    • 用于在WCDMA兼容手机中实现f9完整性算法的硬件加速器的方法和系统
    • US07869590B2
    • 2011-01-11
    • US11103705
    • 2005-04-12
    • Srinivasan SurendranRuei-Shiang Suen
    • Srinivasan SurendranRuei-Shiang Suen
    • H04K1/00H04L9/00H04L9/28
    • H04L9/0625H04L9/3242H04L2209/125H04L2209/24H04L2209/38H04L2209/80
    • In a wireless communication system, a method and system for a hardware accelerator for implementing the f9 integrity algorithm in WCDMA compliant handsets are provided. Intermediate variables may be initialized in an integrity function and a first processing block of bits and at least one additional processing block of bits may be generated for the integrity function from a padded string generated from input variables. Values for a first and a second processing variable may be generated for each processing stage based on a corresponding processing block of bits and on immediately generated previous first and second processing values. The first processing value may be generated utilizing a KASUMI operation after an indication that an immediately previous generated first processing value is available. An authentication code may be generated based on a last of the second processing values and a modified integrity key.
    • 在无线通信系统中,提供了一种用于在WCDMA兼容手机中实现f9完整性算法的硬件加速器的方法和系统。 可以在完整性函数中初始化中间变量,并且可以从从输入变量生成的填充字符串为完整性函数生成位的第一处理块和位的至少一个附加处理块。 可以基于相应的位的处理块和立即生成的先前的第一和第二处理值,为每个处理级产生第一和第二处理变量的值。 可以在紧接着之前生成的第一处理值可用的指示之后利用KASUMI操作来生成第一处理值。 可以基于最后的第二处理值和修改的完整性密钥来生成认证码。
    • 2. 发明授权
    • Method and system for implementing FI function in KASUMI algorithm for accelerating cryptography in GSM/GPRS/EDGE compliant handsets
    • 用于在GSM / GPRS / EDGE兼容手机中加速加密的KASUMI算法中实现FI功能的方法和系统
    • US07760874B2
    • 2010-07-20
    • US10924219
    • 2004-08-23
    • Ruei-Shiang SuenSrinivasan Surendran
    • Ruei-Shiang SuenSrinivasan Surendran
    • H04L9/28H04L9/06H04K1/00
    • H04L9/0625H04L2209/125H04L2209/24H04L2209/80
    • In a wireless communication system, a method and system for implementing an FI function in a KASUMI algorithm for accelerating cryptography in GSM/GPRS/EDGE compliant handsets are provided. An efficient implementation of the FI function may comprise a first substitution stage and a second substitution stage, where a 9-bit substitution circuit and a 7-bit substitution circuit may be used in each of the stages. A pipe register may be used to transfer and zero-extend an input to the 7-bit substitution circuit for processing with an output of the 9-bit substitution circuit. A first multiplexer and a second multiplexer may be used to select the inputs for the substitution circuits at each one of the substitution stages. A third multiplexer and a fourth multiplexer may be used to select subkeys for encryption during the first substitution stage and zero value signals during the second substitution stage.
    • 在无线通信系统中,提供了一种用于在KASUMI算法中实现FI功能的方法和系统,用于在GSM / GPRS / EDGE兼容手机中加速加密。 FI功能的有效实现可以包括第一替换阶段和第二替换阶段,其中可以在每个阶段中使用9位替换电路和7位替换电路。 可以使用管道寄存器来将输入传递和零扩展到7位替换电路,以便用9位替代电路的输出进行处理。 可以使用第一多路复用器和第二多路复用器在每个替代级选择替代电路的输入。 可以使用第三多路复用器和第四多路复用器来选择在第一替换阶段期间进行加密的子密钥和在第二替换阶段期间的零值信号。
    • 4. 发明申请
    • Method and system for implementing FI function in KASUMI algorithm for accelerating cryptography in GSM/GPRS/EDGE compliant handsets
    • 用于在GSM / GPRS / EDGE兼容手机中加速加密的KASUMI算法中实现FI功能的方法和系统
    • US20060013388A1
    • 2006-01-19
    • US10924219
    • 2004-08-23
    • Ruei-Shiang SuenSrinivasan Surendran
    • Ruei-Shiang SuenSrinivasan Surendran
    • H04L9/28
    • H04L9/0625H04L2209/125H04L2209/24H04L2209/80
    • In a wireless communication system, a method and system for implementing an FI function in a KASUMI algorithm for accelerating cryptography in GSM/GPRS/EDGE compliant handsets are provided. An efficient implementation of the FI function may comprise a first substitution stage and a second substitution stage, where a 9-bit substitution circuit and a 7-bit substitution circuit may be used in each of the stages. A pipe register may be used to transfer and zero-extend an input to the 7-bit substitution circuit for processing with an output of the 9-bit substitution circuit. A first multiplexer and a second multiplexer may be used to select the inputs for the substitution circuits at each one of the substitution stages. A third multiplexer and a fourth multiplexer may be used to select subkeys for encryption during the first substitution stage and zero value signals during the second substitution stage.
    • 在无线通信系统中,提供了一种用于在KASUMI算法中实现FI功能的方法和系统,用于在GSM / GPRS / EDGE兼容手机中加速加密。 FI功能的有效实现可以包括第一替换阶段和第二替换阶段,其中可以在每个阶段中使用9位替换电路和7位替换电路。 可以使用管道寄存器来将输入传递和零扩展到7位替换电路,以便用9位替代电路的输出进行处理。 可以使用第一多路复用器和第二多路复用器在每个替代级选择替代电路的输入。 可以使用第三多路复用器和第四多路复用器来选择在第一替换阶段期间进行加密的子密钥和在第二替换阶段期间的零值信号。
    • 6. 发明授权
    • General rate N/(N+1) (0, G) code construction for data coding
    • 通用速率N /(N + 1)(0,G)代码构建用于数据编码
    • US06204781B1
    • 2001-03-20
    • US09272089
    • 1999-03-18
    • Pervez M. AzizIan M. HughesPatrick W. KempseySrinivasan Surendran
    • Pervez M. AzizIan M. HughesPatrick W. KempseySrinivasan Surendran
    • H03M700
    • H03M7/46G06T9/005
    • A general rate N/(N+1) (0, G), code construction, e.g., for a magnetic recording system, allows for encoding or decoding of a dataword having N elements, N preferably being an integer multiple of eight. The dataword is divided into N/8 bytes of binary data that are encoded as a run-length limited (RLL) codeword in accordance with the general rate N/(N+1) (0, G) code construction. The general rate N/(N+1) (0, G) code construction is characterized by the constraints (d=0, G=(N/4)+1, l=N/8, r=N/8). the N/(N+1) (0 (N/4)+1, N/8, N/8) RLL codeword is constructed from the dataword in accordance with 1) pivot bits identifying code violations related to the constraints, 2) correction bits set to correct code violations, and 3) preserved elements having values not included in the code violations. The corrections by correction bits correspond to corrections of predefined code violations that limit the number of consecutive zeros received by, for example, a magnetic record channel to (N/4)+1. The codewords generated in accordance with the general rate N/(N+1) (0, G) code construction may exhibit a high transition density. The high transition density allows for more frequent timing and gain control updates, and so results in lower required channel input signal to noise ratio for a given level of magnetic recording channel performance.
    • 通常的速率N /(N + 1)(0,G),代码构造,例如用于磁记录系统,允许对具有N个元素的数据字进行编码或解码,N优选地是8的整数倍。 数据字根据通用速率N /(N + 1)(0,G)码构造被划分为被编码为游程长度限制(RLL)码字的二进制数据的N / 8字节。 一般速率N /(N + 1)(0,G)码结构的特征在于约束(d = 0,G =(N / 4)+1,l = N / 8,r = N / 8)。 根据1)识别与约束相关的代码违例的枢轴位,从数据字构造N /(N + 1)(0(N / 4)+1,N / 8,N / 8)RLL码字,2) 校正位设置为纠正代码违例,以及3)保留的元素具有不包括在代码违规中的值。 校正位的校正对应于将例如由磁记录通道接收到的(N / 4)+1接收的连续零数量的预定义代码违例的校正。 根据一般速率N /(N + 1)(0,G)码构造生成的码字可以表现出高转换密度。 高转换密度允许更频繁的定时和增益控制更新,因此导致给定级别的磁记录通道性能所需的通道输入信噪比更低。
    • 8. 发明授权
    • Adaptive analog transversal equalizer
    • 自适应模拟横向均衡器
    • US5682125A
    • 1997-10-28
    • US536008
    • 1995-09-29
    • Vadim B. MinuhinVladimir KovnerSrinivasan Surendran
    • Vadim B. MinuhinVladimir KovnerSrinivasan Surendran
    • G11B20/10H03H15/00H03H17/00H03H21/00H04B3/06H04B3/14H04L7/02H04L25/03H04B3/04
    • H03H21/0012G11B20/10009H04L7/0058H04L2025/03369H04L2025/03445H04L2025/03611
    • An analog, adaptive generalized transversal equalizer for use in the filtering system of a disc drive PRML read channel, the transversal equalizer employing the use of non-ideal delay elements. The filtering system comprises the equalizer connected in series with an adaptive, analog prefilter. The prefilter is comprised of a plurality of serially connected, adaptive, analog filter stages having variable transfer functions determined by adaptive parameter signals received by the filter stages. The generalized transversal equalizer comprises a plurality of serially connected, adaptive, analog low pass filters, having taps on either side of each low pass filter, a plurality of multipliers that receive signals at the tap locations of the delay circuit, and a summing circuit that receives the outputs of the multipliers. The transfer functions of the delay circuit are continuously variable in relation to adaptive parameter signals received by the delay circuit and the coefficients of multiplication are variable in relation to the adaptation process.
    • 一种用于磁盘驱动器PRML读通道的滤波系统的模拟自适应广义横向均衡器,横向均衡器采用非理想延迟元件。 滤波系统包括与自适应模拟预滤波器串联连接的均衡器。 预滤波器由多个串联的自适应模拟滤波器级组成,其具有由滤波器级接收的自适应参数信号确定的可变传递函数。 广义横向均衡器包括多个串行连接的自适应模拟低通滤波器,每个低通滤波器的两侧具有抽头,在延迟电路的抽头位置处接收信号的多个乘法器以及一个求和电路, 接收乘法器的输出。 延迟电路的传递函数相对于由延迟电路接收的自适应参数信号是连续可变的,并且乘法系数相对于适应过程是可变的。