排序方式: 共有66条查询结果,搜索用时 15 毫秒
1.
传统的多载波调制都是采用对传输信道进行等带宽划分的方式。为了更好地适应信道传输特性,一个很有应用前景的发展方向是采用非等带宽划分信道的多载波调制方式。本文提出了一种利用正交小波包变换实现的非等带宽划分信道的多载波调制方法。理论分析和实验结果表明,这种方法对于提高信道的传输性能有很大的潜力。 相似文献
2.
在探讨了软件无线电的基本概念,基于软件无线电定义的发射平台结构及多抽样率数字信号处理的基本内容的基础上,着重探讨了软件无线电发射平台中多抽样率数字信号处理的应用,并以单边带调制信号(SSB)为例,指出与传统SSB产生方法不同的结构。 相似文献
3.
K. G. Arvanitis P. N. Paraskevopoulos 《Journal of Optimization Theory and Applications》1995,87(2):235-267
This paper deals with the problem of designing multirate-output contrlleers for sampled-dataH
-optimal control of linear continuous-time systems. Two formulations of the problem are studied. In the first, the intersample behavior of the disturbance and the controlled output signals is not considered, whereas in the second the continuous-time nature of these signals is taken into account. It is shown that, in both cases and unter appropriate conditions, it is plausible to reduce the repective initial problem to an associated discrete-timeH
-optimization problem for which a fictitious static state feedback controller is to be designed. This fact has a beneficial influence on the theoretical and numerical complexity of the problem, since only one algebraic Riccati equation is to be solved here, as compared to two algebraic Riccati equations needed in known techniques concerning theH
-optimization problem with dynamic measurement feedback.The work described in this paper has been partially funded by the General Secretariat for Research and Technology of the Greek Ministry of Industry, Research, and Technology and by the Heracles General Cement Company of Greece. 相似文献
4.
5.
针对可变扩频长度(VSL)的多速率DS/CDMA信号伪码周期的盲估计问题进行了研究,将一般单速率直扩信号二次功率谱伪码周期估计的方法扩展到多速率DS/CDMA模型。该方法首先将接收的多速率DS/CDMA信号进行采样,并对其求一次功率谱,再将一次谱作为输入信号作傅里叶变换并取模、平方,从而得到信号的二次功率谱。通过推导证明,多速率DS/CDMA信号的二次功率谱在扩频码周期的整数倍处出现尖锐的谱线,且不同速率用户的二次谱线幅度是不同的,利用这些幅度差异区分不同速率并通过估计谱线之间的距离即可获得不同速率信号的伪码周期。仿真表明该算法在低信噪比下适用,在-15 dB能够利用较少数据同时估计多组速率的伪码周期。 相似文献
6.
提出一种使用非最大抽取有限冲激响应(Finite Impulse Response,FIR)多率滤波器组结构对信道进行盲估计的方法。该方法对未知信道的特性不敏感,对于零点位于单位圆上的信道及非最小相位信道都可以进行准确的估计。在两种典型信道下对该方法进行了仿真,验证了该方法的性能。 相似文献
7.
Yuh‐Shyan Chen Chih‐Shun Hsu Po‐Ta Chen 《International Journal of Communication Systems》2010,23(5):596-632
The advanced technique of multiple beam antennas is recently considered in wireless networks to improve the system throughput by increasing spatial reuse, reducing collisions, and avoiding co‐channel interference. The usage of multiple beam antennas is similar to the concept of Space Division Multiple Access (SDMA), while each beam can be treated as a data channel. Wireless networks can increase the total throughput and decrease the transmission latency if the physical layer of a mobile node can support multirate capability. Multirate wireless networks incurs the anomaly problem, because low data rate hosts may influence the original performance of high data rate hosts. In this work, each node fits out multiple beam antennas with multirate capability, and a node can either simultaneously transmit or receive multiple data on multiple beams. Observe that the transmitting or receiving operation does not happen at the same time. In this paper, we propose a multiple relay‐based medium access control (MAC) protocol to improve the throughput for low data rate hosts. Our MAC protocol exploits multiple relay nodes and helps the source and the destination to create more than one data channel to significantly reduce the transmission latency. Observe that low data rate links with long‐distance transmission latencies are distributed by multiple relay nodes, hence the anomaly problem can be significantly alleviated. In addition, the ACK synchronization problem is solved to avoid the condition that source nodes do not receive ACKs from destination nodes. An adjustment operation is presented to reduce unnecessary relay nodes during the fragment burst period. Finally, simulation results illustrate that our multiple relay‐based MAC protocol can achieve high throughput and low transmission latency. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
8.
APGAN and RPMC: Complementary Heuristics for Translating DSP Block Diagrams into Efficient Software Implementations 总被引:3,自引:0,他引:3
Shuvra S. Bhattacharyya Praveen K. Murthy Edward A. Lee 《Design Automation for Embedded Systems》1997,2(1):33-60
Dataflow has proven to be an attractive computational model for graphical DSP design environments that support the automatic conversion of hierarchical signal flow diagrams into implementations on programmable processors. The synchronous dataflow (SDF) model is particularly well-suited to dataflow-based graphical programming because its restricted semantics offer strong formal properties and significant compile-time predictability, while capturing the behavior of a large class of important signal processing applications. When synthesizing software for embedded signal processing applications, critical constraints arise due to the limited amounts of memory. In this paper, we propose a solution to the problem of jointly optimizing the code and data size when converting SDF programs into software implementations.We consider two approaches. The first is a customization to acyclic graphs of a bottom-up technique, called pairwise grouping of adjacent nodes (PGAN), that was proposed earlier for general SDF graphs. We show that our customization to acyclic graphs significantly reduces the complexity of the general PGAN algorithm, and we present a formal study of our modified PGAN technique that rigorously establishes its optimality for a certain class of applications. The second approach that we consider is a top-down technique, based on a generalized minimum-cut operation, that was introduced recently in [14]. We present the results of an extensive experimental investigation on the performance of our modified PGAN technique and the top-down approach and on the trade-offs between them. Based on these results, we conclude that these two techniques complement each other, and thus, they should both be incorporated into SDF-based software implementation environments in which the minimization of memory requirements is important. We have implemented these algorithms in the Ptolemy software environment [5] at UC Berkeley. 相似文献
9.
10.