Search

Evaluating the computational complexity of decoders is a very important aspect in the area of Error Control Coding. However, most evaluations have been performed based on hardware implementations. In this paper, different decoding algorithms for binary Turbo codes which are used in LTE standards are investigated. Based on the different mathematical operations in the diverse equations, the computational complexity is derived in terms of the number of binary logical operations. This work is important since it demonstrates the computational complexity breakdown at the binary logic level as it is not always evident to have access to hardware implementations for research purposes. Also, in contrast to comparing different Mathematical operations, comparing binary logic operations provides a standard pedestal in view to achieve a fair comparative analysis for computational complexity. The usage of the decoding method with fewer number of binary logical operations significantly reduces the computational complexity which in turn leads to a more energy efficient/power saving implementation. Results demonstrate the variation in computational complexities when using different algorithms for Turbo decoding as well as with the incorporation of Sign Difference Ratio (SDR) and Regression-based extrinsic information scaling and stopping mechanisms. When considering the conventional decoding mechanisms and streams of 16 bits in length, Method 3 uses 0.0065% more operations in total as compared to Method 1. Furthermore, Method 2 uses only 0.0035% of the total logical complexity required with Method 1. These computational complexity analysis at the binary logical level can be further used with other error correcting codes adopted in different communication standards.

Validated solar maps are very crucial for a holistic site selection, design and financial evaluation of photovoltaic (PV) projects. During this research, the temporal and spatial variations of glob...

Binary and Non-Binary Turbo codes have been deployed in several digital communication standards to perform error correction. In order to enhance their error performance, several schemes such as Joint Source Channel Decoding (JSCD), extrinsic information scaling mechanisms, and prioritized QAM constellation mapping have been proposed for improving the error performance of error correcting codes. In this paper, hybrid schemes comprising of JSCD, regression based extrinsic information scaling, and prioritized 16-Quadrature Amplitude Modulation (QAM) with binary and non-binary Turbo codes have been presented. Significant improvement in error performance has been observed with the proposed scheme as compared to the conventional one. The hybrid scheme in the case of binary symmetric and asymmetric LTE Turbo codes, and triple binary Turbo codes outperform the conventional scheme by 0.8 dB on average. With duo-binary Turbo codes for the DVB-RCS standard, the hybrid scheme outperforms the conventional one with an average gain of 0.9 dB in BER performance.

Wi-Fi and LTE are commonly used for the transmission of high bandwidth data and multimedia over the internet. Providing a good quality of service in the transmission of such data over these wireless channels is challenging due to channel impairments such as noise and fading. This paper proposes three enhanced transmission schemes for audio over Wi-Fi and LTE. The first proposed scheme exploits the unequal importance of the bits generated by an MP3 codec to offer different levels of protection to them during transmission by mapping the important bits on prioritized QAM constellation bit positions. The second and third schemes use the statistical distribution of source symbols to map the bits of the encoded symbols to an SQAM constellation. For the second scheme, only systematic bits from the encoder are mapped onto the SQAM constellation. While for the third scheme, both the systematic and parity bits are mapped onto the SQAM constellation. A comparative analysis with different frequency transforms have been done. The simulation results show that the proposed schemes increase the system performance by 1–20 dB in segmented signal to noise ratio (SSNR). Using DWT further increases the gains up to 90 dB for 16-QAM at rate ½ as compared to FFT.

Photocurrent generated by a solar cell depends on environmental conditions as well as electrical and technological parameters of the cell. During this research, a holistic assessment of the performance of solar cell technologies is performed. Measurement of the solar spectrum is carried out from sunrise to sunset using a calibrated spectrometer. Temporal variations in the solar spectrum, spectral content and average photon energy (APE) are discussed. A model is developed to assess the impact of spectral irradiance and temperature on photocurrent from planar pn junction cells. Effect of irradiance, temperature and average photon energy on the photocurrent generated by a poly-Si solar cell is simulated and analysed. Discussions on the performance of other cell technologies are also made. Results show that the APE was 1.94 eV for the 300–1050 nm bin, 1.91 eV for the 350–1050 nm bin and 1.84 eV for the 400–1050 nm wavelength bin of the AM 1.5 solar spectrum. At low intensity of light, the solar spectrum is rich in photons within near Red - IR wavelengths and hence the APE is 1.75 eV. The APE then increases proportionally with an increase in irradiance until a saturation level is reached at approximately 1.95 eV when irradiance exceeds 700 W/m2. Photocurrent is computed for varying spectral irradiance and temperature conditions. First, at low irradiance levels when the solar spectrum is rich in photons from Red-IR regions, the photocurrent is linearly proportional to the APE. Secondly, as the intensity of light increases and Visible-UV components of light increases, an exponential relationship between the photocurrent and APE is exhibited.

