Direct Addition of Amides to Glycals Enabled by Solvation‐Insusceptible 2‐Haloazolium Salt Catalysis

The direct 2‐deoxyglycosylation of nucleophiles with glycals leads to biologically and pharmacologically important 2‐deoxysugar compounds. Although the direct addition of hydroxyl and sulfonamide groups have been well developed, the direct 2‐deoxyglycosylation of amide groups has not been reported to date. Herein, we show the first direct 2‐deoxyglycosylation of amide groups using a newly designed Brønsted acid catalyst under mild conditions. Through mechanistic investigations, we discovered that the amide group can inhibit acid catalysts, and the inhibition has made the 2‐deoxyglycosylation reaction difficult. Diffusion‐ordered two‐dimensional NMR spectroscopy analysis implied that the 2‐chloroazolium salt catalyst was less likely to form aggregates with amides in comparison to other acid catalysts. The chlorine atom and the extended π‐scaffold of the catalyst played a crucial role for this phenomenon. This relative insusceptibility to inhibition by amides is more responsible for the catalytic activity than the strength of the acidity.     

Compiler compatible 5.66 Mb/mm2 8T 1R1W register file in 14 nm FinFET technology

1-read/1-write (1R1W) register file (RF) is a popular memory configuration in modern feature rich SoCs requiring significant amount of embedded memory. A memory compiler is constructed using the 8T RF bitcell spanning a range of instances from 32 b to 72 Kb. An 8T low-leakage bitcell of 0.106 μm² is used in a 14 nm FinFET technology with a 70 nm contacted gate pitch for high-density (HD) two-port (TP) RF memory compiler which achieves 5.66 Mb/mm² array density for a 72 Kb array which is the highest reported density in 14 nm FinFET technology. The density improvement is achieved by using techniques such as leaf-cell optimization (eliminating transistors), better architectural planning, top level connectivity through leaf-cell abutment and minimizing the number of unique leaf-cells. These techniques are fully compatible with memory compiler usage over the required span. Leakage power is minimized by using power-switches without degrading the density mentioned above. Self-induced supply voltage collapse technique is applied for write and a four stack static keeper is used for read Vmin improvement. Fabricated test chips using 14 nm process have demonstrated 2.33 GHz performance at 1.1 V/25 °C operation. Overall V_min of 550 mV is achieved with this design at 25 °C. The inbuilt power-switch improves leakage power by 12x in simulation. Approximately 8% die area of a leading 14 nm SoC in commercialization is occupied by these compiled RF instances.     

基于FPGA的ASI信号接收与发送的实现

提出了一种用FPGA芯片代替Cypress公司的CY78933和CY78923芯片来实现ASI信号接收与发送的方案，详细阐述了DVB—ASI接口的硬件组成与FPGA实现，该接口符合DVB—ASI的接口规范，可实现270Mbps的信号传输，已经得到实际运用。     

非线性互补问题的一种全局收敛的显式光滑Newton方法

本针对Po函数非线性互补问题，给出了一种显式光滑Newton方法，该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程，并在适当的假设条件下，证明了算法的全局收敛性。     

Double Michael Additions of Lithium Enolate of 1,4-Dioxaspiro[4.5]dec-6-en-8-One to Acrylates

Double Michael additions of lithium enolaie of 1,4-dioxaspiro[4.5]dec-6-en-8-one to four acrylates afforded bicyclo[2.2.2]octan-2-ones with high regio- and stereoselectivities in moderate yields.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.