This paper brings to light the reasoning and principles shaping the standardization direction in the 3rd Generation Partnership Project (3GPP) regarding provision of low complexity Machine Type Communication (MTC), via Long Term Evolution (LTE) of 3GPP. It elaborates 3GPP's approaches and suggestions towards addressing the physical layer challenges and discusses solutions 3GPP proposed specifically in relation to the low complexity operation of MTC devices and the coverage extension of current cellular networks to challenging scenarios of MTC. Results of comprehensive set of simulations are presented to assess the impact of repetition coding and power boosting on the physical downlink shared channel (PDSCH). In addition, novel ideas are presented to reduce the complexity of channel estimation, one of the most computation intensive blocks in the baseband receive chain. These results all leap towards finding the physical layer design for low cost MTC devices via 3GPP LTE.

This paper highlights the significant evolutionary potential in wireless communication networks, taking account of falling costs of RF hardware and increasing availability of powerful centralized signal processing. This so-called 'cloud of antennas' allows a central radio controller to manage a large number of remote antennas (RAs) with increasing control over their radio and radio access network behavior. By introducing autonomous terminal reporting and coordination of broadcast signaling over many RAs, the concepts of a self-organizing, and terminal-centric network are described. These could lead to significantly improved flexibility in the network deployment, reduced downlink transmit power, and reduced control signaling load for the ordinary management of the terminals. The CoA is also compared with other approaches currently being researched.

This paper exploits the use of location information of wireless terminals to improve the performance of a beamforming system and support multiple access. Based on a system providing real-time 3D coordinate information of all terminals in the environment, a novel feedback-free multi-user scheduler is proposed. It chooses a set of angularly separated wireless terminals for simultaneous transmission in order to reduce the impact of mutual interference on overall system performance. If additional feedback of signal-to-interference and noise ratio is available, a location-assisted multi-user scheduler is also suggested to further improve the overall system performance. Both multi-user schedulers are based on a rate-greedy approach. To improve the fairness in resource allocation without introducing additional feedback overhead, a modified proportional fair algorithm (PFA) based on location information can be applied to a beamforming OFDMA system. By scaling the window length of PFA, a range of trade-offs between fairness and rate can be achieved.

This paper proposes a new wireless scheduling methodology which takes advantage of future predictions of data rate for the several users competing for physical access. Based on a system which allows low-cost 3D mapping of an environment in real-time, the predictions are obtained via either low-resolution path-loss prediction given the physical structure of the surroundings or by reference to data rates achieved by previous visitors to a locality. The proportional fair scheduling (PFS) metric is extended to include measures of the future rates users may achieve, leading to a new family of schedulers. They show useful fairness improvements over PFS in exchange for a small capacity loss, and allow a number of configuration options and a range of trade-offs between fairness and capacity.

In this paper, we present an empirical method for efficient analog design retargeting by combining design knowledge reuse and circuit synthesis. The method first decomposes the source system into circuit blocks and extracts the performance parameter specifications of each circuit block. Then, it scales each circuit block and defines a design space in the target technology. Subsequently, each circuit block is synthesized. Our assumption is that if the synthesized circuit blocks retain the same set of performance specifications, then the overall system after retargeting would have the same performance specification as the source system. We experiment the method on a fourth order continuous-time Delta-Sigma modulator.

This paper examines how the capacity of three multiuser multiple-input multiple-output (MIMO) algorithms is affected by a delay in computing and feeding back the transmit (and receive) weighting matrices used by the algorithms. Iterative schemes determining transmit weights that achieve the system-wide Nash equilibrium (NE) or block-diagonalization (BD) of the overall system channel matrix are compared as is a scheme applying successive diagonalization (SD) among users. The NE is found to be far the most robust to out-of-date channel information, whilst SD is found to suffer badly at even the shortest delay considered here (about 0.9 ms); BD's losses vary over a wide range depending on the delay. For the two iterative algorithms we also examine the tradeoff between better convergence and less delay. In both cases, the loss in capacity for weaker convergence is very small, and so it is desirable to minimize the delay and thus the capacity loss caused by it

We present a system that lets a designer directly annotate a 3D model with strokes, imparting a personal aesthetic to the non-photorealistic rendering of the object. The artist chooses a "brush" style, then draws strokes over the model from one or more viewpoints. When the system renders the scene from any new viewpoint, it adapts the number and placement of the strokes appropriately to maintain the original look.

Drawing surfaces using hatching strokes simultaneously conveys material, tone, and form. We present a real-time system for non-photorealistic rendering of hatching strokes over arbitrary surfaces. During an automatic preprocess, we construct a sequence of mipmapped hatch images corresponding to different tones, collectively called a tonal art map. Strokes within the hatch images are scaled to attain appropriate stroke size and density at all resolutions, and are organized to maintain coherence across scales and tones. At runtime, hardware multitexturing blends the hatch images over the rendered faces to locally vary tone while maintaining both spatial and temporal coherence. To render strokes over arbitrary surfaces, we build a lapped texture parametrization where the overlapping patches align to a curvature-based direction field. We demonstrate hatching strokes over complex surfaces in a variety of styles.