• Title/Summary/Keyword: prototype

Search Result 8,279, Processing Time 0.038 seconds

A study on the Meaning Contact of ManChwi Pavilion's Place Transmission and Sense of Prototype Landscape (만취정(晩翠亭)의 장소 전승과 원형경관향유 양상)

  • Lee, Seung-Yeon;Shin, Sang-Sup;Kahng, Byung-Seon
    • Journal of the Korean Institute of Traditional Landscape Architecture
    • /
    • v.34 no.3
    • /
    • pp.38-49
    • /
    • 2016
  • This study is based on the assumption that the documentations, and poetry form a basis for undertone of the location and original landscape explored by inference and enjoyment aspects; the significance has been inferred by investigating the original location, relocated location, and the original landscape of Imsil Manchwi Pavilion. The results of the attempted research for locational value, and preservation of the original landscape before and after the relocation of Imsil Manchwi Pavilion is as follows. Firstly, Manchwi, meaning evergreen, was made a pseudonym of KimWi. The name reflects an image two evergreen pine trees facing one another. The poetry form presents the eternal fidelity. In addition, considering the symbolic plant and the meaning of evergreen pine trees specified on the pavilion, the name is derived from the fidelity, longevity of the family, vitality and so on. Secondly, Manchwi Pavilion was founded in the location, known as the snakehead form, that represents the vitality. Snake faces the swallow form over the river, therefore, it connotes the wishes for fidelity and prosperity of the family. Manchwi Pavillion is prostrate pheasant form which is suitable for those who look for a hiding place or place for their study. It is noticeable that the location infers and hand down the efforts on succession for prosperity of the family and the study. Thirdly, it is estimated that Manchwi Pavilion was established between 1572 and 1582; and the relocation was conducted in the late 1880s. Fourthly, although eternal fidelity was presented in Manchwi Pavillion with locational language, the Manchwi Pavillion after its relocation next to KimWi's grave implies the tendency of the changed value: the commemoration of the ancestors, and prosperity of the family. Fifthly, after the relocation of the pavilion, the proportion of the rooms with Korean heating system, so-called'Ondol'has been increased for its best use in all seasons. And its veranda for extension and its verse couplet implies that this connote the original meaning and pursuit of the study. Sixthly, the way that the poetry portrays pine trees, pond, plants, valleys, and streams shows the aspect of enjoyment of the landscapes and the meaning of fidelity, pure mind, free and easy life, self-examination, the frailty of human life. Lastly, despite the difference between tenth poetic language of three Sipyoung and Wonwoon Sipyeong, exploring the landscape based on the analysis on the poetry can be a basis on the maintenance and restoration of the original landscape as the inspiration and the meaning show that Wonwoon Sipyeong maintains the aspect of the author enjoying original landscape.

A Basic Study on the Establishment of Evaluation Items for the Resiliency of Planting Landscape in Hahoe and Yangdong of World Cultural Heritage (세계문화유산 하회와 양동의 식생경관 진정성 유지를 위한 평가항목 설정 기초 연구)

  • Lee, Chang-Hun;Shin, Hyun-Sil
    • Journal of the Korean Institute of Traditional Landscape Architecture
    • /
    • v.36 no.2
    • /
    • pp.21-29
    • /
    • 2018
  • This study was wanted to select a value evaluation item to maintain the authenticity of the Planting Landscape in Hahoe and Yangdong villages. Above all, after checking the suitability of the 43 selected items by the Focus Group Interview, the weight was calculated in the Analytic Hierarchy Process expert questionnaire to establish the importance of the indicators for the development of the assessment items. The expert analysis analyzed the importance of 2 sections, 6 divisions and 11 detailed categories, and summarized the results of the study as follows : First, the comparative importance of each category and selection of the assessment items for the stabilization of the Planting Landscape of Hahoe and Yangdong indicated that cultural values are more important than biological values. In particular, details of the biological values of trees were derived with relatively low estimates, except for the specific characteristics of species and items of type of tree. Second, as a result of verification of the suitability of the 43 items selected by the Focus Group Interview, the source diameter, the collection width, reception, flushing, supersonality, records, memorials, 11 items were selected, Third, the results of the importance evaluation of the value properties for maintaining the resistance of vegetation through the Analytic Hierarchy Process were : specific in biological values (0.187), steady (0.094), and water pipe width (2007). There was relatively little difference in the highest weights, the width of the pipe except for the lowest value received, and the source diameter flushing. Fourth, the results of an evaluation of the importance of a value property aimed at historical values were whether or not the cultural asset was designated (0.134), the record value (0.092), the time (0.088), and the monument (0.063). In terms of the importance of evaluating the historical values of Planting sites consisting of Hahoe and Yangdong, the importance of designation of cultural properties was considered to be relative to the maintenance of the Planting Landscape including culture and history. Based on the assessment items and weighted values of the Planting Landscape of Yangdong Village and the World Cultural Heritage below and below, this study's Analytic Hierarchy Process can be applied to actual criteria for the assessment of the authenticity of trees in the village. Based on the assessment items and weighted values of the Planting Landscape in Hahoe and Yangdong villages, a follow-up study on the assessment standards for the authenticity of trees in the village will be left as a future task.

