Search

Classification of trabecular bone aims at discriminating different types of trabeculae. This paper proposes a method to perform a soft classification from binary 3D images. In a first step, the local structure tensor is used to estimate a membership degree of every voxel to three different classes, plate-, rod- and junction-like trabeculae. In a second step, the global structure tensor of plate-like trabeculae is compared with the local orientation of rod-like trabeculae in order to discriminate aligned from non-aligned rods. Results show that soft classification can be used for estimating independent parameters of trabecular bone for every different class, by using the classification as a weighting function., ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Rodrigo Moreno, Magnus Borga and Örjan Smedby, Soft Classification of trabeculae in Trabecular Bone, 2011, IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 1641-1644.

Classification of trabecular bone aims at discriminating different types of trabeculae. This paper proposes a method to perform a soft classification from binary 3D images. In a first step, the local structure tensor is used to estimate a membership degree of every voxel to three different classes, plate-, rod- and junction-like trabeculae. In a second step, the global structure tensor of plate-like trabeculae is compared with the local orientation of rod-like trabeculae in order to discriminate aligned from non-aligned rods. Results show that soft classification can be used for estimating independent parameters of trabecular bone for every different class, by using the classification as a weighting function., ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Rodrigo Moreno, Magnus Borga and Örjan Smedby, Soft Classification of trabeculae in Trabecular Bone, 2011, IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 1641-1644.

We consider low complexity precoding for the Multiple Input Single Output (MISO)Gaussian Broadcast channel with $N_t$ antennas at the base station and $N_u$ singleantenna users in the downlink. Theoretical studies have suggested high throughputcommunication with increasing spatial dimensions i.e., $\min(N_t,N_u)$.Nevertheless, most modern communication standards are unable to exploitthe spatial dimension fully, since they are restricted to orthogonal communicationtechniques like TDMA/FDMA (Time/Frequency Division Multiplexed Access) which areknown to be sub-optimal.This restriction is mostly due to the prohibitive complexity of optimal/near-optimalprecoding schemes.On the other hand low complexity techniques like Zero Forcing (ZF) and MMSE have poor sum rate performance.In this paper, we propose a novel low-complexity user grouping based precoding scheme whichschedules all users on the same time-frequency resource (i.e., optimal utilization of resources).The proposed precoder is analytically shown to achieve a sum rate performance significantly better than the ZF precoderat similar complexity.Through simulations, it is also observed to achieve a significant fractionof the sum rate achieved by the optimal schemes., ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Saif Khan Mohammed and Erik G. Larsson, A low complexity user grouping based multiuser MISO downlink precoder, 2011, accepted for IEEE GLOBECOM 2011

When generating a sine table to be used in, e.g., frequency synthesis circuits, a widely used way to assign the table content is to simply take a sine wave with the desired amplitude and quantize it using rounding.This results in uncontrolled rounding of up to 0.5 LSB, causing some noise.In this paper we present a method for increasing the signal quality, simply by adjust the amplitude within a ±0.5 range from the intended. This will not affect the maximum value of the sinusoid, but can increase the spurious free dynamic range with some dB.

Functional connectivity analysis is a way to investigate how different parts of the brain are connected and interact. A common measure of connectivity is the temporal correlation between a reference voxel time series and all the other time series in a functional MRI data set. An fMRI data set generally contains more than 20,000 within-brain voxels, making a complete correlation analysis between all possible combinations of voxels heavy to compute, store, visualize and explore. In this paper, a GPU-accelerated interactive tool for investigating functional connectivity in fMRI data is presented. A reference voxel can be moved by the user and the correlations to all other voxels are calculated in real-time using the graphics processing unit (GPU). The resulting correlation map is updated in real-time and visualized as a 3D volume rendering together with a high resolution anatomical volume. This tool greatly facilitates the search for interesting connectivity patterns in the brain.

This paper presents a 512-point feedforward FFT architecture for wireless personal area network (WPAN). The architecture processes a continuous flow of 8 samples in parallel, leading to a throughput of 2.64 GSamples/s. The FFT is computed in three stages that use radix-8 butterflies. This radix reduces significantly the number of rotators with respect to previous approaches based on radix-2. Besides, the proposed architecture uses the minimum memory that is required for a 512-point 8-parallel FFT. Experimental results show that besides its high throughput, the design is efficient in area and power consumption, improving the results of previous approaches. Specifically, for a wordlength of 16 bits, the proposed design consumes 61.5 mW and its area is 1.43 mm2.