During this research, performance of a 2.45 kWp PV system was evaluated over a period of 5 years. International electrotechnical committee (IEC) standard, IEC 61724: 1998 and a robust mathematical model were used as a guide for the purpose. Performance of the system was closely monitored during the dry winter season. Annual production decreased from 3463.8 kWh to 3370.9 kWh and the capacity utilisation factor decreased from 16.14% to 15.71% over the period. Monthly production was stochastic, but the average monthly production curve followed the same trend as incident global horizontal radiation with low production during dry winter months. Performance ratio was above 90% at the beginning of dry winter month, it then decreased to less than 70% after three months. A mathematical model based on five parameter model and one diode equation was then used to extract essential cell parameters and simulate performance of the system. Statistical indices were computed to assess performance of the model against measurement data. Hence the quality factor of the PV system was computed and was found to be between 60% and 100% with an average of 87% in the dry winter month.

This paper investigates the performance of three different symbol level decoding algorithms for Duo-Binary Turbo codes. Explicit details of the computations involved in the three decoding techniques, and a computational complexity analysis are given. Simulation results with different couple lengths, code-rates, and QPSK modulation reveal that the symbol level decoding with bit-level information outperforms the symbol level decoding by 0.1 dB on average in the error floor region. Moreover, a complexity analysis reveals that symbol level decoding with bit-level information reduces the decoding complexity by 19.6 % in terms of the total number of computations required for each half-iteration as compared to symbol level decoding.

The classification of legal documents has been receiving considerate attention over the last few years. This is mainly because of the over-increasing amount of legal information that is being produced on a daily basis in the courts of law. In the Republic of Mauritius alone, a total of 141,164 cases were lodged in the different courts in the year 2015. The Judiciary of Mauritius is becoming more efficient due to a number of measures which were implemented and the number of cases disposed of in each year has also risen significantly; however, this is still not enough to catch up with the increase in the number of new cases that are lodged. In this paper, we used the k-nearest neighbour machine learning classifier in a novel way. Unlike news article, judgments are complex documents which usually span several pages and contains a variety of information about a case. Our approach consists of splitting the documents into equal-sized segments. Each segment is then classified independently of the others. The selection of the predicted category is then done through a plurality voting procedure. Using this novel approach, we have been able to classify law cases with an accuracy of over 83.5%, which is 10.5% higher than when using the whole documents dataset. To the best of our knowledge, this type of process has never been used earlier to categorise legal judgments or other types of documents. In this work, we also propose a new measure called confusability to measure the degree of scatteredness in a confusion matrix.

The current standard in video compression, High-Efficiency Video Coding (HEVC/H.265), provides superior compression performances compared to its H.264 predecessor. However, considerable increase in processing time is brought about with the large Coding Tree Unit (CTU) in H.265. In this paper, a method of terminating the Coding Unit (CU) earlier is proposed based on the luma residual statistics gathered during the encoding of the initial frames of the sequence. The gathered statistics are then formulated into thresholds adaptively and are used to overcome the unnecessary processing of potential CUs during subsequent frames. Experimental results obtained indicate that the encoding time can be reduced by 36.1% on average compared to HM16 along with a BD-Rate of only 0.29%.

When TCP was designed, the protocol designers at this time did not cater for the problem of running TCP within itself and the TCP dilemma was not originally addressed. The protocol is meant to be reliable and uses adaptive timeouts to decide when a resend should occur. This design can fail when stacking TCP connections though, and this type of network slowdown is known as a “TCP meltdown problem.” This happens when a slower outer connection causes the upper layer to queue up more retransmissions than the lower layer is able to process. Some computer scientists designed a Virtual Private Networking product (OpenVPN) to accommodate problems that may occur when tunneling TCP within TCP. They designed the VPN to use UDP as the base for communication to increase the performance. But the problem with UDP is said to be unreliable and not all VPN systems support UDP tunneling. This paper seeks to provide systems with low-latency primitives for reliable communication that are fundamentally scalable and robust. The focus of the authors is on proposing raptor codes to solve the TCP meltdown problems in VPN systems and decrease delays and overheads. The authors of this paper will simulate the TCP meltdown problem inside a VPN tunnel.