Social Tagging-based Recommendation Platform for Patented Technology Transfer (특허의 기술이전 활성화를 위한 소셜 태깅기반 지적재산권 추천플랫폼)

  • Park, Yoon-Joo
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.3
    • /
    • pp.53-77
    • /
    • 2015
  • Korea has witnessed an increasing number of domestic patent applications, but a majority of them are not utilized to their maximum potential but end up becoming obsolete. According to the 2012 National Congress' Inspection of Administration, about 73% of patents possessed by universities and public-funded research institutions failed to lead to creating social values, but remain latent. One of the main problem of this issue is that patent creators such as individual researcher, university, or research institution lack abilities to commercialize their patents into viable businesses with those enterprises that are in need of them. Also, for enterprises side, it is hard to find the appropriate patents by searching keywords on all such occasions. This system proposes a patent recommendation system that can identify and recommend intellectual rights appropriate to users' interested fields among a rapidly accumulating number of patent assets in a more easy and efficient manner. The proposed system extracts core contents and technology sectors from the existing pool of patents, and combines it with secondary social knowledge, which derives from tags information created by users, in order to find the best patents recommended for users. That is to say, in an early stage where there is no accumulated tag information, the recommendation is done by utilizing content characteristics, which are identified through an analysis of key words contained in such parameters as 'Title of Invention' and 'Claim' among the various patent attributes. In order to do this, the suggested system extracts only nouns from patents and assigns a weight to each noun according to the importance of it in all patents by performing TF-IDF analysis. After that, it finds patents which have similar weights with preferred patents by a user. In this paper, this similarity is called a "Domain Similarity". Next, the suggested system extract technology sector's characteristics from patent document by analyzing the international technology classification code (International Patent Classification, IPC). Every patents have more than one IPC, and each user can attach more than one tag to the patents they like. Thus, each user has a set of IPC codes included in tagged patents. The suggested system manages this IPC set to analyze technology preference of each user and find the well-fitted patents for them. In order to do this, the suggeted system calcuates a 'Technology_Similarity' between a set of IPC codes and IPC codes contained in all other patents. After that, when the tag information of multiple users are accumulated, the system expands the recommendations in consideration of other users' social tag information relating to the patent that is tagged by a concerned user. The similarity between tag information of perferred 'patents by user and other patents are called a 'Social Simialrity' in this paper. Lastly, a 'Total Similarity' are calculated by adding these three differenent similarites and patents having the highest 'Total Similarity' are recommended to each user. The suggested system are applied to a total of 1,638 korean patents obtained from the Korea Industrial Property Rights Information Service (KIPRIS) run by the Korea Intellectual Property Office. However, since this original dataset does not include tag information, we create virtual tag information and utilized this to construct the semi-virtual dataset. The proposed recommendation algorithm was implemented with JAVA, a computer programming language, and a prototype graphic user interface was also designed for this study. As the proposed system did not have dependent variables and uses virtual data, it is impossible to verify the recommendation system with a statistical method. Therefore, the study uses a scenario test method to verify the operational feasibility and recommendation effectiveness of the system. The results of this study are expected to improve the possibility of matching promising patents with the best suitable businesses. It is assumed that users' experiential knowledge can be accumulated, managed, and utilized in the As-Is patent system, which currently only manages standardized patent information.