Modelica is a modern, strongly typed, declarative, equation-based, and object-oriented (EOO) language for modeling and simulation of complex cyber-physical systems. Major features are: ease of use, visual design of models with combination of lego-like predefined model building blocks, ability to define model libraries with reusable components, support for modeling and simulation of complex applications involving parts from several application domains, and many more useful facilities. This paper gives an overview of some aspects of the Modelica language and the OpenModelica environment - the most complete Modelica open-source tool for modeling, simulation, and development of Modelica applications. Special features are MetaModeling for efficient model transformations, the ModelicaML profile for UML-Modelica cyber-physical hardware-software modeling, as well as generation of parallel code for multi-core architectures.

In contrast to IEEE 1149.1, IEEE P1687 allows, through segment insertion bits, flexible scan paths for accessing on-chip instruments, such as test, debug, monitoring, measurement and configuration features. Flexible access to embedded instruments allows test time reduction, which is important at production test. However, the test access scheme should be carefully selected such that resource constraints are not violated and power constraints are met. For IEEE P1687, we detail in this paper session-based and session-less test scheduling, and propose resource and power-aware test scheduling algorithms for the detailed scheduling types. Results using the implementation of our algorithms shows on ITC’02-based benchmarks significant test time reductions when compared to non-optimized test schedules.

Long Term Evolution (LTE) of 3GPP provides high bandwidth for data transfer. Having high bandwidth transfer will exhaust the user equipment (UE)'s battery power quickly. To extend the UE's battery lifetime the 3GPP standards for LTE support Enhanced Discontinuous Reception (DRX). The DRX allow an idle UE to save battery by turning off the radio receiver for a predefined period. Since the Transmission Time Interval (TTI) is related to the size of the data block passed from the higher networks layers to the radio link layer, the DRX scheduler should vary the resource allocation of each user basis on TTI. In this paper, we have evaluated the influences of the TTI sizes as well as the effects of LTE DRX Light and Deep Sleep mode on power consumption for Voice and Web traffic., ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Scott Fowler , Study on Power Saving Based on Radio Frame in LTE Wireless Communication System Using DRX, 2011, IEEE Globecom Workshop on Workshop of SCPA and SaCoNAS., Swedish Excellence Center at Linkoping - Lund in information Technology (ELLIIT)

We consider low complexity precoding for the Multiple Input Single Output (MISO)Gaussian Broadcast channel with $N_t$ antennas at the base station and $N_u$ singleantenna users in the downlink. Theoretical studies have suggested high throughputcommunication with increasing spatial dimensions i.e., $\min(N_t,N_u)$.Nevertheless, most modern communication standards are unable to exploitthe spatial dimension fully, since they are restricted to orthogonal communicationtechniques like TDMA/FDMA (Time/Frequency Division Multiplexed Access) which areknown to be sub-optimal.This restriction is mostly due to the prohibitive complexity of optimal/near-optimalprecoding schemes.On the other hand low complexity techniques like Zero Forcing (ZF) and MMSE have poor sum rate performance.In this paper, we propose a novel low-complexity user grouping based precoding scheme whichschedules all users on the same time-frequency resource (i.e., optimal utilization of resources).The proposed precoder is analytically shown to achieve a sum rate performance significantly better than the ZF precoderat similar complexity.Through simulations, it is also observed to achieve a significant fractionof the sum rate achieved by the optimal schemes., ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Saif Khan Mohammed and Erik G. Larsson, A low complexity user grouping based multiuser MISO downlink precoder, 2011, accepted for IEEE GLOBECOM 2011

Monitoring and tracking human activities around restricted areas is an important issue in security and surveillance applications. The movement of different parts of the human body generates unique micro-Doppler features which can be extracted effectively using joint time-frequency analysis. In this paper, we describe the simultaneous tracking of both location and micro-Doppler features of a human using particle filters (PF). The results obtained using the data from a 77 GHz radar prove the successful usage of particle filters in tracking micro-Doppler features of the human gait.

In this paper, we present a model-based video coding method that uses input from colour and depth cameras, such as the Microsoft Kinect. The model-based approach uses a 3D representation of the scene, enabling several other applications besides video playback. Some of these applications are stereoscopic viewing, object insertion for augmented reality and free viewpoint viewing. The video encoding step uses computer vision to estimate the camera motion. The scene geometry is represented by keyframes, which are encoded as 3D quadsusing a quadtree, allowing good compression rates. Camera motion in-between keyframes is approximated to be linear. The relative camera positions at keyframes and the scene geometry are then compressed and transmitted to the decoder. Our experiments demonstrate that the model-based approach delivers a high level of detail at competitively low bitrates.