In this paper, a new extrinsic information scaling and early stopping mechanism for long term evolution (LTE) turbo code is proposed. A scaling factor is obtained by computing the Pearson’s correlation coefficient between the extrinsic and a posteriori log-likelihood ratio (LLR) at every half-iteration. Additionally, two new stopping criteria are proposed. The first one uses the regression angle which is computed at each half-iteration and is applied at low E b/N 0. The second one uses Pearson’s correlation coefficient and is applicable for high E b/N 0 values. The performance of the proposed scheme was compared against an existing scaling and stopping mechanism based on the sign difference ratio (SDR) technique as well as conventional LTE turbo code. Simulations have been performed with both quadrature phase shift keying (QPSK) modulation and 16-quadrature amplitude modulation (QAM) together with code rates of 1/3 and 1/2. The results demonstrate that the proposed scheme outperforms both the conventional scheme and that employing the SDR-based scaling and stopping mechanism in terms of BER performance and average number of decoding iterations. The performance analysis using EXIT charts for each scheme shows higher initial output mutual information for input mutual information of zero. Better convergence is also demonstrated with the wider tunnel for the proposed scheme. Additionally, the computational complexity analysis demonstrates a significant gain in terms of the average number of computations per packet with the different modulation and coding schemes while still gaining in terms of error performance.

This paper focuses on two commonly used VPNs; OpenVPN and OpenSSH. Both VPN solutions are Open Source and are cross-platform, secure, highly configurable. OpenSSH forms part of a big research group, OpenBSD and is integrated in all routers, switches and almost all operating systems by default. Compared to OpenSSH, OpenVPN is less widely used and the research group is small. OpenVPN can be used only for tunneling purposes, whereas OpenSSH has many features and tunneling is only one of the features. The research by the OpenBSD developers is moving towards security and encryption and has not progress in the field of VPN tunneling since 2011. The only weakness with OpenSSH VPN is that is does not support UDP as the mode of communication, whereas OpenVPN can use both TCP and UDP as the mode of communication. There is a need for UDP tunnel in industries in situations where bandwidth is critical (satellite) and the default option for VPN systems is OpenVPN. The authors of this paper modified the OpenSSH implementation was by adding support for a UDP base connection to its VPN functionality so that OpenSSH can be the VPN of choice for Industries.

Mauritius is considered to have high solar resource potential but it has not yet been fully quantified and exploited due to the lack of valid solar energy data. This paper unveils the solar potential of Mauritius. Ground-based measurements were performed at intervals of 30 s in order to obtain accurate global horizontal irradiance data which can depict all changes in solar power. The latter is used to evaluate average monthly global horizontal irradiance, maximum irradiance, monthly average insolation and monthly sky clearness index. A solar geometry model was used to define the average monthly, seasonal and yearly maximum elevations and extraterrestrial radiation. Measurement data were compared to Meteonorm and NASA SSE 3-hourly averaged solar data. Comparison shows that average irradiance values are in good agreement, whereas insolation and sky clearness values obtained from external sources are inferior to high quality measurement data. The results, presented in this paper, complement solar data of Meteonorm and NASA SSE and secondly, provides PV and solar engineers as well as scientists with highly valuable information on the solar resource of Mauritius that can be used during planning and design of PV systems as well as for conducting further research in Mauritius and surrounding regions.

Single Sign-On (SSO) is a centralized certification method where consumer gains use of many services using one credential. This evolution is driving the next generation of authentication on the cloud. However, Single Sign-On has one big point of failure. If an attacker has obtained one credential, he may obtain use of several providers. SAML (Security Assertion Markup Language) SSO protocol, which is widely used with a password, suffers from this vulnerability. In the past, researchers have focused their attention on XML Signature Wrapping vulnerability and very less on the main component of authentication. This research provides a solution to such problem by combining the dominant features of cancelable fingerprints in existing SAML SSO protocol. During our tests, the effectiveness of the solution has been examined using CVSS (Common Vulnerability Scoring System). Based on the scores provided, it has therefore been concluded that the new combined solution of cancelable fingerprint and SAML SSO protocol has a better protection against the attacks. Nevertheless, the score can further be improved.

The long encoding time of High Efficiency Video Coding (HEVC) compared to its predecessor, Advanced Video Coding (AVC), is mostly associated with the large number of Coding Units (CUs) to be processed during the quad tree splitting of the 64 × 64 Coding Tree Unit (CTU) along with the improved but intensive Motion Estimation (ME) techniques. In this paper, the unnecessary processing of some CUs during the recursive splitting of the CTU along with some of the two-PUs mode operations are skipped so as to bring significant time reduction for the encoder. Statistical distributions of the HEVC splitting decisions based on the Mean Square (MS) values of each 8 × 8 block within the 2N × 2N luma residuals are adaptively constructed during the starting frames for each sequence. Thereafter, thresholds for early termination of the CU and early identification of the 2N × 2N PU mode based on these distributions are applied during the encoding of subsequent inter frames. The proposed inter-mode scheme significantly reduces the total encoding time with negligible loss of coding efficiency. Experimental results show that the proposed scheme effectively achieves 47.0% encoding time savings with a Bjontegaard Delta bitrate (BDBR) increase of only 0.57% for various test sequences under random access conditions.

