共查询到20条相似文献,搜索用时 390 毫秒
1.
2.
针对传统SLM(选择映射)算法降低SFBC(空频分组码)MIMO-OFDM(多输入多输出正交频分复用)系统PAPR(峰均功率比)且需要传输边信息的缺陷,提出一种改进的不传输边信息且检测复杂度低的半盲SLM算法。为了将边信息嵌入发送信号并降低接收端半盲检测的复杂度,所提算法将两根天线上的符号序列分成奇偶两部分,并对其中一部分乘以相位因子用于接收端检测边信息。分析和仿真结果表明,该算法大大降低了接收复杂度,且有很好的BER(误码率)性能。 相似文献
3.
针对大规模多用户多输入多输出(MIMO)系统中基站端检测复杂度高的问题,提出了一种低复杂度、基于强制收敛的变量节点全信息高斯消息传播迭代检测(VFI-GMPID-FC)算法.首先对传统的GMPID算法进行改进,得到VFI-GMPID算法,VFI-GMPID算法的检测性能逼近最小均方误差检测(MMSE)算法,但复杂度要大大低于MMSE算法.然后结合强制收敛思想和VFI-GMPID,提出VFI-GMPID-FC算法,进一步降低算法复杂度,提升检测效率.最后通过仿真结果表明,所提算法在保证检测性能的同时,能有效地降低算法的复杂度. 相似文献
4.
针对可见光通信(Visible Light Communication,VLC)系统中传统非对称限幅光正交频分复用(ACO-OFDM)及直流偏置光正交频分复用(DCO-OFDM)系统存在的不足,提出了一种基于DCO-OFDM与脉冲幅度调制-离散多音频调制(PAM-DMT)混合技术传输方案,并给出了一种接收端低复杂度信号检测算法.该混合传输系统不仅可以通过改变调制方式以得到更为灵活的数据传输速率,还可以在相同数据速率下叠加较小的直流信号.最后通过蒙特卡洛仿真验证了所提设计的有效性. 相似文献
5.
6.
7.
8.
丁春辉贺光辉 《微电子学与计算机》2017,(2):6-9
提出了一种适用于上行链路大规模MIMO系统的基于Kaczmarz算法的低复杂度检测算法.通过将MMSE检测算法转化成等效的增广矩阵的形式,提出的算法同时避免了直接矩阵求逆和Gram矩阵求解.此外,一种算法初始值的估计方法和近似的软判决信息计算方法也被提出用于进一步降低算法复杂度.仿真结果表明该算法在性能和计算复杂度方面优于近期文献中的算法.同时,FPGA的验证结果也表明提出的算法能以更低的硬件资源消耗完成大规模MIMO系统的检测. 相似文献
9.
提出了一种低复杂度次优编码MIMO系统软检测算法.在编码MIMO系统的迭代译码中,信道译码需要MIMO检测输出每一比特的软信息,而软信息的计算需要巨大的计算量.本文在不同的迭代次数中分别利用球形译码的硬判决信息和编码比特先验信息得到发射向量的估计值.在这个估计值的基础上计算MIMO检测中每一比特的软信息,从而避免了常规的穷尽搜索检测算法,减少了复杂度.通过分析和仿真,本算法在有限性能损失的前提下使复杂度得到了极大减少.在相同没置下,本算法的一帧数据仿真时间不到原算法的1/20,并且对于不同的调制方式复杂度基本不变,达到了性能和复杂度的较好折中. 相似文献
10.
提出了一种用于多用户多带超宽带系统的低复杂度动态资源分配方案,该方案在满足所有用户数据速率请求和给定的误比特率前提下,可以最小化总的系统传输功率.分析和实验表明,提出的算法与现有方法相比,性能只有很少的损失,却可以显著降低运算的复杂度.复杂度的降低主要通过把一般性的限制性优化问题转化为线性编程问题,并在求解线性编程问题的过程中寻找更好的初始解.此外,还通过对相邻的副载波进行分簇,亦降低了算法的复杂度,并为系统设计提供了更多的灵活性.最后,还通过实验研究了簇的大小和用户数目对算法和系统的影响. 相似文献
11.
In this paper we present a Base-matrix based decoder architecture for multi-rate QC-LDPC codes proposed in broadband broadcasting system. We use the Modified Min-Sum Algorithm (MMSA) as the decoding algorithm in this architecture, which lowers the complexity of the LDPC decoder while keeping almost the same performance or even better. Based on this algorithm, we designed a novel check node processing unit to reduce the complexity of the decoder and facilitate the multiplex of the processing units. The decoder designed with hardware constraints is not only scalable in throughput, but also easily configurable to support different QC-LDPC codes flexible in code rate and code length. 相似文献
12.
A novel class of binary parallel concatenated recursive systematic convolutional codes termed turbo-codes, having amazing error correcting capabilities, has previously been proposed. However, the decoding of turbo-codes relies on the application of soft input/soft output decoders. Such decoders can be realized either using maximum a posteriori (MAP) symbol estimators or MAP sequence estimators, e.g., the a priori soft output Viterbi algorithm (APRI-SOVA). In this paper, the structure of turbo-code encoders as well as of turbo-code decoders is described. In particular, four different decoder structures are illustratively characterized and their error rate performance capabilities compared in both additive white Gaussian noise (AWGN) as well as flat Rayleigh-fading channels based on extensive simulation results for short frames used for speech transmission in the uplink of a digital mobile radio system applying code division multiple access and joint detection. The decoders are investigated as follows: 1) the MAP symbol estimator-based approach used by Berrou et al. [1993], 2) the MAP symbol estimator-based approach used by Robertson [1994], 3) a new reduced complexity MAP symbol estimator-based approach [Jung 1995], and 4) an APRI-SOVA based approach used by Hagenauer et al. [1994] 相似文献
13.
14.
15.
Hanho Lee 《Circuits and Systems II: Express Briefs, IEEE Transactions on》2005,52(8):461-465
This paper presents a high-speed low-complexity Reed-Solomon (RS) decoder architecture using a novel pipelined recursive modified Euclidean (PrME) algorithm block for very high-speed optical communications. The RS decoder features a low-complexity key equation solver using a PrME algorithm block. The recursive structure enables the novel low-complexity PrME algorithm block to be implemented. Pipelining and parallelizing allow the inputs to be received at very high fiber-optic rates, and outputs to be delivered at correspondingly high rates with minimum delay. This paper presents the key ideas applied to the design of an 80-Gb/s RS decoder architecture, especially that for achieving high throughput and reducing complexity. The 80-Gb/s 16-channel RS decoder has been designed and implemented using 0.13-/spl mu/m CMOS technology in a supply voltage of 1.2 V. The proposed RS decoder has a core gate count of 393 K and operates at a clock rate of 625 MHz. 相似文献
16.
17.
提出了将码分复用(CDM)模块看作系统等效信道的一部分,从而在MIMO-OFDM-CDM系统中引入Turbo迭代检测的措施。使用Turbo迭代检测可以通过解码器和解调器之间软信息的多次迭代提高译码的性能。根据CDM模块的特点,提出了将等效多天线之间的干扰视为高斯噪声,从而降低Turbo迭代检测算法复杂度的措施。仿真结果表明,在系统中使用Turbo迭代检测可以在有限次迭代后达到比传统算法更低的误码率。 相似文献
18.
19.
一种600bps极低速率语音编码算法 总被引:1,自引:0,他引:1
该文针对抗干扰通信中对低速率语音编码算法的应用需求,提出了一种600bps极低速率语音编码算法,采用6帧超帧结构,超帧中包括2个基本帧与4个插值帧。插值帧的线性预测(LPC)参数采用基于闭环最优一阶线性预测的4阶段残差矩阵量化;在解码端,提出了闭环的激励脉冲幅度估计方法,提高了合成语音的自然度与鼻音音节的清晰度。该算法可以提供良好的合成语音质量,DRT测试结果达到88.55分。 相似文献
20.
A flexible and low-complexity entropy-constrained vector quantizer (ECVQ) scheme based on Gaussian mixture models (GMMs), lattice quantization, and arithmetic coding is presented. The source is assumed to have a probability density function of a GMM. An input vector is first classified to one of the mixture components, and the Karhunen-Lo`eve transform of the selected mixture component is applied to the vector, followed by quantization using a lattice structured codebook. Finally, the scalar elements of the quantized vector are entropy coded sequentially using a specially designed arithmetic coder. The computational complexity of the proposed scheme is low, and independent of the coding rate in both the encoder and the decoder. Therefore, the proposed scheme serves as a lower complexity alternative to the GMM based ECVQ proposed by Gardner, Subramaniam and Rao [1]. The performance of the proposed scheme is analyzed under a high-rate assumption, and quantified for a given GMM. The practical performance of the scheme was evaluated through simulations on both synthetic and speech line spectral frequency (LSF) vectors. For LSF quantization, the proposed scheme has a comparable performance to [1] at rates relevant for speech coding (20-28 bits per vector) with lower computational complexity. 相似文献