Classification of trabecular bone aims at discriminating different types of trabeculae. This paper proposes a method to perform a soft classification from binary 3D images. In a first step, the local structure tensor is used to estimate a membership degree of every voxel to three different classes, plate-, rod- and junction-like trabeculae. In a second step, the global structure tensor of plate-like trabeculae is compared with the local orientation of rod-like trabeculae in order to discriminate aligned from non-aligned rods. Results show that soft classification can be used for estimating independent parameters of trabecular bone for every different class, by using the classification as a weighting function., ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Rodrigo Moreno, Magnus Borga and Örjan Smedby, Soft Classification of trabeculae in Trabecular Bone, 2011, IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 1641-1644.

Modelica is a modern, strongly typed, declarative, equation-based, and object-oriented (EOO) language for modeling and simulation of complex cyber-physical systems. Major features are: ease of use, visual design of models with combination of lego-like predefined model building blocks, ability to define model libraries with reusable components, support for modeling and simulation of complex applications involving parts from several application domains, and many more useful facilities. This paper gives an overview of some aspects of the Modelica language and the OpenModelica environment - the most complete Modelica open-source tool for modeling, simulation, and development of Modelica applications. Special features are MetaModeling for efficient model transformations, the ModelicaML profile for UML-Modelica cyber-physical hardware-software modeling, as well as generation of parallel code for multi-core architectures.

Manga is a five Nation (Germany, France, Italy, Sweden and United Kingdom) joint project realized by the European Defence Agency (EDA) which focuses on SiC substrates and a GaN epi wafers supply chain. The main objective of the project, started in March 2010, is to sustain the industrial development of semi-insulating silicon carbide substrates (SI SiC) and prove the industrial capability of Europe to deliver GaN HEMT and MMIC foundries with state-of-the-art GaN HEMT epitaxial wafers on SI-SiC substrates. This paper gives an overview on the current status of the technical developments achieved within the project.

This paper presents a 512-point feedforward FFT architecture for wireless personal area network (WPAN). The architecture processes a continuous flow of 8 samples in parallel, leading to a throughput of 2.64 GSamples/s. The FFT is computed in three stages that use radix-8 butterflies. This radix reduces significantly the number of rotators with respect to previous approaches based on radix-2. Besides, the proposed architecture uses the minimum memory that is required for a 512-point 8-parallel FFT. Experimental results show that besides its high throughput, the design is efficient in area and power consumption, improving the results of previous approaches. Specifically, for a wordlength of 16 bits, the proposed design consumes 61.5 mW and its area is 1.43 mm2.

We consider low complexity precoding for the Multiple Input Single Output (MISO)Gaussian Broadcast channel with $N_t$ antennas at the base station and $N_u$ singleantenna users in the downlink. Theoretical studies have suggested high throughputcommunication with increasing spatial dimensions i.e., $\min(N_t,N_u)$.Nevertheless, most modern communication standards are unable to exploitthe spatial dimension fully, since they are restricted to orthogonal communicationtechniques like TDMA/FDMA (Time/Frequency Division Multiplexed Access) which areknown to be sub-optimal.This restriction is mostly due to the prohibitive complexity of optimal/near-optimalprecoding schemes.On the other hand low complexity techniques like Zero Forcing (ZF) and MMSE have poor sum rate performance.In this paper, we propose a novel low-complexity user grouping based precoding scheme whichschedules all users on the same time-frequency resource (i.e., optimal utilization of resources).The proposed precoder is analytically shown to achieve a sum rate performance significantly better than the ZF precoderat similar complexity.Through simulations, it is also observed to achieve a significant fractionof the sum rate achieved by the optimal schemes., ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Saif Khan Mohammed and Erik G. Larsson, A low complexity user grouping based multiuser MISO downlink precoder, 2011, accepted for IEEE GLOBECOM 2011

The IEEE P1687 (IJTAG) standard proposal aimsat standardizing the access to embedded test and debug logic(instruments) via the JTAG TAP. P1687 specifies a componentcalled Segment Insertion Bit (SIB) which makes it possible toconstruct a multitude of alternative P1687 instrument accessnetworks for a given set of instruments. Finding the best accessnetwork with respect to instrument access time and the numberof SIBs is a time-consuming task in the absence of EDA support.This paper is the first to describe a P1687 design automationtool which constructs and optimizes P1687 networks. Our EDAtool, called PACT, considers the concurrent and sequential accessschedule types, and is demonstrated in experiments on industrialSOCs, reporting total access time and average access time.