Standards like Long Term Evolution (LTE) employ Turbo coded QAM systems in order to achieve high data rates. Despite the fact that several mechanisms have been proposed in order to enhance the error performance of Turbo coded QAM systems, there is still the need to come up with novel or hybrid systems which can contribute towards further improved error performances. In this paper, a comparative analysis has been performed between symmetric and asymmetric LTE Turbo codes with the incorporation of techniques such as prioritization and regression based extrinsic information scaling. Results demonstrate that significant enhancement in the error performance throughout the whole Eb/N0 range can be obtained with high order modulation when these techniques are used. With both symmetric and asymmetric LTE Turbo codes employing 64-QAM and a code-rate of 1/3, an average gain of 0.3 dB below BERs of 10−1 is obtained over symmetric and asymmetric LTE Turbo codes.

This paper performs a comparative analysis of Unequal Error Protection (UEP) schemes for audio transmission over Asymmetric Digital Subscriber Line (ADSL). The proposed UEP scheme exploits three different levels of protection. First at the Discrete Multi-tone Modulation (DMT) layer, second with prioritized retransmissions and finally by using different code rates. A comparative analysis between Reed-Solomon (RS) codes and Turbo Codes is performed using two different block sizes. For the Turbo codes, Sign Division Ratio (SDR)-based extrinsic information scaling is also applied to further enhance the performance. Results show that when UEP is applied at three different levels, a gain of 11 dB is obtained over a scheme which applies UEP at only two levels.

Law is a research-oriented profession and legal research is an activity that costs time and money. Information Technology is now revolutionising the way in which legal research is being done. In this work, we have implemented an online web-based question answer system for the Mauritian Judiciary where users can enter their queries freely using natural language. The system processes the queries by extracting relevant keywords and discards those that do not carry much information and then returns the relevant sections of law which contain these keywords or keyphrases. The system also returns a list of relevant Supreme Court cases. The user can decide on the number of results to be displayed. The user can also wish to have only the name of the relevant acts be displayed for certain keywords or keyphrases. The system does not require the user to know how the law is structured or how the knowledge-base is built in order to benefit from it. The portal can also be accessed via mobile devices without compromising any of its facilities or user-friendliness. It is hoped that the availability of information at the click of a button will help the human resources at the Mauritian Judiciary to become more efficient and this will contribute to the reduction of delays in the disposal of cases.

Cloud computing is introducing several immense changes to people's life style and dealing pattern recently for its innumerous advantages. However, potential security issues are often the barrier for its widespread applications. Modern biometric technologies such as fingerprints claim to produce a different answer to cloud security. Even though there are areas which biometrics method provides benefits, it is at risk of attacks. Towards addressing these problems and rising public confidence, a novel protocol for biometrics authentication on stolen token based on cancelable is presented.

Biometric-established authentication method is maturing into fitting one probably the most promising candidate for either replacing or bettering normal approaches founded on password or token on the cloud. This technological know-how is a deterministic characteristic to provide a safer and more user friendly approach to authentication. However some vulnerability threatens the adoption of biometrics. One of which is due to the fact customers can access assets from different locations on different devices and one person can have many scanners. There exists without doubt a risk associated with permitting a request to access the useful resource. With the intention to contribute in resolving such challenge, a risk rating calculation is endorsed. It is a procedure during which the threat engine will calculate a ranking. The ranking will probably be in comparison with a threshold set and a resolution whether or not to proceed with authentication will likely be made founded on this assessment

The era of Data Centers is underway. Cloud is an off-premise form of computing that stores data on the Internet, whereas a data center refers to on-premise. For cloud-hosting purposes, vendors also often own multiple data centers in several geographic locations to safeguard data availability during outages and other data center failures. Data replication and synchronization techniques have recently attracted a lot of attention of researchers from computing community. Data transferred during replication needs to be secure. Tunneling is one way to secure information before sending it to off-premise replication site. The two kinds of tunneling that exists are TCP and UDP tunnel. UDP tunnel is claimed to be faster during the transfer of data when compared to TCP tunnel, the main reason is that UDP does not make use of excessive acknowledgment messages and also UDP does not suffer the tcp-meltdown problem. In situations where bandwidth is limited, UDP is the preferred option. This paper addresses the reliability of UDP tunnel, while measuring the packet drops when sending different packet sizes. The authors want to determine whether UDP tunnel can be used as the mode of transfer during data replication. A series of tests have been performed and the MTU size have been adjusted for a minimal packet loss. The authors demonstrate that UDP tunnel with an MTU size of 1150 bytes can be used as the mode of transfer for data centers.

