排序方式: 共有6条查询结果,搜索用时 0 毫秒
1
1.
针对嵌入式系统设计中专用的串行外设接口SPI数量不能满足要求的问题,提出一种基于双移位器的FlexIO来模拟SPI通信总线的全新方案,首先阐述了FlexIO的硬件架构,然后在分析标准SPI通信协议的基础上,通过对其内部定时器,移位器与芯片引脚的合理配置并结合少量的软件编程设计,最终模拟出拥有全双工,同步功能的SPI通信总线。通过与标准SPI从机通信的实验,表明了用FlexIO模拟的SPI通信总线具有硬件配置灵活,软件需求少且通信可靠的优点,同时也对用它来模拟其他类型的串行通信总线提供了一定的参考价值。 相似文献
2.
3.
New exact periodic solutions to (2+1)-dimensional dispersive long wave equations 总被引:1,自引:0,他引:1 下载免费PDF全文
In this paper, we make use of the auxiliary equation and the expanded mapping methods to find the new exact periodic solutions for (2+1)-dimensional dispersive long wave equations in mathematical physics, which are expressed by Jacobi elliptic functions, and obtain some new solitary wave solutions (m → 1). This method can also be used to explore new periodic wave solutions for other nonlinear evolution equations. 相似文献
4.
5.
在初等教论中,历来只知道艾氏(Eratos-thenes)素数筛法。本文给出一种新的素数筛选程序,它依赖于如下命题。定理 (张文亮)2n 1为(奇)素数的充分必要条件是n≠(2k 1)m k(n,m,k∈N)。证明如果2n 1为合数,则必为二奇数之积,即有m,k∈N,使得2n 1=(2m 1)·(2k 1),则 n=(2k 1)m k反之,如果对某m,k∈N,使得n=(2k 1)m k,则 2n 1=2[(2k 1)m k] 1 =(2m 1)(2n 1)为合数,因此2n 1为(奇)素数的充要条件是:对任何m,k∈N,自然数n≠(2k 1)m k 定理表明,当n跑遍N={s|s≠(2k 1)·m k,s、m、k∈N}时,2n 1遍历奇素数集, 相似文献
6.
A New Method for Constructing Travelling Wave Solutions to the modified Benjamin--Bona--Mahoney Equation 下载免费PDF全文
We present a new method to find the exact travelling wave solutions of nonlinear evolution equations, with the aid of the symbolic computation. Based on this method, we successfully solve the modified BenjaminBona-Mahoney equation, and obtain some new solutions which can be expressed by trigonometric functions and hyperbolic functions, It is shown that the proposed method is direct, effective and can be used for many other nonlinear evolution equations in mathematical physics. 相似文献
1