Dynamic OFDMA has been recognized as a promising technique forimproving the performance of future wireless cellularsystems. However, this potential performance improvement comes at thecost of additional signaling overhead, which can have a non-negligibleeffect on the system efficiency. In this paper, we propose a newmethod for optimizing the frame length for the downlink in OFDMAsystems. The method maximizes the system efficiency by taking intoaccount both the channel conditions and the amount of signalingoverhead needed to deliver scheduling maps to the users. We formulatethe frame length optimization problem mathematically. By exploitingthe structure of this problem, we develop an algorithm that solves asequence of dynamic programming problems. Simulation results revealsome insight into fundamental limitations as well as provide guidelinesfor the design of dynamic OFDMA systems.

We consider low complexity precoding for the Multiple Input Single Output (MISO)Gaussian Broadcast channel with $N_t$ antennas at the base station and $N_u$ singleantenna users in the downlink. Theoretical studies have suggested high throughputcommunication with increasing spatial dimensions i.e., $\min(N_t,N_u)$.Nevertheless, most modern communication standards are unable to exploitthe spatial dimension fully, since they are restricted to orthogonal communicationtechniques like TDMA/FDMA (Time/Frequency Division Multiplexed Access) which areknown to be sub-optimal.This restriction is mostly due to the prohibitive complexity of optimal/near-optimalprecoding schemes.On the other hand low complexity techniques like Zero Forcing (ZF) and MMSE have poor sum rate performance.In this paper, we propose a novel low-complexity user grouping based precoding scheme whichschedules all users on the same time-frequency resource (i.e., optimal utilization of resources).The proposed precoder is analytically shown to achieve a sum rate performance significantly better than the ZF precoderat similar complexity.Through simulations, it is also observed to achieve a significant fractionof the sum rate achieved by the optimal schemes., ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Saif Khan Mohammed and Erik G. Larsson, A low complexity user grouping based multiuser MISO downlink precoder, 2011, accepted for IEEE GLOBECOM 2011

When generating a sine table to be used in, e.g., frequency synthesis circuits, a widely used way to assign the table content is to simply take a sine wave with the desired amplitude and quantize it using rounding.This results in uncontrolled rounding of up to 0.5 LSB, causing some noise.In this paper we present a method for increasing the signal quality, simply by adjust the amplitude within a ±0.5 range from the intended. This will not affect the maximum value of the sinusoid, but can increase the spurious free dynamic range with some dB.

Functional connectivity analysis is a way to investigate how different parts of the brain are connected and interact. A common measure of connectivity is the temporal correlation between a reference voxel time series and all the other time series in a functional MRI data set. An fMRI data set generally contains more than 20,000 within-brain voxels, making a complete correlation analysis between all possible combinations of voxels heavy to compute, store, visualize and explore. In this paper, a GPU-accelerated interactive tool for investigating functional connectivity in fMRI data is presented. A reference voxel can be moved by the user and the correlations to all other voxels are calculated in real-time using the graphics processing unit (GPU). The resulting correlation map is updated in real-time and visualized as a 3D volume rendering together with a high resolution anatomical volume. This tool greatly facilitates the search for interesting connectivity patterns in the brain.

Functional connectivity analysis is a way to investigate how different parts of the brain are connected and interact. A common measure of connectivity is the temporal correlation between a reference voxel time series and all the other time series in a functional MRI data set. An fMRI data set generally contains more than 20,000 within-brain voxels, making a complete correlation analysis between all possible combinations of voxels heavy to compute, store, visualize and explore. In this paper, a GPU-accelerated interactive tool for investigating functional connectivity in fMRI data is presented. A reference voxel can be moved by the user and the correlations to all other voxels are calculated in real-time using the graphics processing unit (GPU). The resulting correlation map is updated in real-time and visualized as a 3D volume rendering together with a high resolution anatomical volume. This tool greatly facilitates the search for interesting connectivity patterns in the brain.

This paper introduces reconfigurable nonuniform transmultiplexers (TMUXs) based on fixed uniform modulated filter banks (FBs). The TMUXs use parallel processing where polyphase components, of any user, are processed by a number of synthesis FB and analysis FB branches. One branch represents one granularity band, and any user can occupy integer multiples of a granularity band. The proposed TMUX also requires adjustable commutators so that any user occupies any portion of the frequency spectrum. The location and width of this portion can be modified without additional arithmetic complexity or filter redesign. This paper considers both cosine modulated and modified discrete Fourier transform FBs. It discusses the filter design, TMUX realization, and the parameter selection. It is shown that one can indeed decrease the arithmetic complexity by proper choice of system parameters. For the critically sampled case and if the number of channels is higher than necessary, we can reduce the arithmetic complexity. In case of an oversampled system, the arithmetic complexity can be reduced by proper choice of the number of channels and the roll-off factor of the prototype filter. The proposed TMUX is compared to existing reconfigurable TMUXs, and examples are provided for illustration.

