会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 102. 发明授权
    • Channel estimation in a wireless communication system
    • 无线通信系统中的信道估计
    • US08023399B2
    • 2011-09-20
    • US11894282
    • 2007-08-20
    • Jung-Lin PanYounglok KimAriela Zeira
    • Jung-Lin PanYounglok KimAriela Zeira
    • H04J11/00H04B7/216H04B1/69H03D1/04
    • H04L25/0244H04L25/0224
    • A plurality of communication bursts are transmitted substantially simultaneously in a time slot of a time division duplex/code division multiple access communication system. The communication system has a maximum number of K midamble shifts. Each burst has an assigned midamble. Each midamble is a shifted version of a basic midamble code having a period of P. A combined signal is received. The combined signal includes a received version of each of the communication burst's midambles. A P by P square circulant matrix is constructed including the K midamble shifts. A channel response is determined for each of the K midamble shifts using a prime factor algorithm (PFA) discrete Fourier transform (DFT) algorithm, the received combined signal and the P by P square circulant matrix. The PFA DFT algorithm has a plurality of stages. Each stage has P inputs.
    • 在时分双工/码分多址通信系统的时隙中基本上同时发送多个通信脉冲串。 通信系统具有最大数量的K个中间码位移。 每个突发都有一个指定的中间码。 每个中间码是具有周期为P的基本中间码的移位版本。接收组合信号。 组合信号包括每个通信突发的中间码的接收版本。 构造P平方循环矩阵的P包括K个中间码位移。 使用素数因子算法(PFA)离散傅里叶变换(DFT)算法,接收的组合信号和P乘P平方循环矩阵,为每个K中间码位移确定信道响应。 PFA DFT算法具有多个阶段。 每个阶段都有P个输入。
    • 103. 发明授权
    • Fast joint detection base station
    • 快速联合检测基站
    • US07822103B2
    • 2010-10-26
    • US12290772
    • 2008-11-03
    • Parthapratim DeKyle Jung-Lin PanAriela Zeira
    • Parthapratim DeKyle Jung-Lin PanAriela Zeira
    • H04B1/69H04B7/216
    • H04B1/7105
    • A code division multiple access base station receives K data signals over a shared spectrum. The base station receives and samples a combined signal having the K transmitted data signals. A combined channel response matrix is produced. A block column of a cross correlation matrix is determined using the combined channel response matrix. Each block entry of the block column is a K by K matrix. A fourier transform of a complex conjugate transpose of the combined channel response matrix multiplied to the combined signal samples is taken. An inverse of a fourier transform of each block entry is multiplied to a result of the fourier transform to produce a fourier transform of the data vector. An inverse fourier transform of the data vector fourier transform is taken to produce data of the K signals.
    • 码分多址基站通过共享频谱接收K个数据信号。 基站接收并采样具有K个发送的数据信号的组合信号。 产生组合的通道响应矩阵。 使用组合信道响应矩阵来确定互相关矩阵的块列。 块列的每个块条目是K乘K矩阵。 采用乘以组合信号样本的组合信道响应矩阵的复共轭转置的傅立叶变换。 将每个块条目的傅立叶变换的倒数乘以傅里叶变换的结果,以产生数据向量的傅立叶变换。 采用数据向量傅立叶变换的逆傅立叶变换来产生K信号的数据。
    • 104. 发明授权
    • Multiuser detector for variable spreading factors
    • 用于可变扩散因子的多用户检测器
    • US07778232B2
    • 2010-08-17
    • US11588454
    • 2006-10-27
    • Alexander ReznikTimothy J. LubeckiAriela Zeira
    • Alexander ReznikTimothy J. LubeckiAriela Zeira
    • H04B7/216H04J1/16
    • H04B1/7105H04B1/7093H04B1/71052H04B2201/70703H04B2201/70705
    • A multiuser detector method and receiver that detects and decodes synchronous or asynchronous CDMA subchannels having different spreading factors with reduced computational complexity. The multiuser receiver is compatible with ZF-BLE, MMSE, decorrelating detectors and the like using Cholesky decomposition to minimize numeric operations. The receiver and method arranges the columns of system transmission response matrices representing the response characteristics of individual users into a total system transmission response matrix which represents a plurality of matched-filter responses for a given block of received data. The invention when used in conjunction with Cholesky decomposition reduces the number of required mathematic operations prior to parallel matched filtering.
    • 一种多用户检测器方法和接收机,其检测和解码具有不同扩展因子的同步或异步CDMA子信道,并降低计算复杂度。 多用户接收机与使用Cholesky分解的ZF-BLE,MMSE,去相关检测器等兼容,以最小化数字运算。 接收器和方法将表示各个用户的响应特性的系统传输响应矩阵的列排列成表示针对给定的接收数据块的多个匹配滤波器响应的总系统传输响应矩阵。 当与Cholesky分解结合使用时,本发明在并行匹配滤波之前减少了所需数学运算的数量。
    • 109. 发明申请
    • EFFICIENT JOINT DETECTION
    • 有效的联合检测
    • US20090129447A1
    • 2009-05-21
    • US12358739
    • 2009-01-23
    • Jaeyoung KwakJohn W. HaimAriela ZeiraJung-Lin Pan
    • Jaeyoung KwakJohn W. HaimAriela ZeiraJung-Lin Pan
    • H04B1/707
    • H04B1/71052H04B2201/70707
    • K data signals, or bursts, are transmitted over a shared spectrum in a code division multiple access communication format. A combined signal is received and sampled over the shared spectrum, as a plurality of received vector versions. The combined signal includes the K transmitted data signals. A plurality of system matrices and an associated covariance matrix using codes and estimated impulse responses of the K data signals is produced. Each system matrix corresponds to a received vector version. The system and covariance matrices are extended and approximated as block circulant matrices. A diagonal matrix of each of the extended and approximated system and covariance matrices are determined by prime factor algorithm-fast Fourier transform (PFA-FFT) without division of the matrix. The received vector versions are extended. A product of the diagonal matrices and the extended received vector versions is taken. An inverse block discrete Fourier transform is performed by a PFA-FFT on a result of the product to produce the estimated data of the K data signals.
    • K个数据信号或脉冲串以码分多址通信格式通过共享频谱发送。 组合信号在共享频谱上被接收和采样,作为多个接收的矢量版本。 组合信号包括K个发送的数据信号。 产生多个系统矩阵和使用K个数据信号的代码和估计的脉冲响应的相关协方差矩阵。 每个系统矩阵对应于接收到的矢量版本。 系统和协方差矩阵被扩展和近似为块循环矩阵。 每个扩展和近似的系统和协方差矩阵的对角矩阵由质数因子算法 - 快速傅里叶变换(PFA-FFT)确定,而不分割矩阵。 收到的矢量版本被扩展。 采用对角矩阵和扩展接收向量版本的乘积。 通过PFA-FFT对乘积的结果执行逆块离散傅里叶变换,以产生K个数据信号的估计数据。
    • 110. 发明申请
    • ADAPTIVE UPLINK/DOWNLINK TIMESLOT ASSIGNMENT IN A HYBRID WIRELESS TIME DIVISION MULTIPLE ACCESS/CODE DIVISION MULTIPLE ACCESS COMMUNICATION SYSTEM
    • 混合无线时间段自适应上行链路/下行链路时间分配多路访问/代码段多路访问通信系统
    • US20090109935A1
    • 2009-04-30
    • US12348637
    • 2009-01-05
    • Jung-Lin PanAriela Zeira
    • Jung-Lin PanAriela Zeira
    • H04B7/216
    • H04W72/0446H04B7/2618H04L5/0073H04L5/14H04W52/143H04W72/0413H04W72/042H04W72/082H04W72/1268H04W72/1273
    • A method of adaptive uplink/downlink timeslot assignment includes determining at least one of a potentially interfering cell which potentially interferes with a particular cell. A timeslot for uplink communication is eliminated, if a first one of the potentially interfering cells uses that timeslot for downlink communications. A timeslot for downlink communication is eliminated if a dynamic interference measurement in that timeslot as measured by most users exceeds a predetermined threshold and if a dynamic interference measurement in that timeslot does not exceed the predetermined threshold for most users but exceeds the predetermined threshold for at least one user. A timeslot is assigned to an uplink communication of the particular cell using non-uplink eliminated timeslots, and a timeslot is assigned to a downlink communication of the particular cell to each user using non-downlink eliminated timeslots with respect to that user.
    • 自适应上行链路/下行链路时隙分配的方法包括确定可能干扰特定小区的潜在干扰小区中的至少一个。 如果潜在干扰小区中的第一个小区使用该时隙用于下行链路通信,则消除用于上行链路通信的时隙。 如果大多数用户测量的该时隙中的动态干扰测量超过预定阈值,并且如果该时隙中的动态干扰测量对于大多数用户而言不超过预定阈值但是至少超过预定阈值,则消除用于下行链路通信的时隙 一个用户 使用非上行链路消除的时隙将时隙分配给特定小区的上行链路通信,并且使用相对于该用户的非下行链路消除的时隙将时隙分配给每个用户的特定小区的下行链路通信。