会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明授权
    • Method for generating a sequence in a wireless communication system, and apparatus for same
    • 在无线通信系统中生成序列的方法及其装置
    • US09009207B2
    • 2015-04-14
    • US13383821
    • 2010-07-13
    • Sungjun Yoon
    • Sungjun Yoon
    • G06G7/58H04J13/10
    • H04J13/102
    • Disclosed is a method for generating a sequence and an apparatus for the same which can satisfy the number M′ of sequences sufficiently larger than a length N of a sequence required in a wireless communication system. When the generation of a sequence of the wireless communication system is intended, a first sequence is generated from an mth order primitive polynomial determined according to the length of a required sequence. Then, a second sequence and a third sequence are generated from the first sequence, and a remainder and a quotient is obtained by dividing a particular reference parameter by a number equal to or smaller than 2m+1. Next, a fourth sequence having a desired length N is generated by using the remainder and the quotient. Therefore, it is possible to generate sequences satisfying that the number M′ of sequences is sufficiently larger than a length N of the sequence.
    • 公开了一种用于产生序列的方法及其装置,其可以满足充分大于无线通信系统中所需序列的长度N的序列的数目M'。 当想要生成无线通信系统的序列时,根据所需序列的长度确定的第m个原始多项式来生成第一序列。 然后,从第一序列生成第二序列和第三序列,通过将特定参考参数除以等于或小于2m + 1的数字来获得余数和商。 接下来,通过使用余数和商来生成具有期望长度N的第四序列。 因此,可以产生满足序列的数量M'足够大于序列的长度N的序列。
    • 10. 发明授权
    • Apparatus and method for generating scrambling codes in a radio communication system
    • 一种用于在无线电通信系统中产生扰码的装置和方法
    • US08559480B2
    • 2013-10-15
    • US13143688
    • 2010-01-15
    • Sung Jun YoonSung Jin SuhMyung Cheul Jung
    • Sung Jun YoonSung Jin SuhMyung Cheul Jung
    • H04B1/00
    • H04J13/10G06F7/584H04J13/0029H04J13/102
    • An apparatus and method for generating a scrambling code in a radio communication system is disclosed. In particular, an apparatus and method for generating a scrambling code using a Gold-like sequence even when m is a multiple of 4 for a length 2m−1 of a pseudo-random sequence is disclosed. Two LFSRs (LFSR a and LFSR a′) for generating the Gold-like sequence by two different polynomials of degree m are included. The LFSR a′ is constructed by a reciprocal primitive polynomial of the primitive polynomial of degree m over GF(2) used to construct the LFSR a. In order to generate 2m different scrambling codes, one fixed initial value is input to the LFSR a and different initial values of m bits are input to the LFSR a′ according to system-specific information.
    • 公开了一种用于在无线电通信系统中产生扰码的装置和方法。 具体地,公开了即使在伪随机序列的长度2m-1的m为m的倍数时也使用Gold类序列来生成扰码的装置和方法。 包括用于通过两个不同的m度多项式产生Gold状序列的两个LFSR(LFSR a和LFSR a')。 LFSR a'由用于构造LFSR a的GF(2)上的m度的原始多项式的互逆原始多项式构成。 为了产生2m个不同的扰码,根据系统特定的信息,将一个固定的初始值输入到LFSR a,并且将m个比特的不同初始值输入到LFSR a'。