When generating a sine table to be used in, e.g., frequency synthesis circuits, a widely used way to assign the table content is to simply take a sine wave with the desired amplitude and quantize it using rounding.This results in uncontrolled rounding of up to 0.5 LSB, causing some noise.In this paper we present a method for increasing the signal quality, simply by adjust the amplitude within a ±0.5 range from the intended. This will not affect the maximum value of the sinusoid, but can increase the spurious free dynamic range with some dB.

Functional connectivity analysis is a way to investigate how different parts of the brain are connected and interact. A common measure of connectivity is the temporal correlation between a reference voxel time series and all the other time series in a functional MRI data set. An fMRI data set generally contains more than 20,000 within-brain voxels, making a complete correlation analysis between all possible combinations of voxels heavy to compute, store, visualize and explore. In this paper, a GPU-accelerated interactive tool for investigating functional connectivity in fMRI data is presented. A reference voxel can be moved by the user and the correlations to all other voxels are calculated in real-time using the graphics processing unit (GPU). The resulting correlation map is updated in real-time and visualized as a 3D volume rendering together with a high resolution anatomical volume. This tool greatly facilitates the search for interesting connectivity patterns in the brain.

In this paper, we propose two spectrally efficient adaptive partial decode-and-forward (DF)cooperative communication schemes, which are adaptive partialrepetition DF with quantized feedback (APR-DF-QF) and adaptivepartial coded cooperation DF with quantized feedback (APCC-DF-QF).We assume the relay node only has partial channel-state information, which is obtainedvia an quantized feedback link. We use the so-called mutual information (MI)model to adaptively optimize the amount of data that need to beforwarded by the relay node under a given block-error-rateconstraint. Simulation results show that with the optimized feedback, the MI model can predict well theoptimal amount of information that needs to be forwarded by therelay node, and that the two proposed schemes can substantiallyincrease the spectral efficiency.

When generating a sine table to be used in, e.g., frequency synthesis circuits, a widely used way to assign the table content is to simply take a sine wave with the desired amplitude and quantize it using rounding.This results in uncontrolled rounding of up to 0.5 LSB, causing some noise.In this paper we present a method for increasing the signal quality, simply by adjust the amplitude within a ±0.5 range from the intended. This will not affect the maximum value of the sinusoid, but can increase the spurious free dynamic range with some dB.

With the emergence of bandwidth intensive applications new methodologies need to be developed for improvement of network blocking performance, without supplying extra resources in dynamic wavelength-division-multiplexing (WDM) networks. Rerouting is one among the viable and cost-effective solutions to reduce the blocking probability (BP) of optical WDM networks. Similarly, set-up delay tolerance, a metric of service level agreement (SLA) has been exploited in [1]-[3] for improvement in network BP. In this paper, we study the rerouting in dynamic WDM network and analyze two different lightpath rerouting strategies. Moreover, we investigate further improvement in network BP by exploiting these rerouting techniques for network provisioned with set-up delay tolerance. Through extensive simulation studies, we confirm that the rerouting strategies decrease the BP substantially for network provisioned with set-up delay tolerance, even for smaller set-up delay tolerance value i.e. when the connection requests are impatient to wait for provisioning in the network. However, it also reduce BP significantly even when the network is not provisioned with set-up delay tolerance.

Modelica is a modern, strongly typed, declarative, equation-based, and object-oriented (EOO) language for modeling and simulation of complex cyber-physical systems. Major features are: ease of use, visual design of models with combination of lego-like predefined model building blocks, ability to define model libraries with reusable components, support for modeling and simulation of complex applications involving parts from several application domains, and many more useful facilities. This paper gives an overview of some aspects of the Modelica language and the OpenModelica environment - the most complete Modelica open-source tool for modeling, simulation, and development of Modelica applications. Special features are MetaModeling for efficient model transformations, the ModelicaML profile for UML-Modelica cyber-physical hardware-software modeling, as well as generation of parallel code for multi-core architectures.

Modelica is a modern, strongly typed, declarative, equation-based, and object-oriented (EOO) language for modeling and simulation of complex cyber-physical systems. Major features are: ease of use, visual design of models with combination of lego-like predefined model building blocks, ability to define model libraries with reusable components, support for modeling and simulation of complex applications involving parts from several application domains, and many more useful facilities. This paper gives an overview of some aspects of the Modelica language and the OpenModelica environment - the most complete Modelica open-source tool for modeling, simulation, and development of Modelica applications. Special features are MetaModeling for efficient model transformations, the ModelicaML profile for UML-Modelica cyber-physical hardware-software modeling, as well as generation of parallel code for multi-core architectures.

