中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

297 records (took 0.024 seconds)

    One bit matched filter with low complexity and high speed
    1.
    发明授权
    One bit matched filter with low complexity and high speed 有权
    一个位匹配滤波器，复杂度低，速度快

    公开(公告)号：US6157684A

    公开(公告)日：2000-12-05

    申请号：US172973

    申请日：1998-10-14

    Applicant: Lin Yang ,  Yan Zhong ,  Manouchehr S. Rafie

    Inventor： Lin Yang ,  Yan Zhong ,  Manouchehr S. Rafie

    IPC: G06F17/15 ,  H04B1/7093 ,  H04L27/06

    CPC classification number: H04B1/7093 ,  G06F17/15

    Abstract: Described is an one bit matched filter for generating a sequences of correlations between a signal bit stream and a sample stream of n sample bits. The n sample bits are arranged in a rang of n bit positions n, n-1, . . . , 2, 1. Among the n sample bits, m boundary positions are defined based on the bit pattern of the sample stream, where m

    Abstract translation: 描述了一个一比特匹配滤波器，用于产生信号比特流和n个采样比特的采样流之间的相关序列。 n个采样位以n位n，n-1的排列排列。 。 。 ，2,1。在n个采样位中，m个边界位置基于样本流的位模式来定义，其中m

    Trellis construction based on parity check matrix for BCH code
    2.
    发明授权
    Trellis construction based on parity check matrix for BCH code 失效
    基于BCH码奇偶校验矩阵的网格构建

    公开(公告)号：US07266749B1

    公开(公告)日：2007-09-04

    申请号：US10186128

    申请日：2002-06-27

    Applicant: Yan Zhong ,  Lin Yang

    Inventor： Yan Zhong ,  Lin Yang

    IPC: H04L1/14

    CPC classification number: H03M13/152 ,  H03M13/3944 ,  H04L1/0058

    Abstract: A method for constructing a simplified trellis diagram for BCH-encoded information is disclosed. BCH-encoded information is received, having a corresponding parity check matrix H. The parity check matrix H is expressed as an ordered sequence of columns of matrices. A sequence of sub-code words is provided, corresponding to one or more code words, each satisfying a given condition. A matrix Hcp, having columns that are generated as a selected permutation of the columns of the matrix H through a column-permutation-for-binary-matching process, is provided, and a sequence of sub-matrices and a corresponding sequence of permuted sub-code words is provided. A trellis diagram, representing an ordered sequence of code word transitions in the received information and symmetric about a central location, is provided for each code word c, connecting n+1 stages, numbered i=0, 1, . . . , n, in an ordered sequence.

    Abstract translation: 公开了一种用于构建BCH编码信息的简化网格图的方法。 BCH编码信息被接收，具有对应的奇偶校验矩阵H.奇偶校验矩阵H表示为矩阵列的有序序列。 提供一个子代码字序列，对应于一个或多个代码字，每个代码字都满足给定条件。 提供了具有通过列置换二进制匹配处理作为矩阵H的列的选择排列生成的列的矩阵H pc， 提供矩阵和相应的排列子码字序列。 对于每个代码字c，提供了连接n + 1个阶段（编号为i = 0,1）的格子图，表示接收到的信息中的码字转换的有序序列并且关于中心位置对称的格状图。 。 。 ，n，有序序列。

    Low complexity multiple bits matched filter
    3.
    发明授权
    Low complexity multiple bits matched filter 失效
    低复杂度多位匹配滤波器

    公开(公告)号：US06426982B1

    公开(公告)日：2002-07-30

    申请号：US09398939

    申请日：1999-09-17

    Applicant: Lin Yang ,  Yan Zhong ,  Kevin Hwang

    Inventor： Lin Yang ,  Yan Zhong ,  Kevin Hwang

    IPC: H03D100

    CPC classification number: G06F17/15 ,  H04B1/707 ,  H04B7/195 ,  H04B2201/70707 ,  H04L27/2278 ,  H04L2027/0065

    Abstract: Method and system for efficiently and quickly forming a sequence of convolution values from an over-sampled digital signal sequence. Convolution value differences are computable from a set of digital signal values that is smaller than the original set of signal values by a factor of R, the over-sampling rate. The number of adders and the associated time delay for computation of the convolution differences are reduced by at least a factor R and by at least a factor approximately proportional to log2(R), respectively, as compared to conventional computation of a convolution value. This approach is used to estimate a time value for which the convolution attains a largest magnitude or value.

    Abstract translation: 用于从过采样数字信号序列有效且快速地形成卷积值序列的方法和系统。 卷积值差异可以从一组数字信号值计算，该组数字信号值小于原始信号值集合乘以R的倍数，即过采样率。 与卷积值的常规计算相比，用于计算卷积差的加法器的数量和相关联的时间延迟分别减少至少一个因子R和至少一个与log 2（R）成比例的因子。 该方法用于估计卷积达到最大幅度或值的时间值。

    Decoding multi-block product code
    4.
    发明授权
    Decoding multi-block product code 失效
    解码多块产品代码

    公开(公告)号：US06898757B1

    公开(公告)日：2005-05-24

    申请号：US10117388

    申请日：2002-04-04

    Applicant: Yan Zhong ,  Lin Yang

    Inventor： Yan Zhong ,  Lin Yang

    IPC: H03M13/25 ,  H03M13/29 ,  H04L1/00 ,  H04L27/34 ,  H03M13/03

    CPC classification number: H04L1/0057 ,  H03M13/251 ,  H03M13/2909 ,  H04L1/0045 ,  H04L27/3488

    Abstract: A method for efficient decoding of block product code format signals, using a (22p)QAM signal constellation for mapping of a received signal, with p=2, 3, 4, 5, . . . A received signal value rx, corresponding to an x=I or x=Q coordinate, is converted to a p-tuple (B(p-1)x, . . . , B0x) corresponding to a “closest” I-coordinate or Q-coordinate numerical value, and a p-stage algorithm is applied to the signal values rx and to the p-tuples (B(p-1)x, . . . , B0x) to determine a p-tuple (r(p-1)x, . . . , r0x) representing a decoded p-bit value for the received signal value rx. Depending upon a communication channel parameter Eb/N0 and the bit error ratio BER associated with each of the p bits, the received signal values rx may be suitable for some or all communications activities (e.g., HDTV, SDTV, mobile comm).

    Abstract translation: 使用用于映射接收到的信号的（2≤Pp）QAM信号星座来对块产品码格式信号进行有效解码的方法，其中p = 2,3,4,5，...。 。 。 对应于x = I或x = Q坐标的接收信号值r x x x被转换成p元组（B（p-1）x）。 对应于“最接近”的I坐标或Q坐标数值的P阶算法，并且将p级算法应用于信号值r x1 / 以及p元组（B＆gt;（p-1）x，...，B×0x））来确定p元组（r∈（p-1） 1）表示用于接收信号值r x x的解码的p位值的x，...，r 。 根据通信信道参数Eb / N0和与每个p位相关联的比特误差BER，接收信号值r x x可适用于一些或所有通信活动（例如，HDTV， SDTV，手机通讯）。

    Method and apparatus for generating branch metrics and branch indices for convolutional code Viterbi decoders
    5.
    发明授权
    Method and apparatus for generating branch metrics and branch indices for convolutional code Viterbi decoders 失效
    用于生成卷积码维特比解码器的分支度量和分支索引的方法和装置

    公开(公告)号：US5970104A

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

    申请号：US820922

    申请日：1997-03-19

    Applicant: Yan Zhong ,  Lin Yang ,  Manouchehr Rafie

    Inventor： Yan Zhong ,  Lin Yang ,  Manouchehr Rafie

    IPC: H03D1/00

    CPC classification number: H04L1/0054 ,  H03M13/395 ,  H03M13/4107 ,  H03M13/6508 ,  H03M13/6561

    Abstract: A Viterbi decoder generates a branch metric table from first and second data signals taken at two sample times and provides selected branch metrics to an add/compare/select circuit in response to branch indices from a branch index generator. The branch metrics in the branch metric table are the sixteen combinations of the sum of the first and second parallel data signals at first and second sample times and the inverse of such signals. The branch index generator generates the branch indices in response to a received state from the add/compare/select circuit, convolutional code polynomials and the possible states of a radix-4 trellis. The add/compare/select generates a survivor path decision based on the selected branch metrics.

    Abstract translation: 维特比解码器从在两个采样时间获取的第一和第二数据信号产生分支度量表，并且响应于来自分支索引发生器的分支索引将选择的分支度量提供给加法/比较/选择电路。 分支度量表中的分支度量是第一和第二采样时间的第一和第二并行数据信号之和与这些信号的倒数的十六个组合。 分支索引生成器响应于来自加法/比较/选择电路的接收状态，卷积码多项式和基数-4格子的可能状态产生分支索引。 添加/比较/选择基于所选择的分支度量生成幸存者路径决策。

    Method and device for use in wireless communication node
    6.
    发明授权
    Method and device for use in wireless communication node 有权

    公开(公告)号：US12155600B2

    公开(公告)日：2024-11-26

    申请号：US17235962

    申请日：2021-04-21

    Applicant: Zheng Liu ,  Xiaobo Zhang ,  Lin Yang

    Inventor： Zheng Liu ,  Xiaobo Zhang ,  Lin Yang

    IPC: H04L5/00 ,  H04W72/0453 ,  H04W72/23

    Abstract: The present disclosure provides a method and a device for use in wireless communication node. The communication node transmits first information; herein, for a given SCS, the communication node assumes that X1 PRB(s) is (are) comprised in frequency-domain resources that can be occupied by the communication node for transmissions, X1 being a positive integer, and the X1 PRB(s) occupies (occupy) consecutive frequency-domain resources; a position of the X1 PRB(s) in frequency domain is related to at least one of whether the communication node is in coverage or a synchronization reference source selected by the communication node; the first information is used to indicate a position of the X1 PRB(s) in frequency domain, and the first information is transmitted via an air interface. The method in the present disclosure reduces interference and improves link and system performance.

    Method and device in UE and base station used for wireless communication
    7.
    发明授权
    Method and device in UE and base station used for wireless communication 有权

    公开(公告)号：US12126438B2

    公开(公告)日：2024-10-22

    申请号：US17979776

    申请日：2022-11-03

    Applicant: Keying Wu ,  Xiaobo Zhang ,  Lin Yang

    Inventor： Keying Wu ,  Xiaobo Zhang ,  Lin Yang

    IPC: H04L1/00 ,  H04L5/00 ,  H04L27/26 ,  H04W72/23

    CPC classification number: H04L1/0038 ,  H04L5/0053 ,  H04L5/0094 ,  H04L27/2676 ,  H04W72/23

    Abstract: The present disclosure provides a method and a device in a User Equipment (UE) and a base station for wireless communications. A UE receives first information, the first information being used for indicating M DCI blind decoding(s); monitors a first-type radio signal respectively on each of S sub-band(s) in a first time-domain resource; and performs at most M1 DCI blind decoding(s) of the M DCI blind decoding(s) on the S sub-band(s) in the first time-domain resource. Herein, the first-type radio signal detected on the S sub-band(s) is used for determining the M1 DCI blind decoding(s) out of the M DCI blind decoding(s). The above method allows the base station to make dynamic adjustments to the UE's blind decoding on PDCCH resources according to LBT results, ensuring that sufficient PDCCH resources are available and not too many PDSCH resources are preempted, and that excessive blind decodings can be avoided.

Patent Agency Ranking