Sample size is very important in statistical research because it is not too small or too large. Given significant level α, the sample size is calculated based on the z-value and pre-defined error. Such error is defin...Sample size is very important in statistical research because it is not too small or too large. Given significant level α, the sample size is calculated based on the z-value and pre-defined error. Such error is defined based on the previous experiment or other study or it can be determined subjectively by specialist, which may cause incorrect estimation. Therefore, this research proposes an objective method to estimate the sample size without pre-defining the error. Given an available sample X = {X1, X2, ..., Xn}, the error is calculated via the iterative process in which sample X is re-sampled many times. Moreover, after the sample size is estimated completely, it can be used to collect a new sample in order to estimate new sample size and so on.展开更多
Error coding is suited when the transmission channel is noisy. This is the case of wireless communication. So to provide a reliable digital data transmission, we should use error detection and correction algorithms. I...Error coding is suited when the transmission channel is noisy. This is the case of wireless communication. So to provide a reliable digital data transmission, we should use error detection and correction algorithms. In this paper, we constructed a simulation study for four detection algorithms. The first three methods—hamming, LRC, and parity are common techniques in networking while the fourth is a proposed one called Signature. The results show that, the hamming code is the best one in term of detection but the worst one in term of execution time. Parity, LRC and signature have the same ability in detecting error, while the signature has a preference than all others methods in term of execution time.展开更多
针对经典盲均衡算法收敛速度较慢和稳态误差较大的问题,提出了一种基于变步长恒模算法(Constant Modulus Algorithm, CMA)和判决引导的最小均方(Decision Directed Least Mean Square, DD-LMS)算法的双模式切换盲均衡算法。在算法收敛...针对经典盲均衡算法收敛速度较慢和稳态误差较大的问题,提出了一种基于变步长恒模算法(Constant Modulus Algorithm, CMA)和判决引导的最小均方(Decision Directed Least Mean Square, DD-LMS)算法的双模式切换盲均衡算法。在算法收敛初期采用CMA算法,以确保算法可以较快收敛。在收敛之后切换至DD-LMS算法,以进一步降低稳态误差。通过设定阈值来切换算法,取相邻多次迭代误差的平均值作为算法的切换值,以确保算法切换时机的合理性。另外,引入Softsign变步长函数并加入3个参数对该函数进行改进,使得Softsign变步长函数可以依据不同信道环境设定最佳参数,同时提高算法的收敛速度。仿真结果表明,在卫星通用信道条件下,所提算法的收敛迭代次数约为1 000次,稳态误差为-12 dB,在信噪比为15 dB时,误码率为1×10~(-6)。与相关算法对比,所提算法的收敛速度较高,误码率和稳态误差较低。展开更多
论文研究了自适应最小均方误差(Least Mean Squares,LMS)滤波算法的步长选取问题。在分析现有算法的基础上,通过构造步长与误差信号之间的非线性函数,提出一种新的变步长LMS算法。新算法采用误差信号的自相关估计值控制步长,而不是直接...论文研究了自适应最小均方误差(Least Mean Squares,LMS)滤波算法的步长选取问题。在分析现有算法的基础上,通过构造步长与误差信号之间的非线性函数,提出一种新的变步长LMS算法。新算法采用误差信号的自相关估计值控制步长,而不是直接利用瞬时误差控制步长,避免了噪声干扰,降低了稳态失调,可工作于低信噪比环境。同时新算法步长控制无记忆效应,提高了收敛速度。仿真表明,新算法的稳态失调和收敛速度均优于现有变步长LMS算法。展开更多
文摘Sample size is very important in statistical research because it is not too small or too large. Given significant level α, the sample size is calculated based on the z-value and pre-defined error. Such error is defined based on the previous experiment or other study or it can be determined subjectively by specialist, which may cause incorrect estimation. Therefore, this research proposes an objective method to estimate the sample size without pre-defining the error. Given an available sample X = {X1, X2, ..., Xn}, the error is calculated via the iterative process in which sample X is re-sampled many times. Moreover, after the sample size is estimated completely, it can be used to collect a new sample in order to estimate new sample size and so on.
文摘Error coding is suited when the transmission channel is noisy. This is the case of wireless communication. So to provide a reliable digital data transmission, we should use error detection and correction algorithms. In this paper, we constructed a simulation study for four detection algorithms. The first three methods—hamming, LRC, and parity are common techniques in networking while the fourth is a proposed one called Signature. The results show that, the hamming code is the best one in term of detection but the worst one in term of execution time. Parity, LRC and signature have the same ability in detecting error, while the signature has a preference than all others methods in term of execution time.
文摘论文研究了自适应最小均方误差(Least Mean Squares,LMS)滤波算法的步长选取问题。在分析现有算法的基础上,通过构造步长与误差信号之间的非线性函数,提出一种新的变步长LMS算法。新算法采用误差信号的自相关估计值控制步长,而不是直接利用瞬时误差控制步长,避免了噪声干扰,降低了稳态失调,可工作于低信噪比环境。同时新算法步长控制无记忆效应,提高了收敛速度。仿真表明,新算法的稳态失调和收敛速度均优于现有变步长LMS算法。