Modelica is a modern, strongly typed, declarative, equation-based, and object-oriented (EOO) language for modeling and simulation of complex cyber-physical systems. Major features are: ease of use, visual design of models with combination of lego-like predefined model building blocks, ability to define model libraries with reusable components, support for modeling and simulation of complex applications involving parts from several application domains, and many more useful facilities. This paper gives an overview of some aspects of the Modelica language and the OpenModelica environment - the most complete Modelica open-source tool for modeling, simulation, and development of Modelica applications. Special features are MetaModeling for efficient model transformations, the ModelicaML profile for UML-Modelica cyber-physical hardware-software modeling, as well as generation of parallel code for multi-core architectures.

Classification of trabecular bone aims at discriminating different types of trabeculae. This paper proposes a method to perform a soft classification from binary 3D images. In a first step, the local structure tensor is used to estimate a membership degree of every voxel to three different classes, plate-, rod- and junction-like trabeculae. In a second step, the global structure tensor of plate-like trabeculae is compared with the local orientation of rod-like trabeculae in order to discriminate aligned from non-aligned rods. Results show that soft classification can be used for estimating independent parameters of trabecular bone for every different class, by using the classification as a weighting function., ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Rodrigo Moreno, Magnus Borga and Örjan Smedby, Soft Classification of trabeculae in Trabecular Bone, 2011, IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 1641-1644.

We consider low complexity precoding for the Multiple Input Single Output (MISO)Gaussian Broadcast channel with $N_t$ antennas at the base station and $N_u$ singleantenna users in the downlink. Theoretical studies have suggested high throughputcommunication with increasing spatial dimensions i.e., $\min(N_t,N_u)$.Nevertheless, most modern communication standards are unable to exploitthe spatial dimension fully, since they are restricted to orthogonal communicationtechniques like TDMA/FDMA (Time/Frequency Division Multiplexed Access) which areknown to be sub-optimal.This restriction is mostly due to the prohibitive complexity of optimal/near-optimalprecoding schemes.On the other hand low complexity techniques like Zero Forcing (ZF) and MMSE have poor sum rate performance.In this paper, we propose a novel low-complexity user grouping based precoding scheme whichschedules all users on the same time-frequency resource (i.e., optimal utilization of resources).The proposed precoder is analytically shown to achieve a sum rate performance significantly better than the ZF precoderat similar complexity.Through simulations, it is also observed to achieve a significant fractionof the sum rate achieved by the optimal schemes., ©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Saif Khan Mohammed and Erik G. Larsson, A low complexity user grouping based multiuser MISO downlink precoder, 2011, accepted for IEEE GLOBECOM 2011

When generating a sine table to be used in, e.g., frequency synthesis circuits, a widely used way to assign the table content is to simply take a sine wave with the desired amplitude and quantize it using rounding.This results in uncontrolled rounding of up to 0.5 LSB, causing some noise.In this paper we present a method for increasing the signal quality, simply by adjust the amplitude within a ±0.5 range from the intended. This will not affect the maximum value of the sinusoid, but can increase the spurious free dynamic range with some dB.

Functional connectivity analysis is a way to investigate how different parts of the brain are connected and interact. A common measure of connectivity is the temporal correlation between a reference voxel time series and all the other time series in a functional MRI data set. An fMRI data set generally contains more than 20,000 within-brain voxels, making a complete correlation analysis between all possible combinations of voxels heavy to compute, store, visualize and explore. In this paper, a GPU-accelerated interactive tool for investigating functional connectivity in fMRI data is presented. A reference voxel can be moved by the user and the correlations to all other voxels are calculated in real-time using the graphics processing unit (GPU). The resulting correlation map is updated in real-time and visualized as a 3D volume rendering together with a high resolution anatomical volume. This tool greatly facilitates the search for interesting connectivity patterns in the brain.

In this paper, a low-complexity symbol detector is presentedtargeting the emerging 3GPP LTE andWiMAX standards. The detector isthe VLSI implementation of a novel MIMO detection algorithm recentlyproposed. Compared to the design in the reference, the detector performsbetter while consumes less silicon area. Including a microcode controlledchannel preprocessing unit and a pipelined detection unit, it is flexibleenough to cover different standards and transmission schemes whilemaintaining the power and area efficiency. Implemented using 65 nmCMOS process, the detector can support real-time detection of 20 MHzbandwidth 3GPP LTE or 10 MHz WiMAX downlink physical channel.

