Abstract:
A constant multiplier compiler model allows a modified canonical signed two's complement constant multiplier circuit design to be generated from a user specification of the desired constant. A netlist of a modified canonical signed two's complement constant multiplier circuit for computing a product of a multi-bit multiplicand and a multi-bit constant is automatically generated by modifying a netlist of a precursor signed two's complement constant multiplier circuit for computing a product of the multi-bit multiplicand and a multi-bit constant that is all ones. The number of zeros in the multi-bit constant is first maximized by converting the constant to modified canonical form. Then, for each zero in the multi-bit constant, a corresponding logical column of full adders is deleted and each output signal of each adder so deleted is logically connected to a corresponding output signal in a preceding logical column of adders. Two exceptions to the foregoing rule occur. In the case of a first logical column of adders having no preceding logical column of adders, each output signal of each adder deleted is logically connected to a bit of the multi-bit multiplicand. In the case of a logical row of adders receiving a most significant bit of the multi-bit multiplicand, each output signal of each adder deleted is logically connected to one of the most significant bit of the multi-bit multiplicand and logic zero. The method produces a minimum layout, minimizing silicon cost, and produces a high performance design with critical paths optimized in terms of time delay.
Abstract:
A constant multiplier compiler model allows a constant multiplier circuit design to be generated from a user specification of the desired constant. A netlist of a constant multiplier circuit for computing a product of a multi-bit multiplicand and a multi-bit constant is automatically generated by modifying a netlist of a precursor constant multiplier circuit for computing a product of the multi-bit multiplicand and a multi-bit constant that is all ones. For each zero in the multi-bit constant, a corresponding logical column of full adders is deleted and each output signal of each adder so deleted is logically connected to a corresponding output signal in a preceding logical column of adders. Two exceptions to the foregoing rule occur. In the case of a first logical column of adders having no preceding logical column of adders, each output signal of each adder deleted is logically connected to a bit of the multi-bit multiplicand. In the case of a logical row of adders receiving a most significant bit of the multi-bit multiplicand, each output signal of each adder deleted is logically connected to one of the most significant bit of the multi-bit multiplicand and logic zero. The method produces a minimum layout, minimizing silicon cost, and produces a high performance design with critical paths optimized in terms of time delay.
Abstract:
An N-bit binary counter includes N 1-bit counters together producing an N-bit binary word, and a count enable signal generator for generating count enable signals for each of the N 1-bit counters. The count enable signal generator includes multiple logic group/carry ripple devices, different ones of which receive different numbers of bits of the binary word and generate count enable signals for the same number of bits. The logic group/carry ripple devices also receive a carry ripple output signal from an adjacent logic group/carry ripple device and generate a carry ripple output signal for another adjacent logic group/carry ripple device.
Abstract:
A constant multiplier compiler model allows a signed two's complement constant multiplier circuit design to be generated from a user specification of the desired constant. A netlist of a signed two's complement constant multiplier circuit for computing a product of a multi-bit multiplicand and a multi-bit constant is automatically generated by modifying a netlist of a precursor signed two's complement constant multiplier circuit for computing a product of the multi-bit multiplicand and a multi-bit constant that is all ones. For each zero in the multi-bit constant, a corresponding logical column of full adders is deleted and each output signal of each adder so deleted is logically connected to a corresponding output signal in a preceding logical column of adders. Two exceptions to the foregoing rule occur. In the case of a first logical column of adders having no preceding logical column of adders, each output signal of each adder deleted is logically connected to a bit of the multi-bit multiplicand. In the case of a logical row of adders receiving a most significant bit of the multi-bit multiplicand, each output signal of each adder deleted is logically connected to one of the most significant bit of the multi-bit multiplicand and logic zero. The method produces a minimum layout, minimizing silicon cost, and produces a high performance design with critical paths optimized in terms of time delay.
Abstract:
An apparatus for detecting a binary word each of the bits of which has the same binary value includes a plurality of logic groups, different ones of which receive different numbers of bits of the binary word. Each of the logic groups generates an output signal that is asserted if each of the number of bits received by the logic group has the same binary value. Carry ripple circuits series connected to form a carry ripple chain each receive an output signal from one of the logic groups. The carry ripple circuits also receive a carry ripple output signal from a previous carry ripple circuit and produce a carry ripple output signal for a succeeding carry ripple circuit. The carry ripple output signal is asserted when the output signal from the logic group is asserted and the carry ripple output signal from the previous carry ripple circuit is asserted.
Abstract:
Carry-chain structures useful in circuits such as adders, subtractors, counters and arithmetic logic units (i.e., ALU's). The carry-chain structures have regular architectures that can be conveniently generated in various bit widths by automated compiler systems. In a preferred embodiment, a method for automatically generating a carry-chain circuit using a compiler which includes a library of cells by selecting a first cell from the library of cells for use as a carry propagation cell, and using the first cell for multiplexing a carry signal produced by the carry propagation cell, such that the carry-chain includes a plurality of first cells. Further, a carry-chain architecture is produced using the aforementioned method.
Abstract:
The present disclosure provides a method and a device for use in wireless communication node. The communication node transmits first information; herein, for a given SCS, the communication node assumes that X1 PRB(s) is (are) comprised in frequency-domain resources that can be occupied by the communication node for transmissions, X1 being a positive integer, and the X1 PRB(s) occupies (occupy) consecutive frequency-domain resources; a position of the X1 PRB(s) in frequency domain is related to at least one of whether the communication node is in coverage or a synchronization reference source selected by the communication node; the first information is used to indicate a position of the X1 PRB(s) in frequency domain, and the first information is transmitted via an air interface. The method in the present disclosure reduces interference and improves link and system performance.
Abstract:
The present disclosure provides a method and a device in a User Equipment (UE) and a base station for wireless communications. A UE receives first information, the first information being used for indicating M DCI blind decoding(s); monitors a first-type radio signal respectively on each of S sub-band(s) in a first time-domain resource; and performs at most M1 DCI blind decoding(s) of the M DCI blind decoding(s) on the S sub-band(s) in the first time-domain resource. Herein, the first-type radio signal detected on the S sub-band(s) is used for determining the M1 DCI blind decoding(s) out of the M DCI blind decoding(s). The above method allows the base station to make dynamic adjustments to the UE's blind decoding on PDCCH resources according to LBT results, ensuring that sufficient PDCCH resources are available and not too many PDSCH resources are preempted, and that excessive blind decodings can be avoided.
Abstract:
A method and a device in a communication node for wireless communications are disclosed in the present disclosure. The communication node first receives a first signaling; and then receives a first radio signal in K1 slots and receives a second radio signal in K2 slots; the first signaling is used to determine the K1 and the K2; a first TB is used to generate the first radio signal, while a second TB is used to generate the second radio signal, the first TB comprising a positive integer number of bit(s), and the second TB comprising a positive integer number of bit(s); the K1 slots are divided into X1 slot groups, while the K2 slots are divided into X2 slot groups, and positions of the X1 slot groups and the X2 slot groups are interleaved in time domain. The present disclosure can reduce power consumption and improve coverage performance.
Abstract:
The present disclosure provides a method and a device in a communication node for wireless communications. The communication node in the present disclosure first receives first information, and then transmits a first radio signal; a length of a time interval between a start time for transmitting the first radio signal and a first reference time is equal to a sum of a first timing adjustment and a second timing adjustment, the first timing adjustment being one of X candidate timing adjustments, the X being a positive integer greater than 1; the second timing adjustment is used for determining a transmission timing of a radio signal transmitted before the first radio signal in time domain; a transmitter of the first radio signal determines the first timing adjustment out of the X candidate timing adjustments by itself. The present disclosure can improve uplink synchronization performance.