Video Scene Detection using Shot Clustering based on Visual Features (시각적 특징을 기반한 샷 클러스터링을 통한 비디오 씬 탐지 기법)

  • Shin, Dong-Wook;Kim, Tae-Hwan;Choi, Joong-Min
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.2
    • /
    • pp.47-60
    • /
    • 2012
  • Video data comes in the form of the unstructured and the complex structure. As the importance of efficient management and retrieval for video data increases, studies on the video parsing based on the visual features contained in the video contents are researched to reconstruct video data as the meaningful structure. The early studies on video parsing are focused on splitting video data into shots, but detecting the shot boundary defined with the physical boundary does not cosider the semantic association of video data. Recently, studies on structuralizing video shots having the semantic association to the video scene defined with the semantic boundary by utilizing clustering methods are actively progressed. Previous studies on detecting the video scene try to detect video scenes by utilizing clustering algorithms based on the similarity measure between video shots mainly depended on color features. However, the correct identification of a video shot or scene and the detection of the gradual transitions such as dissolve, fade and wipe are difficult because color features of video data contain a noise and are abruptly changed due to the intervention of an unexpected object. In this paper, to solve these problems, we propose the Scene Detector by using Color histogram, corner Edge and Object color histogram (SDCEO) that clusters similar shots organizing same event based on visual features including the color histogram, the corner edge and the object color histogram to detect video scenes. The SDCEO is worthy of notice in a sense that it uses the edge feature with the color feature, and as a result, it effectively detects the gradual transitions as well as the abrupt transitions. The SDCEO consists of the Shot Bound Identifier and the Video Scene Detector. The Shot Bound Identifier is comprised of the Color Histogram Analysis step and the Corner Edge Analysis step. In the Color Histogram Analysis step, SDCEO uses the color histogram feature to organizing shot boundaries. The color histogram, recording the percentage of each quantized color among all pixels in a frame, are chosen for their good performance, as also reported in other work of content-based image and video analysis. To organize shot boundaries, SDCEO joins associated sequential frames into shot boundaries by measuring the similarity of the color histogram between frames. In the Corner Edge Analysis step, SDCEO identifies the final shot boundaries by using the corner edge feature. SDCEO detect associated shot boundaries comparing the corner edge feature between the last frame of previous shot boundary and the first frame of next shot boundary. In the Key-frame Extraction step, SDCEO compares each frame with all frames and measures the similarity by using histogram euclidean distance, and then select the frame the most similar with all frames contained in same shot boundary as the key-frame. Video Scene Detector clusters associated shots organizing same event by utilizing the hierarchical agglomerative clustering method based on the visual features including the color histogram and the object color histogram. After detecting video scenes, SDCEO organizes final video scene by repetitive clustering until the simiarity distance between shot boundaries less than the threshold h. In this paper, we construct the prototype of SDCEO and experiments are carried out with the baseline data that are manually constructed, and the experimental results that the precision of shot boundary detection is 93.3% and the precision of video scene detection is 83.3% are satisfactory.