Recent research has shown that different defects can manifest themselves as failures at different temperature spectra. Therefore, we need multi-temperature testing which applies tests at different temperature levels. In this paper, we discuss the need and problems for testing core-based systems-on-chip at different temperatures. To address the long test time problem for multitemperature test, we propose a test scheduling technique that generates the shortest test schedules while keeping the cores under test within a temperature interval. Experimental results show the efficiency of the proposed technique.

In this paper, a new asymmetric 6T (AS6T) SRAM cell is presented in a standard 90-nm CMOS technology employing separate bitline and wordline for read operation. Utilizing separate bitline and wordline during read operation decouples the other cell node from the bitline, hence, enhancing the read static noise margin (SNM) by almost 2 times as compared to the conventional 6T SRAM. The read SNM of 6T and AS6T SRAM cells during a read operation in 1.0 V supply is 85 mV and 159 mV, respectively. The mean μ of the hold SNM for both cells are well above 140 mV, however, the μ of the conventional 6T SRAM is larger than that of AS6T cell. The impact of process parameter variations on read and hold noise margin of the asymmetric 6T cell and the conventional 6T cell, considering various supply voltages, is investigated. The results demonstrate yield improvement, up to 99.5%, and indicate that the supply voltage can scale down to 0.45 V.

In today's automotive vehicles, electromagnetic interference (EMI) from electronic circuits has become a serious concern. The discussion in this paper proves that a clock signal generated by a resonant clock distribution network exhibits better EMI performance compared to that of a conventional buffer-driven clock network. This discussion is supported by analyzing different clock spectrums and using a simple model of simultaneous switching noise (SSN). According to simulation results presented in a 90-nm CMOS process, using a sinusoidal clock instead of a trapezoidal one, the magnitude of the first tone in the spectrum of SSN is reduced at least by 6.7 dB.

This paper presents reliability measurements of a differential Class-E power amplifier (PA) operating at 850MHz in 130nm CMOS. The RF performance of five samples was tested. At 1.1V, the PAs deliver +20.4–21.5dBm of output power with drain efficiencies and power-added efficiencies of 56–64% and 46–51%, respectively. After a continuous long-term test of 240 hours at elevated supply voltage of 1.4V, the output power dropped about 0.7dB.

With new technologies, temperature has become a major issue to be considered at system level design. In this paper we propose a temperature aware idle time distribution technique for energy optimization with dynamic voltage scaling (DVS). A temperature analysis approach is also proposed which is accurate and, yet, sufficiently fast to be used inside the optimization loop for idle time distribution and voltage selection.

In this paper a calibration technique for high-resolution, flash analog- to-digital converters (ADCs) based on histogram test methods is proposed. A probability density function, PDF, generator circuit is utilized to generate a triangular signal with a constant PDF, i.e., uniform distribution, as a test signal. In the proposed technique both offset estimation and trimming are performed without imposing any changes on the comparator structure in the ADC. The proposed algorithm estimates the offset values and stores them in a RAM. The trimming circuit uses the stored values and performs the trimming by adjusting the reference voltages to the comparators. An 8-bit flash ADC with a 1-V reference voltage, a comparator offset distribution with σos ≈ 30 mV, and a 10-bit test signal with about 3% nonlinearity are used in the simulations. The results show that the calibration improves the DNL and INL from about 3.6/3.9 LSB to about 0.9/0.75 LSB, respectively.

In this paper we present a calibration technique for sigma-delta analog-to-digital converters (ΣΔADC) in which highspeed, low-resolution flash subADCs are used. The calibration technique as such is mainly targeting calibration of the flash subADC, but we also study how the correction depends on where in the ΣΔ modulator the calibration signals are applied. It is shown that the calibration technique can cope with errors that occur in the feedback digital-to-analog converter (DAC) and the input accumulator. Behavioral-level simulation results show an improvement of in effective number of bits (ENOB) from 6.6 to 11.3. Fairly large offset and gain errors have been introduced which illustrates a robust calibration technique.

In this paper, modified low-complex, hybrid architectures for digital, oversampled sigma-delta digital-to-analog converters (ΣΔDACs) are explored in terms of signal-to-noise ratio (SNR) and subDAC complexity. The studied techniques illustrate the trade-off in terms of noise-shaper and DAC implementation complexity and loss in SNR. It is found that a fair amount of improvement in SNR is achieved by maintaining low-complexity of noise shaper. The complexity of the subDAC is yet a parameter, directly related to the number of output bits from the noise shaper. Two different architectures are investigated with respect to subDAC complexity and noise shaper complexity. It is shown that the required number of DAC unit elements (DUE) can be reduced to half.

