You limited your search to:

  Partner: UNT Libraries
 Collection: UNT Theses and Dissertations
Matlab Implementation of a Tornado Forward Error Correction Code

Matlab Implementation of a Tornado Forward Error Correction Code

Date: May 2011
Creator: Noriega, Alexandra
Description: This research discusses how the design of a tornado forward error correcting channel code (FEC) sends digital data stream profiles to the receiver. The complete design was based on the Tornado channel code, binary phase shift keying (BPSK) modulation on a Gaussian channel (AWGN). The communication link was simulated by using Matlab, which shows the theoretical systems efficiency. Then the data stream was input as data to be simulated communication systems using Matlab. The purpose of this paper is to introduce the audience to a simulation technique that has been successfully used to determine how well a FEC expected to work when transferring digital data streams. The goal is to use this data to show how FEC optimizes a digital data stream to gain a better digital communications systems. The results conclude by making comparisons of different possible styles for the Tornado FEC code.
Contributing Partner: UNT Libraries
A New Wireless Sensor Node Design for Program Isolation and Power Flexibility

A New Wireless Sensor Node Design for Program Isolation and Power Flexibility

Date: December 2009
Creator: Skelton, Adam W.
Description: Over-the-air programming systems for wireless sensor networks have drawbacks that stem from fundamental limitations in the hardware used in current sensor nodes. Also, advances in technology make it feasible to use capacitors as the sole energy storage mechanism for sensor nodes using energy harvesting, but most current designs require additional electronics. These two considerations led to the design of a new sensor node. A microcontroller was chosen that meets the Popek and Goldberg virtualization requirements. The hardware design for this new sensor node is presented, as well as a preliminary operating system. The prototypes are tested, and demonstrated to be sustainable with a capacitor and solar panel. The issue of capacitor leakage is considered and measured.
Contributing Partner: UNT Libraries
Physical-Layer Network Coding for MIMO Systems

Physical-Layer Network Coding for MIMO Systems

Date: May 2011
Creator: Xu, Ning
Description: The future wireless communication systems are required to meet the growing demands of reliability, bandwidth capacity, and mobility. However, as corruptions such as fading effects, thermal noise, are present in the channel, the occurrence of errors is unavoidable. Motivated by this, the work in this dissertation attempts to improve the system performance by way of exploiting schemes which statistically reduce the error rate, and in turn boost the system throughput. The network can be studied using a simplified model, the two-way relay channel, where two parties exchange messages via the assistance of a relay in between. In such scenarios, this dissertation performs theoretical analysis of the system, and derives closed-form and upper bound expressions of the error probability. These theoretical measurements are potentially helpful references for the practical system design. Additionally, several novel transmission methods including block relaying, permutation modulations for the physical-layer network coding, are proposed and discussed. Numerical simulation results are presented to support the validity of the conclusions.
Contributing Partner: UNT Libraries
Server load balancing.

Server load balancing.

Access: Use of this item is restricted to the UNT Community.
Date: December 2002
Creator: Kanuri, Jaichandra
Description: Server load balancing technology has obtained much attention as much business proceeded towards e-commerce. The idea behind is to have set of clustered servers that share the load as against a single server to achieve better performance and throughput. In this problem in lieu of thesis, I propose and evaluate an implementation of a prototype scalable server. The prototype consists of a load-balanced cluster of hosts that collectively accept and service TCP connections. The host IP addresses are advertised using the Round Robin DNS technique, allowing any host to receive requests from any client. Once a client attempts to establish a TCP connection with one of the hosts, a decision is made as to whether or not the connection should be redirected to a different host namely, the host with the lowest number of established connections. This problem in lieu of thesis outlines the history of load balancing, various options available today and finally approach for implementing the prototype and the corresponding findings.
Contributing Partner: UNT Libraries
Techniques for Improving Uniformity in Direct Mapped Caches

Techniques for Improving Uniformity in Direct Mapped Caches

Date: May 2011
Creator: Nwachukwu, Izuchukwu Udochi
Description: Directly mapped caches are an attractive option for processor designers as they combine fast lookup times with reduced complexity and area. However, directly-mapped caches are prone to higher miss-rates as there are no candidates for replacement on a cache miss, hence data residing in a cache set would have to be evicted to the next level cache. Another issue that inhibits cache performance is the non-uniformity of accesses exhibited by most applications: some sets are under-utilized while others receive the majority of accesses. This implies that increasing the size of caches may not lead to proportionally improved cache hit rates. Several solutions that address cache non-uniformity have been proposed in the literature. These techniques have been proposed over the past decade and each proposal independently claims the benefit of reduced conflict misses. However, because the published results use different benchmarks and different experimental setups, (there is no established frame of reference for comparing these results) it is not easy to compare them. In this work we report a side-by-side comparison of these techniques. Finally, we propose and Adaptive-Partitioned cache for multi-threaded applications. This design limits inter-thread thrashing while dynamically reducing traffic to heavily accessed sets.
Contributing Partner: UNT Libraries
Source and Channel Coding Strategies for Wireless Sensor Networks

Source and Channel Coding Strategies for Wireless Sensor Networks