During the research, the performance of a 2.45 kWp photovoltaic system power system (PVPS) located in a tropical region was measured and modeled. A bottom up cell to array approach was used to simulate the PVPS performance. Cell parameters were extracted using 4- and 5-parameter models. The PV system power, current and voltage output was modelled using one-diode model in consideration of solar irradiance data which was measured at intervals of 30-seconds. The latter results were compared to results obtained through simulation of the 2.45 kWp system in NREL SAM. Finally the simulation results were compared to measured system's energy output. It can be concluded that only the proposed cell to array approach can be reliably used to assess a PVPS output current, voltage, power and energy with high accuracy. Compared to other models, results of the proposed approach were closer to recorded energy output values.

High Efficiency Video Coding (HEVC/H.265), the latest standard in video compression, aims to halve the bitrate while maintaining the same quality or to achieve the same bitrate with an improved quality compared to its predecessor, AVC/H.264. However, the increase in prediction modes in HEVC significantly impacts on the encoder complexity. Intra prediction methods indeed iterate among 35 modes for each Prediction Unit (PU) to select the most optimal one. This mode decision procedure which consumes around 78 % of the time spent in intra prediction consists of the Rough Mode Decision (RMD), the simplified Rate Distortion Optimisation (RDO) and the full RDO processes. In this chapter considerable time reduction is achieved by using techniques that use fewer modes in both the RMD and the simplified RDO processes. Experimental results show that the average time savings of the proposed method indeed yields a 42.1 % time savings on average with an acceptable drop of 0.075 dB in PSNR and a negligible increase of 0.27 % in bitrate.

Virtual Private Networks (VPNs) provide a secure encrypted communication between remote networks worldwide by using Internet Protocol(IP) tunnels and a shared medium like the Internet. End-to-end connectivity is established by tunneling. OpenVPN and OpenSSH are cross-platform, secure, highly configurable VPN solutions. The performance comparison however between OpenVPN and OpenSSH VPN has not yet been undertaken. This paper focuses on such comparison and evaluates the efficiency of these VPNs over Wide Area Network (WAN) connections. The same conditions are maintained for a fair comparison. To the best knowledge of the authors, this is the first reported test results of these two commonly used VPN technologies. Three parameters, namely speed, latency and jitter are evaluated. Using a real life scenario with deployment over the Linux Operating System, a comprehensive in-depth comparative analysis of the VPN mechanisms is provided. Results of the analysis between OpenSSH and OpenVPN show that OpenSSH utilizes better the link and significantly improves transfer times.

The comparison between TCP and UDP tunnels have not been sufficiently reported in the scientific literature. In this work, we use OpenVPN as a platform to demonstrate the performance between TCP/UDP. The de facto belief has been that TCP tunnel provides a permanent tunnel and therefore ensures a reliable transfer of data between two end points. However the effects of transmitting TCP within a UDP tunnel has been explored and could provide a valuable attempt. The results provided in this paper demonstrates that indeed TCP in UDP tunnel provides better latency. Throughout this paper, a series of tests have been performed, UDP traffic was sent inside UDP tunnel and TCP tunnel successively. The same tests was performed using TCP traffic.

6to4 tunneling enables IPv6 hosts and routers to connect with other IPv6 hosts and routers over the existing IPv4Internet. The main purpose of IPv6 tunneling is to maintain compatibility with large existing base of IPv4 hosts and routers. OpenSSH VPN tunneling is said to have limitations with numerous IPv6 clients and therefore it is advisable to use OpenVPN. To the best knowledge of the authors, this is the first reported successful implementation of 6to4 tunneling over OpenSSH with more than one client. This proof-of-concept positions OpenSSH therefore as a potential alternative to conventional VPNs.

A new joint source channel decoding (JSCD) scheme for turbo trellis-coded modulation is proposed which exploits symbol-a-priori probabilities to improve decoding performance. To obtain symbol-a-priori probabilities, we propose a new method which uses a time-stretched bit-level trellis of a variable length code (VLC) decoder alongside a symbol level trellis. Iterative symbol combining (ISC) is also integrated with the proposed JSCD scheme so that multiple transmissions of the same data packet can be combined to improve decoding. Essentially JSCD with ISC (JSCD-ISC) exploits two types of a-priori information. The first one being the symbol-a-priori probabilities derived from source statistics, and the second one is obtained from the saved extrinsic information of previously transmitted copies of the data. Several simulations with different VLC sources like Huffman and reversible variable length codes (RVLC), and for different number of retransmissions have been performed. The most striking result is obtained with RVLC, whereby using only two retransmissions, the JSCD-ISC scheme outperforms a conventional scheme using three retransmissions by 0.2dB.