In this paper we propose a distributed approachto construct vicinity resource maps at each node in a delay-tolerant network. The scheme uses recent encounters to estimatethe availability of the following resources: energy, buffer space,and bandwidth, in the vicinity of a given node. We then show howa store-carry-forward scheme may benefit from having accessto these resource estimates. While knowledge about resourcesavailable in the vicinity allows nodes to implement meaningfulcustodian election strategies, an evaluation of available band-width and contact time allows them to carry out adaptivequeue management strategies. Thus, such strategies can beapproached from a holistic perspective based on the availabilityof the three resources under consideration in node proximity. Wevalidate our model separately in time-varying and space-varyingenvironments. In addition to synthetic mobility models (randomwaypoint) we validate our resource estimation in a disasterarea mobility model (using Bonn motion traces). We show thatby using this information a routing protocol may dramaticallyimprove its delivery rate and reduce energy overhead whilekeeping delivery latency almost constant.

Most computer science (CS) and software engineering (SE) curricula include some form of SE project with the aim of lowering the gap between CS and SE education and real-world demands in industry. In this paper we briefly discuss and explain our findings of software engineering projects taught at LiU in Sweden. These courses use what we call the ¿tail¿ approach, where student projects are performed at the end of a degree program. We then argue that there are several problems with this approach and sketch an idea where SE projects are an integrated part of a curriculum. Furthermore, pros and cons of this idea, which we call the SE project ¿backbone¿ approach, are discussed and analyzed.

This paper considers transmission of scheduling information in OFDMA-based cellular communication systems such as 3GPP long-term evolution (LTE). These systems provide efficient usage of radio resources by allowing users to be scheduled dynamically in both frequency and time. This requires considerable amounts of scheduling information to be sent to the users. The paper compares two basic transmission strategies: transmitting a separate scheduling message to each user versus broadcasting a joint scheduling message to all users. Different scheduling granularities are considered, as well as different scheduling algorithms. The schemes are evaluated in the context of the LTE downlink using multiuser system simulations, assuming a full-buffer situation. The results show that separate transmission of the scheduling information requires a slightly lower overhead than joint broadcasting, when proportional fair scheduling is employed and the users are spread out over the cell area. The results also indicate that the scheduling granularity standardized for LTE provides a good trade-off between scheduling granularity and overhead., ©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Reza Moosavi, Jonas Eriksson, Erik G. Larsson, Niclas Wiberg, Pål Frenger and Fredrik Gunnarsson, Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA, 2010, IEEE Transactions on Vehicular Technology.http://dx.doi.org/10.1109/TVT.2010.2066589

This paper considers transmission of scheduling information in OFDMA-based cellular communication systems such as 3GPP long-term evolution (LTE). These systems provide efficient usage of radio resources by allowing users to be scheduled dynamically in both frequency and time. This requires considerable amounts of scheduling information to be sent to the users. The paper compares two basic transmission strategies: transmitting a separate scheduling message to each user versus broadcasting a joint scheduling message to all users. Different scheduling granularities are considered, as well as different scheduling algorithms. The schemes are evaluated in the context of the LTE downlink using multiuser system simulations, assuming a full-buffer situation. The results show that separate transmission of the scheduling information requires a slightly lower overhead than joint broadcasting, when proportional fair scheduling is employed and the users are spread out over the cell area. The results also indicate that the scheduling granularity standardized for LTE provides a good trade-off between scheduling granularity and overhead., ©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Reza Moosavi, Jonas Eriksson, Erik G. Larsson, Niclas Wiberg, Pål Frenger and Fredrik Gunnarsson, Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA, 2010, IEEE Transactions on Vehicular Technology.http://dx.doi.org/10.1109/TVT.2010.2066589

Parallel, radix-4 turbo decoding is used to enhance the throughput and at the same time reduce the overall memory cost. The bottleneck is the higher complexity associated with radix-4 parallel interleaver implementation. This paper addresses the implementation issues of radix-4, parallel interleaver and also proposes necessary modifications in the interleaver algorithms for parallel address generation. It presents a re-configurable architecture which enables the use of same turbo decoding core to be used for multiple standards. The proposed interleaver architecture is capable of handling the memory conflicts on-the-fly. It consumes 12.5K gates and can run at a frequency of 285MHz, thus supporting a throughput of 173.3Mpbs, which can cover most of the emerging communication standards.