A Template-based Interactive University Timetabling Support System (템플릿 기반의 상호대화형 전공강의시간표 작성지원시스템)

  • Chang, Yong-Sik;Jeong, Ye-Won
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.3
    • /
    • pp.121-145
    • /
    • 2010
  • University timetabling depending on the educational environments of universities is an NP-hard problem that the amount of computation required to find solutions increases exponentially with the problem size. For many years, there have been lots of studies on university timetabling from the necessity of automatic timetable generation for students' convenience and effective lesson, and for the effective allocation of subjects, lecturers, and classrooms. Timetables are classified into a course timetable and an examination timetable. This study focuses on the former. In general, a course timetable for liberal arts is scheduled by the office of academic affairs and a course timetable for major subjects is scheduled by each department of a university. We found several problems from the analysis of current course timetabling in departments. First, it is time-consuming and inefficient for each department to do the routine and repetitive timetabling work manually. Second, many classes are concentrated into several time slots in a timetable. This tendency decreases the effectiveness of students' classes. Third, several major subjects might overlap some required subjects in liberal arts at the same time slots in the timetable. In this case, it is required that students should choose only one from the overlapped subjects. Fourth, many subjects are lectured by same lecturers every year and most of lecturers prefer the same time slots for the subjects compared with last year. This means that it will be helpful if departments reuse the previous timetables. To solve such problems and support the effective course timetabling in each department, this study proposes a university timetabling support system based on two phases. In the first phase, each department generates a timetable template from the most similar timetable case, which is based on case-based reasoning. In the second phase, the department schedules a timetable with the help of interactive user interface under the timetabling criteria, which is based on rule-based approach. This study provides the illustrations of Hanshin University. We classified timetabling criteria into intrinsic and extrinsic criteria. In intrinsic criteria, there are three criteria related to lecturer, class, and classroom which are all hard constraints. In extrinsic criteria, there are four criteria related to 'the numbers of lesson hours' by the lecturer, 'prohibition of lecture allocation to specific day-hours' for committee members, 'the number of subjects in the same day-hour,' and 'the use of common classrooms.' In 'the numbers of lesson hours' by the lecturer, there are three kinds of criteria : 'minimum number of lesson hours per week,' 'maximum number of lesson hours per week,' 'maximum number of lesson hours per day.' Extrinsic criteria are also all hard constraints except for 'minimum number of lesson hours per week' considered as a soft constraint. In addition, we proposed two indices for measuring similarities between subjects of current semester and subjects of the previous timetables, and for evaluating distribution degrees of a scheduled timetable. Similarity is measured by comparison of two attributes-subject name and its lecturer-between current semester and a previous semester. The index of distribution degree, based on information entropy, indicates a distribution of subjects in the timetable. To show this study's viability, we implemented a prototype system and performed experiments with the real data of Hanshin University. Average similarity from the most similar cases of all departments was estimated as 41.72%. It means that a timetable template generated from the most similar case will be helpful. Through sensitivity analysis, the result shows that distribution degree will increase if we set 'the number of subjects in the same day-hour' to more than 90%.

Development of User Based Recommender System using Social Network for u-Healthcare (사회 네트워크를 이용한 사용자 기반 유헬스케어 서비스 추천 시스템 개발)

  • Kim, Hyea-Kyeong;Choi, Il-Young;Ha, Ki-Mok;Kim, Jae-Kyeong
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.3
    • /
    • pp.181-199
    • /
    • 2010
  • As rapid progress of population aging and strong interest in health, the demand for new healthcare service is increasing. Until now healthcare service has provided post treatment by face-to-face manner. But according to related researches, proactive treatment is resulted to be more effective for preventing diseases. Particularly, the existing healthcare services have limitations in preventing and managing metabolic syndrome such a lifestyle disease, because the cause of metabolic syndrome is related to life habit. As the advent of ubiquitous technology, patients with the metabolic syndrome can improve life habit such as poor eating habits and physical inactivity without the constraints of time and space through u-healthcare service. Therefore, lots of researches for u-healthcare service focus on providing the personalized healthcare service for preventing and managing metabolic syndrome. For example, Kim et al.(2010) have proposed a healthcare model for providing the customized calories and rates of nutrition factors by analyzing the user's preference in foods. Lee et al.(2010) have suggested the customized diet recommendation service considering the basic information, vital signs, family history of diseases and food preferences to prevent and manage coronary heart disease. And, Kim and Han(2004) have demonstrated that the web-based nutrition counseling has effects on food intake and lipids of patients with hyperlipidemia. However, the existing researches for u-healthcare service focus on providing the predefined one-way u-healthcare service. Thus, users have a tendency to easily lose interest in improving life habit. To solve such a problem of u-healthcare service, this research suggests a u-healthcare recommender system which is based on collaborative filtering principle and social network. This research follows the principle of collaborative filtering, but preserves local networks (consisting of small group of similar neighbors) for target users to recommend context aware healthcare services. Our research is consisted of the following five steps. In the first step, user profile is created using the usage history data for improvement in life habit. And then, a set of users known as neighbors is formed by the degree of similarity between the users, which is calculated by Pearson correlation coefficient. In the second step, the target user obtains service information from his/her neighbors. In the third step, recommendation list of top-N service is generated for the target user. Making the list, we use the multi-filtering based on user's psychological context information and body mass index (BMI) information for the detailed recommendation. In the fourth step, the personal information, which is the history of the usage service, is updated when the target user uses the recommended service. In the final step, a social network is reformed to continually provide qualified recommendation. For example, the neighbors may be excluded from the social network if the target user doesn't like the recommendation list received from them. That is, this step updates each user's neighbors locally, so maintains the updated local neighbors always to give context aware recommendation in real time. The characteristics of our research as follows. First, we develop the u-healthcare recommender system for improving life habit such as poor eating habits and physical inactivity. Second, the proposed recommender system uses autonomous collaboration, which enables users to prevent dropping and not to lose user's interest in improving life habit. Third, the reformation of the social network is automated to maintain the quality of recommendation. Finally, this research has implemented a mobile prototype system using JAVA and Microsoft Access2007 to recommend the prescribed foods and exercises for chronic disease prevention, which are provided by A university medical center. This research intends to prevent diseases such as chronic illnesses and to improve user's lifestyle through providing context aware and personalized food and exercise services with the help of similar users'experience and knowledge. We expect that the user of this system can improve their life habit with the help of handheld mobile smart phone, because it uses autonomous collaboration to arouse interest in healthcare.

