In this paper, we study topology-independent link activation (TILA) transmission scheduling protocols for multihop code-division multiple-access (CDMA) packet radio networks. We focus on quality-ofservice (QoS) provisioning for each communication link, particularly when node mobility is considered. We examine the requirements of link activation (LA) transmission scheduling, and show that block ...

This document describes a secret-key cryptosystem MISTY1, which is block cipher with a 128-bit key, a 64-bit block and a variable number of rounds. It documents the algorithm description including key scheduling part and data randomizing part.

The IEEE 802.16 standard defines the ARQ mechanism as a part of the MAC layer. The functioning of the ARQ mechanism depends on a number of parameters. The IEEE 802.16 specification defines them but it does not provide concrete values and solutions. This paper studies the key features and parameters of the 802.16 ARQ mechanism. In particular, we consider a choice for the ARQ feedback type, an al...

Instruction scheduling is a necessary step in compiling for many modern microprocessors. Traditionally, global instruction scheduling techniques have outperformed local techniques. However many of the global scheduling techniques described in the literature have a side effect of increasing the size of compiled code. In an embedded system, the size of compiled code is often a critical issue. In ...

Broadcasting offers a bandwidth-efficient way of delivering popular content in media-on-demand (MoD) systems. Harmonic windows scheduling (HWS) is a mathematical framework that is relevant to bandwidth minimization in MoD broadcasting. Given c channels, the optimal HWS problem tries to schedule as many pages of a video as possible in the c channels. Let κ be the largest integer n satisfying Hn ...

This paper provides an overview of the DITTO (Developing Integrated Tools to Optimise) project and presents some of its initial findings. The aim of DITTO is to increase the practical capacity of railway systems by developing computerised tools that can determine the theoretical capacity of a given infrastructure, optimise timetables in the face of delays and optimise real-time traffic manageme...

A distribution-graph based scheduling algorithm is proposed together with an extended tree growing technique to deal with the problem of unequal-length block-test scheduling under power dissipation constraints. The extended tree growing technique is used in combination with the classical scheduling approach in order to improve the test concurrency having assigned power dissipation limits. Its g...

In this paper we present a genetic scheduling algorithm to support the synthesis of structured data paths with the aim of producing designs with a predictable layout structure and conserving on-chip wiring resources. The data path is organized as architectural blocks (A-block) with local functional unit (FU), memory elements and internal interconnections. The A-blocks are interconnected by a fe...

Scheduling imposes a trade-off between sum capacity and fairness among users. In some situations, fairness needs to be given the first priority. Therefore, a scheduling algorithm which can flexibly control sum capacity and fairness is desirable. In this paper, assuming the single-carrier frequency division multiple access (SC-FDMA), we propose three scheduling algorithms: modified max-map, prop...

A left-edge algorithm approach is proposed in this paper to deal with the problem of unequal-length block-test scheduling under power dissipation constraints. An extended tree growing technique is also used in combination with the left-edge algorithm in order to improve the test concurrency under power dissipation limits. Test scheduling examples and experiments are discussed highlighting furth...