We introduce a recovery algorithm for low-density parity-check codes that provides substantial coding gain over the conventional method. Concisely, it consists of an inference procedure based on successive decoding rounds using different subsets of bit nodes from the bipartite graph representing the code. The technique also sheds light on certain characteristics of the sum–product algorithm and effectively copes with the problems of trapping sets, cycles, and other anomalies that adversely affect the performance LDPC codes.

High Efficiency Video Coding (HEVC/H.265), the latest standard in video compression, aims at half the bit rate while maintaining the same quality compared to its predecessor, AVC/H.264. However, the increase in number of modes (35) for intra prediction in HEVC has significantly impacted on the encoder complexity. In this paper, a reduced number of candidate modes is therefore proposed to improve the encoding time. The most probable modes (MPMs) are inserted in the candidate list based on their computed Rough Mode Decision (RMD) cost rather than appending them to the list. In addition, the number of modes selected for the 4×4 and 8×8 PUs are based on the analysis of the graph obtained by plotting the cost of each mode against the mode number. Using this approach, the number of candidate modes in the RDO process is further reduced. Experimental results show that the average time savings of the proposed method is 38.0% along with an acceptable loss in quality (0.059dB) and a negligible increase in bit rate (0.30%) compared to HM 10.

The authors present a simple technique to combine source coding, channel coding and modulation. This technique employs the Huffman code for source coding, Generalized Array Codes (GAC) for channel coding and Phase/Frequency (BFSK/MPSK) for modulation. The combined scheme has the advantage of reducing the redundancy, providing error protection and simultaneously optimizing on channel bandwidth. It is shown the combined system gives the same performance as its separate counterparts but has lower complexity. The algorithm used to construct the combined trellis decoder employing phase/frequency for a given source text file is designed and implemented in software. The error performances for the combined schemes using BFSK/MPSK modulation are compared with those employing coded as well as Uncoded MPSK modulation. Such a Block Coded Modulation (BCM) scheme is suitable for both information storage and digital transmission systems.

In this study, energy usage of domestic appliances was monitored using energy metering equipment in six selectively chosen middle-income households. The recorded data was analyzed to determine the energy usage trends as well as the leaking and real power consumption. The main aim of this research is to assess the energy profile of the domestic appliances, determine their annual energy consumption and consequently derive their Energy Efficiency Indices. Average annual standby energy of 12.56 kWh, 4.32 kWh and 29.13 kWh were obtained for refrigerator, television and washing machine respectively. The procedure was repeated after the residents of the six households were sensitized on using the electrical appliances more intelligently and efficiently. Following the application of the prescribed energy efficiency measures, average electricity savings of 0.459 kWh/day, 0.061kWh/day and 0.009 kWh/day were noted for refrigerator, television and washing machine respectively. The effect of the energy efficiency measures on the Energy Efficiency Indices was subsequently analyzed. It was found that the annual energy consumption of household washing machine and refrigerator decreased by 16.36% and 18.26% respectively on average while an average decrease of 23.18% was recorded in the on-mode power consumption of television.

The HEVC (H.265) standard has brought in significant improvement in terms of coding efficiency. However, this reduction in bit rate (almost half) comes along with an increase in complexity resulting in a very high compression time. This paper proposes a novel method to reduce the complexity in the intra-mode encoding process. We have defined a new term called the Average Pixel Cost (APC) for a CU. When the APC of a CU is below a specified threshold, the splitting process is stopped and therefore the encoder no longer needs to address the smaller CUs in the quad-tree. This results in considerable time saving for the encoder with negligible deterioration in quality and bitrate. Experimental results, based on this method alone, produced an average reduction of 31.3% in compression time in HM 10.0 with an increase of 0.7% in bitrate along with a negligible decrease of PSNR (−0.03 dB) using an APC threshold of 20.

Previously, the proposed embedded coding techniques based on the row and column array codes, employ a combination of inner codes for error correction and outer codes for error detection. The outer codes involve the addition of further redundant bits. This reduces the overall code rate and hence, the throughput of the system. Furthermore, the decoding of these array codes is not a maximum likelihood decoding. In this paper, we propose a novel embedded coding technique that employs a combination of row and column array codes as well as the generalized array codes, but no outer code. The decoding of these codes is a maximum likelihood decoding and the error detection is done by a new statistical channel evaluation technique that uses the trellises of the component codes embedded in the main block.

Cloud computing has increasingly been a hot topic in the recent years and has achieved maturity. However security concerns are the hindrance to user acceptance of cloud computing systems. User authentication among them requires a high-guaranteed security since all protections rely on the mechanism. As such in recent years biometric technologies are becoming one of the key foundations of a wide range of secure identification and personal verification solutions. In a cloud computing environment, since control over security diminishes as data move dynamically, they present some problems related to the management of biometric data. To overcome this problems, in this paper we propose to use a cancellable biometric authentication system. In this concept a distorted biometric image, derived from the original, is used for authentication. Additionally a data hiding technique is used to embed demographic information in the biometric image. As a result a robust authentication is created by which the original biometric image is not exposed.