Development of $14"{\times}8.5"$ active matrix flat-panel digital x-ray detector system and Imaging performance (평판 디지털 X-ray 검출기의 개발과 성능 평가에 관한 연구)

  • Park, Ji-Koon;Choi, Jang-Yong;Kang, Sang-Sik;Lee, Dong-Gil;Seok, Dae-Woo;Nam, Sang Hee
    • Journal of radiological science and technology
    • /
    • v.26 no.4
    • /
    • pp.39-46
    • /
    • 2003
  • Digital radiographic systems based on solid-state detectors, commonly referred to as flat-panel detectors, are gaining popularity in clinical practice. Large area, flat panel solid state detectors are being investigated for digital radiography. The purpose of this work was to evaluate the active matrix flat panel digital x-ray detectors in terms of their modulation transfer function (MTF), noise power spectrum (NPS), and detective quantum efficiency (DQE). In this paper, development and evaluation of a selenium-based flat-panel digital x-ray detector are described. The prototype detector has a pixel pitch of $139\;{\mu}m$ and a total active imaging area of $14{\times}8.5\;inch^2$, giving a total 3.9 million pixels. This detector include a x-ray imaging layer of amorphous selenium as a photoconductor which is evaporated in vacuum state on a TFT flat panel, to make signals in proportion to incident x-ray. The film thickness was about $500\;{\mu}m$. To evaluate the imaging performance of the digital radiography(DR) system developed in our group, sensitivity, linearity, the modulation transfer function(MTF), noise power spectrum (NPS) and detective quantum efficiency(DQE) of detector was measured. The measured sensitivity was $4.16{\times}10^6\;ehp/pixel{\cdot}mR$ at the bias field of $10\;V/{\mu}m$ : The beam condition was 41.9\;KeV. Measured MTF at 2.5\;lp/mm was 52%, and the DQE at 1.5\;lp/mm was 75%. And the excellent linearity was showed where the coefficient of determination ($r^2$) is 0.9693.

  • PDF

The Model Experiment on the Pair Midwater Trawl (중층용 쌍끌이 기선저인망의 모형실험)

  • Cho, Sam-Kwang;Lee, Ju-Hee;Jang, Chung-Sik
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.31 no.3
    • /
    • pp.228-239
    • /
    • 1995
  • A model experiment on the pair midwater trawl net which is prevailing in Denmark is carried out to get the basic data available for Korean pair bottom trawlers. The model net was made in 1/30 scale considering the Tauti's Similarity law of fishing gear and the dimension of experimental tank. The vertical opening, horizontal opening, towing tension and net working depth of the model net were determined in the tank within the towing velocity 0.46~1.15m/sec, front weight 15.5~62.0g and distance between paired boats 5~8m(which correpond to 2~5k't in towing velocity, 70~280kg in weight and 150~240m in distance respectively in the prototype net). The results got from the model experiment can be converted into the full scale net as follows; 1. Vertical opening showed the largest value of 32m at the condition of 2k't in towing velocity, 280kg in front weight and 150m in the distance between paired boats, and the smallest value of 6m at the condition of 5k't in towing velocity, 70kg in front weight and 240m in the distance between paired boats. 2. Horizontal opening showed the largest value of 45m at the condition of 5k't in towing velocity, 70kg in front weight and 240m in the distance between paired boats, and the smallest value of 33m at the condition of 2k't in towing velocity, 280kg in front weight and 150m in the distance between paired boats. 3. Towing tension showed the largest value of 10, 000kg at the condition of 5k't in towing velocity, 280kg in front weight and 240m in the distance between paired boats, and the smallest value of 1, 600kg at the condition of 2k't in towing velocity, 70kg in front weight and 150m in the distance between paired boats. 4. Net working depth showed the largest value of 38m at the condition of 2k't in towing velocity, 280kg in front weight and 150m in the distance between paired boats, and the smallest value of 6m at the condition of 5k't in towing velocity, 70kg in front weight and 240m in the distance between paired boats. 5. Net opening area showed the largest value of 1, 100m super(2) at the condition of 2k't in towing velocity, 280kg in front weight and 180m in the distance between paired boats, and the smallest value of 250m super(2) at the condition of 5k't in towing velocity, 70kg in front weight and 240m in the distance between paired boats.

  • PDF

