A Low-Jitter Harmonic-Free All-Digital Delay-Locked Loop for Multi-Channel Vernier TDC

This paper presents a low jitter All-Digital Delay-Locked Loop (ADDLL) with fast lock time and process immunity. A coarse locking algorithm is proposed to prevent harmonic locking with just a small increase in hardware resources. In order to effectively solve the dithering phenomenon after locking, a replica delay line and a modified binary search algorithm with two modes were introduced in our ADDLL, which can significantly reduce the peak-to-peak jitter of the replica delay line. In addition, digital codes for a replica delay line can be conveniently applied to the delay line of multi-channel Vernier TDC while maintaining consistency between channels. The proposed ADDLL has been designed in 55 nm CMOS technology. In addition, the post-layout simulation results show that when operated at 1.2 V, the proposed ADDLL locks within 37 cycles and has a closed-loop characteristic, the peak-to-peak and root-mean-square jitter at 800 MHz are 6.5 ps and 1.18 ps, respectively. The active area is 0.024 mm2 and the power consumption at 800 MHz is 6.92 mW. In order to verify the performance of the proposed ADDLL, an architecture of dual ADDLL is applied to Vernier TDC to stabilize the Vernier delay lines against the process, voltage, and temperature (PVT) variations. With a 600 MHz operating frequency, the TDC achieves a 10.7 ps resolution, and the proposed ADDLL can keep the resolution stable even if PVT varies.

Aplikasi belajar tajwid menggunakan binary search

ABSTRAK Tajwid dapat diartikan sebagai aturan atau tata cara untuk membaca Al-Quran dengan benar. seorang muslim biasanya mulai belajar tajwid sejak usianya masih dini, namun dewasa ini motivasi untuk mempelajarinya makin turun. Salah satu penyebabnya adalah cara pembelajaran yang konvensional dan kurang begitu memanfaatkan teknologi. Oleh karena itu, penelitian ini bertujuan untuk membangun aplikasi pembelajaran tajwid berbasis website dan menerapkan algoritma binary search untuk memperoleh hasil yang lebih optimal. Pencarian biner atau binary search adalah suatu algoritma yang bekerja dengan mencari posisi elemen dalam array yang telah diurutkan sebelumnya dan kemudian membandingkan nilainya. Ruang pencarian dibagi menjadi dua, kemudian nilai yang dicari dibandingkan dengan elemen tengah array. Operasi ini diulang terus sampai ada kecocokan diantara dua nilai tersebut. Aplikasi pembelajaran tajwid yang dibuat terdiri dari tiga menu yaitu materi, latihan, dan info. Menu materi berisi mata kuliah yang berkaitan dengan hukum membaca Al-Quran. Menu latihan memungkinkan pengguna untuk melatih pemahaman yang telah mereka pelajari di menu teori, sedangkan menu info berisi instruksi manual penggunaan aplikasi. ABSTRACT Tajweed is set of rules for reciting Al-Quran properly. Muslim start learning tajweed from their early age, but currently motivation to learn tajweed is decreasing. One of the reason is the conventional learning and less use digital technology. Therefore, the aim of this study is to construct tajweed learning application based on website and applied binary search algorithm for better result. Binary search is a search algorithm that works by finding the position of elements in a sorted array and comparing their values. The search space is divided into half, then compared the value searched with the middle element of the Array. This operation is repeated until they match. Tajweed learning application consist of three menus: theory, exercise, and info. Theory menu contains courses related to the law of reciting Al-Quran. Exercise menu allows user to train the understanding they has learned in theory menu, while info menu contains user instruction manual.

COMPARISON OF SOFTWARE COMPLEXITY OF SEARCH ALGORITHM USING CODE BASED COMPLEXITY METRICS

Measures of software complexity are essential part of software engineering. Complexity metrics can be used to forecast key information regarding the testability, reliability, and manageability of software systems from study of the source code. This paper presents the results of three distinct software complexity metrics that were applied to two searching algorithms (Linear and Binary search algorithm). The goal is to compare the complexity of linear and binary search algorithms implemented in (Python, Java, and C++ languages) and measure the sample algorithms using line of code, McCabe and Halstead metrics. The findings indicate that the program difficulty of Halstead metrics has minimal value for both linear and binary search when implemented in python. Analysis of Variance (ANOVA) was adopted to determine whether there is any statistically significant differences between the search algorithms when implemented in the three programming languages and it was revealed that the three (3) programming languages do not vary considerably for both linear and binary search techniques which implies that any of the (3) programming languages is suitable for coding linear and binary search algorithms.

Error Estimation For The Methods Of Correlated colour Temperature Calculation

To date, a lot of methods have been developed for calculating correlated colour temperature (CCT). There are both numerical solutions (Robertson’s method, Yoshi Ohno method, binary search algorithm) and analytical (Javier Hernandez-Andres’s method, McCamy’s method). At the same time, the information about their accuracy is of a segmental fragmentary nature, therefore, it is very difficult to develop recommendations for the application of methods for certain radiators. In this connection, it seems extremely interesting to compare the error of the most well-known CCT calculating methods, using a single universal approach. The paper proposes an algorithm for researching the error of the methods for calculating correlated colour temperature, based on the method for plotting lines of constant CCT of a given length. Temperatures corresponding to these lines are taken as true, and the chromaticity lying on them are used as input data for the researched method. The paper proposes an approach when first the distribution of the error in the entire range of determination of CCT is determined, followed by bilinear interpolation for the required chromaticity. Using this approach, the absolute errors of the following methods for calculating CCT: McCamy, Javier Hernandez, Robertson, and Yoshi Ohno were estimated. The error was estimated in the range occupied by quadrangles of possible values from ANSI C78.377 chromaticity standard, developed by American National Standards Institute for LED lamps for indoor lightning. The tabular and graphical distribution of the absolute error for each investigated method was presented in the range of (2000–7000) K. In addition, to clarify the applicability of the methods for calculating CCT of the sky, the calculation of the distribution of the relative error up to 100000 K was performed. The results of the study can be useful for developers of standards and measurement procedures and for software developers of measuring equipment.

Pencarian Data Barang Produk Atribut Sekolah Menggunakan Algoritma Binary Search

ABSTRACTTechnology and information that is growing and sophisticated must be balanced according to the needs. For it was made the application of binary algorithms for the search data goods production of school attributes. Many methods in search with the goal of making it easier to search, e.g. search data of production items of school attributes with binary search method. Convection in the search of production goods using the manual way by looking for the archive data written in the notebook, the purpose of this research is to create a data retrieval system of goods that will be applied as a data retrieval tool of goods, as well as change the system manual to the computing system. In this research using Binary Search algorithm. Binary search algorithm is a technique applied only on the sorted element (sorted). This research using method of binary search algorithm with analysis stage, system design, coding/construction, testing, and implementation. In the analysis stage, the collection of data conducted is observation and literature study. At the system design stage using Unified Modelling Language (UML) include the use case diagram, activity diagram, Sequence diagram, and Diagram class. At the construction stage using the Java programming language using Netbeans and MySQL Server tools while the implementation of this system is the application of data retrieval of goods. To know the eligibility of a system, it is necessary to test against the search time of 210 data each time duration, 0.0004 seconds, 0.0005 seconds, 0.0006 seconds, 0.0007 seconds, 0.0008 seconds, 0.0009 seconds, 0.0010 seconds, 0.0012 seconds, 0.0014 seconds, 0.00117 seconds. The final result of this study is the application of search for production goods with Binary Search Algorithm Method.