Non binary turbo codes are gaining a lot of attention since the recent adoption of duo binary circular turbo codes by the Digital Video Broadcasting (DVB) community. In this paper, a Joint Source Channel Decoding (JSCD) scheme is proposed for circular non-binary turbo codes. With a view to exploit a-priori probabilities from source statistics, a symbol level trellis is incorporated into the circular trellis of the non-binary turbo decoder. Reversible Variable Length Codes (RVLC) are used as the input source in all simulations. Results show that with JSCD, circular duo binary turbo codes provide an average gain of 0.4 dB at Bit Error Rate (BER) of 10-5 as compared to conventional decoding of circular duo binary turbo codes. With circular triple binary turbo codes, JSCD provides a striking average gain of 3.5 dB at a BER of 10-6 compared to conventional decoding of circular triple binary turbo codes.

This paper proposes a robust resilient transmission scheme for images that have been compressed using the Set Partitioning In Hierarchical Trees (SPIHT) algorithm. The scheme employs Unequal Error Protection (UEP), prioritised Automatic Repeat reQuest (ARQ) and two-dimensional adaptive Wiener filtering. In order to apply UEP, the SPIHT coded bit-stream is partitioned into bit-classes of unequal importance. UEP is then applied at two levels. Firstly, Rate Compatible Punctured Convolutional (RCPC) codes are used to encode the bit-classes with different code-rates hence providing them with different levels of protection. Secondly, prioritized retransmissions are used such that the more important bit-classes are allocated a greater number of retransmissions than the less important ones. Equal gain combining is also performed to further improve the performance. The proposed U E P s c h e m e provides an average gain of 3 dB in P e a k S i g n a l to Noise Ratio (PSNR) over a conventional Equal Error Protection (EEP) in the range 0dB≤Eb/No≤6dB with 16-QAM and an average gain of 3.5 dB in PSNR in the range 0dB≤Eb/No≤3dB with BPSK modulation. Moreover, de-noising with a two dimensional Wiener filter provides an additional gain of 0.76 to 0.90 dB.

In this paper, we focus on the learning aspect of NEAT and its variants in an attempt to solve benchmark problems through fewer generations. In NEAT, genetic algorithm is the key technique that is used to complexify artificial neural network. Crossover value, being the parameter that dictates the evolution of NEAT is reduced. Reducing crossover rate aids in allowing the algorithm to learn. This is because lesser interchange among genes ensures that patterns of genes carrying valuable information is not split or strayed during mating of two chromosomes. By tweaking the crossover parameter and with some minor modification, it is shown that the performance of NEAT can be improved. This enables NEAT algorithm to evolve slowly and retain information even while undergoing complexification. Thus, the learning process in NEAT is greatly enhanced as compared to evolution.

Encryption is the primary solution to provide security to the data, which is travelling on a communication link between any pair of nodes, but Partial encryption is a technique to save computational power, overhead, speed, time and to provide quick security by only encrypting a selected portion of a bit stream. Securing the visual and multimedia data like images requires specific design consideration for use in different applications. The focus of this paper is on selecting the important part of the image that can efficiently achieve by conceptually selecting the part of the image which is further used in its normal mode of operation for encryption. Once encryption is done, the encrypted data is sent along with remaining original part of the message, ensuring its secured transmission and distribution over public networks. This paper proposes a partial image encryption using Single Bit Manipulation technique, convert each byte/character of the message to be encrypted, to its binary equivalent. Now, length of password is considered for bit left shift. i.e., Number of bits to be shifted to left will be decided by the length of password. The issue in traditional cryptosystem in many different areas such as wireless networking, mobile phone services and applications in homeland security is energy consumption for encryption of the large volume visual data. So we are dealing with a partial encryption algorithm of images.

The traffic of digital images and video has grown rapidly in the internet. Security becomes important for several applications like military image database, confidential video conferencing, medical images, etc. Several techniques have been developed for textual data but are not appropriate for images and video with huge amount of file size. In traditional image and video content protection schemes, called fully layered, the whole content is first compressed. Then, the compressed bitstream is entirely encrypted using a standard cipher. The specific characteristics of this kind of data make standard encryption algorithms inadequate. Partial encryption is a recent approach to reduce the encryption time of images in distributed network. Partial image encryption is used to reduce the amount of data to encrypt while achieving a sufficient and inexpensive security. The proposed approach involves two ways, the first is by pixel value manipulation and other second is by using SCAN mapping method. The PSNR comparison of proposed technique with the existing partial image encryption techniques shows that proposed technique gives better security than the existing techniques.