Date: December 2012
Creator: Li, Li
Description: In this dissertation, I focus on source coding techniques as well as channel coding techniques. I addressed the challenges in WSN by developing (1) a new source coding strategy for erasure channels that has better distortion performance compared to MDC; (2) a new cooperative channel coding strategy for multiple access channels that has better channel outage performances compared to MIMO; (3) a new source-channel cooperation strategy to accomplish source-to-fusion center communication that reduces system distortion and improves outage performance. First, I draw a parallel between the 2x2 MDC scheme and the Alamouti's space time block coding (STBC) scheme and observe the commonality in their mathematical models. This commonality allows us to observe the duality between the two diversity techniques. Making use of this duality, I develop an MDC scheme with pairwise complex correlating transform. Theoretically, I show that MDC scheme results in: 1) complete elimination of the estimation error when only one descriptor is received; 2) greater efficiency in recovering the stronger descriptor (with larger variance) from the weaker descriptor; and 3) improved performance in terms of minimized distortion as the quantization error gets reduced. Experiments are also performed on real images to demonstrate these benefits. Second, I present a ...
Contributing Partner: UNT Libraries
A Study of Anti-collision Multi-tag Identification Algorithms for Passive RFID Systems

A Study of Anti-collision Multi-tag Identification Algorithms for Passive RFID Systems

Date: May 2010
Creator: Kamineni, Neelima
Description: The major advantages of radio frequency identification (RFID) technology over barcodes are that the RFID-tagged objects do not require to be in line-of-sight with the reader for their identification and multiple objects can be read simultaneously. But when multiple objects are read simultaneously there is always a problem of collision which reduces the efficiency of the system. This thesis presents a comprehensive study of the dynamic framed slotted ALOHA (DFSA)-based anti-collision multi-tag identification algorithms for passive RFID system. Performance of various DFSA algorithms is compared through extensive simulation results. In addition, a number of simple performance improvement techniques have also been investigated in this thesis, including improved estimation techniques for the number of tags in each read cycle and a low-complexity heuristic stopping criterion that can be easily implemented in the practical system.
Contributing Partner: UNT Libraries
Timing and Congestion Driven Algorithms for FPGA Placement

Timing and Congestion Driven Algorithms for FPGA Placement

Date: December 2006
Creator: Zhuo, Yue
Description: Placement is one of the most important steps in physical design for VLSI circuits. For field programmable gate arrays (FPGAs), the placement step determines the location of each logic block. I present novel timing and congestion driven placement algorithms for FPGAs with minimal runtime overhead. By predicting the post-routing timing-critical edges and estimating congestion accurately, this algorithm is able to simultaneously reduce the critical path delay and the minimum number of routing tracks. The core of the algorithm consists of a criticality-history record of connection edges and a congestion map. This approach is applied to the 20 largest Microelectronics Center of North Carolina (MCNC) benchmark circuits. Experimental results show that compared with the state-of-the-art FPGA place and route package, the Versatile Place and Route (VPR) suite, this algorithm yields an average of 8.1% reduction (maximum 30.5%) in the critical path delay and 5% reduction in channel width. Meanwhile, the average runtime of the algorithm is only 2.3X as of VPR.
Contributing Partner: UNT Libraries
A Quality of Service Aware Protocol for Power Conservation in Wireless Ad Hoc and Mobile Networks

A Quality of Service Aware Protocol for Power Conservation in Wireless Ad Hoc and Mobile Networks

Access: Use of this item is restricted to the UNT Community.
Date: December 2002
Creator: Gangidi, Murali
Description: Power consumption is an important issue for mobile computers since they rely on the short life of batteries. Conservation techniques are commonly used in hardware design of such systems but network interface is a significant consumer of power, which needs considerable research to be devoted towards designing a low-power design network protocol stack. Due to the dynamic nature of wireless networks, adaptations are necessary to achieve energy efficiency and a reasonable quality of service. This paper presents the application of energy-efficient techniques to each layer in the network protocol stack and a feedback is provided depending on the performance of this new design. And also a comparison of two existing MAC protocols is done showing a better suitability of E2MAC for higher power conservation. Multimedia applications can achieve an optimal performance if they are aware of the characteristics of the wireless link. Relying on the underlying operating system software and communication protocols to hide the anomalies of wireless channel needs efficient energy consumption methodology and fair quality of service like E2MAC. This report also focuses on some of the various concerns of energy efficiency in wireless communication and also looks into the definition of seven layers as defined by International ...
Contributing Partner: UNT Libraries
A Comparison of Agent-Oriented Software Engineering Frameworks and Methodologies

A Comparison of Agent-Oriented Software Engineering Frameworks and Methodologies

Date: December 2003
Creator: Lin, Chia-En
Description: Agent-oriented software engineering (AOSE) covers issues on developing systems with software agents. There are many techniques, mostly agent-oriented and object-oriented, ready to be chosen as building blocks to create agent-based systems. There have been several AOSE methodologies proposed intending to show engineers guidelines on how these elements are constituted in having agents achieve the overall system goals. Although these solutions are promising, most of them are designed in ad-hoc manner without truly obeying software developing life-cycle fully, as well as lacking of examinations on agent-oriented features. To address these issues, we investigated state-of-the-art techniques and AOSE methodologies. By examining them in different respects, we commented on the strength and weakness of them. Toward a formal study, a comparison framework has been set up regarding four aspects, including concepts and properties, notations and modeling techniques, process, and pragmatics. Under these criteria, we conducted the comparison in both overview and detailed level. The comparison helped us with empirical and analytical study, to inspect the issues on how an ideal agent-based system will be formed.
Contributing Partner: UNT Libraries