Recent Network on Chip (NoC) design must take the thermal issue into consideration due to its great impact on the network performance and reliability, especially for 3D NoC. In this work, we design a virtual channel based fully adaptive routing algorithm for the runtime 3D NoC thermal-aware management. To improve the network throughput and latency, we use two virtual channels for each horizontal direction and design a routing function which can not only avoid deadlock and livelock, but also ensure high adaptivity and routability in the throttled network. For path selection, we design a strategy that takes priority to the distance, but also considers path diversity and traffic state. For throttling information collection, instead of transmitting the topology information of the whole network, we use a 12 bits register to reserve the router state for one hop away, which saves the hardware cost largely and decreases the network latency. In the experiments, we test our proposed routing algorithm in different states with different sizes, and the proposed algorithm shows better network latency and throughput with low power compared with traditional algorithms.

This papter proposes a new type of unidirectional error control codes which indicates the location of unidirectional errors clustered in b-bit length, i.e., unidirectional byte error in b (b2) bits. Single unidirectional b-bit byte error locating codes, called SUbEL codes, are first clarified using necessary and sufficient conditions, and then code construction algorithm is demonstrated. The lower bound on check bit length of the SUbEL codes is derived. Based on this, the proposed codes are shown to be very efficient. Using the code design concept presented for the SUbEL codes, it is demonstrated that generalized unidirectional byte error locating codes are easily constructed.

This paper describes a new method for lossy audio signal compression via compressive sensing (CS). In this method, a structured shrinkage operator is employed to decompose the audio signal into three layers, with two sparse layers, tonal and transient, and additive noise, and then, both the tonal and transient layers are compressed using CS. Since the shrinkage operator is able to take into account the structure information of the coefficients in the transform domain, it is able to achieve a better sparse approximation of the audio signal than traditional methods do. In addition, we propose a sparsity allocation algorithm, which adjusts the sparsity between the two layers, thus improving the performance of CS. Experimental results demonstrated that the new method provided a better compression performance than conventional methods did.

As the semiconductor technology continues to develop, hundreds of cores will be deployed on a single die in the future Chip-Multiprocessors (CMPs) design. Three-Dimensional Network-on-Chips (3D NoCs) has become an attractive solution which can provide impressive high performance. An efficient and deadlock-free routing algorithm is a critical to achieve the high performance of network-on-chip. Traditional methods based on deterministic and turn model are deadlock-free, but they are unable to distribute the traffic loads over the network. In this paper, we propose an efficient, adaptive and deadlock-free algorithm (EAR) based on a novel routing selection strategy in 3D NoC, which can distribute the traffic loads not only in intra-layers but also in inter-layers according to congestion information and path diversity. Simulation results show that the proposed method achieves the significant performance improvement compared with others.

The byte error locating codes specify the byte location in which errors are occurred without indicating the precise location of erroneous bit positions. This type of codes is considered to be useful for fault isolation and reconfiguration in the fault-tolerant computer systems. In this paper, difference between the code function of error-location and that of error-correction/error-detection is clarified. With using the concepts of unidirectional byte distance, unordered byte number and ordered byte number, the necessary and sufficient conditions of the unidirectional byte error locating codes are demonstrated.

This paper proposes a new class of unidirectional byte error locating codes, called single symmetric bit error correcting and single unidirectional byte error locating codes, or SEC–SUbEL codes. Here, "byte" denotes a cluster of b bits, where b2. First, the necessary and sufficient conditions of the codes are clarified, and then code construction method is demonstrated. The lower bound on check bit length of the SEC–SUbEL codes is derived. Based on this, the proposed codes are shown to be very efficient in some range of the information length. The code design concept presented for the SEC–SUbEL codes induces the generalized unidirectional byte error locating codes with single symmetric bit error correction capability.

In this paper, we design a stealthy GSM phone identity catcher. As the GSM protocols do not mandate the authentication of BSes (Base Stations) to MSes (Mobile Stations), fake BSes can be implemented to lure victims to register with and thereby intercept crucial information of the user, including their identities. However, the straightforward implementation of GSM phone identity catcher can be easily perceived by users employing detection software due to such phenomena as phone interface changes and service interruptions. In this paper, we propose several effective mechanisms, such as smart configuration of the fake BSes, quick attachment/detachment and service relay, to make the catching process invisible to users and software. Real world experiments have been conducted and the results prove the efficiency and stealth of our proposed GSM phone identity catcher. We hope our work could help to enhance the effectiveness of IMSI catching attack and thereby alert the industry to design stronger authentication protocol in communication systems.

Error locating codes were first presented in 1963 by J.K. Wolf and B.Elspas. Since then several code design methods have been proposed. However, their algebraic structure has not yet been clarified. It is apparent that necessary and sufficient conditions for error correcting/detecting codes can be expressed by Hamming distance, but, on the other hand, those for error locating codes cannot always be expressed only by Hamming distance. This paper presents necessary and sufficient conditions for error locating codes by using a newly defined metric and a function. The function represents the number of bytes where Hamming distance between corresponding bytes of two codewords has a certain integer range. These conditions show that an error locating code having special code parameters is an error correcting/detecting code. This concludes that error locating codes include existing bit/byte error correcting/detecting codes in their special cases.