Prefetching based on the Type-Level Access Pattern in Object-Relational DBMSs (객체관계형 DBMS에서 타입수준 액세스 패턴을 이용한 선인출 전략)

  • Han, Wook-Shin;Moon, Yang-Sae;Whang, Kyu-Young
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.529-544
    • /
    • 2001
  • Prefetching is an effective method to minimize the number of roundtrips between the client and the server in database management systems. In this paper we propose new notions of the type-level access pattern and the type-level access locality and developed an efficient prefetchin policy based on the notions. The type-level access patterns is a sequence of attributes that are referenced in accessing the objects: the type-level access locality a phenomenon that regular and repetitive type-level access patterns exist. Existing prefetching methods are based on object-level or page-level access patterns, which consist of object0ids of page-ids of the objects accessed. However, the drawback of these methods is that they work only when exactly the same objects or pages are accessed repeatedly. In contrast, even though the same objects are not accessed repeatedly, our technique effectively prefetches objects if the same attributes are referenced repeatedly, i,e of there is type-level access locality. Many navigational applications in Object-Relational Database Management System(ORDBMs) have type-level access locality. Therefore our technique can be employed in ORDBMs to effectively reduce the number of roundtrips thereby significantly enhancing the performance. We have conducted extensive experiments in a prototype ORDBMS to show the effectiveness of our algorithm. Experimental results using the 007 benchmark and a real GIS application show that our technique provides orders of magnitude improvements in the roundtrips and several factors of improvements in overall performance over on-demand fetching and context-based prefetching, which a state-of the art prefetching method. These results indicate that our approach significantly and is a practical method that can be implemented in commercial ORDMSs.

  • PDF

A 13b 100MS/s 0.70㎟ 45nm CMOS ADC for IF-Domain Signal Processing Systems (IF 대역 신호처리 시스템 응용을 위한 13비트 100MS/s 0.70㎟ 45nm CMOS ADC)

  • Park, Jun-Sang;An, Tai-Ji;Ahn, Gil-Cho;Lee, Mun-Kyo;Go, Min-Ho;Lee, Seung-Hoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.3
    • /
    • pp.46-55
    • /
    • 2016
  • This work proposes a 13b 100MS/s 45nm CMOS ADC with a high dynamic performance for IF-domain high-speed signal processing systems based on a four-step pipeline architecture to optimize operating specifications. The SHA employs a wideband high-speed sampling network properly to process high-frequency input signals exceeding a sampling frequency. The SHA and MDACs adopt a two-stage amplifier with a gain-boosting technique to obtain the required high DC gain and the wide signal-swing range, while the amplifier and bias circuits use the same unit-size devices repeatedly to minimize device mismatch. Furthermore, a separate analog power supply voltage for on-chip current and voltage references minimizes performance degradation caused by the undesired noise and interference from adjacent functional blocks during high-speed operation. The proposed ADC occupies an active die area of $0.70mm^2$, based on various process-insensitive layout techniques to minimize the physical process imperfection effects. The prototype ADC in a 45nm CMOS demonstrates a measured DNL and INL within 0.77LSB and 1.57LSB, with a maximum SNDR and SFDR of 64.2dB and 78.4dB at 100MS/s, respectively. The ADC is implemented with long-channel devices rather than minimum channel-length devices available in this CMOS technology to process a wide input range of $2.0V_{PP}$ for the required system and to obtain a high dynamic performance at IF-domain input signal bands. The ADC consumes 425.0mW with a single analog voltage of 2.5V and two digital voltages of 2.5V and 1.1V.