In this paper we propose a new encoding scheme utilises predictive coding technique in order to increase the efficiency of evolving artificial neural network. The predictor encodes the sample data fed to the system and the artificial neural network acts as the decoder. The latter is trained using a data model created via predictive coding, which is generated from the initial sample. Only the residual data output from the encoder is fed to the artificial neural network for authentication. Distributed and local processing has been simultaneously used in parallel and in synchrony. Comparison of the simulation results with those obtained using traditional methods such as selective biometric features shows an improvement in efficiency of up to 80% while utilising a lower complexity neural network.

In traditional image and video content protection schemes, called fully layered, the whole content is first compressed. Then, the compressed bitstream is entirely encrypted using a standard cipher (DES, AES, IDEA, etc.). The specific characteristics of this kind of data (high-transmission rate with limited bandwidth) make standard encryption algorithms inadequate. Another limitation of fully layered systems consists of altering the whole bitstream syntax which may disable some codec functionalities. Partial encryption is a new trend in image and video content protection. It consists of encrypting only a subset of the data. The aim of partial image encryption using SCAN mapping method is to reduce the amount of data to encrypt while preserving a sufficient level of security than the fully layered image encryption using SCAN method. In this paper, we analyzed Image encryption techniques and Partial image encryption techniques and present the comparative results.

It is well known that packet losses in the networks are mainly due to congestion because of the finite buffer capacity of queues in routers. Forward error correction (FEC) can recover from losses without retransmissions of lost packets. However, FEC faces with two main drawbacks: firstly, the redundancy generated by the sender increases the overall load of the network resulting in an increase of loss rate and secondly, waiting for redundant information to be able to recover lost packets results in additional delay. In this paper we employ the Reed Solomon erasure (RSE (7, 4)) code to recover lost packets. We apply the adaptive differential pulse code modulation (ADPCM) compression technique to make room for the redundant packets and thus reduce the additional load due to redundancy. We further modify the recovery scheme to bring down the decoding delay from a maximum of 6 packets to a maximum of 3 packets. Results of informal mean opinion score (MOS) listening test show that the modified RSE code is capable of correcting any burst of two packets and provides a tradeoff between quality, network load and decoding delay.

A joint technique to reduce redundancy and provide error control is presented. The proposed technique involves the concatenation of Variable-Length Source Codes (VLSC) and convolutional codes. An algorithm for the design of a joint trellis code is proposed and examples of the design procedure are illustrated with VLSC and convolutional codes of rate ½ and variable constraint length. It is shown that this joint scheme gives a reduction in overall complexity without any loss of error performance compared to that of a disjoint trellis decoder of convolutional code and a VLSC decoder. The proposed joint design is implemented in software and its error performances are compared with those of the separate VSLC and convolutional codes as well as the corresponding uncoded schemes. Simulation results show that a coding gain of up to 6 dB can be achieved from the joint VLSC and (2,1,6) convolutional codes over the uncoded VLSC transmission.

In this paper, we propose a technique for combining Huffman source code with channel Array codes and carry out a complexity analysis of the combined as well as the separate coding system. The trellis algorithm for any combined Huffman and Array decoders is presented together with an example for designing a combined trellis decoder based on the proposed algorithm. The complexity of both coding schemes is analysed in terms of the Complexity Reduction Ratio (CRR) which we shall derive in the paper. It is shown through calculations and simulation results that a combined code provides a reduction in overall complexity and computational time as compared to the conventional separate system comprising of an Array trellis decoder followed by a Huffman decoder.

DC servo drives normally employ an internal current loop as well as a speed control loop requiring the use of a speed transducer. This paper presents a fuzzy logic controlled DC servo drive without the need for mechanical speed sensors. Speed estimation is performed from measurements of the input current and voltage to the motor. The latter is driven by a current-regulated voltage source DC-DC converter capable of operating in all four quadrants of the torque-speed plane. The fuzzy controller uses the calculated rotor speed to produce the armature current command necessary for matching the reference speed profile. The proposed system is shown to track the dynamic input speed settings and to reject step load disturbances with largely reduced settling times and steady state errors.

A technique for combining Huffman code, row and column array (RAC) codes and phase/frequency modulation in order to reduce redundancy, provide error protection and simultaneously to optimise channel bandwidth is presented. It is shown that this scheme provides a reduction in overall complexity as compared to that employing a demodulator followed by a trellis decoder of RAC code and a Huffman decoder. The trellis of the combined codes employing BFSK/MPSK modulation are designed and implemented and their error performances are compared with those employing coded as well as uncoded MPSK modulation. The proposed block coded modulation (BCM) scheme is suitable for both data transmission and information storage.