会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • Delayed branch decision in quadrature decomposition with M-searching
    • 通过M搜索在正交分解中延迟分支决策
    • US20080162902A1
    • 2008-07-03
    • US11706821
    • 2007-02-12
    • Wei LiHaifeng WangJorma LillebergMing ChenShixin Cheng
    • Wei LiHaifeng WangJorma LillebergMing ChenShixin Cheng
    • G06F9/00
    • H04L25/03216H04L2025/03426
    • A QRD-M decomposition includes a first and a sequential second stage, at least. In the first stage, M branches are selected from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated. In the second stage, more than M branches are selected from among those branches entering the second stage as survive branches from which multiple decompositions are calculated. The symbol of the received signal is decided from a branch that is a survive branch of both the first and second stages. The second stage may be within a window that may include additional stages at which the pruning decision down to M survive branches is delayed. One or more windows may be used in a single QRD-M decomposition. In an embodiment, all branches entering the second stage are survive branches. It is shown that the marginal increased computational load increases accuracy.
    • QRD-M分解至少包括第一和第二阶段。 在第一阶段,从分支进入第一阶段的M个分支中选出M个分支作为计算多个分解的生存分支。 在第二阶段,从进入第二阶段的那些分支中选出超过M个分支作为计算多重分解的生存分支。 接收信号的符号由作为第一和第二级的存活分支的分支决定。 第二阶段可能在一个窗口内,可能包括另外一个阶段,在此阶段,由M延续出来的剪枝决定被延迟。 单个QRD-M分解中可以使用一个或多个窗口。 在一个实施例中,进入第二阶段的所有分支都是能够分支的。 显示边际增加的计算负载提高了精度。
    • 5. 发明授权
    • Delayed branch decision in quadrature decomposition with M-searching
    • 通过M搜索在正交分解中延迟分支决策
    • US07844008B2
    • 2010-11-30
    • US11706821
    • 2007-02-12
    • Wei LiHaifeng WangJorma LillebergMing ChenShixin Cheng
    • Wei LiHaifeng WangJorma LillebergMing ChenShixin Cheng
    • H04L5/12H04L23/02
    • H04L25/03216H04L2025/03426
    • A QRD-M decomposition includes a first and a sequential second stage, at least. In the first stage, M branches are selected from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated. In the second stage, more than M branches are selected from among those branches entering the second stage as survive branches from which multiple decompositions are calculated. The symbol of the received signal is decided from a branch that is a survive branch of both the first and second stages. The second stage may be within a window that may include additional stages at which the pruning decision down to M survive branches is delayed. One or more windows may be used in a single QRD-M decomposition. In an embodiment, all branches entering the second stage are survive branches. It is shown that the marginal increased computational load increases accuracy.
    • QRD-M分解至少包括第一和第二阶段。 在第一阶段,从分支进入第一阶段的M个分支中选出M个分支作为计算多个分解的生存分支。 在第二阶段,从进入第二阶段的那些分支中选出超过M个分支作为计算多重分解的生存分支。 接收信号的符号由作为第一和第二级的存活分支的分支决定。 第二阶段可能在一个窗口内,可能包括另外一个阶段,在此阶段,由M延续出来的剪枝决定被延迟。 单个QRD-M分解中可以使用一个或多个窗口。 在一个实施例中,进入第二阶段的所有分支都是能够分支的。 显示边际增加的计算负载提高了精度。
    • 8. 发明授权
    • OFDM transceiver structure with time-domain scrambling
    • 具有时域扰频的OFDM收发器结构
    • US07564906B2
    • 2009-07-21
    • US10781041
    • 2004-02-17
    • Haifeng WangJorma Lilleberg
    • Haifeng WangJorma Lilleberg
    • H04L27/28
    • H04L27/2602H04L25/03866
    • A method and transceiver for wireless multicarrier communications. At the transmitter side, conventional OFDM symbols, after inverse fast Fourier Transform, are scrambled in time domain and then guard-interval (GI) inserted, up-converted at the carrier frequency for transmission. At the receiver side, after GI removal and frequency domain channel equalization, the received signal is transformed into time-domain by inverse fast Fourier Transform. The time-domain equalized signal is descrambled in time domain and then transformed back to the frequency domain before it is rate-matched, demodulated and decoded. This time-domain scrambling and descrambling method can be used in a wireless OFDM system such as WLAN, cellular OFDM, and MC-CDMA.
    • 一种用于无线多载波通信的方法和收发器。 在发射机侧,在快速傅里叶逆变换之后的常规OFDM符号在时域中加扰,然后在载波频率上插入保护间隔(GI)进行上变频以进行传输。 在接收机侧,GI去除和频域信道均衡后,通过快速傅里叶逆变换将接收信号转换为时域。 时域均衡信号在时域中被解扰,然后在速率匹配,解调和解码之前被转换回到频域。 该时域加扰和解扰方法可用于诸如WLAN,蜂窝OFDM和MC-CDMA的无线OFDM系统中。
    • 9. 发明授权
    • Method and apparatus providing bit-to-symbol mapping for space-time codes
    • 为时空代码提供比特到符号映射的方法和装置
    • US06700926B1
    • 2004-03-02
    • US09710936
    • 2000-11-13
    • Markku J. HeikkilaJorma Lilleberg
    • Markku J. HeikkilaJorma Lilleberg
    • H04B138
    • H03M13/25H04L1/0618
    • A method for optimizing a bit-to-symbol mapping operation. The method has steps of (a) determining a most probable symbol selection error made during a space-time decoding operation; and (b) selecting a bits-to-symbol mapper such that a bit-to-symbol mapping step results in a most probable symbol selection error, made during a space-time decoding operation, causes a minimal number of bit errors. The bits-to-symbol mapping step can be carried out so as to minimize an average number of bit errors resulting from an occurrence of the most probable symbol selection error, as well as from an occurrence of at least a second most probable symbol selection error, during the space-time decoding operation. A space-time coded communications system that operates in accordance with the method is also disclosed.
    • 用于优化位到符号映射操作的方法。 该方法具有以下步骤:(a)确定在空时解码操作期间产生的最可能的符号选择错误; 以及(b)选择比特到符号映射器,使得比特到符号映射步骤导致在空时解码操作期间产生的最可能的符号选择错误导致最小数量的位错误。 可以执行比特到符号映射步骤,以便最小化由最可能的符号选择错误的发生导致的平均比特错误数,以及从至少第二最可能符号选择错误的发生 ,在空时解码操作期间。 还公开了根据该方法操作的时空编码通信系统。
    • 10. 发明授权
    • Calculating estimates and decisions of parameters for receiver
    • 计算接收机参数的估计和决策
    • US5881097A
    • 1999-03-09
    • US742064
    • 1996-10-31
    • Jorma LillebergMarkku Juntti
    • Jorma LillebergMarkku Juntti
    • H04B1/707H04B15/00H04K1/00H04L27/30
    • H04B1/707
    • A receiving method and a receiver comprising circuit elements that are arranged to calculate estimates for parameters of a received signal in two or more stages, for processing the signal iteratively by means of an observation time-slot of a given length and containing a plurality of samples, and for sliding the observation time-slot over the received samples. In order to avoid complicated matrix operations, the receiver comprises circuit elements for sliding the observation time-slot in such a way that successive observation time-slots partly overlap, and for employing, upon calculating the estimates and decisions of parameters in each observation time-slot, estimates provided by the previous observation time-slot as initial values for those samples that fall within the previous observation time-slot, and estimates provided by the previous stage for those samples that do not fall within the previous observation time-slot.
    • 一种接收方法和接收机,包括电路元件,其被布置成以两级或更多级计算接收信号的参数的估计,用于通过给定长度的观测时隙迭代地处理信号并且包含多个采样 并且用于在所接收的样本上滑动观察时隙。 为了避免复杂的矩阵运算,接收机包括用于滑动观测时隙的电路元件,使得连续观测时隙部分重叠,并且在计算每个观测时间段中的参数的估计和决定时, 时隙,由先前观察时隙提供的估计值作为落在先前观察时隙内的那些采样的初始值,以及由前一级为不在前一观测时隙内的那些采样提供的估计。